Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-04 (gpt-5.6-sol-codex-subscription)
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.

Height and width of a nonempty finite poset

Definition

Let PP be a nonempty finite poset. Its height is

h(P):=max{C:CP is a chain},h(P):=\max\{\,|C|:C\subseteq P\text{ is a chain}\,\},

and its width is

w(P):=max{A:AP is an antichain}.w(P):=\max\{\,|A|:A\subseteq P\text{ is an antichain}\,\}.

Here P|P| and the cardinalities below are finite cardinalities (The cardinality A\lvert A\rvert of a finite set).

The maxima exist. A chain is a subset of PP whose elements are pairwise comparable and an antichain one whose distinct elements are pairwise incomparable (Chain in a poset, Antichains, chain covers, and antichain covers of a poset); each is a subset of PP, hence finite with cardinality at most P|P| by A subset of a finite set is finite, with BA\lvert B\rvert \le \lvert A\rvert, and equality holds if and only if B=AB = A. The possible cardinalities therefore form nonempty subsets of the finite set {0,1,,P}\{0,1,\ldots,|P|\} — the empty subset is vacuously both a chain and an antichain, so 00 occurs, and every singleton is both, so some cardinality 11 occurs. A nonempty finite set of natural numbers has a greatest member, as follows from The well-ordering principle by applying leastness to the corresponding differences from P|P|. Thus h(P)h(P) and w(P)w(P) are natural numbers with 1h(P),w(P)P1\le h(P),w(P)\le |P|.

The empty poset is excluded so that h(P)h(P) and w(P)w(P) are at least 11: on the empty poset the only chain and the only antichain are empty, so both maxima would be 00 and every statement below with a nonzero lower bound would need a separate convention.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 37 results over 17 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources