Normal crystals over a root datum #
Fix a root datum P : RootDatum ι X Y with a base b, so that the simple roots are the
P.root i and the simple coroots the P.coroot i for i : b.support. A normal crystal over
(P, b) is a type B with a weight map wt : B → X, raising and lowering operators
e i, f i : B → Option B (with none playing the role of Kashiwara's 0) and natural numbers
ε i x, φ i x such that
f iande iare partial inverses:f i x = some y ↔ e i y = some x;- raising adds the simple root to the weight and lowers
ε iby one; ε i xis the length of thee i-string abovexandφ i xthat of thef i-string below it, which is encoded byε i x = 0 ↔ e i x = none,φ i x = 0 ↔ f i x = noneand the shift ofε ialonge i;φ i x - ε i x = ⟨wt x, α_i^∨⟩.
These are Kashiwara's crystal axioms together with his seminormality condition, which Joseph
and the path-model literature call normality; since ε i and φ i are natural numbers every
string is finite. Crystals of Littelmann paths and of integrable highest weight modules are of
this kind.
The structure records ε and φ as data, but TauCeti.NormalCrystal.ext shows that a normal
crystal is determined by its weight map and its raising operators: the lowering operators and the
string lengths carry no further freedom.
Main definitions #
TauCeti.NormalCrystal: a normal crystal over a root datum with a base.TauCeti.NormalCrystal.dual: the dual crystal, exchangingewithf,εwithφand negating the weight.TauCeti.NormalCrystal.eIter,TauCeti.NormalCrystal.fIter: iterated root operators.TauCeti.NormalCrystal.StrictHom: strict morphisms of normal crystals that are defined everywhere (no element is sent to0), with identities, composition and duals.TauCeti.NormalCrystal.StrictIso: strict isomorphisms of normal crystals, with inverses, composition and duals.TauCeti.NormalCrystal.transport: the transport of a normal crystal along a bijection of the underlying types, with the strict isomorphismTauCeti.NormalCrystal.transportIso.
Main results #
TauCeti.NormalCrystal.ext: a normal crystal is determined bywtande.TauCeti.NormalCrystal.e_ne_some_self,TauCeti.NormalCrystal.f_ne_some_self: no root operator fixes an element.TauCeti.NormalCrystal.isSome_eIter_iff,TauCeti.NormalCrystal.isSome_fIter_iff: the string identitiese i ^ n x ≠ 0 ↔ n ≤ ε i xandf i ^ n x ≠ 0 ↔ n ≤ φ i x, with the weight and string-length changesTauCeti.NormalCrystal.wt_of_eIter_eq_some,TauCeti.NormalCrystal.ε_of_eIter_eq_someand their lowering counterparts.TauCeti.NormalCrystal.StrictHom.ε_apply,TauCeti.NormalCrystal.StrictHom.φ_apply,TauCeti.NormalCrystal.StrictHom.f_apply: a map preserving weights and commuting with the raising operators preserves the string lengths and commutes with the lowering operators.TauCeti.NormalCrystal.StrictIso.eq_transport: the target of a strict isomorphism is the transport of its source along the underlying bijection.
References #
- M. Kashiwara, On crystal bases, CMS Conf. Proc. 16 (1995), §7.
- A. Joseph, Quantum groups and their primitive ideals, Springer (1995), §5.2.
- D. Bump and A. Schilling, Crystal bases: representations and combinatorics, World Scientific (2017), Ch. 2.
- P. Littelmann, Paths and root operators in representation theory, Ann. of Math. 142 (1995).
A normal crystal over the root datum P with base b: a weight map, partial raising and
lowering operators e i, f i indexed by the simple roots, and natural string lengths ε i,
φ i, satisfying Kashiwara's crystal axioms together with normality (ε i x and φ i x are the
lengths of the e i- and f i-strings through x). The value none of e i or f i stands
for Kashiwara's 0.
- wt : B → X
The weight map.
The raising operator attached to a simple root.
The lowering operator attached to a simple root.
The length of the raising string above an element.
The length of the lowering string below an element.
Lowering and raising are partial inverses.
- wt_of_e_eq_some {i : ↥b.support} {x y : B} : self.e i x = some y → self.wt y = self.wt x + P.root ↑i
Raising adds the simple root to the weight.
The raising string above
xis empty exactly whene i xis undefined.Raising shortens the raising string by one.
The lowering string below
xis empty exactly whenf i xis undefined.- φ_sub_ε (i : ↥b.support) (x : B) : ↑(self.φ i x) - ↑(self.ε i x) = (P.toLinearMap (self.wt x)) (P.coroot ↑i)
The difference of the string lengths is the pairing of the weight with the coroot.
Instances For
Lowering subtracts the simple root from the weight.
No raising operator fixes an element, since it changes the weight by a simple root.
No lowering operator fixes an element.
Lowering lengthens the raising string by one.
Raising lengthens the lowering string by one.
Lowering shortens the lowering string by one.
A map commuting with the raising operators preserves the lengths of raising strings.
A map commuting with the raising operators preserves the lengths of lowering strings at every point where it preserves the weight.
A map commuting with the raising operators commutes with the lowering operators at every point where it preserves the weight.
A normal crystal is determined by its weight map and its raising operators.
The dual crystal #
The dual crystal: the same underlying type with the raising and lowering operators and the two string lengths exchanged and the weight negated.
Instances For
Strings #
The n-fold raising operator e i ^ n, as a partial map.
Instances For
The n-fold lowering operator f i ^ n, as a partial map.
Instances For
Raising n times adds n copies of the simple root to the weight.
Raising n times shortens the raising string by n.
String identity for raising: e i ^ n x is defined exactly when n ≤ ε i x.
Lowering n times subtracts n copies of the simple root from the weight.
Lowering n times shortens the lowering string by n.
String identity for lowering: f i ^ n x is defined exactly when n ≤ φ i x.
The iterated root operators are partial inverses of each other.
Lowering n times lengthens the raising string by n.
Raising n times lengthens the lowering string by n.
Strict morphisms #
A strict morphism of normal crystals: a map of the underlying types preserving weights and
commuting with the raising operators. It then also preserves the string lengths and commutes with
the lowering operators (TauCeti.NormalCrystal.StrictHom.ε_apply,
TauCeti.NormalCrystal.StrictHom.φ_apply, TauCeti.NormalCrystal.StrictHom.f_apply).
This is a total map B → B'. Kashiwara's strict morphisms are maps B ⊔ {0} → B' ⊔ {0} fixing 0,
which may also send elements, even whole connected components, to 0; StrictHom is the case in
which no element is sent to 0. For isomorphisms (TauCeti.NormalCrystal.StrictIso) the two
conventions agree.
- toFun : B → B'
The underlying map.
A strict morphism preserves weights.
A strict morphism commutes with the raising operators.
Instances For
A strict morphism preserves the string lengths ε i.
A strict morphism preserves the string lengths φ i.
A strict morphism commutes with the lowering operators.
The identity strict morphism.
Instances For
Composition of strict morphisms.
Instances For
A strict morphism is also a strict morphism between the dual crystals.
Instances For
Strict isomorphisms and transport #
A strict isomorphism of normal crystals: a bijection of the underlying types preserving
weights and commuting with the raising operators. Its inverse is again a strict isomorphism
(TauCeti.NormalCrystal.StrictIso.symm).
- toFun : B → B'
- invFun : B' → B
- left_inv : Function.LeftInverse self.invFun self.toFun
- right_inv : Function.RightInverse self.invFun self.toFun
A strict isomorphism preserves weights.
A strict isomorphism commutes with the raising operators.
Instances For
The strict morphism underlying a strict isomorphism.
Instances For
The identity strict isomorphism.
Instances For
The inverse of a strict isomorphism.
Instances For
Composition of strict isomorphisms.
Instances For
A bijective strict morphism is a strict isomorphism.
Instances For
A strict isomorphism is also a strict isomorphism between the dual crystals.
Instances For
The transport of a normal crystal along a bijection σ : B ≃ B': the normal crystal on
B' for which σ is a strict isomorphism (TauCeti.NormalCrystal.transportIso).
Instances For
The bijection σ as a strict isomorphism onto the transported crystal.
Instances For
Uniqueness of transport: the target of a strict isomorphism is the transport of its source along the underlying bijection.