Haar Null Sets and the Consistent Reflection of Non-meagreness
Bibliographic record
Abstract
Abstract A subset X of a Polish group G is called Haar null if there exist a Borel set B ⊃ X and Borel probability measure μ on G such that μ(gBh) = 0 for every g; h ∊ G. We prove that there exist a set X ⊂ R that is not Lebesgue null and a Borel probability measure μ such that μ (X + t) = 0 for every t ∊ R. This answers a question from David Fremlin’s problem list by showing that one cannot simplify the definition of a Haar null set by leaving out the Borel set B. (The answer was already known assuming the Continuum Hypothesis.) This result motivates the following Baire category analogue. It is consistent with ZFC that there exist an abelian Polish group G and a Cantor set C ⊂ G such that for every non-meagre set X ⊂ G there exists a t ∊ G such that C ∩ (X + t) is relatively non-meagre in C. This essentially generalizes results of Bartoszyński and Burke–Miller.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".