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

Tail estimates: q-adic vanishing against the vacuum and finiteness of the weight strings

Statement

Let F(M) be the charge-M Fock space with ground sequence bs∘=uM−s and let Hop be the opposite-channel energy. Then:

(i) Vanishing against the right tail. For a fixed type-A ground sequence, the condition Hop(b⊗bs∘)≤0 means that the added integer index lies inside or below the filled right tail {M−s,M−s−1,… }; then b∧bs∘∧bs+1∘∧⋯=0, a sufficiently long finite prefix of this entire filled-tail wedge is already 0, and hence the element lies in qnW0 for every n.

(ii) Dual left tail. The mirrored condition with the left tail gives the same exact finite vanishing, with the roles of left and right exchanged.

(iii) Endomorphisms commuting with the loop. A nonzero-weight endomorphism C of Vaff commuting with z has only finitely many loop-shift/color terms on each fundamental vector; inserting C deep inside a ground tail is eventually 0, so it converges q-adically to 0 on every vector.

(iv) The period operator. For the explicit period operator T on F(M) that prepends e vacuum entries and shifts every old index down by e: T preserves each label-weight/size component, and on the positive-size-n part its k-th power is 0 as soon as ke>n. Consequently (1−T)−1=1+T+T2+⋯ is a finite geometric sum on every nonvacuum weight, and each label weight has only finitely many partition vectors.

Facts & Assumptions

Given: The charge-M Fock space, its normal partition basis, the ground sequence, and the energy Hop with the criterion Hop>0  ⟺  m1>m2.

[F1]

Finite normal words have strictly decreasing indices. Straightening preserves cardinality, total index sum and residue multiset, and keeps all indices between the input extremes. Hence an r-factor word supported in an interval of fewer than r integers is zero. In an interval of exactly r integers there is only one possible normal r-tuple, whose sum is the sum of the entire interval (Normally ordered q-wedges form a basis for every finite wedge length, The semi-infinite q-wedge Fock space and its q-adic topology).

[F2]

Hop(um1⊗um2)>0 iff m1>m2. Also um=zavj when m=j−ae; thus z shifts an index by −e (The level-zero vector representation, its affinization and the level-one crystal energy, The q-wedge relations coincide with the type-A energy braiding kernel).

[F3]

A charge-M normal word has indices ij=M+λj−j+1. Its size is the finite excess ∑j=1R(ij−(M−j+1))=∣λ∣ once R contains its nonvacuum part, and its label weight is ΩM−∑cellsαc−r+M. The simple roots are independent in the explicit affine datum (The semi-infinite q-wedge Fock space and its q-adic topology, The cyclic affine type A Cartan datum and its residues).

Proof

technique · straighten finite filled intervals, using cardinality for an added factor and the changed sum for a replaced factor; use the maximum index and the preserved excess for the period operator
1.1F1F2givenalgebra

Right-tail vanishing. Put L=M−s. By [F2], Hop(um⊗uL)≤0 is equivalent to m≤L. Choose B≤m and truncate the filled tail at uB. The word um∧uL∧uL−1∧⋯∧uB has L−B+2 factors, all in the interval [B,L], which contains only L−B+1 integers. Every normal term of its finite straightening would have that many distinct indices inside the same interval, which is impossible by [F1]. Thus this finite word is zero, as is every longer prefix. Its semi-infinite image is zero and therefore belongs to qnW0 for every n at each such finite stage (and to qnF0 in the Fock space). This argument concerns the whole filled tail; it does not assert that um∧uL alone is zero when m<L.

1.2F2givenalgebra

Finite shifts of C. Here nonzero weight means that C is homogeneous of a weight γ≠0: it maps a weight space of weight ν into weight ν+γ. Write each Cvj as a finite sum ∑k,acj,k,azavk. Since Cz=zC and z is invertible, C(ztvj)=∑k,acj,k,azt+avk. Thus each term replaces um by um+d, where d=k−j−ae belongs to a fixed finite set obtained from the e fundamental vectors; its coefficient depends only on m mod e. A term with d=0 would be the same vector um and have weight shift zero, so its coefficient is zero by homogeneity. Choose D bounding the absolute values of all occurring shifts.

1.3F1F3givenalgebra

