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.
The incidence vector of a subset over a stated field
Definition
Fix a field , a natural number , and the standard basis of (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ).
For a subset , its incidence vector over is
Thus
The field is part of the datum and is written whenever two fields are being used at once. The same subset may therefore produce different vectors on this page: the coordinates are the same zero-one pattern, but the arithmetic happens in the chosen field.
The assignment is injective: if , then some coordinate lies in exactly one of them, so . In particular and whenever .
Remarks
- Everything below turns set-system questions into vector-space questions through this definition. Distinctness of sets becomes distinctness of vectors, parity questions become equalities in , and intersection sizes become bilinear-form values.
Depends on
Used by
- A set family whose incidence vectors are dependent over F₂ and independent over ℝ Counterexample
- A finite family of subsets of [n] and its incidence matrix over F Definition
- The pairing construction gives an Eventown family of size 2^⌊ n/2⌋ Example
- ⟨ v_A,v_B⟩ is the image of | A∩ B| in F; over F₂ it is 0 or 1 according to the parity of | A∩ B| Lemma
- If F does not shatter T then x_T agrees on {v_F:F inF} with a combination of the x_S for S⊊ T Lemma
- If the incidence vectors of A₁,…,Aₘ⊆[n] are linearly independent over F then m≤ n Lemma
- A second proof of Sauer–Shelah, from the multilinear polynomial space Theorem
- An Eventown family that no further set can be added to has exactly 2^⌊ n/2⌋ members Theorem
- An L-intersecting family on [n] with | L|=s has at most ∑ᵢ₌₀ˢC(n, i) members Theorem
- Fisher's inequality, nonuniform form: distinct nonempty A₁,…,Aₘ⊆[n] with | Aᵢ∩ Aⱼ|=t for all i≠ j satisfy m≤ n Theorem
- Oddtown: distinct A₁,…,Aₘ⊆[n] with every | Aᵢ| odd and every | Aᵢ∩ Aⱼ| (i≠ j) even satisfy m≤ n Theorem
Dependency tree · two levels
28 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
- L. Babai and P. Frankl, Linear Algebra Methods in Combinatorics, §1.1 (standard reference, not scraped)
- J. Matousek, Thirty-three Miniatures, Miniature 3 (standard reference, not scraped)