Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 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.

The first boundary Virasoro singular vectors at central charge minus two

Example

At p=2 and d=1, the boundary Virasoro central charge is c=−2 and the weights are an=((4n+1)2−1)/8 and bn=((4n−1)2−1)/8. Their chain begins a0=0<b1=1<a1=3<b2=6<a2=10.

Let v0 be the highest vector in M(−2,0) and v1 the highest vector in M(−2,1). Their first singular vectors are s1=L−1v0,s2=(L−12−2L−2)v1. The Verma map sending v1 to s1 sends s2 to s3=(L−13−2L−2L−1)v0, a nonzero singular vector at global grade three. Thus the first embeddings are M(−2,3)↪M(−2,1)↪M(−2,0).

The resulting simple-module characters, through relative grade six, are ch⁡L(−2,0)=1+q2+q3+2q4+2q5+4q6+O(q7), ch⁡L(−2,1)=q(1+q+q2+2q3+3q4+4q5+6q6+O(q7)). These finite coefficients illustrate the exact all-grade character formulas (1−q)/∏m≥1(1−qm) and (q−q3)/∏m≥1(1−qm), respectively.

Facts & Assumptions

Given: The two algebraic Verma modules and the fixed values p=2,d=1.

In this verification, a singular vector means a nonzero L0-eigenvector annihilated by every Lm with m>0. Thus the calculations below establish both the eigenvector and positive-mode conditions; [F1] gives the highest-vector relations used.

[F1]

Virasoro algebra in the Lm convention gives [Lm,Ln]=(m−n)Lm+n+(m3−m)δm+n,0C/12; Virasoro Verma modules and contravariant forms fixes the induced module and highest-vector relations, with C=−2 in this example and Lmvh=0 for m>0 and L0vh=hvh.

[F2]

PBW basis and grades of Virasoro Verma modules gives linearly independent negative-mode PBW monomials and grade dimensions P(N).

[F3]

Single-chain maximal submodules at boundary Virasoro central charges identifies each first embedded Verma as the maximal proper submodule and proves the exact simple-character formulas.

Verification

1.1F1F2algebra

Substitution into the boundary formulas gives c=−2 and a0=0,b1=1,a1=3,b2=6,a2=10. From [F1], L1s1=[L1,L−1]v0=2L0v0=0, and for m≥2, Lms1=(m+1)Lm−1v0=0. The vector is nonzero by [F2], so s1 is singular.

1.2F1F2algebra

For a highest vector vh, commutation gives L1L−12vh=(4h+2)L−1vh,L1L−2vh=3L−1vh, L2L−12vh=6hvh,L2L−2vh=(4h+c/2)vh. At h=1,c=−2 the coefficient pairs are (6,3) for each of L1,L2, so both modes annihilate s2. For m>2, applying Lm to a relative-grade-two vector lands below the Verma top and is zero. The distinct PBW terms make s2≠0, so it is singular.

2.1F2F3step 1.1step 1.2algebra

A singular vector at weight h′ defines a Verma homomorphism by sending the new highest vector to that vector. Under [F2], this map is right multiplication by its nonzero negative-mode polynomial. PBW filters U(n−) with associated graded the polynomial algebra on the negative modes, which has no zero divisors; hence right multiplication is injective. Applying this to s1 and s2 gives the stated embeddings, and the composite sends v2 to s3. The PBW coefficients 1,−2 show s3≠0. The proved chain lemma [F3] supplies maximality and the exact simple characters.

3.1F1F2step 2.1algebra

Directly verify the composite singular vector. Commutators give L1L−13v0=6L−12v0,L1L−2L−1v0=3L−12v0, L2L−13v0=6L−1v0,L2L−2L−1v0=3L−1v0. Thus L1s3=L2s3=0. Also L3L−13v0=24L0v0=0 and L3L−2L−1v0=5L1L−1v0=10L0v0=0. For m>3, positive modes land below the top. Therefore s3 is singular.

4.1F2F3algebra∎

For M(−2,0), the character from [F3] is (1−q)R(q); for M(−2,1) it is q(1−q2)R(q), where R(q)=∏m≥1(1−qm)−1. The coefficients of R through degree six are the partition numbers 1,1,2,3,5,7,11. Subtracting the shifted coefficients gives 1,0,1,1,2,2,4 and, inside the factor q, 1,1,1,2,3,4,6. These are the displayed expansions; the coefficient arithmetic is finite and exact.

Depends on

Dependency tree · 2 levels

Sources