Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck pass
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.

Lower and upper global bases in a small highest weight module

Example

For the rank-one highest weight module V(mω) use the divided string wn=F(n)vm, 0≤n≤m, which is the lower global basis, and the lower integral lattice MA=⨁n=0mAwn. Its normalized polarization is diagonal, B(wn,ws)=δnsdm,n,dm,n=qn(m−n)(mn)q, so the upper form-dual global basis is wnup=dm,n−1wn and the restricted integral dual is MA∨=⨁n=0mA dm,n−1wn. These two explicit A-lattices are the objects compared; no finite-index or determinant-unit property is presumed. For m=1 one has d1,0=d1,1=1 and the two bases coincide. For m=2 one has d2,0=d2,2=1 and d2,1=1+q2, so MA∨=Aw0⊕A(1+q2)−1w1⊕Aw2⊋MA, with middle quotient A/(1+q2). The Z[q]-spans of the respective bases extend to the same A0 crystal lattice, and both bases have the same three crystal residues. The upper operators are the weighted adjoints of the duality theorem: their q=0 reductions give the same finite string, while exact lower adjunction differs by the displayed norm ratios, and the upper basis is fixed by the adjoint bar rather than the ordinary lower bar.

Facts & Assumptions

[L1]

String and form recurrence: for 1≤n≤m, with EF(n)v=[m−n+1]F(n−1)v and σ(F)=q−1KE, the normalized module form satisfies dm,n=qm−2n+1[m−n+1][n] dm,n−1 with dm,0=1; distinct labels are orthogonal (Divided-power commutation and the simple Uqi(sl2) string modules, The contravariant form on an integrable highest weight module).

[L2]

Closed form: iterating the recurrence gives dm,n=qn(m−n)(mn)q (The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality).

[L3]

Upper duality: the upper basis is the inverse-Gram field dual, the dual charts are spanned by the same vectors over A0 and A∞, and the exact mixed adjunctions hold with the displayed norm ratios (Upper and lower global bases are dual and crystal compatible).

[L4]

Residues: at q=0 the coefficient rings give A0 with dm,n a unit congruent to 1, so both the lower and upper basis vectors reduce to the same crystal class; the ordinary bar acts on coefficients by q↦q−1, while the adjoint bar is the one fixing the upper basis (The upper (form-dual) global basis and the required perfectness of the integral pairing).

Proof

technique · direct
1.1L1L2

The norms. The recurrence of [L1] with base dm,0=1 gives the diagonal values; iterating it produces the closed form dm,n=qn(m−n)(mn)q of [L2], and orthogonality between distinct labels makes the Gram matrix diagonal.

1.2L3L4

Common crystal lattice and residues. Put C0=⨁nZ[q]wn and C0∨=⨁nZ[q]wnup. Since every dm,n is a unit of A0 congruent to 1 modulo q, the inclusion maps identify A0⊗Z[q]C0 and A0⊗Z[q]C0∨ with L0=⨁nA0wn=⨁nA0wnup, and the residues of wn and wnup are the same crystal class bn; the upper operators are the weighted adjoints whose q=0 reductions reproduce the same partial-inverse string, while exact adjunction carries the ratios dm,n/dm,n±1 given by the duality theorem and so the corresponding unweighted adjunction holds modulo q and generally fails exactly over Q(q).

1.3L3L4

Bars for m=2. The ordinary bar fixes w1 but sends its upper denominator to 1+q−2, so it moves w1up; the adjoint bar ψ∨ is characterized by B(ψu,ψ∨v)=B(u,v)‾ and, on the diagonal form, fixes each wnup. This is exactly the distinction between lower-bar and adjoint-bar fixedness asserted by the duality theorem, and no lower/upper basis equality is implied.

2.1L2step 1.1

The two lattices for m=2. Substituting m=2: d2,0=1, d2,1=q(21)q=q(q+q−1)=1+q2, d2,2=1. Hence MA=⨁Awn and MA∨=Aw0⊕A(1+q2)−1w1⊕Aw2, whose middle quotient (1+q2)−1A/A≅A/(1+q2) is nonzero: the map a/(1+q2)+A↦a+(1+q2)A is an isomorphism; in particular MA∨ properly contains MA and the inclusion is not an isomorphism. For m=1, d1,0=d1,1=1 and the two lattices coincide.

3.1step 1.1step 2.1step 1.2step 1.3∎

Conclusion. Steps 1.1–2.1 compute the rank-one norms, compare the two genuine A-lattices, exhibit the common crystal lattice and residues with modulo-q adjoint agreement and the stated exact weighted adjunction, and identify the correct bar. All calculations are finite and use no determinant-unit assumption.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

29 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