Entire functions mapping uncountable dense sets of reals onto each other monotonically
Bibliographic record
Abstract
When <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> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper B"> <mml:semantics> <mml:mi>B</mml:mi> <mml:annotation encoding="application/x-tex">B</mml:annotation> </mml:semantics> </mml:math> </inline-formula> are countable dense subsets of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper R"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">R</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathbb {R}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , it is a well-known result of Cantor that <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> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper B"> <mml:semantics> <mml:mi>B</mml:mi> <mml:annotation encoding="application/x-tex">B</mml:annotation> </mml:semantics> </mml:math> </inline-formula> are order-isomorphic. A theorem of K.F. Barth and W.J. Schneider states that the order-isomorphism can be taken to be very smooth, in fact the restriction to <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper R"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">R</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathbb {R}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of an entire function. J.E. Baumgartner showed that consistently <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="2 Superscript normal alef 0 Baseline greater-than normal alef 1"> <mml:semantics> <mml:mrow> <mml:msup> <mml:mn>2</mml:mn> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mi mathvariant="normal"> ℵ </mml:mi> <mml:mn>0</mml:mn> </mml:msub> </mml:mrow> </mml:msup> <mml:mo>></mml:mo> <mml:msub> <mml:mi mathvariant="normal"> ℵ </mml:mi> <mml:mn>1</mml:mn> </mml:msub> </mml:mrow> <mml:annotation encoding="application/x-tex">2^{\aleph _0}>\aleph _1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and any two subsets of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper R"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">R</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathbb {R}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> having <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal alef 1"> <mml:semantics> <mml:msub> <mml:mi mathvariant="normal"> ℵ </mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:annotation encoding="application/x-tex">\aleph _1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> points in every interval are order-isomorphic. However, U. Abraham, M. Rubin and S. Shelah produced a ZFC example of two such sets for which the order-isomorphism cannot be taken to be smooth. A useful variant of Baumgartner’s result for second category sets was established by S. Shelah. He showed that it is consistent that <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="2 Superscript normal alef 0 Baseline greater-than normal alef 1"> <mml:semantics> <mml:mrow> <mml:msup> <mml:mn>2</mml:mn> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mi mathvariant="normal"> ℵ </mml:mi> <mml:mn>0</mml:mn> </mml:msub> </mml:mrow> </mml:msup> <mml:mo>></mml:mo> <mml:msub> <mml:mi mathvariant="normal"> ℵ </mml:mi> <mml:mn>1</mml:mn> </mml:msub> </mml:mrow> <mml:annotation encoding="application/x-tex">2^{\aleph _0}>\aleph _1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and second category sets of cardinality <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal alef 1"> <mml:semantics> <mml:msub> <mml:mi mathvariant="normal"> ℵ </mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:annotation encoding="application/x-tex">\aleph _1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> exist while any two sets of cardinality <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal alef 1"> <mml:semantics> <mml:msub> <mml:mi mathvariant="normal"> ℵ </mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:annotation encoding="application/x-tex">\aleph _1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> which have second category intersection with every interval are order-isomorphic. In this paper, we show that the order-isomorphism in Shelah’s theorem can be taken to be the restriction to <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-stru
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.001 |
| 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.000 |
| 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".