pith. sign in

arxiv: 2607.02500 · v1 · pith:JH65BM2Knew · submitted 2026-07-02 · 🧮 math.CO

The structure of FAC posets and the Aharoni--Korman conjecture

Lawrence Hollom This is my paper

Pith reviewed 2026-07-03 10:07 UTC · model grok-4.3

classification 🧮 math.CO
keywords FAC posetAharoni-Korman conjecturesaturated chainscattered posetantichain partitioncountable posetco-wellfoundedordered sum
0
0 comments X

The pith

The Aharoni-Korman conjecture holds for countable FAC posets that contain no saturated chain of the forbidden infinite sum form.

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

The paper establishes that any countable poset with no infinite antichain satisfies the 1992 Aharoni-Korman conjecture provided it avoids one specific type of saturated chain. The conjecture asserts the existence of a chain that intersects every set in some partition of the poset into antichains. The proof proceeds by first decomposing the poset into scattered subposets that capture its global structure, then applying that decomposition to locate the desired chain. A reader would care because the conjecture is already known to fail in general, so the result isolates a substantial class of posets where the expected intersection property survives.

Core claim

For every countable FAC poset containing no saturated chain D such that either D or its reverse is an ordered sum over the naturals of infinite co-wellfounded posets, there exists a chain C together with a partition of the poset into antichains such that C meets every block of the partition. The same posets admit a decomposition into scattered posets that reflect the structure of the original order.

What carries the argument

The decomposition of a countable FAC poset into scattered posets that reflect its overall structure, together with the exclusion of saturated chains of the form ⊕_{x∈ω} D_x where each D_x is infinite and co-wellfounded.

If this is right

  • The Aharoni-Korman conjecture is verified for every countable FAC poset whose saturated chains avoid the infinite co-wellfounded sum pattern.
  • Any such poset admits a canonical decomposition into scattered subposets that preserve the global order relations.
  • The forbidden chain form is the only remaining obstruction within the countable case.
  • Structural results about scattered components can be applied directly to locate the intersecting chain.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Counterexamples to the full conjecture, if they exist in the countable setting, must contain the excluded chain type.
  • The decomposition technique may extend to other intersection properties of chains and antichains in FAC posets.
  • It remains open whether the same structural decomposition works when countability is dropped.

Load-bearing premise

The poset must be countable and must avoid saturated chains whose order type or reverse order type is an infinite sum of infinite co-wellfounded pieces.

What would settle it

Exhibit a countable FAC poset that contains a saturated chain of the forbidden form and yet admits no chain that intersects every block of any antichain partition.

Figures

Figures reproduced from arXiv: 2607.02500 by Lawrence Hollom.

Figure 1
Figure 1. Figure 1: An example of a poset P with distinguished elements ⊥ and ⊤ and infinite chains (in the rounded rectangles, each of order type ω) A, B, C labelled. Here, T := {⊥, ⊤} ∪ B ∪ C (also shown in a grey rectangle) is the unique maximal tube, but {⊥, ⊤} ∪ X is a spine of P for all X ∈ {A, B, C}. We now show that, given any spine of T and corresponding partition of T into antichains, we can extend it into a partiti… view at source ↗
Figure 2
Figure 2. Figure 2: A Hasse diagram of the poset defined in Proposition [PITH_FULL_IMAGE:figures/full_fig_p039_2.png] view at source ↗
read the original abstract

A poset $P$ is said to satisfy the finite antichain condition, or FAC for short, if it has no infinite antichain. Such posets exhibit rich and complex structure, and 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. While this conjecture is now known to be false, in this paper we prove that the conjecture does hold true for a broad class of posets. In particular, we prove that the Aharoni--Korman conjecture holds for countable posets containing no saturated chain $D$ such that either $D$ or its reverse $D^*$ is of the form $\bigoplus_{x\in\omega} D_x$, where each $D_x$ is infinite and co-wellfounded. In pursuit of this goal, we prove several structural results, the foremost of which demonstrates how a countable FAC poset may be broken up into a collection of scattered posets which reflect the structure of the poset as a whole.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 1 minor

Summary. The paper proves that the Aharoni-Korman conjecture holds for countable FAC posets containing no saturated chain D such that D or its reverse is of the form ⊕_{x∈ω} D_x with each D_x infinite and co-wellfounded. As the main technical tool, it establishes a decomposition of such posets into a collection of scattered posets that reflect the global structure.

Significance. If the proofs are correct, the result is significant because it identifies a broad, explicitly delimited class of FAC posets in which the conjecture holds, despite the existence of counterexamples outside this class. The structural decomposition theorem supplies the key mechanism for the proof and constitutes an independent contribution to the theory of FAC posets.

minor comments (1)
  1. The abstract states the main theorem but does not explicitly name or state the decomposition result; adding a one-sentence description of the decomposition would improve readability for readers who consult only the abstract.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for recommending acceptance. The evaluation correctly identifies the scope of our result on the Aharoni-Korman conjecture for countable FAC posets and the role of the decomposition into scattered posets.

