Alphabeta Math
TheoremStatement: 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.

Compatibility subspace yields the P(z)-tensor product

Statement

Let C be a full category of grading-restricted generalized V-modules and W1,W2∈C. If S=W1 P(z) W2 with its induced P(z)-dual module action and its contragredient S' are both objects of C, then its contragredient (W1 P(z) W2)' together with the dual of the natural inclusion W1 P(z) W2↪(W1⊗W2)* is the P(z)-tensor product of W1,W2 in C.

Facts & Assumptions

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

[F1]

P(z)-tensor product in a module category: For a strongly A-graded Möbius or conformal vertex algebra V, an abelian group à containing A, z∈C×, and a specified full category C of strongly Ã-graded generalized V-modules with grading-preserving Möbius-module morphisms, a P(z)-tensor product of W1,W2∈C is an object T∈C and a P(z)-intertwining map ι:W1⊗W2→T̄ such that for every X∈C, composition with ι gives a natural bijection HomC(T,X)→M[P(z)]XW1,W2. Existence is an additional theorem or hypothesis, not part of the definition.

[F2]

P(z)-compatibility subspace and local grading restriction defines the transported field YP(z)′ by the displayed residue formula and defines COMPP(z) by lower truncation of this field together with the transported compatibility identity. Its P(z)-local grading restriction requires λ to be a finite sum of generalized LP(z)′(0)-eigenvectors, each homogeneous for A~; the generated doubly graded subspace must have finite-dimensional (β)[h] components and be lower truncated in each fixed integer weight string. For each P(z)-map I with target W∈C, the transpose I′(w′)(w1⊗w2)=⟨w′,I(w1⊗w2)⟩ defines an image; the definition of W1 P(z) W2 sums these images and states that transposed Jacobi and grading put each one in the stated subspace.

[F3]

Strongly graded contragredient duality for Möbius and conformal modules proves the opposite-field restricted dual, componentwise evaluation M≅M′′, and functorial restricted transposition for strongly graded generalized modules over strongly graded Möbius or conformal V, preserving the auxiliary and generalized-weight gradings and all three Möbius operators. It imposes no CFT-type hypothesis. Use the ambient strong gradings and morphisms stipulated in F1 and F2. Each global generalized-weight space here is finite dimensional, so only finitely many auxiliary degrees occur at a fixed weight; the doubly restricted dual therefore agrees with ⨁h(M[h])∗ used below. Its weight support and global grading restriction are the same as those of M.

[F4]

P(z)-intertwining map: Let V be strongly A-graded Möbius or conformal, let à contain A, and let W1,W2,W3 be strongly Ã-graded generalized V-modules; fix z∈C×. Retain the ambient strong gradings from F1 and F2. The morphisms preserve those gradings and commute with the three Möbius operators; no conformal vector, CFT-type condition or trivial auxiliary-group specialization is required. 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+1((j)+1,i)zi I((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.

Proof

1.1givenF1F2F3F4algebra

Write S=W1 P(z) W2 and T=S′. For w1,w2 define ι(w1⊗w2) in T‾=∏h(S[h])∗ by evaluation on each finite-dimensional S[h]: its pairing with s∈S is s(w1⊗w2). The value generally belongs to the completion, not to T. Each s is a finite sum of vectors in images Ij′(Xj′) by the definition of S. Grading compatibility follows from the grading of each Ij. Lower truncation follows uniformly because T is grading restricted: if its real weights are bounded below by B, then T[h−m]=0 for every integer m>Re(h)−B, independently of the vector used to test the component. The compatibility identity for s is exactly the transpose of P(z)-Jacobi for ι, and the transported L(j) identities transpose to its three required bracket identities. Thus ι is a P(z)-map. The assumption T∈C is needed here; fullness alone does not imply it.

2.1givenF1F2F3F4step 1.1algebra

For a P(z)-map I:W1⊗W2→X‾ with X∈C, the map I′:X′→S, I′(x′)(w1⊗w2)=⟨x′,I(w1⊗w2)⟩, has image in S by its defining sum. Transposed P(z)-Jacobi makes it a module homomorphism for the induced action on S. The transposed three Möbius identities also make it intertwine the transported Möbius operators, and the degree-addition condition preserves auxiliary degree; in particular it preserves generalized weights. Its restricted transpose is therefore a grading-preserving Möbius-module map S′→X′′ by F3. Identify X′′ with X using F3; since C is full and S′,X∈C, the resulting map η:T→X is a morphism of C. Evaluation of pairings gives I=η‾∘ι.

3.1F1F2F3step 2.1algebra∎

Conversely, if η:T→X has this property, transpose it and use the evaluation identifications T′=S′′≅S, X′′≅X. For every x′∈X′, its transpose must be the vector in S with values ⟨x′,I(w1⊗w2)⟩ for all w1,w2. The inclusion S↪(W1⊗W2)∗ is injective, so this vector is uniquely I′(x′). Thus η is unique. The pairing formula commutes with postcomposition, which gives naturality and the representing property.

Depends on

Dependency tree · 2 levels

Sources