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 standard bilinear form on
Definition
Fix a field and a natural number . The standard bilinear form on is
The symbol denotes the finite sum in the additive commutative group of the field : it is at and is obtained by successively adding the terms for .
This is a symmetric bilinear form in the sense of Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms, and its matrix in the standard basis of is the identity matrix. Hence it is nondegenerate in the sense of The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space.
When , the squaring law gives
So over the form detects parity and not positivity. It is not an inner product there, and the page never treats it as one.
Remarks
- The formula is the same over every field, but the consequences are not. The Oddtown and Eventown arguments use only bilinearity over ; the Fisher argument later uses the order and positivity of as well.
Depends on
- Field
- Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms
- The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space
- Vector space over a field
- The standard list $e : n \to F^{n}$ with $e_i(i) = 1_F$ and $e_i(j) = 0_F$ for $j \ne i$ is an ordered basis of $F^{n}$; hence $\dim_F F^{n} = n$, and $F^{0}$ is the zero space with basis $\varnothing$ and dimension $0$
Used by
- A finite family of subsets of [n] and its incidence matrix over F Definition
- The n hyperplanes xᵢ=1 cover {0,1}ⁿ except the origin, so the Alon–Füredi bound is tight Example
- FALSE: ⟨ x,y⟩=∑ᵢxᵢyᵢ makes F₂ⁿ an inner product space False statement
- FALSE: distinct nonempty A₁,…,Aₘ⊆[n] whose pairwise intersections all have the same parity satisfy m≤ n False statement
- ⟨ 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
- For a subspace U≤ Fⁿ, dim_F U^⊥=n-dim_F U, where U^⊥={x:⟨ x,u⟩=0 for all u∈ U} Lemma
- If v₁,…,vₘ∈ℝⁿ satisfy ⟨ vᵢ,vⱼ⟩=t≥0 for i≠ j and ⟨ vᵢ,vᵢ⟩>t, they are linearly independent Lemma
- Which field each bound is proved over, and what changes when it is replaced Remark
- An Eventown family that no further set can be added to has exactly 2^⌊ n/2⌋ members Theorem
- Covering {0,1}ⁿ minus the origin by affine hyperplanes avoiding the origin needs at least n of them Theorem
- Eventown: distinct A₁,…,Aₘ⊆[n] with every | Aᵢ| and every | Aᵢ∩ Aⱼ| even satisfy m≤ 2^⌊ n/2⌋ 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
34 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, §2.3.1 (standard reference, not scraped)