Pith. sign in

REVIEW 7 minor 22 references

The Aharoni--Korman conjecture is false

T0 review · 0 major / 7 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The Aharoni–Korman (fishbone) conjecture is false: a countable poset satisfies the finite antichain condition but has no chain meeting every antichain of any partition.

desk verdict This paper refutes the Aharoni–Korman conjecture with a carefully constructed counterexample and a Lean-verified core proof; the positive theorem for vacillating posets keeps the conjecture's spirit alive. read the letter →

arxiv 2411.16844 v5 pith:NERZ63GE submitted 2024-11-25 math.CO

Lawrence Hollom This is my paper · ORCID
classification math.CO MSC 06A0706A06
keywords Aharoni-Kormanconjecturefiniteantichainconditionposetspinestronglymaximalchainscatteredvacillatingreplacementcounterexample
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper claims to settle the Aharoni–Korman conjecture, a 1992 problem asserting that every poset with no infinite antichain (an FAC poset) has a chain that meets every antichain in some partition into antichains. The paper constructs a specific countable poset, $P_5$, and proves it is an FAC scattered poset with no such chain, so the conjecture is false in full generality. At the same time, it proves the conjecture is true for all countable 'vacillating' FAC posets, a class that forbids a particular wellfounded-over-co-wellfounded interval structure. If correct, the work closes the conjecture while showing why counterexamples must be complicated.

What carries the argument

The central object carrying the negative result is the poset $P_5$, and the load-bearing mechanism is the chain-length observation inside each level: any interval between comparable points contains chains of a stated maximal length through a middle point, and Lemma 5.11 uses it to force a hypothetical partition function $f$ to act bijectively on finite intervals of $L_{n+1}$, producing the contradiction. For the positive side, the machinery is a family of 'replacement' partial orders on chains — $\eta$-replacements, alternating replacements, and reductions — used with Zorn's lemma to construct maximal chains, together with the chain extension $H(P)$ and the reduction order $\unrhd$; from a reduced chain one builds a strong thick chain, and a known theorem converts a thick chain into a spine.

What would settle it

Find three points $(x,y,n) \leq (u,v,n) \leq (w,z,n)$ in $P_5$ such that every chain inside the interval $[(x,y,n),(w,z,n)]$ containing $(u,v,n)$ has length strictly less than $w+z+1-x-y$; that would break the chain-length observation on which Lemma 5.11 depends. Alternatively, exhibit a chain $C \subseteq P_5$ that meets every antichain in some partition of $P_5$ into antichains, directly contradicting Proposition 5.7.

Watch

Extended reading notes

Core claim

The central discovery is a countable poset $P_5$ — defined on levels $L_n = \omega \times \omega \times \{n\}$ with cross-level comparability rules — that satisfies the finite antichain condition yet admits no spine: no chain $C$ can meet every antichain of any partition into antichains. The order places $(x,y,n)$ below $(u,v,m)$ when the levels are far apart ($n \geq m+2$), within the same level by the product order, and across adjacent levels by two comparison rules that force a precise, chain-rich geometry between $L_n$ and $L_{n+1}$. The proof fixes an arbitrary chain $C$, shows that some level meeting $C$ is finite, then shows that any hypothetical antichain partition with spine would be witnessed by a function $f$ whose level-wise behaviour contradicts the chain-length structure inside each $L_n$. The same paper proves a compensating positive theorem: every countable vacillating FAC poset has a spine.

Load-bearing premise

The counterexample rests on the chain-length fact that inside each level $L_n$ of $P_5$, any interval between two comparable points has a chain of the full claimed length $w+z+1-x-y$ through any specified middle point; if this fact fails, the contradiction that rules out a spine collapses.

Editorial extensions

