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.
The zero quadratic form gives the exterior algebra
Example
Let on a finite-dimensional -vector space and hence . The two quotient presentations identify canonically with . If is an ordered basis, their common basis is and the increasing square-free monomials. The form is degenerate whenever .
Facts & Assumptions
Given: A field of characteristic not , a finite-dimensional vector space with ordered basis , and .
The Clifford algebra is the tensor-algebra quotient by the ideal generated by (Universal Clifford algebra of a quadratic space).
The exterior algebra is the tensor-algebra quotient by the ideal generated by (Exterior Algebra Of A Finite Free Module).
The ordered square-free Clifford monomials form a basis (PBW basis and exterior associated graded for a Clifford algebra).
The increasing exterior monomials form a basis (Exterior Algebra Basis Monomials).
Verification
Since for every , [F1] and [F2] quotient by the same two-sided ideal. The map is therefore well defined, preserves the induced algebra operations, and has the inverse .
By [F3] and [F4], the same ordered square-free monomials are bases on the two sides; for both lists consist only of . Thus the canonical presentation isomorphism has the asserted basis description, including the degenerate case.
Depends on
Used by
Nothing in the library uses this result yet.
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.