Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-11-05 (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.

Exact lengths of boundary long-screening strings

Statement

In the rank-one oscillator spaces fix integers p≥2 and 0≤i≤p−2, and put β=i/(2p) and δ=(2p−2−i)/(2p). For every n≥0,

Q2ne(β−n)α≠0,Q2n+1e(β−n)α=0.

For every n≥1,

Q2n−1e(δ−n)α≠0,Q2ne(δ−n)α=0.

Every shorter nonnegative screening power in either displayed string is nonzero.

Facts & Assumptions

Given: The explicit polynomial coefficient maps Qt of the oscillator definition, with p,i,β,δ as stated. Write d=p−1−i, Δj(z)=∏r<s(zr−zs), and h(t)=pt2−(p−1)t.

[F1]

Rank-one Feigin–Fuchs oscillator spaces and long-screening coefficients defines the polynomial spaces, the substitution/creation fields, their coefficient maps, and their degree and weight operators.

[L1]

For j≥1, put pm(z)=∑r=1jzrm. A symmetric polynomial is a polynomial invariant under permutations of z1,…,zj. For a partition λ of D with at most j parts, its monomial orbit sum is the sum of the distinct monomials obtained by assigning the parts of λ to distinct variables. These orbit sums span the homogeneous symmetric polynomials of degree D, since invariance makes coefficients constant on each permutation orbit.

Proof

1.1givenF1L1algebra

Commuting each annihilation substitution through the later creation exponential contributes exp⁡(−2p∑m≥1(zs/zr)m/m)=(1−zs/zr)2p. The subsequent charge shift contributes zr2p for that pair. Consequently repeated substitution in [F1] gives the exact finite-residue identity Qjetα=Res⁡z1⋯Res⁡zjΔj(z)2p∏rzr2ptexp⁡(∑m≥1xmm∑rzrm)e(t+j)α. Only the symmetric homogeneous degree D=j(−2pt−1)−pj(j−1) in the exponential can contribute. Its oscillator coefficients span the symmetric polynomials of degree D in the j variables. Indeed, the coefficient of ∏mxmqm, where ∑mmqm=D, is ∏mpm(z)qm/(mqmqm!). Products of power sums span every orbit sum in [L1]: in pλ1⋯pλℓ the terms using ℓ distinct variables give a positive integer multiple of the orbit sum for λ, while every term with repeated variables has fewer than ℓ distinct variables and is an orbit sum for a partition obtained by merging parts. Induction on ℓ therefore solves for every orbit sum as a linear combination of products of power sums. The degree-D oscillator space is finite-dimensional, so a linear functional on it can select any desired symmetric polynomial from those coefficient functions.

2.1F1step 1.1algebra

In the first family take j=2n>0, t=β−n; then D=jd. Use the symmetric polynomial (∏rzr)d in step 1.1. In the second family take j=2n−1, t=δ−n; then D=j(i+1), and use (∏rzr)i+1. Both resulting residues equal the constant term of Δj(z)2p∏rzr−p(j−1). If V(z)=Δj(z)p=∑μcμzμ, reciprocal substitution gives Δj(z)2p∏rzr−p(j−1)=(−1)pj(j−1)/2V(z)V(z−1). The constant term is (−1)pj(j−1)/2∑μcμ2≠0, since V is a nonzero polynomial with real coefficients. This proves both asserted nonvanishing claims, including n=0 in the first family because Q0 is the identity.

3.1F1step 2.1algebra∎

Give a homogeneous input polynomial oscillator degree N. In a term of the creation exponential, choosing powers with total oscillator degree c adds total z-degree c; choosing substitution terms that lower oscillator degree by a adds total z-degree −a. The coefficient selected by Qt=Res⁡zE1,t(z) satisfies 2pt+c−a=−1, hence a−c=2pt+1 and the output degree is N−a+c=N−2pt−1. Since h(t+1)−h(t)=2pt+1, Qt preserves the explicit weight N+h(t). Put an=((2pn+d)2−(p−1)2)/(4p) and bn=((2pn−d)2−(p−1)2)/(4p). The first family's initial weight is an; its charge after 2n+1 steps would be β+n+1, whose minimum weight is bn+1. But bn+1−an=(i+1)(2n+1)>0, so this output is zero. The second family's weight is bn; after 2n steps its charge would be δ+n, whose minimum weight is an, and an−bn=2nd>0. This output is also zero. If any earlier power vanished, all its later composites would vanish, contradicting step 2.1. This proves all claimed exact lengths.

Depends on

Dependency tree · 1 level

Sources