Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedverified 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.

Rank-one lattice and square-zero screening data for the triplet construction

Definition

Fix an integer p≥2. Let L=Zα with bilinear form ⟨rα,sα⟩=2prs, and put P=C[x1,x2,…], where every polynomial uses finitely many variables. Write Ft=Petα for a copy of P labelled by t∈Q. On it define α−n=xn, αn=2pn∂xn for n≥1, and α0=2ptI. Write α(z)=∑n∈Zαnz−n−1. The vector etα means 1∈Ft; it is not an analytic exponential.

Use two distinguished sectors indexed by ϵ=0,1: A=⨁ϵ=01⨁n∈ZFn−ϵ/p,M=⨁ϵ=01⨁n∈ZFn+1/2−ϵ/p. The sector-one subspace of A is denoted I and its sector-zero subspace VL. A state charge r=m−δ/p carries sector δ∈{0,1}. The charge shift er sends fetα in sector ϵ to fe(t+r)α in sector ϵ+δ when ϵ+δ≤1, and to zero otherwise. This rule applies on both A and M. In particular two sector-one actions have zero composite. The scalar cocycle for allowed shifts is ε(r,s)=1; there is no extra phase. For two state charges with sector sum at most one, ⟨rα,sα⟩=2prs is an even integer, so this choice has commutator (−1)2prs=1. The multiplication involving two sector-one states is defined to be zero, rather than a fractional-power generalized lattice product.

Define exponential fields on either vector space by Er(z)=exp⁡ ⁣(∑n≥1rα−nnzn)exp⁡ ⁣(−∑n≥1rαnnz−n)erzrα0, where zrα0fetα=z2prtfetα. For every allowed action the exponent 2prt is an integer. On a disallowed action the field is zero. Each coefficient is defined algebraically: the annihilation exponential is finite on a polynomial, and the creation exponential has only finitely many contributions to a fixed power of z.

Put bn(z)=∂zn−1α(z)/(n−1)!. For a monomial state xn1⋯xnkerα define its field by Y(xn1⋯xnkerα,z)=:bn1(z)⋯bnk(z)Er(z):. Here normal ordering means the following explicit finite distribution over the k oscillator factors: split each bn into its part with oscillator index less than zero and its part with index at least zero; sum over all choices, placing every chosen negative part to the left of Er and every chosen nonnegative part to its right. Factors within either group commute. Extend linearly, and distinguish YA and YM by the space acted upon. This definition gives candidate state fields, not a waiver of their vertex/module Jacobi obligations.

Set 1=e0, ω=(x12/(4p)+(p−1)x2/(2p))e0, v=e−α/p, Q=(eα)(0) and F=e−α, H=QF, E=Q2F, using coefficients Y(a,z)=∑k∈Za(k)z−k−1. Let W be the smallest linear subspace of VL containing 1,ω,F,H,E and closed under every product a(k)b of its elements, for k∈Z; it exists as the intersection of all such subspaces. Once the vertex and conformal identities are established, this is the vertex subalgebra generated by the four displayed states, denoted W(p) here. Equality with the full kernel ker⁡VLv(0) is a further structural assertion, not part of the definition and not required for the four-generator construction.

For a∈W use the explicit screening-deformation candidate Y~(a,z)=YM(a,z)+∑n≥1(−1)n+1nz−nYM(v(n)a,z). Define P+p−1 as the span of all finite words of its modes applied to eα/2, and M1 as the corresponding cyclic span generated by e−α/2. These spans are defined within M; their module, containment and grading properties are separate assertions. The endpoint convention is Λ(p−1)=We(p−2)α/(2p)⊂⨁nFn+(p−2)/(2p) and Π(1)=We−α/2⊂⨁nFn+1/2 for the undeformed lattice fields. These definitions specify particular cyclic spaces; their irreducibility and their identification with the extension endpoints also require proof.

Depends on

Dependency tree · 2 levels

Sources