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.
Hyperedge intersection consequence in Construction 1
PDF p. 2: Construction 1, final sentence
Statement
Let be an integer and let be a hypergraph satisfying the conditions of Construction 1, with Berge girth at least as specified in the hypergraph terminology. Then any two distinct hyperedges of intersect in at most one vertex.
Statement references
Facts & Assumptions
By Hypergraph terminology used in Construction 1, the hypergraph in this formulation is finite, and its girth is Berge girth, with infinite girth permitted when there is no Berge cycle.
By Berge girth at least three forces linearity, a finite hypergraph of Berge girth at least three is linear: any two distinct hyperedges have at most one common vertex.
Proof
Given: An integer and a hypergraph satisfying the stated construction conditions, including Berge girth at least .
Goal: Any two distinct hyperedges of intersect in at most one vertex.
The hypergraph is finite and has Berge girth at least three, since its Berge girth is at least and . This also holds if its girth is infinite.
Applying the linearity lemma to shows that any two distinct hyperedges have at most one common vertex, as required.
Depends on
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.
Sources
- Maria Axenovich and Patrick Schmitteckert, Non-isomorphic graphs have distinct vertex-Ramsey classes, arXiv:2610.03704v1 · PDF p. 2, Construction 1, final sentence