Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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.

H is a division ring that is not commutative, hence not a field: q−1=qˉ/N(q) for q≠0, while ij=k and ji=−k

Statement

Let H be the quaternions, with the addition, the multiplication, the elements 0H and 1H, the basis elements e0=1,e1=i,e2=j,e3=k, the real embedding λ↦λ^, the conjugate xˉ and the norm N(x) of The quaternions H: real quadruples with componentwise addition and an explicit multiplication formula matching the table on 1,i,j,k. Then:

  1. (H,+,⋅,0H,1H) is a ring (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides);

  2. it is not commutative (Commutative ring): ij=k and ji=−k, and k≠−k;

  3. xxˉ=xˉx=N(x)^ for every x∈H, and N(x)>0 in R whenever x≠0H;

  4. H is a division ring (Division ring: a ring with 1≠0 in which every nonzero element is a unit): 1H≠0H and every x≠0H is a unit, with

    x−1  =  N(x)−1^ xˉ;

    consequently H∖{0H} is a group under multiplication;

  5. H is not a field (Field).

Facts & Assumptions

Given: The set H of quadruples of real numbers with the operations, distinguished elements, basis elements ep for p∈4, real embedding λ^, conjugate and norm of The quaternions H: real quadruples with componentwise addition and an explicit multiplication formula matching the table on 1,i,j,k; [x]m denotes the m-th coordinate of x∈H, for m∈4={0,1,2,3} (The natural numbers N (von Neumann)).

[L1]

R is a field: (R,+,0) is an abelian group, multiplication is associative and commutative with identity 1, multiplication distributes over addition, 0≠1, and every t≠0 has an inverse t−1 (The reals form a field, The real numbers, Field, Group and abelian group). Also 0⋅t=t⋅0=0 for every real t (Multiplication by zero: 0⋅a=0).

[L2]

R is a totally ordered field with positive cone P: exactly one of t∈P, t=0, −t∈P holds, and P is closed under addition and multiplication (The reals form a totally ordered field, Ordered field).

[L3]

In an ordered field the square of a nonzero element is positive (Squares of nonzero elements are positive).

Proof

technique · direct
1.1

The additive group. Addition on H is defined coordinatewise from addition on R, so it is associative and commutative, 0H is a two-sided identity, and (−x0,−x1,−x2,−x3) is a two-sided additive inverse of x. Hence (H,+,0H) is an abelian group and −x=(−x0,−x1,−x2,−x3).

L1L5given
1.2

Coefficient form of the product. For m,p,q∈4 let εm(p,q) be the real coefficient of the monomial xpyq in the m-th coordinate of the defining product formula, and εm(p,q)=0 when that monomial does not occur there; every such coefficient is 1, −1 or 0. Reading the four coordinates of the formula off one at a time, [xy]m=∑p<4∑q<4εm(p,q) xp yq for all x,y∈H and all m∈4, the right-hand side being a sum of sixteen real numbers.

L1L4given
1.3

The cyclic symmetry of the table. Let γ:4→4 fix 0 and send 1↦2↦3↦1, and let Γ:H→H be the coordinate permutation determined by [Γx]γ(p)=xp, that is Γ(x0,x1,x2,x3)=(x0,x3,x1,x2). Then Γ is a bijection, Γ(ep)=eγ(p), Γ fixes each λ^, and Γ(λx)=λΓ(x), all immediately from the definition of Γ.

L1given
1.4

Claim 2: from the table, ij=k=(0,0,0,1) and ji=−k=(0,0,0,−1). By [L1], 1≠0, so [L3] gives 1=12>0; the ordered-field definition in [L2] then gives −1<0, hence 1≠−1. Thus the two products differ, and multiplication on H is not commutative.

L1L2L3given
1.5

Claim 3, the norm identity. Evaluating the product formula at y=xˉ gives coordinates x0x0−x1(−x1)−x2(−x2)−x3(−x3)=N(x), then x0(−x1)+x1x0+x2(−x3)−x3(−x2)=0, then x0(−x2)+x2x0+x3(−x1)−x1(−x3)=0, then x0(−x3)+x3x0+x1(−x2)−x2(−x1)=0; so xxˉ=N(x)^. Evaluating it at x:=xˉ, y:=x gives x0x0−(−x1)x1−(−x2)x2−(−x3)x3=N(x) and, in the same way, 0 in each of the other three coordinates; so xˉx=N(x)^ as well.

L1given
1.6

