Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 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 intertwiners and P(z)-maps correspond

Statement

Fix z∈C×, p∈Z, and ℓp(z)=log⁡∣z∣+iarg⁡(z)+2πip with 0≤arg(z)<2π. For strongly graded generalized V-modules W1,W2,W3, IY,p(w1⊗w2)=Y(w1,eℓp(z))w2 is a linear isomorphism from grading-compatible logarithmic intertwiners of type (W3;W1,W2) to P(z)-intertwining maps of that type. Its inverse is YI,p(w1,x)w2=(yL(0)xL(0)I(y−L(0)x−L(0)w1⊗y−L(0)x−L(0)w2))∣y=e−ℓp(z).

Facts & Assumptions

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

[F1]

Logarithmic intertwining operator: 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(·,x)·:W1⊗W2→W3[log x]{x}, written Y(w1,x)w2=∑n∈C∑k≥0(w1)n;kw2x−n−1(log⁡x)k, satisfying: for each w1,w2,n, (w1)n+m;kw2=0 for all sufficiently large integers m, with the bound independent of k; the intertwining Jacobi identity; ∂xY(w1,x)=Y(L(−1)w1,x); and [L(j),Y(w1,x)]=∑i=0j+1binom⁡(j+1,i)xiY(L(j−i)w1,x) for j=−1,0,1. Each 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 it is grading-compatible when coefficient degrees add. The no-log subspace retains the same integer-string truncation. For ordinary modules (grading-restricted generalized modules with diagonalizable L(0)) over a conformal vertex algebra of CFT type it agrees with the usual ordinary intertwining-operator space; no such identification is asserted for unrestricted generalized modules.

[F2]

P(z)-intertwining map: Let z∈C× and W1,W2,W3 be generalized V-modules. A P(z)-intertwining map of type (W3;W1,W2) is a linear map I:W1⊗W2→Wˉ3=∏h∈CW3[h] whose Ã-degrees add, for which πh−mI(w1⊗w2)=0 for all sufficiently large integers m for each fixed h,w1,w2, and which satisfies the P(z)-Jacobi identity and, for j=−1,0,1,L(j)I(w1⊗w2)=I(w1⊗L(j)w2)+∑i=0j+1binom⁡(j+1,i)ziI((L(j−i)w1)⊗w2). There is no L(-1)-derivative axiom for I. Formal variables x0,x1 are independent; z is a fixed complex number.

[F3]

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∈ZV(n), with V(n)={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+1binom⁡(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,α∈AV(n)(α), each component finite dimensional and lower truncated in n for each α,1∈V(0)(0),vmV(β)⊂V(α+β), and L(j)V(α)⊂V(α) for j=−1,0,1. In the conformal case require ω∈V(2)(0). For an abelian group Ã⊃A, a generalized module W=⊕h∈C,β∈A~W[h](β) is strongly Ã-graded when W[h](β)=W[h]∩W(β),W(β)=⊕hW[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.1givenF1F2F3algebra

Substituting eℓp(z) in the logarithmic Jacobi and sl(2) identities gives the P(z) identities; the source lower-truncation bound makes every completed-weight component well defined.

2.1givenF1F2F3step 1.1algebra

In the reverse formula, conjugation by xL(0)yL(0) transports the P(z)-Jacobi identity and sl(2) brackets to the formal intertwiner identities; the j=0 bracket yields the L(-1)-derivative property. P(z)-lower truncation yields the required coefficientwise truncation.

3.1givenF1F2step 2.1algebra∎

Substituting the formulas into one another cancels the x±L(0) and y±L(0) factors and recovers I and Y, respectively, for the same branch p.

Depends on

Dependency tree · 2 levels

Sources