If this is right

  • The Aharoni–Korman conjecture, in full generality, is false; any future positive result must restrict the class of posets or weaken the conclusion.
  • For countable posets, the vacillating condition marks a sharp boundary: every countable vacillating FAC poset has a spine, while the non-vacillating poset P5 does not.
  • Every countable FAC poset has a strongly maximal chain, a structural guarantee weaker than a spine but now unconditional in the countable case.
  • Since a spine must be strongly maximal, counterexamples must be posets whose strongly maximal chains fail to extend to antichain partitions; P5 is such a poset.
  • The formal verification of the counterexample's key proposition means that the core of the negative result is machine-checked, not merely argued.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The stability of the counterexample under changing the constant 2 to any α > 1 (noted in the paper) suggests the failure mechanism is structural rather than numerical; one could test whether the same contradiction survives for all α > 1.
  • Because P5 has width ℵ0, the paper's open question of whether finite-width posets all have spines is not answered by this construction; a finite-width counterexample, if one exists, would need a different mechanism than the one used here.
  • The replacement-order technique used to find strongly maximal chains might transfer to the hypergraph problems that motivated the conjecture, where a similar maximality-versus-partition tension appears.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 7 minor

Summary. The paper claims to resolve the 1992 Aharoni-Korman conjecture. It develops a substantial apparatus around chain extensions, reduction orders, and strongly maximal chains, and states two main theorems: Theorem 1.15, that every countable FAC poset has a strongly maximal chain, and Theorem 1.18, that every countable vacillating FAC poset has a spine. The central result is Theorem 1.2, proved as Proposition 5.7: the explicitly defined countable poset P5 on N x N x N is scattered and has no infinite antichain, yet it admits no chain C that meets every member of some partition into antichains. The no-spine proof fixes an arbitrary chain C, uses Lemma 5.10 to find a level Ln with finite intersection with C, and then shows that no antichain partition function f can be defined on C union Ln union Ln+1, by forcing f to act bijectively on finite intervals of Ln+1 and then deriving a counting contradiction on a lower-level chain.

Significance. If correct, the paper settles a 1992 conjecture that has been open for over thirty years, and it does so in the negative. The counterexample is the core contribution: it is constructed explicitly, the proof of Proposition 5.7 is largely self-contained, and the paper reports that the proposition has been formally verified in Lean by Bhavik Mehta, with code available at reference [19]. That machine-checked artifact considerably strengthens confidence in the central claim. The positive theorem for countable vacillating FAC posets is also significant because it shows that the counterexample is in a precise sense at the boundary of the class of posets for which the conjecture can still hold. I read the central no-spine argument as sound; the remaining issues I found are local and presentational.

minor comments (7)
  1. [Section 4, opening paragraph] The paper says 'Recall that a poset is vacillating if there is no contiguous chain C in P such that either C or C* has every proper interval wellfounded, but is not itself wellfounded.' This is not equivalent to Definition 1.17. Under the Section 4 formulation, a copy of omega would fail to be vacillating, while Definition 1.17 explicitly permits wellfounded and co-wellfounded posets as vacillating. Please reconcile the two statements.
  2. [Section 5.2, proof of Proposition 5.7] The set R is defined as {x in Ln : x > max(C intersect Ln)}, but Lemma 5.10 only guarantees that C intersect Ln is finite, not that it is nonempty. If C intersect Ln is empty, the maximum is undefined. Please state the convention max(empty) = -infinity or redefine R as Ln in that case; the intended argument is clear and adapts, but the formal definition should be repaired.
  3. [Section 5.2, Lemma 5.10] The displayed line 'm_{n+1} <= min{x,y} + 1 <= min{u,v} = m_n. Therefore m_{n+1} < m_n' is not a logically valid inference as written. The intended point is that comparability through the second level condition forces min{x,y} + 1 <= m_n, hence min{x,y} < m_n, and therefore m_{n+1} <= min{x,y} < m_n. Please correct the display.
  4. [Section 5.2, final paragraph of Proposition 5.7] The set T is written as {q in L_{n-1} : q is not >= (3a, a, b)}. The third coordinate is presumably n, not b, and it would help to add a sentence explaining why this set is exactly { (u,v,n-1) : u+v <= 2a-1 }.
  5. [Section 5.2, Lemma 5.11] The notation 'C intersect L_{n+1} is reduced above D0 or D1' uses the reduction symbol from Section 2.3 for objects that are not explicitly identified as nonprincipal chains. Please clarify that the intended relation is 'cofinally above' or first embed the relevant chains in N(P).
  6. [Section 5.2, Observation 5.8] Item (v) asserts that P5 is scattered and not vacillating without proof. Scatterability is not used heavily in the no-spine proof, but a one-sentence justification for both claims would make the observation self-contained.
  7. [References] Reference [19] cites a GitHub repository without a commit hash or version identifier. Since the formal verification is advertised as evidence for Proposition 5.7, please pin the exact version of the formalization for reproducibility.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the P5 counterexample is built from scratch, the no-spine proof is self-contained, and the positive results use prior independent theorems as black boxes.