Claim 3, positivity. Let x≠0H; then xp≠0 for at least one p∈4. Each xp′2 with xp′≠0 is positive, and each xp′2 with xp′=0 equals 0; a sum in which at least one summand is positive and the rest are positive or 0 is positive, since P is closed under addition and u+0=u. Hence N(x)>0, and in particular N(x)≠0.

L1L2L3
2.1

Real scalars pass through the product. For λ∈R the formula gives λ^x=xλ^=(λx0,λx1,λx2,λx3), an element we abbreviate λx; in particular λ^μ^=λμ^, 1Hx=x1H=x, and (−1)x=−x by step 1.1.

step 1.1L1given
2.2

The coefficients are the multiplication table: εm(p,q)=[epeq]m for all m,p,q∈4. Fix p and q and substitute x=ep, y=eq into step 1.2: then xp′=0 for p′≠p and yq′=0 for q′≠q, and a real product with a factor 0 is 0, so every one of the sixteen summands vanishes except the one indexed by (p,q), which equals εm(p,q)⋅1⋅1=εm(p,q).

step 1.2L1L4
2.3

Both distributive laws hold. By step 1.2 and distributivity in R, [(x+x′)y]m=∑p,qεm(p,q)(xp+xp′)yq=∑p,q(εm(p,q)xpyq+εm(p,q)xp′yq)=[xy]m+[x′y]m, the last equality being a regrouping of a finite sum of thirty-two real terms; the same computation in the second argument gives x(y+y′)=xy+xy′.

step 1.2L1L4
2.4

The nine table checks that establish eγ(p)eγ(q)=Γ(epeq) for all p,q∈{1,2,3}, read off the table of The quaternions H: real quadruples with componentwise addition and an explicit multiplication formula matching the table on 1,i,j,k: jj=−1=Γ(−1)=Γ(ii); jk=i=Γ(k)=Γ(ij); ji=−k=Γ(−j)=Γ(ik); kj=−i=Γ(−k)=Γ(ji); kk=−1=Γ(−1)=Γ(jj); ki=j=Γ(i)=Γ(jk); ij=k=Γ(j)=Γ(ki); ik=−j=Γ(−i)=Γ(kj); ii=−1=Γ(−1)=Γ(kk). The cases with p=0 or q=0 are immediate, both sides being eγ(q) or eγ(p) respectively.

step 1.3given
2.5

Claim 5: every field is a commutative ring by [L6], and the multiplication of H is not commutative by step 1.4; so H is not a field.

step 1.4L6
3.1

Real scalars pass through a triple product too: by step 1.2 and step 2.1, [(λx)y]m=∑p,qεm(p,q)(λxp)yq=λ[xy]m and likewise [x(λy)]m=λ[xy]m, so (λx)y=λ(xy)=x(λy). Taking λ=−1 gives (−x)y=−(xy)=x(−y).

step 1.2step 2.1L1L4
3.2

Reduction of associativity to the sixty-four basis triples. Applying step 1.2 twice and rearranging, [(xy)z]m=∑s,rεm(s,r)[xy]szr=∑p,q,r(∑sεm(s,r)εs(p,q))xpyqzr, and applying step 2.2 twice, [(epeq)er]m=∑sεm(s,r)[epeq]s=∑sεm(s,r)εs(p,q); hence [(xy)z]m=∑p,q,r<4xpyqzr [(epeq)er]m. The same computation with the other bracketing gives [x(yz)]m=∑p,q,r<4xpyqzr [ep(eqer)]m. Therefore, if (epeq)er=ep(eqer) holds for all p,q,r∈4, then (xy)z=x(yz) for all x,y,z∈H.

step 1.2step 2.2L1L4
3.3

Basis triples containing the index 0. Since e0=1H is a two-sided identity by step 2.1, each of (e0eq)er=eqer=e0(eqer), (epe0)er=eper=ep(e0er) and (epeq)e0=epeq=ep(eqe0) holds. So only the twenty-seven triples with p,q,r∈{1,2,3} remain.

step 2.1
3.4

The multiplication of H commutes with Γ: Γ(x)Γ(y)=Γ(xy) for all x,y. By step 1.2 and [Γx]p=xγ−1(p), [Γ(x)Γ(y)]γ(m)=∑p,qεγ(m)(γ(p),γ(q))xpyq, while [Γ(xy)]γ(m)=[xy]m=∑p,qεm(p,q)xpyq; by step 2.2 the two families of coefficients are [eγ(p)eγ(q)]γ(m) and [epeq]m=[Γ(epeq)]γ(m), which agree by step 2.4.

step 1.2step 2.2step 1.3step 2.4L1L4
4.1

