Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

The basic representation global basis is unitriangular in the partition basis

Statement

There is an explicit semi-infinite wedge bar ψ with the vacuum fixed, coefficient bar q↦q−1 and Uq/bar compatibility, whose restriction to M=V(Λ0) is the normalized highest module bar. On all partitions its integral triangular correction is

G(λ)=∣λ⟩+∑μ strictly dominated by λdμ,λ(q)∣μ⟩,dμ,λ∈qZ[q],

with diagonal 1 and same e-core support; the family {G(λ)} is an A-basis of FA and an A0-basis of F0, with the actual infinity chart and balanced Z-intersection. Exactly the e-regular G(λ) form the lower global basis of M, identified by the two lower-global-basis suppliers. The ambient basis is not automatically compatible with the other field irreducible summands. The transpose equality dλ,μ=dμ′,λ′ is false in general; the source symmetry concerns the bar matrix, not D. Ambient natural-form dual coefficients use (D−1)T, and basic upper coefficients require the restricted Gram inverse and need not be Laurent polynomials.

Facts & Assumptions

Given: The Fock space with its partition basis, the wedge bar, the dominance order, and the lower global basis of the highest weight module M.

[F1]

The finite quotient is presented by the complete local straightening relations, including equal and distinct residues, and its normal words form a basis (The finite q-wedge space and the normal-ordering relations, Normally ordered q-wedges form a basis for every finite wedge length). The normalized reversal bar and its relation preservation are proved in step 1.1, not supplied by these citations.

[F2]

Finite straightening preserves the total index sum, keeps indices between their input extremes, and has normal words with strictly decreasing indices (The finite q-wedge space and the normal-ordering relations, Normally ordered q-wedges form a basis for every finite wedge length). The truncation-independence argument is supplied locally in step 2.2.

[F4]

Dominance and conjugation are the published prefix-sum order and the transpose map; the abacus description of e-cores and the residue-count implication are proved in step 3.1 (Dominance order on partitions, Partitions, English diagrams, and conjugation, The regular-partition label convention and the Mullineux crystal involution).

Proof

technique · solve the triangular bar equations degree by degree, prove prefix independence, then identify the regular part with the module lower basis and compare the two matrix symmetries
1.1F1givenalgebra

The normalized finite reversal bar. For a length-r tuple I, put t(I) equal to its number of unequal-residue pairs and define ψr(uI)=(−1)r(r−1)/2qt(I)ureverse⁡I, extended by q↦q−1. This descends through the finite straightening relations: an equal-residue swap relation reverses to itself, whereas every distinct-residue two-factor relation reverses, after coefficient bar, to q times that relation. For the recursive relation its four terms are ul∧um+q−1um∧ul+um−b∧ul+b+q−1ul+b∧um−b; reversal and coefficient bar give precisely q times these same four terms. All terms preserve the residue multiset, so the global factor qt(I) is identical on the terms of a relation in a longer word. Thus the relation ideal is preserved. Applying reversal twice cancels the barred scalar and gives ψr2=1. For the finite action the residue-count difference under a lowering move is t(I+)−t(I)=ni−ni+1−1, and under its raising reverse it is −(ni−ni+1)−1; substituting these identities into the fixed prefix coproduct converts its coefficient bar to the reversed suffix coproduct. Hence ψr intertwines the generator bar, and its toral compatibility follows from weight preservation. These are finite computations in the relations of [F1].

2.1step 1.1F1F4algebra

Integral dominance triangularity. Straighten the reversed tuple of a normal wedge. The leading swap scalars cancel (−1)r(r−1)/2qt(I), leaving the original wedge with coefficient 1. Every other branch replaces an unequal pair by strictly more balanced interior indices with the same sum and residues. The sorted prefix sums therefore strictly decrease, so the corresponding partition is strictly dominated by the original one. All coefficients are Laurent integral and residues are preserved. Consequently on a finite degree the matrix of ψ is dominance-unitriangular over Z[q,q−1]. This conclusion is obtained from the finite relations, rather than assumed for the bar-correction equations.

2.2step 1.1F1F2algebra

