Cluster k1145
Taylor-Wiles obstruction bound and epsilon-eta matrices
A patching cluster. A TaylorWilesObstructionBound claim bounds the number of obstructions for deformations in terms of dual cohomology, assuming a cohomology claim CohP. Files compute with matrices made from epsilon and eta parts over a ring of the form X plus nilpotent pieces, show finite modules have the expected size, state a representation identity rho1, a twisted cocycle formula, and bound kernel sizes. Many helper files are counting lemmas. The role is arithmetic bookkeeping for the choice of auxiliary primes.
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
Dual numbers: a number with a tiny part that squares to zeroGroup homology: measuring how a group acts on a vector spaceGroups as matrices: representations and charactersTopology: open sets, closed sets, compact and connected setsFinite sets and countingFinitely generated abelian groups
References
Darmon, Diamond and Taylor, Fermat's Last Theorem · sect. 3Background reading suggested by the AI namer · unchecked
Uses
Used by
67 Lean files, main folder Development.AutomorphicArithmetic.AutomorphicVarieties.PatchingModules.DegreeCountCohomology.