Theorems · Theorem · nonassociative algebras

RootPairing.GeckConstruction.lie_e_f_ne

∀ {ι : Type u_1} {R : Type u_2} {M : Type u_3} {N : Type u_4} [inst : Finite ι] [inst_1 : CommRing R]
  [inst_2 : IsDomain R] [inst_3 : CharZero R] [inst_4 : AddCommGroup M] [inst_5 : Module R M] [inst_6 : AddCommGroup N]
  [inst_7 : Module R N] {P : RootPairing ι R M N} [inst_8 : P.IsCrystallographic] {b : P.Base} [inst_9 : Fintype ι]
  {i j : ↥b.support},
  i ≠ j → ∀ [P.IsReduced] [P.IsIrreducible], ⁅RootPairing.GeckConstruction.e i, RootPairing.GeckConstruction.f j⁆ = 0

Lemma 3.5 from [Geck](Geck2017).

Defined in

Mathlib.LinearAlgebra.RootSystem.GeckConstruction.Relations

Cited by

0 results in Mathlib

Foundations

Depth 125 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

FiniteCommRingIsDomainCharZeroAddCommGroupModuleAddCommGroupModuleRootPairing.IsCrystallographicFintypeRootPairing.IsReducedRootPairing.IsIrreducible