Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-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.

Logarithmic intertwining operator

Definition

Let V be a Möbius or conformal vertex algebra and W1,W2,W3 generalized V-modules. A logarithmic intertwining operator of type (W3;W1,W2) is a linear map Y:W1⊗W2→W3[log⁡x]{x}, with Y(w1,x)w2=∑n∈C∑k≥0(w1)n;kw2 x−n−1(log⁡x)k, where log⁡x is a formal symbol, such that the following conditions hold. For each w1,w2 and n, (w1)n+m;kw2=0 for all sufficiently large integers m, with one bound independent of k. For v∈V and w1∈W1, w2∈W2, the Jacobi identity is x0−1δ ⁣(x1−x2x0)Y3(v,x1)Y(w1,x2)w2−x0−1δ ⁣(x2−x1−x0)Y(w1,x2)Y2(v,x1)w2=x2−1δ ⁣(x1−x0x2)Y(Y1(v,x0)w1,x2)w2. Here Yi is the V-action on Wi, δ(t)=Σr∈Ztr, and x0,x1,x2 are independent formal variables. The first delta term is expanded in nonnegative powers of x2, the second in nonnegative powers of x1, and the right-hand term in nonnegative powers of x0, using the ordinary formal binomial convention. The derivative and Möbius bracket identities are ∂xY(w1,x)=Y(L(−1)w1,x),[L(j),Y(w1,x)]=∑i=0j+1(j+1i)xiY(L(j−i)w1,x),j=−1,0,1. For each n, the coefficient of x−n−1 is a finite polynomial in log⁡x; no uniform degree bound over all n is imposed. In the strongly graded setting the operator is grading-compatible when coefficient degrees add. The no-log subspace consists of logarithmic intertwining operators with all coefficients for k>0 zero, retaining the stated integer-string truncation. It agrees with the usual ordinary intertwining-operator space over a conformal vertex algebra of CFT type when W1,W2,W3 are ordinary modules, meaning grading-restricted generalized modules with diagonalizable L(0); without that lower bound, no uniform real-part truncation is asserted.

Facts & Assumptions

Given: Work over C with the formal-variable, grading, and branch conventions in the linked definitions.

[F1]

Module for an ordinary vertex algebra: Let V be a vertex algebra over C in the ordinary, non-super convention of def-vertex-algebra-state-field. A left V-module is a complex vector space M and a linear map YM(−,z):V⟶{formal fields on M},a⟼YM(a,z)=∑n∈Za(n)Mz−n−1, with the following properties: 1. Lower truncation. For every a∈V and m∈M, a(n)Mm=0 for all sufficiently large integers n, so YM(a,z)m∈M((z)) in the support convention of def-formal-distribution-on-a-vector-space. 2. Vacuum. YM(1,z)=id⁡M. 3. Module Jacobi identity. For every a,b∈V, z0−1δ ⁣(z1−z2z0)YM(a,z1)YM(b,z2)−z0−1δ ⁣(z2−z1−z0)YM(b,z2)YM(a,z1)=z2−1δ ⁣(z1−z0z2)YM(Y(a,z0)b,z2). Here δ(x)=∑r∈Zxr; the first expansion is in nonnegative powers of z2, the second in nonnegative powers of z1, and the right-hand expansion is in nonnegative powers of z0. They use the formal binomial conventions of def-formal-distribution-on-a-vector-space. The Y inside the right-hand side is the state-field map of V; it is not the action map YM. A V-module homomorphism f:M→N is a linear map such that fYM(a,z)=YN(a,z)f for every a∈V. This definition does not impose a conformal grading, finite-dimensional weight spaces, semisimplicity of L0, a right-module convention, or a twist by an automorphism. For a conformal vertex algebra, write YM(ω,z)=∑n∈ZLM(n)z−n−2 when a conformal vector ω is specified. A V-submodule of M is a linear subspace stable under every mode a(n)M. A module is simple (or irreducible) if it is nonzero and has no proper nonzero V-submodule. A module is completely reducible (or semisimple) if it is an internal direct sum of simple V-submodules; the empty direct sum is the zero module.

[F2]

Grading-restricted generalized module: Let V be a conformal vertex algebra of CFT type and M a left V-module. Write LM(0) for the coefficient determined by YM(ω,z)=∑n∈ZLM(n)z−n−2. For h∈C, define the generalized LM(0)-eigenspace M[h]={m∈M:(LM(0)−h)Nm=0 for some integer N≥1}. The module is grading-restricted generalized if M=⨁h∈CM[h], every M[h] is finite dimensional, and the real parts of its nonzero generalized weights are bounded below. The direct sum means each vector has only finitely many generalized-weight components. This convention explicitly adds finite-dimensionality and a lower bound to the generalized-eigenspace decomposition; those conditions are not consequences of the module Jacobi identity.

[F3]

Conformal vertex algebra of CFT type: A conformal vertex algebra of CFT type is a complex vertex algebra V in the sense of def-vertex-algebra-state-field, with a specified vector ω∈V and scalar c∈C, such that, writing Y(ω,z)=∑n∈ZL(n)z−n−2, the operators L(n) and scalar central action c satisfy the Virasoro relations of def-virasoro-algebra, and L(−1)=T. In addition, L(0) is diagonalizable, Vn:={v∈V:L(0)v=nv} gives V=⨁n≥0Vn, every Vn is finite dimensional, and V0=C1. Under this page's convention, this is a vertex operator algebra of CFT type. The grading and the CFT-type condition are part of the definition; they do not follow from the vertex-algebra axioms alone. The conformal weight of v∈Vn is n. A conformal vector, a grading, and the nonnegative grading condition are additional data beyond an ordinary vertex algebra.

[F4]

Strongly graded generalized module in the HLZ setting: Let V be an ordinary non-super vertex algebra in the sense of def-vertex-algebra-state-field. A Möbius vertex algebra has V=⊕n∈ZVn with Vn=v∈V:L(0)v=nv, and operators L(-1),L(0),L(1) representing sl(2), with L(-1) equal to translation, and satisfying [L(j),Y(v,x)]=Σi=0j+1 binom⁡(j+1,i)xiY(L(j−i)v,x) for j=−1,0,1. A Möbius module has the corresponding sl(2)-action and field commutator identities. A conformal vertex algebra supplies these operators through its Virasoro field. For a generalized module write L(0)_s for the diagonal operator acting by h on W[h]; the nilpotent part is L(0)-L(0)_s. Let A be an abelian group and suppose V has compatible integer-weight and A-gradings V=⊕n∈Z,α∈AVnα, each component finite dimensional and lower truncated in n for each α, 1∈V00, vmVβ⊂Vα+β, and L(j)Vα⊂Vα for j=−1,0,1. In the conformal case require ω∈V20. For an abelian group Ã⊃A, a generalized module W=⊕h∈C,β∈A~W[βh] is strongly Ã-graded when W[βh]=W[h]∩Wβ, Wβ=⊕h W[βh] and W[h]=⊕β W[βh], each W[βh] is finite dimensional, W[βh+k]=0 for all sufficiently negative integers k for each h,β, vmWβ⊂Wα+β, and L(j)Wβ⊂Wβ for j=−1,0,1. Morphisms preserve both gradings and the V-action.

Proof

1.1givenF1F2algebra

The coefficient convention specifies complex powers and coefficientwise finite log polynomials, while the lower-truncation bound is independent of the log degree.

2.1givenF1F2F3F4step 1.1algebra∎

Write Yk(w1,x)w2=∑n∈C(w1)n;kw2x−n−1 for k≥0. The formal derivative acts by ∂x(xa(log⁡x)k)=axa−1(log⁡x)k+kxa−1(log⁡x)k−1, with the second term zero when k=0. Taking log-degree zero in the derivative axiom gives Y0(L(−1)w1,x)=∂xY0(w1,x)+x−1Y1(w1,x); projection to log-degree zero need not preserve that axiom. Instead, restrict to operators already satisfying Yk=0 for every k>0. Their defining Jacobi, derivative and three sl2 identities are precisely the corresponding no-log identities. They form a vector subspace since the identities are linear and finite sums retain integer-string truncation by taking the maximum of the bounds. For ordinary-module inputs w1,w2 of weights h1,h2, the L(0) bracket and derivative identity give L3(0)((w1)n;0w2)=(h1+h2−n−1)(w1)n;0w2. If output weights have real parts at least B, this coefficient vanishes for Re⁡n>Re⁡(h1+h2)−1−B. Finite homogeneous support of arbitrary inputs gives one bound for each pair. Conversely, ordinary real-part truncation implies integer-string truncation, so the two spaces agree under the stated ordinary-module hypotheses. No uniform real-part truncation is asserted for unrestricted generalized modules.

Depends on

Dependency tree · 2 levels

Sources