Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-08-29
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.

Increasing-index wedges of a basis form a basis of ΛkV

Statement

Let V have the ordered basis (e1,…,en) over F and let 0≤k≤n. For each k-element subset I={i1<⋯<ik}⊆{1,…,n} write

eI:=ei1∧⋯∧eik.

Then the family (eI)I indexed by the k-element subsets of {1,…,n} is a basis of ΛkV.

Facts & Assumptions

Given: A vector space V with ordered basis (e1,…,en) and a degree 0≤k≤n.

[L1]

The exterior power is ΛkV=V⊗k/Wk with the wedge equal to the universal multilinear map composed with the quotient projection (The kth exterior power as the tensor-power quotient by repeated-vector relations).

[L2]

The pure tensors ei1⊗⋯⊗eik over all k-tuples form a basis of V⊗k (The elementary tensors of two bases form the product basis of the tensor product).

[L3]

Alternating k-linear maps factor uniquely through ΛkV (Exterior powers represent alternating multilinear maps and are unique up to unique isomorphism).

[L5]

For k≥1, the matrix determinant is alternating and multilinear in the columns, with det⁡(Ik)=1 (The Leibniz determinant is column-multilinear, alternating and normalized over every commutative ring).

Proof

technique · direct
1.1L1

If k=0, then [L1] gives Λ0V=F, and the unique 0-element subset of {1,…,n} is ∅, with e∅:=1F a basis of F. So only the case k≥1 remains.

1.2L1L2

Assume k≥1. By [L2], every element of V⊗k is a linear combination of the pure tensors over all k-tuples; passing to the quotient of [L1], every element of ΛkV is a linear combination of the wedges ei1∧⋯∧eik over all k-tuples.

1.3L1algebra

Still assuming k≥1, a wedge with a repeated index is zero by [L1], and a wedge with distinct indices equals the increasing-index wedge up to a sign: transposing two adjacent wedge entries multiplies the wedge by −1, because by [L1] the alternating relation gives 0=(⋯v+w⋯v+w⋯ )=(⋯v⋯w⋯ )+(⋯w⋯v⋯ ).

1.4L3L5

For each k-subset J={j1<⋯<jk} define φJ:Vk→F by φJ(v1,…,vk):=det⁡M, where M is the k×k matrix whose rth column is the list of the j1,…,jk coordinates of vr; by [L5], φJ is k-linear and alternating, so [L3] induces a unique linear map φ‾J:ΛkV→F with φ‾J(v1∧⋯∧vk)=φJ(v1,…,vk).

2.1step 1.2step 1.3L4

If k≥1, then steps 1.2 and 1.3 give that the increasing wedges eI span ΛkV.

2.2L5step 1.4

If k≥1, then for subsets I,J, the matrix for φJ at (ei1,…,eik) is the identity when I=J and has a zero row when I≠J, so [L5] and step 1.4 give φ‾J(eI)=1 for I=J and 0 for I≠J.

3.1step 1.4step 2.2L4

If k≥1 and ∑IcIeI=0, applying φ‾J of step 1.4 gives cJ=0 for every J by step 2.2, so the increasing wedges are linearly independent in the sense of [L4].

4.1step 1.1step 2.1step 3.1L4∎

Step 1.1 handles k=0, while steps 2.1 and 3.1 show that for k≥1 the increasing wedges are a spanning independent set. Therefore in every case the family (eI)I is a basis of ΛkV.

Depends on

Used by

Dependency tree · two levels

38 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