Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

The dual crystal: reversed arrows, negated weights and swapped ε/φ

Statement

Let B be the crystal of a crystal basis (L,B) of an integrable module (Crystal lattices, crystal bases and their crystals, The crystal graph, εi, φi and the weight function); its operators are the partial maps e~i,f~i:B→B∪{0} satisfying e~ib=b′ if and only if b=f~ib′, and εi,φi∈Z≥0 satisfy φi(b)−εi(b)=⟨hi,wt(b)⟩.

Define the dual crystal B∨:={b∨:b∈B} by

wt(b∨):=−wt(b),εi(b∨):=φi(b),φi(b∨):=εi(b),f~i(b∨):=(e~ib)∨,e~i(b∨):=(f~ib)∨,

with 0∨:=0. Then:

(i) B∨ satisfies the crystal axioms: (e~i,f~i) are partial inverses, the arrows of B∨ are the arrows of B with orientation reversed, the displayed εi,φi are exactly the maximal iterated powers, and (B∨)∨=B canonically;

(ii) tensor products reverse order. For crystals B1,B2 as above the map b1⊗b2↦b2∨⊗b1∨ is an isomorphism of crystals (B1⊗B2)∨→B2∨⊗B1∨ for the tensor product of The tensor product crystal B1⊗B2 and its two-case convention.

The construction is stated for crystals of crystal bases of integrable modules, where εi,φi are finite and nonnegative. For the negative-half crystal of The Kashiwara lattices L(λ) and L(∞) and their generating sets only the formal φi=εi+⟨hi,wt⟩, which may be negative, is defined, and no dual is asserted there. No choice principle is used.

Facts & Assumptions

Given: The crystal (B,wt,εi,φi,e~i,f~i) of a crystal basis (L,B) of an integrable module (Crystal lattices, crystal bases and their crystals), and in (ii) two such crystals B1,B2; the dual B∨ as defined in the Statement.

[F1]

Crystal graph invariants (The crystal graph, εi, φi and the weight function): εi(b)=max⁡{n:e~i nb≠0} and φi(b)=max⁡{n:f~i nb≠0} are finite and nonnegative on B, φi(b)=εi(b)+⟨hi,wt(b)⟩, and along an existing edge f~ib=b′ one has εi(b′)=εi(b)+1, φi(b′)=φi(b)−1, with the dual statement for e~i.

[F2]

Crystal basis axioms (Crystal lattices, crystal bases and their crystals): e~i,f~i are partial maps B→B∪{0} with f~ib=b′ if and only if b=e~ib′; the underlying module strings are finite and the Kashiwara operators of The Kashiwara operators e~i and f~i of an integrable module act as string shifts.

[F3]

The tensor product crystal and its rules (The tensor product crystal B1⊗B2 and its two-case convention), including weight additivity and the strict/non-strict comparison split.

[F4]

The ε/φ formulas (The weight, εi and φi formulas for the tensor product crystal): for B1⊗B2 the max formulas for εi,φi hold, and the branch used by f~i is exactly φi(b1)>εi(b2) versus φi(b1)≤εi(b2).

[F5]

The negative-half crystal of The Kashiwara lattices L(λ) and L(∞) and their generating sets carries only the formal quantity φi=εi+⟨hi,wt⟩, which may be negative, and no finite dual construction is asserted for it.

Proof

technique · direct
1.1F1F2

Partial inverses and reversed arrows. By definition f~i(b∨)=b′∨ holds exactly when e~ib=b′, which by the partial-inverse axiom of B holds exactly when b=f~ib′, i.e. when b∨=e~i(b′∨); hence the pair (e~i,f~i) on B∨ satisfies the partial-inverse axiom. Moreover the arrows of B∨ are those of B run backwards: an arrow b∨→b′∨ in B∨ means f~i(b∨)=b′∨, i.e. e~ib=b′, i.e. f~ib′=b, which is the arrow b′→b of B.

2.1step 1.1F1F2

The displayed εi,φi are the maximal iterated powers. By induction on n, e~i n(b∨)=(f~i nb)∨ and f~i n(b∨)=(e~i nb)∨; hence max⁡{n:e~i n(b∨)≠0}=max⁡{n:f~i nb≠0}=φi(b) and max⁡{n:f~i n(b∨)≠0}=εi(b), as displayed; the weight pairing is preserved, φi(b∨)−εi(b∨)=εi(b)−φi(b)=−⟨hi,wt(b)⟩=⟨hi,wt(b∨)⟩, and involutivity (B∨)∨=B holds because (b∨)∨:=b restores the operators, weights and string data. This proves (i).

3.1step 2.1F3F4algebra

The tensor swap preserves the operators. Extend S by S(0)=0 and put p:=φi(b1), s:=εi(b2). If p≥s, then Sf~i((b1⊗b2)∨)=S((e~ib1⊗b2)∨)=b2∨⊗f~i(b1∨); the target f~i selects its second factor because φi(b2∨)=s≤p=εi(b1∨). If p<s, then Sf~i((b1⊗b2)∨)=f~i(b2∨)⊗b1∨, and the target selects its first factor because s>p. For raising, if p>s, then Se~i((b1⊗b2)∨)=b2∨⊗e~i(b1∨) and the target selects its second factor because s<p; if p≤s, then Se~i((b1⊗b2)∨)=e~i(b2∨)⊗b1∨, and the target selects its first factor because s≥p. These formulas also hold at zero endpoints. The target weight is −wt(b1)−wt(b2), equal to the weight of the dual input; maximal string lengths are preserved because both operators are intertwined.

4.1step 3.1step 2.1F3F5given∎

Conclusion. The map S is a bijection of vertex sets by construction, and step 3.1 shows that it intertwines e~i and f~i for every i; it preserves weights by step 2.1, hence it is an isomorphism of crystals (B1⊗B2)∨→B2∨⊗B1∨, which is (ii). Because s and p range over finite nonnegative integers, the case analysis covers all vertices, including the tie p=s where both readings agree. All constructions are explicit set-theoretic operations on the vertex set B and the fixed operator maps, so no choice principle is used; the construction is stated only for crystals of integrable-module crystal bases, the negative-half case being excluded in the Statement.

Depends on

Used by

Dependency tree · two levels

18 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