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.

Real Clifford signature recurrences and eightfold periodicity

Statement

Let Clp,q be the real algebra for the form with p positive and q negative squares, using v2=Q(v)1. As ungraded real algebras, for p,q,n≥0,

Clp+1,q+1≅Clp,q⊗RM2(R),Cln+2,0≅Cl0,n⊗RM2(R),Cl0,n+2≅Cln,0⊗RH.

The pure-signature algebras through dimension eight are

nCln,0Cl0,n
0RR
1R⊕RC
2M2(R)H
3M2(C)H⊕H
4M2(H)M2(H)
5M2(H)⊕M2(H)M4(C)
6M4(H)M8(R)
7M8(C)M8(R)⊕M8(R)
8M16(R)M16(R)

For every n≥0, the pure algebras satisfy

Cln+8,0≅M16(Cln,0),Cl0,n+8≅M16(Cl0,n).

Facts & Assumptions

Given: The standard real quadratic forms with signature (p,q) and the positive-square-first convention.

[F1]

Each canonical Clifford generator squares to its assigned +1 or −1 value (Universal Clifford algebra of a quadratic space).

[F2]

A linear map satisfying the quadratic relation extends uniquely to a Clifford algebra homomorphism (Universal property of the Clifford algebra).

[F3]

A real Clifford algebra on m generators has dimension 2m by its ordered square-free basis (PBW basis and exterior associated graded for a Clifford algebra).

[F4]

The low-dimensional algebras are Cl1,0=R⊕R, Cl0,1=C, Cl2,0=M2(R), Cl1,1=M2(R), and Cl0,2=H (Low-dimensional real Clifford algebra models).

[F5]

The real coefficient tensor identities include C⊗H≅M2(C), H⊗H≅M4(R), and Mm(D)⊗Mn(R)≅Mmn(D) (Tensor identities for the real division algebras).

[F7]

The Clifford algebra of the zero real vector space is R (The zero-dimensional Clifford algebra is the base field).

[F8]

Ordinary tensor products of real vector spaces have canonical associative reparenthesizations and flips on elementary tensors (Symmetry and associativity isomorphisms for tensor products over a commutative ring).

[F9]

Tensoring over R commutes with direct sums, including the isomorphism (A⊕B)⊗C≅(A⊗C)⊕(B⊗C) (Tensor products commute with arbitrary direct sums).

[F10]

Images of orthogonal Clifford vectors anticommute, by xˉyˉ+yˉxˉ=2B(x,y)1 (Polarized relations in a Clifford algebra).

Proof

technique · generator maps, PBW dimensions, and iteration
1.1givenF1F2F10constructalgebra

Let u,v generate Cl1,1 with u2=1, v2=−1, and uv=−vu by [F10], and put τ=uv. Then τ2=−u2v2=1, and τ anticommutes with both u and v. Send each old positive or negative generator xi of Clp,q to xi⊗τ, and send the new positive and negative generators to 1⊗u and 1⊗v. The images satisfy the standard quadratic relations: the old squares are unchanged because τ2=1, the new squares are +1,−1, old pairs anticommute by [F10], and all cross anticommutators vanish because τ anticommutes with u,v. Thus every linear combination has its prescribed square, and [F2] gives a homomorphism Clp+1,q+1→Clp,q⊗Cl1,1.

1.2F1F2F4F10constructalgebra

Let r,s be the positive generators of Cl2,0. By [F10], rs=−sr; put σ=rs. Then σ2=rsrs=−r2s2=−1, and σ anticommutes with r,s. Send each negative generator yi of Cl0,n to yi⊗σ and the two new positive generators to 1⊗r,1⊗s. Each old image squares to (−1)(−1)=+1, the new images square to +1, old pairs anticommute by [F10], and the cross anticommutators vanish. Hence every linear combination has its prescribed square, and [F2] gives the homomorphism used in the second recurrence.

1.3F1F2F4F10constructalgebra

Let r,s be the two negative generators of Cl0,2≅H. By [F10], rs=−sr; put σ=rs, so σ2=rsrs=−r2s2=−1 and σ anticommutes with each. Send every positive generator xi of Cln,0 to xi⊗σ and the two new negative generators to 1⊗r,1⊗s. Old images square to −1, new images square to −1, old pairs anticommute by [F10], and cross anticommutators vanish. Thus every linear combination has its prescribed square, and [F2] gives a homomorphism Cl0,n+2→Cln,0⊗H.

