Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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-canonical, canonical and quasi-canonical Fock bases

Definition

Assume inherited AC The Axiom of Choice for the invoked quantum based/global lattice and normalized quasi-R suppliers.

Work in the conventions of The higher-level wedge-tensor Fock module and The Fock-space convention dictionary for finite type-A quantum modules: the source parameter is s, the library parameter is t=s−1, the monomial basis of the Fock module is {MA}, and ψ is the ordinary compatible bar of The tensor-product bar on the Fock module and its truncation compatibility, which is triangular and integral on the monomial basis.

The source dual-canonical family (LA) is the unique ψ-fixed family with LA=MA+∑B<As Z[s] MB, and the canonical family (TA) is the unique ψ-fixed family with TA=MA+∑B<As−1Z[s−1] MB.

Let dA,B(s) and pA,B(−s) be the transition coefficients defined by MB=∑AdA,B(s) LA,LB=∑ApA,B(−s) MA, and define the quasi-canonical family by PA:=∑BdA,B(s) MB,so thatMA=∑BpA,B(−s) PB. The families L and T are ordinary-bar fixed; P generally is not.

The reverse-factor monomials M~A use the reverse-column reading of the tableau A; the corresponding bar-fixed families L~A,T~A are defined by the same triangular conditions with respect to M~A, so that L~A is supported on B>A. Rectification is the weight-preserving combinatorial identification of the original lower ground component RevΛ with the reverse-factor lower ground component StdΛ, given by reading down columns and reverse row insertion.

The source sesquilinear form is the C-antilinear-in-the-first argument pairing with ⟨MA,ψMB⟩=δAB, and the bilinear reverse-factor form is C(M~A,ψMB)=δAB. Thus the labelled monomial Gram matrices of the two forms are the inverse ordinary-bar matrix, not the identity. Transition duality gives ⟨PA,LB⟩=δAB,C(L~A,TB)=δAB,C(T~A,LB)=δAB.

All four families are Laurent-integral bases of the finite Fock cuts and commute with the upper-cut and common-bottom-tail embeddings. On a highest constituent, the source bilinear normalization C0 and the library polarization of The upper (form-dual) global basis and the required perfectness of the integral pairing differ by an explicit weight power, proved in the global-basis comparison later in this pair; no unqualified library-upper/ordinary-bar identification is asserted.

Facts & Assumptions

Given: Assume inherited AC The Axiom of Choice for the invoked quantum suppliers. A finite cut of the Fock module with its monomial basis {MA}, the ordinary compatible bar ψ with ψMA=MA+∑B<AZ[s±1]MB, the reverse-column reading and rectification, and the two forms of the Definition.

[F1]

Fock bar and monomial basis (The tensor-product bar on the Fock module and its truncation compatibility, The column monomial basis of the higher-level Fock module, The higher-level wedge-tensor Fock module): ψ is involutive, triangular with coefficients in Z[s±1], preserves the integral monomial lattice, and commutes with the cut embeddings; the monomials form a Laurent-integral basis.

[F3]

Normalized finite quasi-R intertwiner (Existence and uniqueness of the weightwise quasi-R intertwiner, The quasi-R intertwiner determines its inverse and the coproduct factorizations): the positive-first/negative-second family is uniquely determined by Θ0=1 and Δ(u)Θ=ΘΔ‾(u), with Δ‾(u)=(xˉ⊗xˉ)Δ(uˉ), and its finite-cut evaluations are the tensor bars of [F1].

Verification

1.1F1algebra

The two triangular charts. Fix a total order refining the finite-cut Bruhat order. Construct a fixed vector with leading term MA by descending elimination on its lower support. Suppose its bar discrepancy has largest remaining term rMB; involutivity gives r+rˉ=0, since every higher discrepancy has already vanished. Write r=∑n>0rn(sn−s−n). There is a unique c+=∑n>0rnsn in sZ[s] with c+−cˉ+=r, and a unique c−=−∑n>0rns−n in s−1Z[s−1] with the same property. Adding the relevant c±MB removes this discrepancy and changes only smaller ones. Finite descending elimination constructs the two charts, with uniqueness by the same largest-coefficient argument. This explicitly retains conjugation in the fixed-vector equation c=Bψcˉ. Each chart is integral unitriangular, hence an integral basis.

1.2F1algebra

Rectification of the ground components. On a column cancel the simultaneous i,i+1 occurrences; concatenate the column words and cancel −+ pairs. In reverse tensor order this is the lower rule with ordinary column reading. Weakly increasing rows are stable: a changed entry violating the neighboring row inequality would have an equal neighboring entry giving a later surviving + or earlier surviving −, contrary to the selected extremum; if that neighboring sign is cancelled, column strictness gives its matching mate in the same intervening strip and cancels the selected sign too. Apply this matching successively across neighboring columns, including unequal heights. The only highest tableau in this closed set is ground: starting at the rightmost column, absence of unmatched minus forces consecutive bottom entries from the alphabet minimum; induct leftward using row inequalities on the overlap, while a gap above it gives an unmatched minus with no right-hand mate. Raising decreases the entry sum to its finite lower bound, so the whole closed standard set is the reverse lower ground component. For the original lower order read columns from the right and align their tops; the same argument gives the reverse-standard set. Insert its reverse-column word by bumping the smallest larger entry. Adjacent insertions differ by the Knuth moves acb↔cab for a≤b<c and bac↔bca for a<b≤c. Cancelling the three-letter signatures for each adjacent alphabet pair preserves their unmatched counts and selected sign, and the changed entry follows its bump path, so insertion commutes with crystal edges. Reverse insertion, bumping the largest smaller entry in the backward column word, reverses each successive bump path and preserves the row and column inequalities. Thus the two procedures are inverse, weight preserving, send ground to ground and identify RevΛ with StdΛ in the asserted lower charts.

