Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 F, n≥0, and table f:{0,1}n→F, there is exactly one multilinear extension. It is f~(X)=∑b∈{0,1}nf(b)λb(X),λb(X)=∏i=1n(biXi+(1−bi)(1−Xi)). An empty product is 1. Equality and uniqueness are for formal polynomials, including in characteristic two.

Facts & Assumptions

Given: The objects and hypotheses in the statement above.

[F1]

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

1.1F1algebra

Each factor in λb is Xi when bi=1 and 1−Xi when bi=0. Hence λb is multilinear. At a Boolean vector c, every factor equals one if c=b; if c≠b, a differing coordinate supplies a zero factor. Thus λb(c) is one for b=c and zero otherwise.

1.2F1baseih

For uniqueness consider a multilinear polynomial h 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 n−1 and write h=A+XnB with A,B multilinear in the other variables. Its restrictions h0=A and h1=A+B vanish on that smaller cube, so both are zero by the induction hypothesis.

2.1step 1.1algebra

The displayed finite sum is multilinear and takes value f(c) at c. When n=0 it is the single constant f(()). In particular the zero table extends to zero and the constant-one table extends to one.

3.1step 2.1step 1.2discharge-inductionalgebra∎

The formal identity h=(1−Xn)h0+Xnh1 gives h=0. 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 0≠1, 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