full rationale

The paper's central claim (Theorem 1.2) is a counterexample to the Aharoni–Korman conjecture. The defining order on P5 in Example 5.6 is given explicitly, with no parameter fitted to a desired conclusion; the constant 2 in the fourth clause is explicitly remarked to be replaceable by any real α > 1, so it is not a tuned quantity. Proposition 5.7 is proved by assuming an arbitrary chain C is a spine and deriving a contradiction through Lemmas 5.9, 5.10, and 5.11. The argument uses only the definition of a spine, elementary facts about antichains and chains within levels, and Observation 5.8, whose items are verified directly from the definition of P5. No step of the proof invokes the Aharoni–Korman conjecture or any equivalent formulation as an assumption. The positive theorems (Theorem 1.18) rely on Theorem 1.10 of Duffus–Goddard and Theorem 1.11 of Zaguia as external black boxes; these are prior independent results not authored by the present author, and they are used legitimately rather than as a self-citation chain. The formal verification of Proposition 5.7 by Bhavik Mehta in Lean/mathlib4 is independent machine-checked support, explicitly weakening any concern about hidden circularity. There is no fitted input renamed as a prediction, no uniqueness theorem imported from the authors' own prior work, and no ansatz smuggled in via citation. The paper is self-contained against external benchmarks for the counterexample and adequately supported for the positive results. A minor presentational issue exists in Lemma 5.10's definition of max(C ∩ Ln) if that intersection is empty, but the intended meaning is clear and does not constitute circular reasoning. Overall, no derivation step reduces to its own inputs.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper introduces new mathematical definitions (spine, vacillating poset, the chain extension H(P), reduction order, thick chain) but these are constructions within standard mathematics, not postulated entities requiring independent empirical evidence. There are no fitted free parameters: the constant 2 in the definition of P5 is arbitrary (any α > 1 works).

assumptions (5)
  • standard math Standard ZFC set theory and Zorn's lemma are used without comment.
    Zorn's lemma is invoked explicitly in Lemma 3.6, Lemma 4.9, Lemma 4.16, and Lemma 4.17 to produce maximal chains and reduced chains.
  • standard math Fact 1.7: every infinite FAC poset contains an infinite chain.
    This follows from infinite Ramsey theory and is used throughout to replace infinite antichain-free sequences with chains.
  • standard math Hausdorff's characterization of scattered linear orders (Theorem 2.13).
    Used in Lemma 2.14 to prove that nontrivial scattered posets contain atomic increasing chains, a key step in the reduction theory.
  • standard math Theorem 1.10 of Duffus-Goddard: FAC posets with no infinite intervals have a spine.
    Used as a black box in the proof of Lemma 3.1 to produce strongly maximal chains inside certain wide-interval subposets.
  • standard math Theorem 1.11 of Zaguia: posets with locally finite incomparability graph have a spine.
    Used in the proof of Theorem 1.18 to establish that every thick chain has a spine, which is then extended to a spine of the whole poset.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Aharoni--Korman conjecture is false." pith.science (2026). https://pith.science/paper/NERZ63GE

