Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Clifford involutions and the norm of a vector product

Statement

Let V be finite-dimensional over R, let B be symmetric, put Q(v)=B(v,v), and use the Clifford convention v2=Q(v)1 in Cl(V,Q) from Universal Clifford algebra of a quadratic space. The assignments α(v)=−v and t(v)=v, extended respectively as an algebra automorphism and an order-reversing anti-automorphism, descend to the quotient. Put xˉ=t(α(x)) and N(x)=xxˉ. For anisotropic u1,…,uk,

N(u1⋯uk)=∏j=1k(−Q(uj)) 1.

No nondegeneracy assumption is needed for the involution and norm-of-product assertions.

Facts & Assumptions

Given: The tensor-algebra quotient and relation v2=Q(v)1 of Universal Clifford algebra of a quadratic space.

[F1]

The Clifford algebra is the quotient of the tensor algebra by the two-sided ideal generated by v2−Q(v)1 for all v∈V (Universal Clifford algebra of a quadratic space).

Proof

technique · direct
1.1F1construct

On the tensor algebra, send a word v1⋯vm to (−1)mv1⋯vm for α, and to vm⋯v1 for t. The first is an algebra automorphism and the second reverses products. Each defining relation v2−Q(v)1 is fixed by both maps. The ideal generated by these relations is therefore invariant under each map: applying either map to a generator of the ideal gives another generator, with left and right factors exchanged for t. Thus both maps descend to the quotient and square to the identity.

2.1step 1.1F1algebra

Their composite xˉ=t(α(x)) is an order-reversing involution and satisfies uˉ=−u for u∈V. Hence N(u)=uuˉ=−u2=−Q(u)1.

3.1step 2.1algebra∎

For k=0, the empty product is 1 and N(1)=1. If N(y) is scalar, then N(xy)=xyxy‾=xyyˉxˉ=xN(y)xˉ=N(y)N(x). Induction on k≥1, starting with step 2.1, therefore gives N(u1⋯uk)=∏j=1k(−Q(uj))1.

Remarks

This is xxˉ with vˉ=−v. Meinrenken's text often writes the reversion norm t(x)x; for a homogeneous word of parity k that norm differs by (−1)k, so the conventions agree on even products only.

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