weak_sl2_action
Given a finite partially ordered type α with decidable equality, an integer-valued function rank : α → ℤ, and linear endomorphisms E, F, H : Module.End ℂ (α → ℂ), the predicate weak_sl2_action asserts that E * F - F * E = H, H * E - E * H = 2 • E, H * F - F * H = -2 • F, for every x : α we have H (Pi.single x 1) = (rank x : ℂ) • Pi.single x 1, and for all x y : α, if (E (Pi.single x 1)) y ≠ 0 then x ⋖ y.
Statement
def weak_sl2_action {α : Type*} [Fintype α] [DecidableEq α] [PartialOrder α] (rank : α → ℤ) (E F H : Module.End ℂ (α → ℂ)) : Prop
- Defined in
- arXiv:2610.24148, Section 2.5.3
- Verified
- 21 Oct 2026
- Axioms
- none listed
- Used by 1
- weak_sl2_hall_conditionLet α be a finite partially ordered type with decidable equality and an integer rank function rank : α → ℤ. If rank makes α a ranked poset…
Read back from the Lean
Given a finite type α with decidable equality and a partial order ≤, a function rank : α → ℤ, and complex linear endomorphisms E, F, H on the space of complex-valued functions α → ℂ, weak_sl2_action rank E F H is the proposition that all of the following hold:
1. E ∘ F - F ∘ E = H (the commutator of E and F is H),
2. H ∘ E - E ∘ H = 2 • E (the commutator of H and E is 2 • E),
3. H ∘ F - F ∘ H = -2 • F (the commutator of H and F is -2 • F),
4. For every x : α, H applied to the standard basis vector δ_x (the function Pi.single x 1) equals the scalar multiple (rank x : ℂ) • δ_x,
5. For all x y : α, if the value of E(δ_x) at y is non-zero, then y covers x in the partial order (x ⋖ y, i.e., x < y and no element lies strictly between them).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A weak sl_2-action on a ranked poset with integer rank function. -/ def weak_sl2_action {α : Type*} [Fintype α] [DecidableEq α] [PartialOrder α] (rank : α → ℤ) (E F H : Module.End ℂ (α → ℂ)) : Prop := E * F - F * E = H ∧ H * E - E * H = 2 • E ∧ H * F - F * H = -2 • F ∧ (∀ x : α, H (Pi.single x (1 : ℂ)) = (rank x : ℂ) • Pi.single x (1 : ℂ)) ∧ (∀ x y : α, (E (Pi.single x (1 : ℂ))) y ≠ 0 → x ⋖ y)