@misc{pith2026241116844,
  author       = {Pith},
  title        = {Pith review of: The Aharoni--Korman conjecture is false},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NERZ63GE}},
  note         = {Machine review of arXiv:2411.16844}
}
abstract

A poset $P$ is said to satisfy the finite antichain condition, or FAC, if it has no infinite antichain. It was conjectured by Aharoni and Korman in 1992 that any FAC poset $P$ possesses a chain $C$ and a partition into antichains such that $C$ meets every antichain of the partition. In this work we provide a counterexample to this conjecture, demonstrating that it is false. We also discuss variations of the conjecture which may yet be true.

Figures

Figures reproduced from arXiv: 2411.16844 by the authors.

Figure 1
Figure 1. A Hasse diagram of P1. The regions in grey triangles are order-isomorphic to ω. Now, we define maximal chains C1 and C2 as follows. C1 := {⊥, ⊤} ∪ {(n, 0) : n ∈ N}, C2 := {⊥, ⊤} ∪ {(n, 1) : n ∈ N} ∪ {a}. We claim that both C1 and C2 are strongly maximal, but, while C2 is a spine in P, C1 is not a spine. Indeed, every point of the form (n, 0) is incomparable to all points of the form (m, 1) for m ≥ n, and so we can p… view at source ↗
Figure 2
Figure 2. A Hasse diagram of P2. The regions in grey triangles are order-isomorphic to ω, and this structure continues infinitely in both directions. Define the chains C0 and C1 by Ci := {(z, i, n) : z ∈ Z, n ∈ N}. Furthermore, define for each n ∈ N the chain Dn := {(z, i, n) : z ∈ Z, i ∈ 2}. Note that the chains Ci and Dn are all maximal, and both the family {C0, C1} and the family {Dn : n ∈ N} partition P2. Thus, even thoug… view at source ↗
Figure 3
Figure 3. An approximate Hasse diagram of P5. The regions within the grey V-shapes are order-isomorphic to ω × ω, and this structure continues infinitely downwards. Relations between Ln and Ln+1 are shown in more detail in [PITH_FULL_IMAGE:figures/full_fig_p039_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Two examples of the relations between Ln and Ln+1. The red region in Ln is the set of those points above (1, 10, n + 1) (shown in a red circle), and the blue region in Ln+1 is the set of those points below (1, 2, n) (shown in a blue circle). Proposition 5.7. P5 is a co…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

22 extracted references · 20 canonical work pages

  1. [19]

    Disproof of the Aharoni-Korman conjecture

    Mehta, B. Disproof of the Aharoni-Korman conjecture. https://github. com/b-mehta/AharoniKorman, 2025. A formal verification of the proof of Proposition 5.7. Accessed 2025-01-15

    work page 2025

  2. [1]

    A note on Dilworth’s theorem in the infinite case

    Abraham, U. A note on Dilworth’s theorem in the infinite case. Order 4 (1987), 107–125

    work page 1987

  3. [2]

    K¨ onig’s duality theorem for infinite bipartite graphs.Journal of the London Mathematical Society 2 , 1 (1984), 1–12

    Aharoni, R. K¨ onig’s duality theorem for infinite bipartite graphs.Journal of the London Mathematical Society 2 , 1 (1984), 1–12

    work page 1984

  4. [3]

    Journal of Combinatorial Theory, Series B 43 , 3 (1987), 303–313

    Aharoni, R.Menger’s theorem for countable graphs. Journal of Combinatorial Theory, Series B 43 , 3 (1987), 303–313

    work page 1987

  5. [4]

    Infinite matching theory

    Aharoni, R. Infinite matching theory. Discrete Mathematics 95 , 1-3 (1991), 5–22

    work page 1991

  6. [5]

    arXiv preprint arXiv:2206.02576 (2022)

    Aharoni, R.Strongly maximal matchings and strongly minimal covers. arXiv preprint arXiv:2206.02576 (2022). 3 pages

    arXiv 2022

  7. [6]

    Inven- tiones mathematicae 176 , 1 (2009), 1–62

    Aharoni, R., and Berger, E.Menger’s theorem for infinite graphs. Inven- tiones mathematicae 176 , 1 (2009), 1–62

    work page 2009

  8. [7]

    Dis- crete mathematics 311 , 15 (2011), 1518–1522

    Aharoni, R., and Berger, E.Strongly maximal antichains in posets. Dis- crete mathematics 311 , 15 (2011), 1518–1522

    work page 2011

Show all 22 references
  1. [8]

    Combinatorics, Probability and Computing 3 , 2 (1994), 145–156

    Aharoni, R., and Diestel, R.Menger’s theorem for a countable source set. Combinatorics, Probability and Computing 3 , 2 (1994), 145–156

    1994

  2. [9]

    Greene-Kleitman’s theorem for infinite posets

    Aharoni, R., and Korman, V. Greene-Kleitman’s theorem for infinite posets. Order 9 (1992), 245–253

    1992

  3. [10]

    Israel Journal of Mathematics 90 , 1 (1995), 81–91

    Aharoni, R., and Loebl, M.Strongly perfect infinite graphs. Israel Journal of Mathematics 90 , 1 (1995), 81–91

    1995

  4. [11]

    The countable Erd˝ os–Menger conjecture with ends

    Diestel, R. The countable Erd˝ os–Menger conjecture with ends. Journal of Combinatorial Theory, Series B 87 , 1 (2003), 145–161

    2003

  5. [12]

    Annals of Mathematics 51 , 1 (1950), 161–166

    Dilworth, R.A decomposition theorem for partially ordered sets. Annals of Mathematics 51 , 1 (1950), 161–166

    1950

  6. [13]

    Some progress on the Aharoni–Korman conjecture

    Duffus, D., and Goddard, T. Some progress on the Aharoni–Korman conjecture. Discrete mathematics 250 , 1-3 (2002), 79–91

    2002

  7. [14]

    Discrete Mathematics 35 , 1-3 (1981), 39–52

    Duffus, D., Pouzet, M., and Rival, I.Complete ordered sets with no infinite antichains. Discrete Mathematics 35 , 1-3 (1981), 39–52

    1981

  8. [15]

    Ordered sets: Colorings and complexity

    Goddard, T. Ordered sets: Colorings and complexity . PhD Thesis, Emory University, June 1996

    1996

  9. [16]

    Greene, C., and Kleitman, D. J. The structure of Sperner k-families. Journal of Combinatorial Theory, Series A 20 , 1 (1976), 41–68

    1976

  10. [17]

    Grundz¨ uge einer Theorie der geordneten Mengen.Mathema- tische Annalen 65 , 4 (1908), 435–505

    Hausdorff, F. Grundz¨ uge einer Theorie der geordneten Mengen.Mathema- tische Annalen 65 , 4 (1908), 435–505

    1908

  11. [18]

    D., Mislove, M., and Priestley, H.Ordered sets with no infinite antichains

    Lawson, J. D., Mislove, M., and Priestley, H.Ordered sets with no infinite antichains. Discrete Mathematics 63 , 2-3 (1987), 225

    1987

  12. [20]

    Perles, M. A. On Dilworth’s theorem in the infinite case. Israel Journal of Mathematics 1 (1963), 108–109. A RESOLUTION OF THE AHARONI–KORMAN CONJECTURE 45

    1963

  13. [21]

    arXiv preprint arXiv:2205.02296 (2022)

    van der Zypen, D.Counterexample to a conjecture of Aharoni and Korman. arXiv preprint arXiv:2205.02296 (2022). 2 pages

    2022 arXiv

  14. [22]

    Some progress on the Aharoni–Korman conjecture

    Zaguia, I. Some progress on the Aharoni–Korman conjecture. Discrete Math- ematics 347 , 10 (2024). Appendix A. Summary of terminology and notation In order to aid the reader of this paper, we include here a list of the terminology and notation used in this paper, given in the ...

    2024

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.