CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck pass

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A maximal antichain of size one in a finite poset of width two

Statement refuted

The false statement False: every maximal antichain in a finite poset has maximum cardinality claims that every maximal antichain in a finite poset has maximum cardinality.

Facts & Assumptions

Given: The poset $P = {a, b, c}$ with $a < b$ , $a < c$ , and $b, c$ incomparable.

[F1]

An antichain is maximal when no larger antichain contains it, and maximum when no antichain has greater cardinality; the width is the maximum cardinality of an antichain (Antichains, chain covers, and antichain covers of a poset, Height and width of a nonempty finite poset).

Counterexample

technique · direct

1.1givenF1

The singleton ${a}$ is an antichain and cannot be enlarged, since both $b$ and $c$ are comparable with $a$ .

1.2givenF1

The pair ${b, c}$ is an antichain. No three-element antichain exists, because the only three-element subset is $P$ itself and it contains the comparable pair $a, b$ ; hence the width of $P$ is $2$ .

2.1step 1.1step 1.2∎

Thus ${a}$ is maximal of cardinality $1$ but not maximum, providing the required counterexample.

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

M. Keller and W. T. Trotter, Applied Combinatorics, §6.4 (standard reference, not scraped)