Documentation

TauCeti.RingTheory.DividedPowers.Commutation

Commuting binomial coefficients with divided powers #

Suppose that a * x = x * (a + c) in an associative algebra over ℚ, with c commuting with x. This file combines polynomial semiconjugacy with normalized powers to prove

(a choose m) x⁽ⁿ⁾ = x⁽ⁿ⁾ (a + n c choose m),
x⁽ⁿ⁾ (a choose m) = (a - n c choose m) x⁽ⁿ⁾.

These identities are the Cartan/root-vector reordering rules used in a PBW basis of the Kostant integral form. Their significance is integral: although x⁽ⁿ⁾ contains the denominator n!, moving it past a Cartan binomial coefficient introduces no new rational coefficient.

Main results #

References #

theorem TauCeti.Associative.ringChoose_mul_dividedPower {A : Type u} [Ring A] [Algebra ℚ A] [BinomialRing A] (m : ℕ) {a x c : A} (h : a * x = x * (a + c)) (hc : Commute c x) (n : ℕ) :

A generalized binomial coefficient can be moved to the right across a divided power by shifting its argument by n • c.

theorem TauCeti.Associative.dividedPower_mul_ringChoose {A : Type u} [Ring A] [Algebra ℚ A] [BinomialRing A] (m : ℕ) {a x c : A} (h : a * x = x * (a + c)) (hc : Commute c x) (n : ℕ) :

A generalized binomial coefficient can be moved to the left across a divided power by shifting its argument by -n • c.