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.
Boolean-cube interpolation
Statement
For every field , , and table , there is exactly one multilinear extension. It is An empty product is . Equality and uniqueness are for formal polynomials, including in characteristic two.
Facts & Assumptions
Given: The objects and hypotheses in the statement above.
A multilinear extension agrees with the table at every Boolean vertex and has individual exponents at most one (Multilinear extension of a Boolean-cube table).
Proof
Each factor in is when and when . Hence is multilinear. At a Boolean vector , every factor equals one if ; if , a differing coordinate supplies a zero factor. Thus is one for and zero otherwise.
For uniqueness consider a multilinear polynomial vanishing at all Boolean vertices. In dimension zero it is a constant with value zero, hence is zero. For positive dimension assume the assertion in dimension and write with multilinear in the other variables. Its restrictions and vanish on that smaller cube, so both are zero by the induction hypothesis.
The displayed finite sum is multilinear and takes value at . When it is the single constant . In particular the zero table extends to zero and the constant-one table extends to one.
The formal identity gives . Induction proves the vanishing assertion in every dimension; applying it to the difference of two extensions proves uniqueness. All identities used only field addition and multiplication, with , so characteristic two is included.
Depends on
Used by
Dependency tree · two levels
3 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
- Justin Thaler, Proofs, Arguments, and Zero-Knowledge (2023), §3.5, Fact 3.5 and Lemma 3.6, pp.29–30 (standard reference, not scraped)