Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01
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.

Wedge monomials in a dual basis form a basis

Statement

Let e1,,en be a basis of V, with dual basis e1,,en. Then the wedges

ei1eik(1i1<<ikn)

form a basis of Altk(V).

Facts & Assumptions

Given: A basis e1,,en of V and its dual basis e1,,en.

[F1]

The degree-k part of the exterior algebra is Altk(V), with wedge product given by alternating tensor multiplication (The exterior algebra of covectors).

[L1]

Every covector expands in the dual basis, and ei(ej)=δji (The dual family (b)bB associated to a Hamel basis B, defined by b(c)=δbc).

Proof

technique · direct
1.1

Let ωAltk(V). Expanding each input vector in the basis and using multilinearity shows that ω is determined by its values on basis k-tuples. Because ω is alternating, every tuple with a repeated index vanishes and every tuple with distinct indices reduces, up to sign, to one with increasing indices. Thus ω is a linear combination of the displayed wedges from [F1].

F1L1givenalgebra
2.1

Suppose IcIeI=0, where I=(i1<<ik) and eI:=ei1eik. Evaluating at (ej1,,ejk) with j1<<jk, [L1] gives eI(ej1,,ejk)=1 when I=(j1,,jk) and 0 otherwise. Hence every cI=0.

L1step 1.1algebra
3.1

Therefore the displayed wedges form a basis of Altk(V).

step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

17 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