Documentation

LeanPool.CompositionAlgebrasOverRings.Conic.CayleyDicksonConverse

The converse halves of GPR 18.14 and GPR 18.15 #

Conic/CayleyDicksonAssociative.lean proves the directions of GPR 18.14(a),(b) that build algebras — if B is commutative with trivial conjugation then Cay(B, μ) is commutative, and if B is commutative associative with involutive conjugation then Cay(B, μ) is associative — and records two explicit failure witnesses. Conic/CayleyDicksonAlternative.lean proves both directions of GPR 18.14(c).

This file supplies the remaining implications, so that GPR 18.14(a) and GPR 18.14(b) become equivalences, and then discharges their conjugation hypotheses over a projective module to obtain GPR 18.15.

Method #

Nothing here needs the associator formulas of GPR 18.13. Each converse is read off from a single well-chosen instance, exactly as in GPR 18.14(c):

Main results #

References #

theorem ConicAlgebra.Cay.fst_mul_of_snd_eq_zero {k : Type u} {B : Type v} [CommRing k] [NonAssocRing B] [Module k B] (C : ConicAlgebra k B) (μ : k) {x y : C.Cay μ} (hy : y.2 = 0) :
(x * y).1 = x.1 * y.1

On elements with zero j-part the product of the double is the product of B: the μ-term of the first component needs a nonzero j-part.

theorem ConicAlgebra.Cay.snd_mul_of_snd_eq_zero {k : Type u} {B : Type v} [CommRing k] [NonAssocRing B] [Module k B] (C : ConicAlgebra k B) (μ : k) {x y : C.Cay μ} (hx : x.2 = 0) (hy : y.2 = 0) :
(x * y).2 = 0

Elements with zero j-part are closed under multiplication.

theorem ConicAlgebra.mul_comm_of_mul_comm_cay {k : Type u} {B : Type v} [CommRing k] [NonAssocRing B] [Module k B] (C : ConicAlgebra k B) (μ : k) (h : ∀ (x y : C.Cay μ), x * y = y * x) (a b : B) :
a * b = b * a

GPR 18.14(a), ⇒, first half. A commutative double forces B commutative, since B sits inside it as the elements with zero j-part.

theorem ConicAlgebra.conj_eq_id_of_mul_comm_cay {k : Type u} {B : Type v} [CommRing k] [NonAssocRing B] [Module k B] (C : ConicAlgebra k B) (μ : k) (h : ∀ (x y : C.Cay μ), x * y = y * x) (u : B) :
C.conj u = u

GPR 18.14(a), ⇒, second half. A commutative double forces the conjugation of B to be the identity. This is the contrapositive of ConicAlgebra.exists_mul_ne_mul_cay.

theorem ConicAlgebra.mul_assoc_of_mul_assoc_cay {k : Type u} {B : Type v} [CommRing k] [NonAssocRing B] [Module k B] (C : ConicAlgebra k B) (μ : k) (h : ∀ (x y z : C.Cay μ), x * y * z = x * (y * z)) (a b c : B) :
a * b * c = a * (b * c)

GPR 18.14(b), ⇒, first half. An associative double forces B associative, by the same embedding. No hypothesis on μ.

theorem ConicAlgebra.isAlternative_cay_of_mul_assoc_cay {k : Type u} {B : Type v} [CommRing k] [NonAssocRing B] [Module k B] (C : ConicAlgebra k B) (μ : k) (h : ∀ (x y z : C.Cay μ), x * y * z = x * (y * z)) :

An associative double is alternative.

theorem ConicAlgebra.isMultiplicative_of_isMultiplicative_cay {k : Type u} {B : Type v} [CommRing k] [NonAssocRing B] [Module k B] [instSMulComm : SMulCommClass k B B] [instTower : IsScalarTower k B B] (C : ConicAlgebra k B) (μ : k) (h : (C.cay μ).IsMultiplicative) :

The converse of the multiplicativity criterion. If the norm of Cay(B, μ) permits composition then so does the norm of B, for every μ.

Same embedding: n_{Cay}(u, 0) = n_B(u) - μ·n_B(0) = n_B(u), and (u, 0)(v, 0) = (uv, 0).

