Recognition: unknown
Infinite-Exponent Partition Relations on Higher Analogues of the Real Line
Pith reviewed 2026-05-09 14:42 UTC · model grok-4.3
The pith
The lexicographic order on ^α2 yields a complete classification of its infinite-exponent partition relations to countable targets in ZF.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
By proving a collection of infinite-exponent partition relations that hold on ⟨^α2,<lex⟩, the authors derive a complete classification of the instances in which this order satisfies ⟨^α2,<lex⟩ → (τ)^τ whenever τ is countable.
What carries the argument
The central object is the lexicographic linear order ⟨^α2,<lex⟩ on the set of all functions from an ordinal α to {0,1}, which carries the partition relations under study.
If this is right
- The relation holds or fails for each countable τ according to a determined pattern in the ordinal α.
- The classification applies uniformly to every ordinal length α.
- No choice axioms are required for any part of the classification.
- The results extend the classical case of the real line to all higher analogues ^α2.
Where Pith is reading between the lines
- The same proof techniques may decide analogous partition questions for lexicographic orders on other finite alphabets.
- The classification supplies concrete data that can be checked directly in models of ZF where the axiom of choice fails.
- Similar classifications could be sought for partition relations on other natural orders that generalize the reals, such as lexicographic products or tree orders.
Load-bearing premise
The classification is obtained from the standard ZF definitions of the lexicographic order and the partition-relation arrow notation without any choice principles.
What would settle it
An explicit computation for a small ordinal α and a specific countable τ that contradicts the predicted holding or failure of the arrow ⟨^α2,<lex⟩ → (τ)^τ would falsify the classification.
read the original abstract
We present a number of results concerning infinite-exponent partition relations on linear orders of the form $\langle {}^\alpha 2,<_{\text{lex}}\rangle$ for $\alpha$ an ordinal, generalising the setting of the real line, working throughout in ZF without the Axiom of Choice. As a particular consequence of our results, we obtain a full classification of the relation $\langle {}^\alpha 2,<_{\text{lex}}\rangle \rightarrow (\tau)^\tau$ for $\tau$ countable.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper establishes results on infinite-exponent partition relations for the lexicographically ordered spaces ⟨^α2, <lex⟩ (α an ordinal), working throughout in ZF without the axiom of choice. A principal consequence is a complete classification of the relation ⟨^α2, <lex⟩ → (τ)^τ when τ is countable.
Significance. If the ZF classification holds, the work would meaningfully extend partition calculus from the reals to higher ordinal analogues in a choice-free setting, supplying a full picture for all countable τ and thereby strengthening the choiceless theory of homogeneity properties on these orders.
major comments (1)
- [the section containing the classification theorem for countable τ] The central classification of ⟨^α2, <lex⟩ → (τ)^τ for countable τ is asserted to hold in pure ZF. However, the standard constructions of homogeneous sets of order type τ proceed by building a countable sequence of elements, each satisfying color conditions relative to the previous ones. Without an explicit choice-free justification (e.g., via a definable selection or an appeal to a ZF theorem that avoids DC_ω), the argument risks relying on dependent choice, which would falsify the ZF claim.
Simulated Author's Rebuttal
We thank the referee for the careful reading and for identifying the need to confirm that the central classification holds strictly in ZF. We address the concern below and will revise the manuscript accordingly.
read point-by-point responses
-
Referee: [the section containing the classification theorem for countable τ] The central classification of ⟨^α2, <lex⟩ → (τ)^τ for countable τ is asserted to hold in pure ZF. However, the standard constructions of homogeneous sets of order type τ proceed by building a countable sequence of elements, each satisfying color conditions relative to the previous ones. Without an explicit choice-free justification (e.g., via a definable selection or an appeal to a ZF theorem that avoids DC_ω), the argument risks relying on dependent choice, which would falsify the ZF claim.
Authors: We agree that an explicit justification is required to substantiate the ZF claim. The construction in the classification theorem proceeds by recursion along the well-ordered set τ. To ensure no appeal to DC_ω is made, we will add a new lemma in the revised manuscript that verifies the required selections at successor steps can be performed definably from the given coloring and the lexicographic structure, without arbitrary choices. This will be done by exhibiting a uniform way to specify the next element using the fixed parameters of the proof. The revision will not change the theorem statement or its consequences but will make the choice-free character fully transparent. revision: yes
Circularity Check
No circularity: self-contained ZF derivation of partition relations
full rationale
The paper works entirely within ZF, deriving infinite-exponent partition relations on lexicographic orders ^α2 from the standard definitions of <lex and the arrow notation. The classification of ⟨^α2,<lex⟩ → (τ)^τ for countable τ is obtained as a consequence of general results on such relations, without any data fitting, self-definitional loops, or load-bearing self-citations that reduce the central claim to unverified prior inputs. All steps are direct consequences of ZF axioms and the given order and coloring definitions; no step equates a derived quantity to a fitted or renamed input by construction. The skeptic concern about dependent choice is a potential correctness issue outside the scope of circularity analysis, as no quoted reduction to self-inputs appears.
Axiom & Free-Parameter Ledger
axioms (1)
- standard math ZF set theory (without AC)
Reference graph
Works this paper leans on
-
[1]
L.\ A.\ Gardiner, Infinite-exponent partition relations on the real line, arXiv:2507.12361 (2025)
work page internal anchor Pith review Pith/arXiv arXiv 2025
-
[2]
S.\ Ginsburg, Some remarks on order types and decompositions of sets, Transactions of the American Mathematical Society, Volume 74, no.\ 3 (1953), pp.\ 514--535
1953
-
[3]
Schilhan, Structural infinite-exponent partition relations and weak choice principles, in preparation
L.\ A.\ Gardiner, J. Schilhan, Structural infinite-exponent partition relations and weak choice principles, in preparation
-
[4]
F.\ Hausdorff, Grundzüge einer Theorie der geordneten Mengen, Mathematische Annalen, Volume 65 (1908), pp.\ 435--505
1908
-
[5]
Chan and S
W. Chan and S. Jackson, Applications of infinity-Borel codes to definability and definable cardinals, Fundam. Math. 265, No. 3, 215--258 (2024; Zbl 07922314)
2024
-
[6]
T.\ J.\ Jech, The Axiom of Choice, Studies in logic and the foundations of mathematics, Volume 75, North-Holland (1973)
1973
-
[7]
P.\ Jullien, Contribution à l’étude des types d’ordres dispersés, doctoral thesis, Université de Marseille (1968)
1968
-
[8]
A.\ Kanamori, The Higher Infinite: Large Cardinals in Set Theory from Their Beginnings, Springer, Berlin (2003)
2003
-
[9]
E.\ M.\ Kleinberg, Infinitary Combinatorics and the Axiom of Determinateness, Springer-Verlag Lecture Notes in Mathematics, Volume 612 (1977)
1977
-
[10]
R.\ Laver, On Fraïssé's order type conjecture, Annals of Mathematics, Volume 93, no.\ 1 (1971), pp.\ 89--111
1971
-
[11]
P.\ Lücke, P.\ Schlicht, T.\ Weinert, Choiceless Ramsey theory of linear orders, Order, Volume 34 (2017), pp.\ 369--418
2017
-
[12]
A.\ R.\ D.\ Mathias, On a generalization of Ramsey's theorem, doctoral thesis, University of Cambridge (1970)
1970
-
[13]
A.\ C.\ Morel, On the arithmetic of order types Transactions of the American Mathematical Society, Volume 92, no.\ 1 (1959), pp.\ 48--71
1959
-
[14]
303--306
K.\ Příkrý, Determinateness and partitions, Proceedings of the American Mathematical Society, Volume 54, no.\ 1 (1976), pp. 303--306
1976
-
[15]
J.\ G.\ Rosenstein, Linear Orderings, Pure and Applied Mathematics, Academic Press, New York and London, Volume 98 (1982)
1982
-
[16]
R.\ M.\ Solovay, A model of set-theory in which every set of reals is Lebesgue measurable, Annals of Mathematics, Volume 92, no.\ 1 (1970), pp.\ 1--56
1970
- [17]
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.