Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Highest weight elements, lowering-generated sets and highest weight crystals

Definition

Let B be a crystal, meaning the data (B,wt,εi,φi,e~i,f~i) attached to a crystal basis or to a tensor product of such data (The crystal graph, εi, φi and the weight function, The tensor product crystal B1⊗B2 and its two-case convention).

A vertex b∈B is a highest weight element (a highest vertex, a maximal vector) of weight λ∈P if wt(b)=λ and e~ib=0 for every i∈I. The lowering-generated set of b is

F(b):={f~i1⋯f~irb: r≥0, i1,…,ir∈I}∖{0},

the set of all nonzero iterated lowering images of b; it contains b and is closed under nonzero images of every f~i. It need not be closed under raising: at the bottom b of a two-vertex rank-one string, F(b)={b} while e~ib is the top vertex. The connected component C(b) of b is the smallest subset of B containing b and closed under nonzero images of e~i and f~i for all i; by the partial-inverse axiom this is the connected component of the underlying coloured graph.

B is a highest weight crystal of highest weight λ if B has a highest weight element b of weight λ and B=F(b).

The definition deliberately separates two conditions. Always F(b)⊆C(b), and a highest vertex need not generate B: in a tensor product B1⊗B2 a vertex with εi(b1)=0 and εi(b2)≤φi(b1) for all i is highest while B1⊗B2 is in general larger than its lowering-generated set (the companion page computes both cases). Conversely, for abstract crystals the two conditions do not determine B up to isomorphism: the source literature records that not every connected crystal with a highest weight element of weight λ is isomorphic to B(λ). In this library crystals come from crystal bases of modules, and uniqueness for those is a theorem proved later on this page, not a consequence of this definition.

For the canonical objects, B(λ)=B(λ) denotes the crystal of the simple highest weight module V(λ)=L(λ) (The Kashiwara lattices L(λ) and L(∞) and their generating sets) and P+ the dominant integral labels (Kac moody integral and dominant integral weights); that B(λ) is a highest weight crystal of highest weight λ is the next theorem. The operators e~i,f~i used throughout are those of The Kashiwara operators e~i and f~i of an integrable module. No choice principle is used.

Depends on

Used by

Dependency tree · two levels

17 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources