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

Finite-jet integration of positive Virasoro operators

Statement

Let V be a conformal vertex algebra of CFT type and d a nonnegative integer. Set Ed=⨁m=0dVm. Let Gd be the group of truncated series f(t)=t+∑n=1dbntn+1, with composition modulo td+2. Every f∈Gd has a unique expression f(t)=exp⁡(∑n=1dcntn+1∂t)t modulo td+2. The assignment Rd(f)=exp⁡(∑n=1dcnL(n))∣Ed is a representation of Gd. Its matrix entries are polynomials in b1,…,bd. It is compatible with restriction from Ed+1 to Ed and with truncation of jets. In particular no convergence of the formal logarithmic vector field is required.

Facts & Assumptions

[F1]

The grading is nonnegative integral with finite-dimensional pieces, and [L(0),L(n)]=−nL(n), [L(m),L(n)]=(m−n)L(m+n) for m,n>0, by Conformal vertex algebra of CFT type and Virasoro algebra in the Lm convention. The central term vanishes for these indices.

Proof

Given: The objects and integer d in the statement. All series and matrices below are truncated; d=0 gives the trivial group and identity operator.

1.1givenalgebra

Put Ad=C[t]/(td+2) and Dn=tn+1∂t for 1≤n≤d. These are well-defined derivations of Ad, and [Dm,Dn]=(n−m)Dm+n, with Dk=0 for k>d. Any product of d+1 such derivations is zero: each factor raises the degree of a nonconstant monomial by at least one and kills constants. Thus exp⁡D is a finite sum for D=∑cnDn. The repeated Leibniz identity Dk(uv)=∑j=0k(kj)DjuDk−jv implies that exp⁡D is an algebra automorphism, with inverse exp⁡(−D). Its image of t has coefficient cn in degree n+1, plus a polynomial in c1,…,cn−1, since a product of at least two derivations contributing to that degree has positive indices summing to n. Recursive coefficient comparison therefore gives unique cn for each f, polynomial in b1,…,bn. The substitution operator Sf:h↦h∘f consequently equals exp⁡D.

2.1F1step 1.1algebra

On Ed, L(n) lowers weight by n, so L(n)=0 for n>d and every product of d+1 positive modes vanishes. Define the linear map J(Dn)=L(n)∣Ed. It reverses brackets: J([X,Y])=−[J(X),J(Y)]. This follows on basis elements from the commutators, including the zero terms when m+n>d, and extends by bilinearity.

3.1step 1.1step 2.1constructalgebra

We prove integration of this map directly. The coefficients b1,…,bd identify Gd with Cd. Along any piecewise smooth path f(s) starting at the identity, set X=Sf−1∂sSf. Differentiating the multiplicativity of Sf shows that X is a derivation. It raises monomial degree and hence equals ∑xnDn: a derivation is determined by its value on t, which lies in t2Ad. Define U by ∂sU=J(X)U, U(0)=I. This equation has the explicit solution I+∑k=1d∫0<sk<⋯<s1<sJ(X(s1))⋯J(X(sk)) dsk⋯ds1. Differentiation verifies the equation; the same finite iteration applied to the difference of two solutions proves uniqueness.

4.1step 3.1step 2.1algebra

This solution depends only on the endpoint. Indeed, take a smooth fixed-endpoint homotopy f(s,u) and set Y=Sf−1∂uSf, A=J(X), B=J(Y). Differentiating inverses gives ∂uX−∂sY=[X,Y], and therefore ∂uA−∂sB=−[A,B]. The defect W=∂uU−BU satisfies ∂sW=AW by substitution and this last identity. At s=0, Y=0 and U=I, so W=0 there; uniqueness gives W=0 throughout. At s=1, Y=0, so ∂uU(1,u)=0. Any two smooth paths with the same endpoints are joined by their linear interpolation in the coefficient coordinates Cd; piecewise smooth paths can be reparametrized with vanishing derivatives at joins and the argument applied to the pieces. The iterated-integral solution justifies every parameter differentiation here, without any analytic ODE existence theorem.

5.1step 3.1step 4.1algebra

Write the resulting endpoint operator as R(f). For f,g∈Gd, first follow a path from the identity to g, then the path g to f∘g obtained from a path f(s) by f(s)∘g. Substitution reverses composition, so Sf(s)∘g=SgSf(s) and its left logarithmic derivative is exactly Sf(s)−1∂sSf(s). The second segment consequently transports R(g) to R(f)R(g). Endpoint independence proves R(f∘g)=R(f)R(g). Along the path f(s)=exp⁡(sD)t, its substitution is exp⁡(sD), so X=D and the explicit solution is exp⁡(sJ(D)). Thus R=Rd as stated.

6.1step 1.1step 2.1step 5.1∎

The exponential formula and the triangular polynomial recursion prove polynomial dependence on the jet coefficients. Restricting from Ed+1 kills L(d+1) and leaves all other positive modes unchanged; coefficients cn with n≤d depend only on the corresponding truncated jet. Thus restrictions agree. All arguments use finite sums, finite-dimensional matrices, explicit polynomial recursions and finite integrals, so require neither convergence of the infinite vector field nor any additional choice axiom.

Depends on

Dependency tree · 2 levels

Sources