Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (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.

A one-variable BV algebra and a classical master solution

Example

Let A=C[x,θ]/(θ2) with ∣x∣=0 and ∣θ∣=−1. Define ∂θ(f+θg)=g and let Δ=∂x∂θ. Then (A,Δ) is a BV algebra in the degree-+1 convention. The element S=x3/3 satisfies the classical master equation and its Hamiltonian differential is dS(f+θg)={S,f+θg}=x2g.

Facts & Assumptions

[F1]

BV algebra with a degree-one generator: the order condition is [[[Δ,ma],mb],mc]=0, with Δ(1)=Δ2=0 and {a,b}=(−1)∣a∣(Δ(ab)−(Δa)b−(−1)∣a∣aΔb).

[F2]

Classical and formal quantum master equations: for S∈A0, the classical master equation is {S,S}=0.

[F3]

A classical master solution defines a square-zero differential: any degree-zero classical master solution induces the square-zero map dS={S,−}.

Verification

1.1givenconstructalgebra

Every element is f(x)+θg(x) with f,g∈C[x] and θ2=0; the polynomial quotient multiplication is associative and the assigned degrees make it graded commutative. For homogeneous factors, the ordinary product rule gives the Leibniz rule for ∂x; direct expansion gives ∂θ(fθj)=fj, ∂θ(θgh)=gh, and ∂θ((θg)(θh))=0=g(θh)−(θg)h, so ∂θ is a degree-+1 graded derivation. Thus Δ(f+θg)=g′(x) has degree +1, Δ(1)=0, and Δ2=0.

2.1F1step 1.1algebra

For a homogeneous derivation D, [D,ma]=mD(a); the composition identity gives [Δ,ma]=mΔa+m∂θa∂x+(−1)∣a∣m∂xa∂θ. Commuting once more yields [ [Δ,ma],mb]=m∂θam∂xb+(−1)∣a∣m∂xam∂θb, a multiplication operator. Multiplication operators gradedly commute, so the third commutator with mc is zero and [F1]'s order condition holds.

2.2F1F2step 1.1algebra

Direct substitution in [F1] gives {f(x),θg(x)}=f′(x)g(x) because Δ(fθg)=(fg)′, Δf=0, and Δ(θg)=g′. Hence {S,θg}=x2g and {S,f}=0; also S and S2 depend only on x, so {S,S}=0 by the same formula. Thus S satisfies the CME [F2].

3.1F2F3step 2.2algebra∎

Step 2.2 gives dS(f+θg)=x2g, which is independent of θ and is killed by dS. Therefore dS2=0 directly, in agreement with [F3].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · one level

4 results within one dependency step of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources