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.
Bipartite neighbourhoods, Hall's condition and systems of distinct representatives
Definition
Let be a finite bipartite graph with specified parts and . For , its neighbourhood in is The pair satisfies Hall's condition (on ) if for every .
For any indexed family , write . A system of distinct representatives (SDR) is an injection such that for every .
When and are finite, the incidence graph of the family is the finite bipartite graph with the disjoint tagged parts and an edge exactly when . For , its left tagged copy has neighbourhood
Depends on
Used by
- A finite family has an SDR if and only if every subfamily has a union at least as large as its index set Corollary
- The maximum matching from X has size |X|-max_S⊆ X(|S|-|N(S)|) Corollary
- Three left vertices with only two collective neighbours fail Hall's condition and cannot all be matched Example
- Alternating reachability from unmatched left vertices produces a vertex cover of the same size as a maximum matching Lemma
- Hall's condition passes to the strict and tight induction subinstances Lemma
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 33 results over 16 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
- F. Gotti, Matching and Hall's Theorem (standard reference, not scraped)