Bibliographic record
Abstract
What largeness and structural assumptions on <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A subset-of-or-equal-to left-bracket double-struck upper R right-bracket Superscript omega"> <mml:semantics> <mml:mrow> <mml:mi>A</mml:mi> <mml:mo>⊆</mml:mo> <mml:mo stretchy="false">[</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">R</mml:mi> </mml:mrow> <mml:msup> <mml:mo stretchy="false">]</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>ω</mml:mi> </mml:mrow> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">A \subseteq [\mathbb {R}]^{\omega }</mml:annotation> </mml:semantics> </mml:math> </inline-formula> can guarantee the existence of a non-empty perfect set <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper P subset-of-or-equal-to double-struck upper R"> <mml:semantics> <mml:mrow> <mml:mi>P</mml:mi> <mml:mo>⊆</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">R</mml:mi> </mml:mrow> </mml:mrow> <mml:annotation encoding="application/x-tex">P \subseteq \mathbb {R}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> such that <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="left-bracket upper P right-bracket Superscript omega Baseline subset-of-or-equal-to upper A"> <mml:semantics> <mml:mrow> <mml:mo stretchy="false">[</mml:mo> <mml:mi>P</mml:mi> <mml:msup> <mml:mo stretchy="false">]</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>ω</mml:mi> </mml:mrow> </mml:msup> <mml:mo>⊆</mml:mo> <mml:mi>A</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">[P]^{\omega } \subseteq A</mml:annotation> </mml:semantics> </mml:math> </inline-formula>? Such a set <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper P"> <mml:semantics> <mml:mi>P</mml:mi> <mml:annotation encoding="application/x-tex">P</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is called <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A"> <mml:semantics> <mml:mi>A</mml:mi> <mml:annotation encoding="application/x-tex">A</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-homogeneous. We show that even if <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A"> <mml:semantics> <mml:mi>A</mml:mi> <mml:annotation encoding="application/x-tex">A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is open, in general it is independent of ZFC whether for a cardinal <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="kappa"> <mml:semantics> <mml:mi>κ</mml:mi> <mml:annotation encoding="application/x-tex">\kappa</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, the existence of an <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A"> <mml:semantics> <mml:mi>A</mml:mi> <mml:annotation encoding="application/x-tex">A</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-homogeneous set <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper H element-of left-bracket double-struck upper R right-bracket Superscript kappa"> <mml:semantics> <mml:mrow> <mml:mi>H</mml:mi> <mml:mo>∈</mml:mo> <mml:mo stretchy="false">[</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">R</mml:mi> </mml:mrow> <mml:msup> <mml:mo stretchy="false">]</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>κ</mml:mi> </mml:mrow> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">H \in [\mathbb {R}]^{\kappa }</mml:annotation> </mml:semantics> </mml:math> </inline-formula> implies the existence of a non-empty perfect <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A"> <mml:semantics> <mml:mi>A</mml:mi> <mml:annotation encoding="application/x-tex">A</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-homogeneous set. On the other hand, we prove an infinite dimensional analogue of Mycielski’s Theorem: if <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A"> <mml:semantics> <mml:mi>A</mml:mi> <mml:annotation encoding="application/x-tex">A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is large in the sense of a suitable Baire category-like notion, then there exists a non-empty perfect <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A"> <mml:semantics> <mml:mi>A</mml:mi> <mml:annotation encoding="application/x-tex">A</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-homogeneous set. We introduce fusion games to prove this and other infinite dimensional perfect set theorems. Finally we apply this theory to show that it is independent of ZFC whether Tukey reductions of the maximal analytic cofinal type can be witnessed by definable Tukey maps.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".