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.

Tensor bars on finite products of based integrable modules

Statement

For any finite sequence of based integrable modules in the finite-weight-space category Oint, the field tensor bar Ψ=Θ(composite factor bars), built from the normalized intertwiner Θ of Existence and uniqueness of the weightwise quasi-R intertwiner, is well defined, semilinear, U- and bar-compatible, involutive and independent of all parenthesizations; all root-height sums are vectorwise finite.

For arbitrary four-axiom based integrable factors in finite Cartan type, the same field assertion and integral lattice preservation hold without multiplicity or global weight bounds, by the finite-action and universal integral-coefficient clauses of Divided-power integrality of the quasi-R action on based lattices. Their actual bar is weight-transfer triangular with diagonal 1. Finite action and integrality do not imply finite supported normalized global lifts: the periodic rank-one construction of Periodic cyclotomic tensor corrections escape every finite cut refutes that additional unrestricted assertion and the natural integral balanced tensor triple.

The full based and globalization assertion holds for bounded Oint pairs with independently established integral action (in particular for finite Cartan type), and for the supported construction cases of the supplier: highest-first or first Chigh with arbitrary based second; arbitrary based first with lowest or Clow second; finite highest products and exact based subquotients and weight-admissible direct sums of their tensor constructions; and ordered highest-prefix, based-middle, lowest-suffix products with their explicit support bounds. This includes the full finite-dimensional tensor product, with every constituent, in finite Cartan type. For any further class, the globalization assertion requires independently proved integral action and finite raw-basis correction closure in the strict weight-transfer order.

In these supported cases the actual tensor global vectors are uniquely corrected bar-fixed lifts of the raw tensor residue vectors, with corrections in qZ[q]; the transition and its inverse have finite columns, the corrected vectors form an A-basis, and the integral tensor triple is balanced. The q=0 tensor crystal lattice is supplied separately by The crystal basis of a tensor product and the two-case operator rule, and its actual infinity chart is Ψ(L0tensor). Exact based integral bar-compatible subquotient maps preserve corrected global bases by balanced uniqueness, within these supported constructions. Raw tensor lower vectors need not be bar fixed. The affine boundary of the integral-action supplier still disproves arbitrary based-pair integral action in general type. No universal-R braiding or uncontrolled semi-infinite evaluation is asserted.

Facts & Assumptions

[F1]

Intertwiner calculus (Existence and uniqueness of the weightwise quasi-R intertwiner, The quasi-R intertwiner determines its inverse and the coproduct factorizations): Θ0=1, Θ−1=Θ‾=(ψ⊗ψ)(Θ), Δ(u)Θ=ΘΔ‾(u) for all u, the field cocycle ((Δ⊗id)Θ)Θ12=((id⊗Δ)Θ)Θ23 holds coefficientwise, and the action of Θ is vectorwise finite on the completed pairs.

[F2]

Integral action and supported construction (Divided-power integrality of the quasi-R action on based lattices): cases (a)–(d) give finite integral Θ action and weight-transfer triangularity with diagonal 1, including arbitrary based finite-type pairs. Finite supported semilinear correction and the genuine tensor global basis additionally hold for the stated supported highest/lowest construction classes and for integral pairs with finite raw-basis correction closure; this includes the entire finite-dimensional tensor product.

[F3]

Balanced triples and uniqueness (Balanced triples over the two charts of P1 and the globalization map, The lower global basis of Uq− and of a highest weight module): an integral balanced lift with prescribed residue is unique; adapted tensor global bases give the Z-span, the A0-chart, the actual infinity chart and the integral globalization isomorphisms.

[F4]

Crystal tensor rule (The crystal basis of a tensor product and the two-case operator rule): the tensor product of crystal lattices is a crystal lattice with residue basis the tensor classes b⊗b′.

[F5]

Label grading and finite rank-one strings (Quantum weight modules, weights in P, and integrability, Uniqueness of the i-string decomposition of an integrable module): labels are part of the module data, Q=⨁iZαi, and every weight vector has a finite admissible expansion in divided i-strings of top coroot a≥0 and positions 0≤n≤a. The finite-type longest element sends the positive root cone to its negative (Weyl length equals inversion number); on labels the simple reflection is siμ=μ−⟨μ,hi⟩αi.

[F6]