1.4F6F7algebra

Since R is a field by [F6], specialize [F7] to identify Cl0,0 with R. This supplies the n=0 row of both pure-signature columns.

2.1F3F4step 1.1algebra

The map in step 1.1 is surjective: its image contains 1⊗u,1⊗v, hence 1⊗τ and the second factor; multiplying xi⊗τ by 1⊗τ recovers xi⊗1, which generates the first factor (when p+q=0, the first factor is just the scalar algebra generated by the unit). The source dimension is 2p+q+2 by [F3], equal to the target dimension 2p+q⋅4 by [F3]–[F4]. Therefore the map is an isomorphism. Substituting Cl1,1≅M2(R) from [F4] proves the first recurrence.

2.2F3F4step 1.3algebra

The images generate the two tensor factors because σ is invertible (when n=0, the first factor is only the scalar algebra), and both sides have dimension 2n+2: the source has this dimension by [F3], while the target has dimension 2n⋅4 by [F3] and [F4]. Thus the homomorphism is an isomorphism.

2.3F3F4step 1.2algebra

Using the generator-map construction in step 1.2, the images generate both tensor factors because σ is invertible (when n=0, the first factor is only the scalar algebra), so the induced homomorphism is surjective. Its source and target both have dimension 2n+2 by [F3] and [F4]; hence it is an isomorphism, and [F4] identifies the second factor with M2(R).

3.1F4F5F9step 2.3step 2.2algebra

Applying the second and third recurrences to [F4] gives Cl3,0≅Cl0,1⊗M2(R)≅M2(C), Cl4,0≅Cl0,2⊗M2(R)≅M2(H), Cl0,3≅Cl1,0⊗H≅H⊕H, and Cl0,4≅Cl2,0⊗H≅M2(H). The first two use C⊗M2(R)≅M2(C) and H⊗M2(R)≅M2(H) from [F5]; the third uses (R⊕R)⊗H≅H⊕H by [F9], and the fourth uses M2(R)⊗H≅M2(H) by [F5].

4.1F4F5F9step 2.3step 2.2step 1.4step 3.1algebra

Applying the recurrences again and the tensor identities [F5] yields Cl5,0≅(H⊕H)⊗M2(R)≅M2(H)⊕M2(H), Cl6,0≅M2(H)⊗M2(R)≅M4(H), Cl7,0≅M4(C)⊗M2(R)≅M8(C), Cl8,0≅M8(R)⊗M2(R)≅M16(R), Cl0,5≅M2(C)⊗H≅M4(C), Cl0,6≅M2(H)⊗H≅M8(R), Cl0,7≅(M2(H)⊕M2(H))⊗H≅M8(R)⊕M8(R), and Cl0,8≅M4(H)⊗H≅M16(R). The recurrences used are respectively Cln+2,0≅Cl0,n⊗M2(R) and Cl0,n+2≅Cln,0⊗H; [F9] distributes tensor products across the split factors, [F4] supplies the initial rows through n=2, and step 1.4 supplies n=0. Thus these entries give every row of the displayed pure-signature table.

5.1F5F8step 2.3step 2.2algebra∎

Iterating the second recurrence in step 2.3 and the third recurrence in step 2.2 gives Cln+8,0≅Cl0,n+6⊗M2(R)≅Cln+4,0⊗H⊗M2(R)≅Cl0,n+2⊗M2(R)⊗H⊗M2(R)≅Cln,0⊗H⊗M2(R)⊗H⊗M2(R) and Cl0,n+8≅Cln+6,0⊗H≅Cl0,n+4⊗M2(R)⊗H≅Cln+2,0⊗H⊗M2(R)⊗H≅Cl0,n⊗M2(R)⊗H⊗M2(R)⊗H. The reassociations and flips in [F8] preserve multiplication on elementary tensors, so they are algebra isomorphisms; they reorder the four extra factors as H⊗H⊗M2(R)⊗M2(R). By [F5], H⊗H≅M4(R) and then M4(R)⊗M2(R)⊗M2(R)≅M16(R). This proves both eightfold identities.

Depends on

Used by

Dependency tree · two levels

37 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