Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Low-dimensional real Clifford algebra models

Statement

Use the positive-square-first convention Qp,q=∑i=1pxi2−∑j=1qxp+j2, and let M2(D) have the meaning in Real, complex, and quaternion coefficient algebras and matrix notation. Then

SignatureAlgebra
(1,0)R⊕R
(0,1)C
(2,0)M2(R)
(1,1)M2(R)
(0,2)H

Facts & Assumptions

Given: The real Clifford quotient with relation v2=Q(v)1, the displayed standard signatures, and the coefficient algebras C,H,M2(R).

[F1]

In the Clifford quotient, each canonical generator satisfies vˉ 2=Q(v)1 (Universal Clifford algebra of a quadratic space).

[F2]

A linear map from a quadratic space to a unital associative algebra that satisfies every square relation extends uniquely to its Clifford algebra (Universal property of the Clifford algebra).

[F3]

For an ordered basis of an n-dimensional quadratic space, the increasing square-free Clifford monomials form a basis of size 2n (PBW basis and exterior associated graded for a Clifford algebra).

[F4]

The real algebra H has basis 1,i,j,k with ij=k (Real, complex, and quaternion coefficient algebras and matrix notation); every complex number has a unique form a+bi, so 1,i is a real basis of C (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2)).

Proof

technique · explicit representations and dimension comparison
1.1givenF2F3F4construct

For Cl1,0, send its positive generator to (1,−1)∈R⊕R; every multiple xe then squares to x2(1,1), so [F2] gives a homomorphism. Its image contains (1,1) and (1,−1), which span the target over R, and [F3] gives dimension 2 on the source, so the map is an isomorphism. For Cl0,1, send its negative generator to i∈C; every multiple xe squares to −x2, and the images 1,i are a basis, so [F2]–[F3] give an isomorphism.

1.2givenF1F2F3constructalgebra

Let A=(100−1), B+=(0110), and B−=(01−10). Direct multiplication gives A2=B+2=I, B−2=−I, and AB+=−B+A, AB−=−B−A. Hence (xA+yB+)2=(x2+y2)I and (xA+yB−)2=(x2−y2)I for all real x,y, so [F2] gives the required homomorphisms from Cl2,0 and Cl1,1. In each case the images of 1, the two generators, and their product are the four linearly independent matrices I,A,B+,B− in some order, so the maps are surjective; [F3] gives dimension 4 on each source, making both maps isomorphisms.

2.1givenF1F2F3F4construct∎

Send the two negative generators of Cl0,2 to i,j∈H. They square to −1 and anticommute, so every linear combination xi+yj squares to −(x2+y2) and [F2] gives a homomorphism. Its image contains 1,i,j,ij=k, the basis in [F4]; [F3] gives dimension 4 on the source, so this homomorphism is an isomorphism.

Depends on

Used by

Dependency tree · two levels

21 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