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

The tensor-product bar on the Fock module and its truncation compatibility

Statement

Assume inherited AC The Axiom of Choice for the invoked based/global lattice 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, with source parameter s and the ordered column-monomial basis {MA:A∈ColΛ} of The column monomial basis of the higher-level Fock module.

(1) On every finite interval the Fock module carries an ordinary compatible bar ψ, the tensor-product quasi-R bar built from the factors' own normalized bars on the finite-product based integrable modules of Tensor bars on finite products of based integrable modules. It is involutive (semilinear with s↦s−1) and independent of the parenthesization of the tensor factors.

(2) It is triangular on the monomial basis: ψMA=MA+∑B<AZ[s±1] MB in the Bruhat order of the Definition; it fixes each ordered fundamental wedge, and it preserves the integral monomial lattice ⨁AZ[s±1]MA.

(3) Both kinds of truncation commute with ψ and preserve the actual charts and bases: an upper-cut inclusion of the smaller coordinate alphabet (equivalently the inverse identification on the supported truncation), and the common-bottom-tail embedding ιk(MA)=MA⊔(k−1)l, satisfy ψιk=ιkψ and map bar-fixed/chart vectors to bar-fixed/chart vectors. Hence ψ induces a well-defined bar on the full direct limit of The column monomial basis of the higher-level Fock module, including the semi-infinite columns.

Its finite products are used only on actual finite-Cartan based fundamental factors; no universal two-sided-unbounded tensor theorem and no arbitrary integral quasi-R action claim is imported.

Facts & Assumptions

Given: Assume inherited AC The Axiom of Choice as specified above. A finite interval [k,r], its Fock module F(Λ) on that cut with ordered column monomials MA, and the reduced finite products of fundamental factors with their own normalized bars and integral lattices.

[F1]

Finite-product tensor bars (Tensor bars on finite products of based integrable modules, The bar lattice and the divided-power integral lattice of a based module, The quasi-R intertwiner determines its inverse and the coproduct factorizations, Divided-power integrality of the quasi-R action on based lattices): on finite products of based integrable modules, the quasi-R construction defines an involutive tensor bar compatible with the factors' bars, with the inverse and coproduct factorizations determined by the intertwining data, integrality on based lattices controlled by divided powers, and the stated admissible finite-product scope.

[F2]

Monomial basis and weights (The column monomial basis of the higher-level Fock module, The higher-level wedge-tensor Fock module): the ordered wedges and their tensor products form the integral monomial basis; generators act by finitely many box moves, shift weights, and the Bruhat order compares the prefix weights of tableaux.

[F3]

Conventions (The Fock-space convention dictionary for finite type-A quantum modules): bar fixes the divided generators, inverts D, and sends s↦s−1; the fundamental factors are based with their own highest-vector-normalized bars.

[F4]

Global bases and balanced triples (Balanced triples over the two charts of P1 and the globalization map, The lower global basis of Uq− and of a highest weight module): the finite-interval comparison interfaces for lower global bases and their bar-fixed lifts.

Proof

technique · direct
1.1F1F2F3construct

The bar on a finite cut. On a finite cut take the reduced finite product of the tensor factors V(Λmj) and equip each factor with its own normalized bar of [F3]. The finite-product theorem [F1] produces an involutive semilinear bar on the tensor product, compatible with the factor bars; by [F2] the basis of this module is the set of column monomials MA of the cut. This defines ψ on each finite cut.

2.1F1F2F3step 1.1algebra

Triangularity. In the actual positive-first-factor quasi-R convention, every nonconstant term raises the weight in an earlier tensor prefix and lowers the complementary suffix by the same positive root. The prefix-dominance definition therefore puts every resulting label strictly below A. The constant term is one, and each factor bar fixes its ordered minuscule wedge vector. The finite-product divided-power integrality makes every coefficient a Laurent integer, proving the displayed triangular formula.

2.2F1F4step 1.1

Involution and parenthesization independence. Both properties are inherited from the finite-product theorem [F1]: applying the tensor bar twice returns the original element because each factor bar is involutive and the quasi-R twist is inverted by the inverse factorization; reassociating the tensor factors replaces the product of quasi-R twists by its twisted product, and the intertwining relations [F1] identify the corresponding bars.

3.1step 2.1

Integral monomial lattice. Since ψMA differs from MA by integral combinations of lower monomials (step 2.1), the Z[s±1]-span of the MA is stable under ψ; the same holds for ψ−1=ψ.

3.2F1F2step 2.2

Upper cuts. Consider a larger upper coordinate interval and a tensor supported on the old alphabet. A positive operator in an earlier prefix can only replace a letter a+1 by a, never create a letter above the old upper bound. Every quasi-R term involving a new upper-boundary root therefore kills that prefix. Terms supported on old roots agree with their old-cut terms, and the fundamental bars fix the same ordered vectors. Reassociate successive prefixes using step 2.2. Thus the larger bar restricts to the old bar, rather than relying on an incorrect letter-replacement description of the factor bars.

4.1F1F2F3step 2.2step 3.2

Common lower tails. After appending k−1 to every factor, each earlier tensor prefix has every wedge occupied at k−1. Any positive-root word involving the new boundary must apply Ek−1 at some stage. Earlier positive replacements on old roots preserve that occupancy; Ek−1 either encounters no k or attempts to create a duplicate k−1, and kills each factor, hence the prefix. The entire quasi-R correction involving the new boundary is zero. The old-root toral weights of the appended tail are zero, so all surviving old-root terms and factor bars agree with the old calculation. This proves ψιk=ιkψ on finite products. Common-root string operators and integral lattices are preserved; uniqueness of balanced lifts therefore preserves the actual charts and bases. No assertion says all new generators vanish on the image.

5.1F1F2step 2.2step 3.2step 4.1

The direct limit. Every vector of the full Fock module lies in the image of some finite double cut, and every calculation in the expansion of ψ is finite and stabilizes in a cut containing the residue and the input and output supports by steps 3.1, 3.2. Hence the compatible family of bars defines a bar on the direct limit, still involutive and triangular, and it fixes each ordered fundamental wedge. No infinite series is taken.

6.1step 1.1step 2.1step 2.2step 3.1step 3.2step 4.1step 5.1∎

Conclusion. On every finite cut the Fock module has the ordinary compatible bar ψ of (1)-(2); the upper-cut and common-tail embeddings commute with it by (3), so it descends to the full bounded or semi-infinite module. All uses are confined to actual finite-Cartan based fundamental factors; neither a universal two-sided-unbounded tensor-bar theorem nor an arbitrary integral quasi-R action is asserted.

Depends on

Used by

Dependency tree · two levels

54 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