Periodic finite-cut escape (Periodic cyclotomic tensor corrections escape every finite cut): arbitrary based rank-one pairs can have finite integral involutive tensor bars while the normalized lift of a fixed seed escapes every finite constituent cut; raw projection intertwines the full and cut bars, and each cut lift has a nonzero constituent coordinate of index at least J−1.

Proof

technique · direct
1.1F1F5constructalgebra

Actual support bounds and finite correction closure. The Oint hypothesis includes finite upper-cone support: for each factor Mj, supp⁡Mj⊆⋃a(λj,a−Q+). Fix a total label μ and a choice of these finitely many upper labels. A tensor label tuple satisfies μj=λj,aj−βj, βj∈Q+ and ∑jβj=∑jλj,aj−μ. Independent simple-root coordinates bound every coordinate of every βj, so there are finitely many tuples, regardless of multiplicities at their labels. Every strict root transfer increases a prefix label by a nonzero element of Q+; hence a chain of transfers visits no tuple twice and has bounded length. Each evaluated bar column is a finite sum of raw basis vectors: the tuple bounds permit only finitely many root degrees, each degree has a finite algebra expansion, and vectors in a field basis have finite support. Starting from a finite set of raw seeds, recursively adjoin the raw support of their bar columns. This is a finitely branching tree with the bounded strict-transfer depth just proved, so its closure is finite. The correction and inverse unitriangular transition therefore take place in a finite raw-basis set, even if some label spaces have infinite multiplicity. In finite Cartan type there is also a global label bound for every upper-cone integrable factor. Indeed a nonzero vector at η has a nonzero admissible i-string position Fi(n)v with top η+nαi and top coroot a=⟨η,hi⟩+2n; its mirrored position a−n is nonzero by [F5] and has label siη. Thus support is stable under every si, including on nonseparating chosen label gradings. Applying the longest element w0 shows that the same support lies in ⋃b(w0λb+Q+). The intersection of an upper cone λa−Q+ and a lower cone w0λb+Q+ consists of labels w0λb+γ with 0≤γ≤λa−w0λb coefficientwise in the simple-root basis, so is finite or empty. The finite union of these intersections bounds the entire support. No finite-dimensional-weight-space inference for arbitrary based integrable modules is used. These arguments apply to the stated bounded category; an unrestricted two-sided-unbounded based pair still needs a separate finite-action and supported-correction proof.

2.1F1F2F3step 1.1constructalgebra

The field tensor bar. For the empty sequence take the tensor unit 1=Q(q)1 of weight zero, with u⋅1=ε(u)1: the counit of the quantum-group structure underlying [F1] has ε(Ei)=ε(Fi)=0 and ε(Kh)=1. Its basis is {1}, its crystal operators vanish, and its bar is Ψ∅(f(q)1)=f(q−1)1. These generator actions show integrability and bar compatibility; the divided-power lattice is A 1, stable because positive divided powers act by zero and each Kh acts by one and each Ti,c,t acts by the Gaussian scalar (ct)i∈A. Its zero and infinity charts are A01 and A∞1=Ψ∅(A01). A Laurent polynomial regular at zero has no negative powers and one regular at infinity has no positive powers, so A∩A0∩A∞=Z and A∩A0=Z[q]. Thus the balanced map of [F3] is Z1→Z[q]1/qZ[q]1, an isomorphism, and its unique global lift is 1, with no correction. Every positive-root component of Θ annihilates a tensor pair containing this unit, since its positive or negative quantum half acts trivially there, while Θ0=1 acts as the identity; hence adjoining a unit leaves the tensor bar unchanged under the canonical unit identifications. The empty case is therefore vectorwise finite, involutive, integral, balanced and independent of parenthesization. For arbitrary integrable finite-Cartan factors, the supplier's finite-action clause proves tensor integrability and successive vectorwise finite quasi-R evaluation without support or multiplicity bounds; the same field-bar calculations below therefore apply to those factors as well. For a single factor use its given bar. Define the binary bar ΨM,N=Θ(ψM⊗ψN) and, for a finite sequence, the iterated composition; on each Oint factor pair the action of Θ is vectorwise finite by the explicit label-tuple bound in step 1.1; for the separately admitted ordered lowest inputs, the supplied lower-cone bounds hold before evaluation. Ψ is semilinear because ψ sends q to q−1. Since Θ−1=Θ‾ by [F1], applying the binary bar twice gives ΘΘ‾=id, so Ψ2=id; and Δ(u)Θ=ΘΔ‾(u) gives Ψ(ux)=ψ(u)Ψ(x) for every u and every tensor x on which the action is defined.

