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

First screening kernel from a finite symmetric-polynomial calculation

Statement

In the explicit lattice-screening data let p≥2, N=p−1, β=(p−2)/(2p), w=eβα and b=e(β+1)α. Give P=C[x1,x2,…] oscillator degree deg⁡xk=k, and denote its degree-n part by Pn. Write Dn⊂Pnw for the degree-n span of all finite products of negative Virasoro modes applied to w. Then Dn=Pnw for 0≤n<N, and DN=ker⁡(Q:PNw⟶Cb),Q(fw)=f(−2p,−2p,…)b. The displayed map has rank one. In particular, its kernel is contained in W(p)w, without assuming a global Feigin–Fuchs decomposition, endpoint irreducibility or the triplet extension theorem.

Facts & Assumptions

Given: The stated integer p≥2, polynomial spaces, explicit conformal vector, oscillator fields and screening Q. A partition of n is a finite nonincreasing list of positive integers summing to n. Write p(n) for the number of such partitions, so dim⁡Pn=p(n).

[F1]

Rank-one lattice and square-zero screening data for the triplet construction defines the oscillator actions and exponential fields.

[F2]

Jacobi identities for the rank-one square-zero lattice extension proves their vertex/module Jacobi identities.

[F3]

The conformal-field calculation in Admissible triplet action and the Jordan top of the cyclic logarithmic module gives L(0)-weights and the Virasoro modes of the explicit conformal vector. In particular eα is primary of weight one, so its zero mode Q commutes with the Virasoro modes by taking residues.

Proof

1.1givenF1F3algebra

Put q=(p−1)/(2p) and suppress charge labels on polynomials. The oscillator formula for L(−k) on charge β is L(−k)=∑j≥1jxk+j∂xj+14p∑j=1k−1xjxk−j+(β+q(k−1))xk. On the charge 1/2 Fock space, its positive mode is L(k)=∑j≥1(k+j)xj∂xk+j+p∑j=1k−1j(k−j)∂xj∂xk−j+k(1−(p−1)k)∂xk. Define a nondegenerate bilinear pairing between each equal-degree pair of these two polynomial spaces by making distinct monomials orthogonal and setting ⟨∏xjmj,∏xjmj⟩=∏mj!(−2pj)mj. Thus the adjoint of multiplication by xj is −2pj∂xj. Applying this rule termwise to the negative-mode formula gives exactly the positive-mode formula: its linear coefficient is −2pk(β+q(k−1))=k(1−(p−1)k). Consequently ⟨L(−k)f,g⟩=⟨f,L(k)g⟩ whenever the degrees match. These are finite-dimensional algebraic pairings and require no analytic completion.

2.1step 1.1algebra

On the charge-1/2 polynomial space form the degree-preserving finite-on-each-degree operator H=∑k≥1xkL(k). Put E=∑k≥1kxk∂xk and define Jp=∑a,b≥1(a+b)xaxb∂xa+b+p∑a,b≥1abxa+b∂xa∂xb+(p−1)∑k≥1k(k−1)xk∂xk. Let σ replace every xk by −xk. The two cubic terms change sign under conjugation by σ, whereas xk∂xk does not. The positive-mode formula of step 1.1 therefore gives the exact identity σHσ=−Jp+(2−p)E.

3.1givenstep 2.1algebra

Fix n≥1 and choose an integer m≥n. Substitution xk=∑i=1myik identifies Pn with the degree-n symmetric polynomials in m variables. Indeed the first m power sums generate the elementary symmetric polynomials by the recursion rer=∑j=1r(−1)j−1er−jxj; conversely the same recursion expresses each power sum in them. The elementary symmetric polynomials are algebraically independent: in a lexicographic monomial order their products have distinct leading exponent lists, so a nonzero polynomial relation cannot cancel its leading monomial. They generate every symmetric polynomial as well: its lexicographically highest exponent list is nonincreasing, and a product of elementary symmetric polynomials has exactly that leading monomial; subtracting its scalar multiple and repeating strictly decreases the leading monomial within the finite degree. Their weighted degree-n monomials, or equivalently the monomial symmetric functions indexed by partitions of n with at most m parts, thus give the required dimension-p(n) basis. The chain rule identifies Jp with J=p∑iyi2∂yi2+2∑i<jyi2∂yi−yj2∂yjyi−yj−2(m−1)∑iyi∂yi. To check the first-order terms, its action on xk is k∑a=1k−1xaxk−a+(p−1)k(k−1)xk. This follows from ∑i<j(yik+1−yjk+1)/(yi−yj)=12(∑a=0kxaxk−a−(k+1)xk) with x0=m. The chain rule's second-order term is p∑a,babxa+b∂xa∂xb, as displayed. The divided differences are polynomials on symmetric inputs since their numerators are antisymmetric in yi,yj.

4.1step 2.1step 3.1algebra

In the monomial symmetric basis, J is triangular in partition dominance order, with diagonal entry θλ=p∑iλi(λi−1)−2∑i(i−1)λi. For completeness, on two unequal exponents a>b the pair operator (yi2∂yi−yj2∂yj)/(yi−yj) sends yiayjb+yibyja to a(yiayjb+yibyja) plus terms with the two exponents strictly between a and b. This is obtained by expanding the differences of powers in its numerator; the remaining terms transfer positive exponent from the larger to the smaller. Such transfers produce dominated partitions: the sum of any fixed number of the largest entries cannot increase, as follows by maximizing the sum over subsets before and after the transfer. For equal exponents the diagonal coefficient is a and there are no transfer terms. Hence the pair terms have diagonal 2∑i<jmax⁡(λi,λj)=2∑i(m−i)λi. Combining this with the first and last terms of J proves the formula. Further, ∑i(i−1)λi≤n(n−1)/2, with equality only for λ=(1n): regarding the partition as ordered rows of boxes, the index i−1 counts preceding rows and is at most the number of boxes preceding a given box; summing gives the bound, strict if any row contains two boxes. Since p>0, it follows that θλ≥−n(n−1), and equality holds only at (1n). Thus all diagonal entries of −Jp+(2−p)n are strictly negative when 1≤n<N, and at n=N exactly one is zero, the column partition. By triangularity and conjugation, H is invertible on those smaller degrees and its kernel has dimension at most one on degree N.

5.1F1F2F3step 1.1step 4.1algebra∎

Induct on n≤N for the span Dn. The degree-zero span is the whole one-dimensional space. Suppose all smaller degrees are full. By definition Dn=∑k=1nL(−k)Dn−k. Its annihilator under the nondegenerate pairing of step 1.1 is therefore precisely the simultaneous kernel of L(1),…,L(n) on the dual charge-1/2 degree-n space: the lower spaces are full by induction. Every vector in this simultaneous kernel is killed by H. Step 4.1 gives zero annihilator when n<N, hence Dn=Pnw. When n=N it gives codim⁡DN≤1. On the other hand Qw=0, since Y(eα,z)w starts with zp−2b, and [F3] implies that Q kills every Virasoro descendant of w. Its explicit action on PNw is easy to calculate: the annihilation exponential replaces xk by xk−2pz−k, and the prefactor is zp−2. The output charge β+1 has minimum degree N, so the zero-mode output here has oscillator degree zero. Only the constant output of that substitution contributes, giving Q(fw)=f(−2p,−2p,…)b for weighted-homogeneous f∈PN. This functional is nonzero, since its value on xN is −2p. Thus DN has codimension at least one and is contained in this rank-one kernel. The equal codimensions prove the asserted equality. Finally all negative Virasoro modes are modes of ω∈W(p), so DN⊂W(p)w.

Depends on

Dependency tree · 2 levels

Sources