The Galois 2-cocycle of a split algebra #
Let A be a K-algebra and L a field equipped with a K-algebra structure, and suppose we are
given descent data in the form of an L-algebra isomorphism φ : L ⊗[K] A ≃ₐ[L] Mₙ(L). This file
attaches to φ a 2-cocycle of Aut_K(L) with values in Lˣ, in the normalization of
TauCeti.TwoCocycle.
Each σ : L ≃ₐ[K] L acts on L ⊗[K] A by σ ⊗ 1 and on Mₙ(L) entrywise, and both actions are
σ-semilinear. Transporting σ ⊗ 1 along φ and undoing the entrywise action gives the
automorphism
splittingAut φ σ = φ ∘ (σ ⊗ 1) ∘ φ⁻¹ ∘ σ⁻¹
of Mₙ(L), which is L-linear. By Skolem–Noether (TauCeti.exists_unit_conj_of_algEquiv) it is
conjugation by some g_σ ∈ GL_n(L), determined up to Lˣ. The automorphisms satisfy
splittingAut φ (στ) = splittingAut φ σ ∘ σ ∘ splittingAut φ τ ∘ σ⁻¹, so g_στ and g_σ · σ(g_τ)
induce the same conjugation and differ by a unit scalar; this scalar is the cocycle:
c(σ, τ) · g_σ · σ(g_τ) = g_στ.
The construction is carried out for an arbitrary family of conjugators in
TauCeti.TwoCocycle.ofConjugators, since the cocycle depends on the conjugators and not only on
φ; TauCeti.cocycleOfSplitting is the cocycle of the conjugators chosen by
TauCeti.splittingConjugator. Only the choice of conjugators, via Skolem–Noether, needs L to be
a field: splittingAut and its lemmas are stated for a commutative semiring L, and
TauCeti.TwoCocycle.ofConjugators for a commutative ring L.
Up to coboundaries the cocycle depends on neither choice. Two families of conjugators for the same
φ differ by unit scalars, and their cocycles by the coboundary of those scalars; and two
splittings into the same Mₙ(L) differ, by Skolem–Noether, by an inner automorphism of Mₙ(L),
which transforms the conjugators of one into conjugators of the other without changing the
cocycle. Splittings into matrix algebras of different index types reduce to this case by
reindexing, which does not change the cocycle either.
Main definitions #
TauCeti.splittingAut φ σ: theL-algebra automorphismφ ∘ (σ ⊗ 1) ∘ φ⁻¹ ∘ σ⁻¹ofMₙ(L).TauCeti.splittingConjugator φ σ: a choseng_σ ∈ GL_n(L)withsplittingAut φ σequal to conjugation byg_σ.TauCeti.TwoCocycle.ofConjugators φ g hg: the2-cocycle of a familygof conjugators, the unit scalarsc(σ, τ)withc(σ, τ) · g_σ · σ(g_τ) = g_στ.TauCeti.cocycleOfSplitting φ: the cocycle of the chosen conjugators.
Main results #
TauCeti.splittingAut_mul: the twisted multiplicativity ofσ ↦ splittingAut φ σ.TauCeti.TwoCocycle.ofConjugators_toFun_eq_iff: the valuec(σ, τ)is the unique unituwithu · g_σ · σ(g_τ) = g_στ.TauCeti.cocycleOfSplitting_toFun_eq_iff: the same characterization ofcocycleOfSplitting φwith respect to the chosen conjugatorssplittingConjugator φ σ.TauCeti.TwoCocycle.cohomologous_ofConjugators: two families of conjugators for the same splitting give cohomologous cocycles.TauCeti.cohomologous_cocycleOfSplitting: two splittingsφ : L ⊗[K] A ≃ₐ[L] Mₙ(L)andφ' : L ⊗[K] A ≃ₐ[L] Mₘ(L)give cohomologous cocycles.
Implementation notes #
The sign of the cocycle is chosen with the crossed product in mind: for the crossed product
A = (L, Aut_K(L), c), split by a ⊗ x ↦ (v ↦ a · v · x) into the L-linear endomorphisms of
A as a right L-vector space with basis u_σ, the conjugators satisfy
c(σ, τ) · g_σ · σ(g_τ) = g_στ for the defining cocycle c. The connecting map of
1 → Lˣ → GL_n(L) → PGL_n(L) → 1, which reads g_σ · σ(g_τ) = δ(σ, τ) · g_στ, is the inverse
cocycle and presents the opposite algebra.
References #
- P. Gille and T. Szamuely, Central Simple Algebras and Galois Cohomology (2006), Ch. 2 and §4.4.
- J.-P. Serre, Local Fields, GTM 67 (1979), Chapter X.
The automorphism φ ∘ (σ ⊗ 1) ∘ φ⁻¹ ∘ σ⁻¹ of Mₙ(L) attached to a splitting
φ : L ⊗[K] A ≃ₐ[L] Mₙ(L) and σ : L ≃ₐ[K] L, where σ⁻¹ acts on matrices entrywise. The two
semilinear twists cancel, so it is an automorphism of L-algebras.
Equations
Instances For
The defining formula of splittingAut.
On an entrywise image σ(m), splittingAut φ σ is σ ⊗ 1 transported along φ.
Twisted multiplicativity: splittingAut φ (στ) = splittingAut φ σ ∘ σ ∘ splittingAut φ τ ∘ σ⁻¹, the cocycle condition for σ ↦ splittingAut φ σ with values in the automorphisms of
Mₙ(L).
The 2-cocycle of a family of conjugators for a splitting φ : L ⊗[K] A ≃ₐ[L] Mₙ(L):
given g_σ ∈ GL_n(L) with splittingAut φ σ equal to conjugation by g_σ for every σ, the
value c(σ, τ) is the unit scalar with c(σ, τ) · g_σ · σ(g_τ) = g_στ, characterized by
TauCeti.TwoCocycle.ofConjugators_toFun_eq_iff.
Equations
Instances For
The defining property of TwoCocycle.ofConjugators:
c(σ, τ) · g_σ · σ(g_τ) = g_στ.
Characterization of the cocycle of a conjugator family: c(σ, τ) is the unique unit u
with u · g_σ · σ(g_τ) = g_στ.
The cocycle does not depend on the choice of conjugators, up to coboundaries: two families
g and g' of conjugators for the same splitting φ differ by unit scalars b(σ), with
g'_σ = b(σ) · g_σ, and their cocycles differ by the coboundary of b⁻¹.
A chosen conjugator g_σ ∈ GL_n(L) for splittingAut φ σ, so that splittingAut φ σ is
m ↦ g_σ * m * g_σ⁻¹. It is determined by φ and σ only up to a unit scalar.
Equations
Instances For
splittingAut φ σ is conjugation by splittingConjugator φ σ. It is stated with the matrix
inverse (↑g_σ)⁻¹, the simp normal form of ↑(g_σ⁻¹) under Matrix.coe_units_inv.
The cocycle of a split algebra with chosen descent data: for a splitting
φ : L ⊗[K] A ≃ₐ[L] Mₙ(L) with n nonempty, the 2-cocycle of the conjugators
splittingConjugator φ σ, that is, the unit scalars c(σ, τ) with
c(σ, τ) · g_σ · σ(g_τ) = g_στ.
Equations
Instances For
The defining property of cocycleOfSplitting: with g_σ = splittingConjugator φ σ,
c(σ, τ) · g_σ · σ(g_τ) = g_στ.
Characterization of the cocycle of a split algebra: with g_σ = splittingConjugator φ σ,
c(σ, τ) is the unique unit u with u · g_σ · σ(g_τ) = g_στ.
The cocycle of a split algebra does not depend on the splitting, up to coboundaries: two
L-algebra isomorphisms φ : L ⊗[K] A ≃ₐ[L] Mₙ(L) and φ' : L ⊗[K] A ≃ₐ[L] Mₘ(L) give
cohomologous cocycles. The index types n and m have the same cardinality, since Mₙ(L) and
Mₘ(L) are isomorphic, so φ' is reduced to a splitting into Mₙ(L) by reindexing.