Reduction of the twenty-seven triples to nine. Suppose (epeq)er=ep(eqer) for a triple (p,q,r). Applying step 3.4, (eγ(p)eγ(q))eγ(r)=Γ(epeq)Γ(er)=Γ((epeq)er) and eγ(p)(eγ(q)eγ(r))=Γ(ep)Γ(eqer)=Γ(ep(eqer)), so the identity holds for (γ(p),γ(q),γ(r)) as well. Since γ restricted to {1,2,3} is a cycle of length three, for each p∈{1,2,3} there is exactly one t∈{0,1,2} with γt(p)=1; hence every triple in {1,2,3}3 is obtained by iterating γ from a triple whose first entry is 1, and it suffices to check the nine triples (1,q,r) with q,r∈{1,2,3}.

step 2.4step 3.4
4.2

The nine remaining checks, using the table of The quaternions H: real quadruples with componentwise addition and an explicit multiplication formula matching the table on 1,i,j,k and the sign rule of step 3.1: (ii)i=(−1)i=−i and i(ii)=i(−1)=−i; (ii)j=−j and i(ij)=ik=−j; (ii)k=−k and i(ik)=i(−j)=−(ij)=−k; (ij)i=ki=j and i(ji)=i(−k)=−(ik)=j; (ij)j=kj=−i and i(jj)=i(−1)=−i; (ij)k=kk=−1 and i(jk)=ii=−1; (ik)i=(−j)i=−(ji)=k and i(ki)=ij=k; (ik)j=(−j)j=−(jj)=1 and i(kj)=i(−i)=−(ii)=1; (ik)k=(−j)k=−(jk)=−i and i(kk)=i(−1)=−i. All nine agree.

step 3.1step 2.1given
5.1

Multiplication on H is associative: by steps 3.3, 4.1 and 4.2 the identity (epeq)er=ep(eqer) holds for all sixty-four basis triples, and step 3.2 transfers it to all of H.

step 3.2step 3.3step 4.1step 4.2
6.1

Claim 1: by step 1.1 the additive structure is an abelian group; by step 5.1 and step 2.1 multiplication is associative with two-sided identity 1H, so (H,⋅,1H) is a monoid; and both distributive laws hold by step 2.3. So H is a ring.

step 1.1step 2.1step 2.3step 5.1L5
7.1

Claim 4. First 1H≠0H, because 1≠0 in R. Let x≠0H and put λ:=N(x)−1, which exists by step 1.6, and y:=λxˉ=N(x)−1^xˉ. Then xy=x(λxˉ)=λ(xxˉ)=λN(x)^=λN(x)^=1^=1H by step 3.1, step 1.5 and step 2.1, and yx=(λxˉ)x=λ(xˉx)=1H in the same way. So x is a unit of the ring H with x−1=N(x)−1^xˉ, and H is a division ring; by [L5] its units form a group, and by the description of a division ring that group is H∖{0H}.

step 2.1step 3.1step 6.1step 1.5step 1.6L1L5
8.1

Claims 1 to 5 are established: claim 1 in step 6.1, claim 2 in step 1.4, claim 3 in step 1.5 together with step 1.6, claim 4 in step 7.1 and claim 5 in step 2.5.

step 6.1step 1.4step 1.5step 1.6step 7.1step 2.5∎

Remarks

  • No notion of linearity is used, and none is available here. The reduction of associativity to basis triples is carried out entirely inside R: the product is a fixed real formula, its coefficients are named, and the two bracketings are expanded into the same shape of finite sum, whose coefficients are then recognised as the coordinates of the corresponding basis products. The only tools are the field arithmetic of R and the regrouping law for finite sums (Generalised associativity: in a monoid the product of a finite list does not depend on the bracketing, and in a commutative monoid it does not depend on the order of the factors either).

  • How the count of cases falls. Sixty-four basis triples; those in which one of the three indices is 0 collapse by the identity law, leaving twenty-seven; the cyclic symmetry i↦j↦k↦i is a bijection commuting with multiplication, and it acts on the twenty-seven triples with every orbit of size three, so nine representatives suffice. The symmetry is checked, not asserted: it rests on nine equations of the table.

  • H separates three notions this page keeps apart. It is a ring that is not commutative; it is a division ring that is not a field; and it has no zero divisors without being an integral domain, since a domain is required to be commutative (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors).

  • The inverse formula x−1=N(x)−1^xˉ is the exact analogue of zˉ/∣z∣2 for complex numbers, and the proof is the same computation; the only quaternionic subtlety is that xxˉ and xˉx have to be computed separately, which the norm-identity step above does.

Depends on

Used by

Dependency tree · two levels

57 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