Definition and gradings of T. On an eventually-ground word define T by prepending uM∧⋯∧uM−e+1 and replacing every old index ij by ij−e. The simultaneous translation by −e preserves the finite wedge relations: all residue differences and index gaps are unchanged. The new ground tail is again the charge-M tail, so this operation respects local kernels and extending a representative by ground entries, and defines a linear endomorphism of F(M). At position e+j, its excess above the ground index is (ij−e)−(M−(e+j)+1)=ij−(M−j+1); the prepended entries have excess zero. The old residues are unchanged by translation by e, and the new ground entries contribute zero residue-count deviation. Hence total size and label weight are preserved before and after straightening, by [F1] and [F3]. In particular T preserves each label-weight/size component; this does not require a permutation of its partition labels.

1.4F3givenalgebra

Finite label weights. If ∣λ;M⟩ has fixed label weight μ, then ΩM−μ=∑iniαi, where ni counts the residue-i cells. Independence of the simple roots in [F3] uniquely determines all ni and hence ∣λ∣=∑ini. Only finitely many partitions have this size: each has at most that many positive parts, each bounded by the size. Therefore each label weight contains finitely many partition basis vectors.

2.1F1F2step 1.1algebra

Dual left-tail vanishing. The mirrored filled tail ending at uL is ⋯∧uL+2∧uL+1∧uL, with an extra factor um on its right and the mirrored condition Hop(uL⊗um)≤0, equivalently m≥L. Truncate its left end at any B≥m. The resulting word uB∧⋯∧uL∧um has B−L+2 factors inside the B−L+1 integers of [L,B], so it is zero by the same finite normal-basis count. Extending that left end preserves zero. This is the reversed-interval version of step 1.1 and proves the dual exact finite vanishing and all its q-adic estimates.

2.2F1step 1.2algebra

Deep replacement. Fix an eventually-ground representative of a Fock vector. At a sufficiently deep slot its index is m, and the entire local block um+D∧um+D−1∧⋯∧um−D is ground. In a term of the insertion of C at that slot, replace um by um+d, where 0<∣d∣≤D. This still has exactly 2D+1 factors, all in [m−D,m+D]. Its total index sum is the ground block's sum plus d. By [F1] the only possible normal tuple of that cardinality in this interval is the complete ground tuple, whose sum is different. Every normal coefficient must therefore be zero. The block vanishes before it is wedged with the remaining factors, so the insertion is zero at every sufficiently deep slot; the cutoff is uniform for the finite shifts and, by taking a maximum, for any finite linear combination of representatives. These eventual zeros converge to zero in the separated q-adic topology.

2.3F1F3step 1.3algebra

Nilpotence on positive size. On ∣λ;M⟩, Tk prepends ke ground entries and shifts all old indices down by ke. The largest shifted old index is M+λ1−ke, so when ke>λ1 all indices of the resulting word are at most M. Choose a finite prefix of length R whose remainder is ground and whose last ground entry is below every nonground index. Its ground sum is SR=∑j=1R(M−j+1) and its actual sum is SR+∣λ∣, by step 1.3. Every normal R-tuple with maximum at most M satisfies aj≤M−j+1, and therefore has sum at most SR. Straightening preserves sum and the upper bound M, so no such normal term exists if ∣λ∣>0. Thus the finite prefix, and hence Tk∣λ;M⟩, is zero. Equivalently the only normal charge-M semi-infinite word with maximum at most M is the vacuum, excluded by the preserved positive size. Since λ1≤∣λ∣=n, Tk=0 on the size-n>0 part whenever ke>n.

3.1step 2.3algebra

Geometric inverse. On a positive-size component choose K with Ke>n. The finite operator sum G=∑k=0K−1Tk satisfies (1−T)G=G(1−T)=1−TK=1 by step 2.3. This gives the claimed finite geometric inverse on every nonvacuum label weight and the resulting isomorphism for the tail recurrence; no inverse on the vacuum component is asserted.

4.1step 1.1step 2.1step 2.2step 1.3step 2.3step 3.1step 1.4∎

Conclusion. Steps 1.1 and 2.1 give the right and dual left filled-tail estimates by exact finite vanishing; step 2.2 gives eventual zero for every deep insertion of a loop-commuting homogeneous nonzero-weight endomorphism; steps 1.3, 2.3 and 3.1 give the size-preserving and label-weight-preserving period operator, its positive-size nilpotence bound and finite inverse; and step 1.4 proves finite label-weight components.

Remarks

  • The estimates are proved here in the library's residue convention c−r mod e with the ground sequence bs∘=uM−s; none of the two-sided-unbounded evaluation statements of the earlier finite ordered tensor theory is imported.

Depends on

Used by

Dependency tree · two levels

22 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