2.2F1F2step 1.1

Integral preservation and triangularity. In all the integral action cases of the supplier, including arbitrary based finite-type pairs, Ψ preserves the divided-power integral tensor lattice and is an A-bijection because Ψ2=id; every positive-root component of Θ raises the first label and lowers the second, and only the degree-0 component fixes a label pair, so the action on raw tensor lower basis vectors is triangular with diagonal 1 in the weight-transfer order. Finite raw-basis correction closure additionally holds in the bounded category by step 1.1 and in the separately supported ordered cases of [F2]; it is not inferred from unrestricted finite-type action integrality.

3.1F1step 2.1

Independence of parenthesizations. For three factors the two bracketings compute ((Δ⊗id)Θ)Θ12 and ((id⊗Δ)Θ)Θ23 composed with the factor bars, and the field cocycle of [F1] makes them equal coefficientwise; since every rebracketing of a finite sequence is generated by binary reassociations, all parenthesizations give the same Ψ, with all sums finite in each total root degree. This is the field-level assertion and requires no integral action.

3.2F2F4step 1.1step 2.2

The corrected tensor global vectors. Within the finite raw-basis closure proved in step 1.1, or the separately supplied bounded ordered interval, apply the semilinear correction algorithm of [F2]: in each such finite transfer interval solve gt=et+∑s>tatses with ats∈qZ[q] for the bar-fixed lift of the raw vector et. Involutivity forces the remainder to satisfy f+fˉ=0, whose unique positive q-part supplies the next coefficient; finite induction yields existence and uniqueness of the corrected family, which is an A-basis of the tensor lattice congruent to the raw basis modulo q, and an A0-basis whose residues are precisely the raw tensor crystal basis supplied by [F4]. The raw vectors themselves are generally not bar fixed, which is why the correction is needed.

4.1F3step 3.2

The integral balanced tensor triple. Since the corrected family is Ψ-fixed, its A∞-span is the actual infinity chart Ψ(L0tensor) and its A0-span is the original tensor zero chart; intersecting the Laurent coefficient rings in this common basis gives the Z-span as the balanced intersection L0tensor∩Ψ(L0tensor)∩A-lattice, so the integral globalization isomorphisms of [F3] identify the corrected family as the genuine tensor global basis and prove integral balancedness. This uses the crystal lattice only as the residue datum and does not assert that Ψ preserves A0 or that the bar chart equals L0tensor.

5.1F2F3step 4.1

Based subquotients and scope. Exact based subobjects are saturated basis subsets and based quotients have basis-subset kernels; both commute with bars and crystal operators, and the image of a corrected global vector is integral and bar fixed with one raw residue or 0, so balanced uniqueness [F3] proves the basis-or-0 compatibility and the corrected bases descend to exact tensor subquotients and direct sums within the stated bounds. Outside the listed cases no integral action is claimed, and the affine counterexample of the supplier shows it can fail; no universal braiding or semi-infinite evaluation is asserted.

6.1F6step 5.1algebra

The unrestricted finite-type globalization boundary. The actual integral rank-one bar in [F6] is algebraic and involutive but has no finite normalized lift of its seed: projecting a putative finite lift to a cut J beyond its support by two identifies it, by finite-cut uniqueness, with a cut lift having a nonzero coordinate of index at least J−1. For the natural integral balanced map, an element g of the zero/bar intersection has both g and Ψg with polynomial raw coordinates. The anti-invariant difference Ψg−g must vanish: at its least first weight its polynomial coefficient satisfies sˉ=−s, hence is zero. The prescribed residue and the least-first-weight argument eliminate every polynomial correction at or below the seed weight. Thus a balanced lift of the seed would have the finite triangular normalization just contradicted. The resulting failure concerns the unrestricted based extension; steps 3.2–5.1 retain the entire supported full-tensor construction and its inheritance.

7.1step 3.1step 4.1step 5.1step 6.1∎

Conclusion. Step 1.1 proves the bounded-category finite-support bridge; steps 2.1 and 3.1 prove the well-defined semilinear involutive field bar and its parenthesization independence; steps 2.2, 3.2 and 4.1 prove integral preservation, the triangular correction, the corrected global basis and the balanced tensor triple in the supported construction cases; step 5.1 proves subquotient inheritance, and step 6.1 refutes unrestricted finite-type globalization while retaining the finite integral bar action.

Depends on

Used by

Dependency tree · two levels

55 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