Cluster k1103
Determinant laws over algebras: tensor products, split algebras
A determinant law is a way to package the characteristic polynomial and determinant of a representation without choosing a basis. The files build such determinants over an algebra, show a determinant is fixed by its values on a spanning set, lift idempotents (projection-like elements) over complete rings, and prove that a determinant kills an element exactly when a tensor condition holds. Also present are "split algebras" where a polynomial is forced to have all its roots, and matrices built through tensor products. The role is foundational algebra for studying Galois representations with unusual residual behaviour.
5 import steps from the main theorem.
Proof status: on 21 Nov 2026 the Lean FRO and the Mathlib Initiative certified the Lean statement and proof (latest check). Names and descriptions on this map are written by Claude from samples of the code and may be wrong.
Prerequisite concepts
PolynomialsTensor products of rings and algebrasLinear algebraSymmetric polynomials and elementary symmetric functionsRings, fields and algebrasAdic completion: approximating by ever higher powers of an idealLocal rings and residue fields: one big ideal of small elements
References
Bellaïche and Chenevier, Families of Galois Representations and Selmer Groups · ch. 1Background reading suggested by the AI namer · unchecked
Uses
Used by
45 Lean files, main folder Development.AutomorphicArithmetic.AutomorphicVarieties.CommutativeAlgebraHeight.