⚠ This is the converse implication, not the sharp criterion. GPR Exc. 18.18 says that for B multiplicative, Cay(B, μ) is multiplicative if and only if μ[B, B, B] ⊆ Rad(Dn_B); that characterization needs the associator formulas of GPR 18.13 and is not proved here. The forward implication proved elsewhere (ConicAlgebra.isMultiplicative_cay) is the case [B, B, B] = 0.

theorem ConicAlgebra.conjIsInvolution_of_mul_assoc_cay {k : Type u} {B : Type v} [CommRing k] [NonAssocRing B] [Module k B] [instSMulComm : SMulCommClass k B B] [instTower : IsScalarTower k B B] (C : ConicAlgebra k B) (μ : k) (h : ∀ (x y z : C.Cay μ), x * y * z = x * (y * z)) :

GPR 18.14(b), ⇒, second half. An associative double is alternative, so ConicAlgebra.conjIsInvolution_of_isAlternative_cay applies.

theorem ConicAlgebra.mul_comm_of_mul_assoc_cay {k : Type u} {B : Type v} [CommRing k] [NonAssocRing B] [Module k B] [instSMulComm : SMulCommClass k B B] [instTower : IsScalarTower k B B] (C : ConicAlgebra k B) (μ : k) (h : ∀ (x y z : C.Cay μ), x * y * z = x * (y * z)) (a c : B) :
a * c = c * a

GPR 18.14(b), ⇒, third half. An associative double forces B commutative.

This is the one implication that is not an embedding argument. It is the contrapositive of ConicAlgebra.exists_mul_mul_ne_mul_mul_cay, whose hypothesis that the conjugation of B be an involution is supplied by ConicAlgebra.conjIsInvolution_of_mul_assoc_cay.

theorem ConicAlgebra.mul_comm_cay_iff {k : Type u} {B : Type v} [CommRing k] [CommRing B] [Algebra k B] (C : ConicAlgebra k B) (μ : k) :
(∀ (x y : C.Cay μ), x * y = y * x) ↔ ∀ (u : B), C.conj u = u

GPR 18.14(a). For B commutative, the double Cay(B, μ) is commutative exactly when the conjugation of B is the identity — for every scalar μ.

theorem ConicAlgebra.mul_assoc_cay_iff {k : Type u} {B : Type v} [CommRing k] [CommRing B] [Algebra k B] (C : ConicAlgebra k B) (μ : k) :
(∀ (x y z : C.Cay μ), x * y * z = x * (y * z)) ↔ C.ConjIsInvolution

GPR 18.14(b). For B commutative, the double Cay(B, μ) is associative exactly when the conjugation of B is an involution — for every scalar μ.

GPR 18.15: discharging the hypothesis on the conjugation #

Over a finitely generated projective module the conjugation of an alternative conic algebra is automatically an involution (GPR 16.14(b), ConicAlgebra.conjIsInvolution_of_projective). Since an associative B is alternative, that removes the conjugation hypothesis from both criteria and leaves conditions on the multiplication of B alone.

theorem ConicAlgebra.isAlternative_cay_iff_of_projective {k : Type u} {B : Type v} [CommRing k] [NonAssocRing B] [Module k B] [SMulCommClass k B B] [IsScalarTower k B B] [Module.Finite k B] [Module.Projective k B] (C : ConicAlgebra k B) (μ : k) :
IsAlternative (C.Cay μ) ↔ ∀ (a b c : B), a * b * c = a * (b * c)

GPR 18.15(b). For B finitely generated projective, Cay(B, μ) is alternative exactly when B is associative.

theorem ConicAlgebra.mul_assoc_cay_of_projective {k : Type u} {B : Type v} [CommRing k] [CommRing B] [Algebra k B] [Module.Finite k B] [Module.Projective k B] (C : ConicAlgebra k B) (μ : k) (x y z : C.Cay μ) :
x * y * z = x * (y * z)

GPR 18.15(a). For B a finitely generated projective commutative algebra, Cay(B, μ) is associative — unconditionally, the conjugation hypothesis of GPR 18.14(b) being automatic.