Prefix independence. Take a charge-zero prefix of length m with m>∣λ∣ and append u−m. In straightening this new minimum past the reversed prefix, a secondary correction replaces it and another index by indices strictly greater than −m. No later branch recreates −m, since balancing and swapping stay inside the current extremes. Such a branch would have m+1 distinct indices at least −m+1, whose minimum total is the ground sum −m(m+1)/2 plus m+1. The actual preserved total is −m(m+1)/2+∣λ∣, which is smaller, so every secondary branch is zero. Only the leading factor (−1)mq−a remains, where a counts the prefix indices with residue different from −m; it cancels the change in the reversal normalization. This proves prefix independence on every finite partition combination. The coefficient calculation in step 1.1 gives compatibility with stabilized Fi. For each Ei, choose a sufficiently deep cutoff with −m≢i; its boundary scalar is then 1, so the same finite calculation gives compatibility with Ei. Prefix independence makes this compatible with every other cutoff. Weight preservation gives the toral bar identity, and the vacuum-fixed bar therefore restricts on M to the normalized highest-module bar.

3.1step 1.1step 2.1F4algebra

The positive-q correction. Proceed down a finite dominance refinement and suppose the already constructed lower vectors G(μ) are bar-fixed. The residual in ψ(∣λ⟩)−∣λ⟩, after prior corrections, is ∑μrμ(q)G(μ). Since ψ2=1, each coefficient satisfies rμ+rμ‾=0. Writing a finite antisymmetric Laurent polynomial as r=∑k>0ak(qk−q−k) gives the unique c=∑k>0akqk∈qZ[q] with c−cˉ=r. Adding cG(μ) therefore kills that residual. Induction constructs the unique bar-fixed G(λ) with leading standard vector and remainder in qZ[q] on strictly dominated shapes. For completeness define the abacus of λ as Sλ={λr−r+1:r≥1}. Runner i consists of the indices congruent to i; its charge κi is the number of occupied positive indices minus the number of missing nonpositive indices on that runner. Adding a residue-k cell moves an occupied index from k to k+1, so induction from the vacuum gives κi=mi−1−mi. Packing each runner downward fills it up to its uniquely determined top index j−e+eκi, where 1≤j≤e represents i. An elementary downward bead move by e to an empty position deletes a boundary rim strip of e cells (the boundary path between those positions has length e); conversely every removable rim strip gives this bead move. Thus the packed abacus is the usual e-core and is uniquely determined by the charges. Since all corrections preserve the occupied residue multiset at a common cutoff, they preserve these charges and hence the core. At each degree the triangular correction matrix and its inverse are integral polynomial matrices.

4.1step 1.1step 2.2step 3.1F3algebra

Ambient charts and identification of the basic lower basis. On each finite label component, step 3.1 gives a unitriangular matrix D over Z[q] with inverse over the same ring. Hence the G(λ) form bases of FA over A and of F0 over A0. Since they are bar fixed, they also form an A∞-basis of ψ(F0), where A∞=A0‾. Expressing a vector in this common basis shows FA∩F0∩ψ(F0)=⨁λZG(λ): its coefficients are integral Laurent polynomials regular at zero and infinity, hence integers. In particular the only bar-fixed element of FA∩qF0 is zero. On M, the divided-node lattice maps into FA by [F3], and its canonical lower lattice maps into F0 because its Kashiwara lowering words start at the vacuum and the ambient normalized operators preserve F0. Its lower global lift of the regular residue λ therefore has image H∈FA∩F0, with ψH=H and H≡∣λ⟩(modqF0). The ambient G(λ) has these same properties, so their difference is a bar-fixed element of FA∩qF0 and is zero. This proves that precisely the regular G's form the lower global basis of M; the other ambient G's are excluded by field independence. No integral saturation or compatibility with other irreducible summands is assumed.

5.1step 1.1step 4.1F4algebra

The false transpose symmetry. The equality dλ,μ=dμ′,λ′ fails at e=2 and degree 4: the recursion gives d(2,1,1),(4)=q while d(1,1,1,1),(3,1)=0, since (2,1,1)′=(3,1) and 4′=(1,1,1,1); the source symmetry statement concerns the bar transition matrix, not the lower matrix D. Ambient natural-form dual coefficients use (D−1)T, and basic upper coefficients need the restricted Gram inverse, which may have rational entries.

6.1step 1.1step 2.2step 4.1step 5.1∎

Conclusion. The explicit wedge bar is involutive, prefix-independent and integral; the global basis G(λ) is dominance-unitriangular with qZ[q] off-diagonal coefficients and same-core support, the A-and A0-bases and the balanced intersection are as displayed, exactly the regular family is the lower global basis of M=V(Λ0), and the naive transpose symmetry of D is false while the correct inverse/Gram rules hold.

Depends on

Used by

Dependency tree · two levels

39 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