1.3F1algebra

The Gram matrices. Put B=Bψ with ψMj=∑iBijMi, and write Sij=⟨Mi,Mj⟩. The normalization ⟨Mi,ψMj⟩=δij says SB=I, since the second argument is linear. Therefore S=B−1, with no transpose. Exactly the same equation holds for C(M~i,Mj), since its second argument is also linear, so its matrix is again B−1. Involutivity says BBˉ=I, hence B−1=Bˉ.

2.1F1step 1.1algebra

The quasi-canonical family and the inverse charts. Let U be the coefficient matrix of L in M, with columns labelled by vectors, and set D=U−1. The coefficient of LA in MB is DA,B=dA,B(s), while UA,B=pA,B(−s). The coefficient matrix of P is DT, whose inverse is UT. These identities prove both displayed quasi-canonical expansions with the stated index positions and show integrality. The fixed-chart equation is BψUˉ=U, where coefficient conjugation sends s to s−1.

2.2F1step 1.1step 1.2

Cuts and integrality. All four families are computed weight by weight from the same triangular equations, so they are Laurent-integral bases of each finite cut. Since the embeddings of [F1] preserve the monomial basis and the bar, they preserve these equations and hence the four families; on the highest constituent the normalized source pairing is C0 up to the explicit weight rescaling proved in the global-basis comparison.

2.3F1F3step 1.3algebra

The reverse-bar adjoint calculation. Let ω be the linear anti-automorphism Ei↦Fi, Fi↦Ei, Da↦Da; reversing products preserves the toral mixed, commutator and Serre relations. Write Hi=DiDi+1−1. The source coproduct has ΔEi=1⊗Ei+Ei⊗Hi, ΔFi=Fi⊗1+Hi−1⊗Fi. Put A=flip∘(ω⊗ω). Direct substitution gives AΔEi=Fi⊗1+Hi⊗Fi=Δ‾Fi and AΔFi=1⊗Ei+Ei⊗Hi−1=Δ‾Ei; the toral coproduct is unchanged. Hence AΔ(u)=Δ‾(ωu) and AΔ‾(u)=Δ(ωu) on the generated algebra. Applying the anti-automorphism A to Δ(u)Θ=ΘΔ‾(u) gives A(Θ)Δ‾(ωu)=Δ(ωu)A(Θ). Its degree-zero term is one and flip with E/F exchange preserves the positive-first/negative-second completion. The exact normalized uniqueness of [F3] therefore gives A(Θ)=Θ. On each ordered minuscule wedge factor the Ei,Fi matrices are mutually transpose and the Da matrices are diagonal, so transpose realizes ω. Consequently transposing the original two-factor bar and reversing factors gives the reverse-factor bar in the same tableau labelling. The same statement for successive prefixes follows from the coproduct factorization and parenthesization independence of [F1], [F3]; thus B~=BT. In raw full-tensor labels this also reads (E~i)T=Fi‾, (F~i)T=Ei‾, where the bar acts on matrix coefficients and conjugates all toral weight powers. Finally B~TB−1B=B=B−1‾, so C(ψ~x,ψy)=C(x,y)‾. This adjoint calculation uses the two ordinary tensor bars independently of charge transpose.

3.1step 2.1step 1.3algebra

The sesquilinear delta identity. By step 2.1 the coefficient matrices are U for L and DT for P, with D=U−1. Thus the pairing matrix is DT‾TB−1U=DˉB−1U. The fixed-chart equation BUˉ=U gives B−1U=Uˉ, so this product is DˉUˉ=I. This proves ⟨PA,LB⟩=δAB directly, including coefficient conjugation.

3.2step 1.1step 1.3step 2.3algebra

The reverse-factor delta identities. Let U~ and V be the coefficient matrices of L~ and T. Since BVˉ=V, their pairing matrix is U~TB−1V=U~TVˉ. Both U~−I and Vˉ−I have coefficients in sZ[s], so this matrix lies in I+sMat⁡(Z[s]). Step 2.3 makes each entry bar fixed, because the vectors being paired are fixed. The only bar-fixed polynomial in sZ[s] is zero, proving C(L~A,TB)=δAB. Replacing the positive charts by T~ and L gives a matrix in I+s−1Mat⁡(Z[s−1]) and the same bar argument, proving C(T~A,LB)=δAB.

4.1step 1.1step 1.2step 2.1step 2.2step 1.3step 3.1step 2.3step 3.2∎

Conclusion. The four families L,T,P and their reverse-factor counterparts are well-defined Laurent-integral bases of the finite Fock cuts with the stated triangular charts and delta pairings, and the reverse ground component is identified with StdΛ by rectification. All later comparisons with the library upper family use the explicit weight rescaling of the global-basis theorem, never the bare names of the families.

Depends on

Used by

Dependency tree · two levels

48 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