A nonsemisimple generator on an irreducible rank-two module
ProvedQAlgorithms.Papers.Independent.Intake100.P65.nonSemisimpleXExampleLet be an algebraically closed field with invertible, and let be admissible with , , and for all . For each of the two root lists and , the corresponding has an irreducible representation on with
Moreover and . Thus a generator need not act semisimply on a simple module.
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P65
noncomputable section
open scoped BigOperators TensorProduct
open QAlgorithms.Papers.Independent.Renew46.P16
open QAlgorithms.Papers.Independent.Support21.P08 (IrreducibleRepresentation)
open QAlgorithms.Papers.Independent.Support21.P12
open QAlgorithms.Papers.Independent.Support21.P14 (BrauerPairing oddPairingCount)
namespace QAlgorithms.Papers.Independent.Intake100.P65
universe u v
/-- Remark 3.3, PDF pp.14--15. The explicit recurrence and matrices give an
irreducible module for both stated root lists, with a nonzero square-zero
X_1-1/4. The two ranks are bound together, rather than selecting one case. -/
theorem nonSemisimpleXExample (R : Type u) [Field R] [IsAlgClosed R]
[Invertible (2 : R)] (omega : ℕ → R)
(hzero : omega 0 = 1) (hone : omega 1 = 0)
(hrec : ∀ a, omega (a+2) = (1/2 : R) * omega (a+1) - (1/16 : R) * omega a)
(ha : OmegaAdmissible omega) :
∀ r : ℕ, r = 2 ∨ r = 3 →
let roots : Fin r → R := fun i => if i.val < 2 then 1/4 else -1/2
let x : Matrix (Fin 2) (Fin 2) R := !![0, 1/4; -1/4, 1/2]
∃ rho : Cyclotomic R omega .degenerate r roots 2 →ₐ[R]
Module.End R (Fin 2 → R),
IrreducibleRepresentation rho ∧
rho (ce R omega .degenerate r roots 2 0) = Matrix.toLin' !![1,0;0,0] ∧
rho (cg R omega .degenerate r roots 2 0) = Matrix.toLin' !![1,0;0,-1] ∧
rho (cy R omega .degenerate r roots 2) = Matrix.toLin' x ∧
rho (toCycl R omega .degenerate r roots 2 (affineX R omega 2 1)) =
Matrix.toLin' (-x) ∧
x - (1/4 : R) • (1 : Matrix (Fin 2) (Fin 2) R) ≠ 0 ∧
(x - (1/4 : R) • (1 : Matrix (Fin 2) (Fin 2) R))^2 = 0 := by sorry
end QAlgorithms.Papers.Independent.Intake100.P65
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be an algebraically closed field equipped with an inverse of , and let satisfy
as well as
For every nonnegative integer such that or , define for and otherwise, for , and set
Let be the quotient of the free associative unital -algebra on by
Then there exists an -algebra homomorphism whose representation space contains a nonzero vector and whose only subspaces invariant under every , , are and , such that, viewing the following matrices as operators on column vectors,
The conclusion also includes
The roots are indexed with repetition: for both are , and for the third is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.