Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-11-04 (gpt-6-luna)
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 one-field N=2 Landau–Ginzburg Jacobian algebra has dimension k+1

Facts & Assumptions

Given: Let k∈Z≥1 and λ∈C∖{0}, and set W(X)=λXk+2/(k+2). Use the formal derivative and Jacobian quotient of One-field Landau–Ginzburg Jacobian algebra.

[F1]

One-field Landau–Ginzburg Jacobian algebra: Jac⁡(W)=C[X]/(W′(X)), with the formal derivative defined by (Xn)′=nXn−1 and the ideal (W′) defined in the commutative ring C[X].

[F2]

The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i and C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2): C is a field containing the embedded real field, so every positive integer such as k+2 is a nonzero complex scalar and every nonzero complex number is invertible.

[F3]

The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution: C[X] consists of finitely supported coefficient sequences with coefficientwise addition and convolution multiplication.

[F5]

The ideal generated by a subset and principal ideals and In a commutative ring, (S) consists of finite sums ∑risi, and (a)=Ra: in a commutative ring the ideal generated by a single element a is exactly Ra={ra:r∈R}.

[F6]

Vector space over a field: a complex vector space has an abelian-group addition and a scalar map satisfying the vector-space axioms.

[F7]

The quotient ring R/I with (r+I)(s+I)=rs+I, The quotient vector space V/W and its canonical projection, and Coset equality, well-defined quotient operations, and the canonical projection with kernel W: for a linear subspace I of a complex vector space V, the same cosets V/I carry the quotient vector-space operations [p]+[q]=[p+q] and a[p]=[ap]; for an ideal I in a ring, the quotient-ring elements are those same additive cosets.

[F8]

Linear subspace of a vector space: a subset containing zero and closed under addition and complex scalar multiplication is a linear subspace.

Statement

For W(X)=λXk+2/(k+2) with k≥1 and λ≠0, the Jacobian algebra is Jac⁡(W)≅C[X]/(Xk+1), with basis [1],[X],…,[Xk] and complex dimension k+1.

Proof

1.1givenF1F2algebra

By the derivative definition in [F1], W′(X)=λXk+1. Since λ≠0 is a unit by [F2], the ideals (W′) and (Xk+1) are equal: each generator is a unit multiple of the other. Thus the quotient in [F1] is C[X]/(Xk+1).

1.2F2F3F4F6algebra

Define scalar multiplication on C[X] by a⋅∑jbjXj=∑j(abj)Xj. Its addition is coefficientwise; the additive-group laws follow coefficientwise from the ring structure [F4], and the scalar distributivity, associativity, and identity axioms follow coefficientwise from the field laws [F2] and the polynomial operations [F3]. Hence this makes C[X] a complex vector space in the sense of [F6].

1.3F3F4F5F8algebra

Let I=(Xk+1). By [F5], I={qXk+1:q∈C[X]}. It contains zero; if qXk+1,q′Xk+1∈I, their sum is (q+q′)Xk+1∈I; and for a∈C, a⋅(qXk+1)=(a⋅q)Xk+1∈I. Thus I is a linear subspace of C[X] by [F8].

2.1F1F6F7step 1.2step 1.3

By [F7] and step 1.3, the additive cosets C[X]/I in the quotient-ring construction of [F1] carry the quotient vector-space operations [p]+[q]=[p+q] and a[p]=[a⋅p]. Therefore the quotient ring in step 1.1 has this specified complex vector-space structure.

3.1givenF3F9step 1.1step 2.1algebra

For a finitely supported polynomial p(X)=∑j=0NajXj, extend its coefficient sequence by aj=0 for every j>N, and write p=qXk+1+r, where q=∑j=k+1NajXj−k−1 (the zero polynomial if N≤k) and r=∑j=0min⁡(N,k)ajXj. Then [p]=[r]=∑j=0kaj[Xj] in the quotient vector space, so every quotient vector is a finite linear combination of B={[1],[X],…,[Xk]}. The span of B is a linear subspace containing B by the span definition in [F9], so it contains every such combination; hence B spans the quotient.

3.2givenF3F5F7F9step 2.1algebra

Suppose ∑j=0kaj[Xj]=0. By quotient-coset equality this means r=∑j=0kajXj∈I. By [F5], r=qXk+1 for some polynomial q. Convolution multiplication in [F3] gives zero coefficients in degrees 0,…,k for qXk+1, whereas those coefficients of r are a0,…,ak; hence each aj=0. The finite-list criterion [F9] gives linear independence of the displayed classes.

4.1F2F9step 3.1step 3.2∎

Let B={[1],[X],…,[Xk]}. The map j↦[Xj] from {0,1,…,k} onto B is injective: if [Xi]=[Xj] for i≠j, their difference gives a nontrivial vanishing linear combination, contradicting step 3.2. To check independence of the subset B, take any injective finite list from B and assign its coefficients to the distinct exponent indices of its entries, with zero coefficients at the unused indices; step 3.2 forces all coefficients to vanish. Thus B is linearly independent as a subset. Together with spanning from step 3.1, [F9] makes B a basis with k+1 elements, so the dimension definition in [F9] gives dim⁡CJac⁡(W)=k+1. This is an algebraic quotient calculation only; no infrared-CFT identification is part of this theorem.

Depends on

Dependency tree · 2 levels

Sources