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 six-element poset of width three and a three-chain cover
Example
Let with for each , and no other comparabilities between distinct elements. Then is an antichain, and
is a chain cover. The width is exactly , and this cover is minimum.
Facts & Assumptions
Given: The six-element poset described in the Example.
In a finite poset, the minimum number of chains in a chain cover equals the width (Dilworth's theorem: the minimum number of chains covering a finite poset equals its width).
Verification
The set is an antichain, so the width is at least .
Every antichain contains at most one element from each comparable pair , so it has at most elements. Hence the width is exactly .
The three displayed two-element chains cover all six elements, so they form a chain cover of cardinality .
By steps 1.2 and 1.3, and equivalently by [L1], the displayed cover has the minimum possible number of chains.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 14 results over 9 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
- M. Keller and W. T. Trotter, Applied Combinatorics, §6.4 (standard reference, not scraped)