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.
Multilinear polynomials and the reduction on the cube
Definition
A polynomial is multilinear when , or when
Equivalently, is a linear combination of the monomials
For a multi-index , let . The multilinear reduction of is the unambiguously defined polynomial
Equivalently, each monomial is reduced by replacing every positive power by . Thus is multilinear, including when it is the zero polynomial. The next lemma proves that it is the unique multilinear polynomial agreeing with on the cube, and that if then its total degree does not exceed that of .
Remarks
- The reduction is a cube phenomenon. It is not an algebra homomorphism on all of ; it is the canonical representative for restricting a polynomial to .
Depends on
- Monomials, coefficients, degree in each variable and total degree in $F[x_1,\dots,x_n]$
- Reducing $f$ modulo $g_i(x_i)=\prod_{s\in S_i}(x_i-s)$ lowers each $\deg_{x_i}$ below $\lvert S_i\rvert$, preserves the values on the grid, and preserves any top-degree coefficient whose exponents stay below the grid sizes
- Polynomial rings in finitely many commuting indeterminates by iteration
- Field
Used by
- The six 2-subsets of [4] are {0,1}-intersecting, and the bound ∑_i≤2C(4, i)=11 holds Example
- f̃ is multilinear, agrees with f at every point of {0,1}ⁿ, is degree-nonincreasing when nonzero, and is the unique multilinear polynomial with that agreement 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
- The functions {0,1}ⁿ→ F obtained from x_T with | T|≤ s are linearly independent, so they span a space of dimension ∑ᵢ₌₀ˢC(n, i) Lemma
Dependency tree · two levels
11 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
- J. Matousek, Thirty-three Miniatures, Miniature 17 (standard reference, not scraped)