Circularity Check

0 steps flagged

No circularity: direct mathematical proof under explicit restrictions

full rationale

The paper is a self-contained theorem in order theory. It proves the Aharoni-Korman conjecture holds precisely for countable FAC posets lacking saturated chains of the forbidden form ⊕_{x∈ω} D_x (D_x infinite and co-wellfounded). The structural decomposition into scattered posets is obtained by direct analysis of the poset order, not by any parameter fitting, self-definition, or load-bearing self-citation. The restriction is stated upfront to avoid known counterexamples; the proof does not smuggle in an ansatz or rename a known result as a new derivation. No step reduces by construction to its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The proof relies on classical definitions and properties of posets, chains, antichains, well-foundedness, and scattered orders; no free parameters, ad-hoc axioms, or new entities are introduced.

axioms (1)
  • standard math Standard definitions and closure properties of partially ordered sets, antichains, chains, saturated chains, and the operations of sum and reverse.
    Invoked throughout the statement of the main theorem and the decomposition result.

pith-pipeline@v0.9.1-grok · 5724 in / 1144 out tokens · 23574 ms · 2026-07-03T10:07:13.098300+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 2 canonical work pages

  1. [1]

    A note on D ilworth's theorem in the infinite case

    Abraham, U. A note on D ilworth's theorem in the infinite case. Order 4\/ (1987), 107--125

    1987

  2. [2]

    K \"o nig's duality theorem for infinite bipartite graphs

    Aharoni, R. K \"o nig's duality theorem for infinite bipartite graphs. Journal of the London Mathematical Society 2 , 1 (1984), 1--12

    1984

  3. [3]

    Menger's theorem for countable graphs

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

    1987

  4. [4]

    Infinite matching theory

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

    1991

  5. [5]

    Strongly maximal matchings and strongly minimal covers

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

    work page arXiv 2022

  6. [6]

    Menger’s theorem for infinite graphs

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

    2009

  7. [7]

    Strongly maximal antichains in posets

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

    2011

  8. [8]

    Menger's theorem for a countable source set

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

    1994

  9. [9]

    Greene- K leitman's theorem for infinite posets

    Aharoni, R., and Korman, V. Greene- K leitman's theorem for infinite posets. Order 9\/ (1992), 245--253

    1992

  10. [10]

    Strongly perfect infinite graphs

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

    1995

  11. [11]

    The countable E rd o s-- M enger conjecture with ends

    Diestel, R. The countable E rd o s-- M enger conjecture with ends. Journal of Combinatorial Theory, Series B 87 , 1 (2003), 145--161

    2003

  12. [12]

    A decomposition theorem for partially ordered sets

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

    1950

  13. [13]

    Some progress on the A haroni-- K orman conjecture

    Duffus, D., and Goddard, T. Some progress on the A haroni-- K orman conjecture. Discrete mathematics 250 , 1-3 (2002), 79--91

    2002

  14. [14]

    Complete ordered sets with no infinite antichains

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

    1981

  15. [15]

    Ordered sets: Colorings and complexity

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

    1996

  16. [16]

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

    1976

  17. [17]

    Grundz \"u ge einer T heorie der geordneten M engen

    Hausdorff, F. Grundz \"u ge einer T heorie der geordneten M engen. Mathematische Annalen 65 , 4 (1908), 435--505

    1908

  18. [18]

    The A haroni-- K orman conjecture is false

    Hollom, L. The A haroni-- K orman conjecture is false. Israel Journal of Mathematics, to appear\/ (2026)

    2026

  19. [19]

    Counterexamples to conjectures on strong maximality and minimality

    Hollom, L., and Randall Shaw, B. Counterexamples to conjectures on strong maximality and minimality. The Electronic Journal of Combinatorics 33 , 2 (2026), P2.11

    2026

  20. [20]

    D., Mislove, M., and Priestley, H

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

    1987

  21. [21]

    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 counterexample to the Aharoni--Korman conjecture. Accessed 2026-06-17

    2025

  22. [22]

    Perles, M. A. On D ilworth’s theorem in the infinite case. Israel Journal of Mathematics 1\/ (1963), 108--109

    1963

  23. [23]

    Stanley, R. P. Enumerative Combinatorics, Volume 1, Second Edition . Cambridge studies in advanced mathematics, 2011

    2011

  24. [24]

    Counterexample to a conjecture of A haroni and K orman

    van der Zypen, D. Counterexample to a conjecture of A haroni and K orman. arXiv preprint arXiv:2205.02296\/ (2022). 2 pages

    work page arXiv 2022

  25. [25]

    Some progress on the Aharoni--Korman conjecture

    Zaguia, I. Some progress on the Aharoni--Korman conjecture . Discrete Mathematics 347 , 10 (2024)

    2024