Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

Explicit regular quadratic Wick star product

Example

Let f,g∈D(Rd), let ℓf(ϕ)=∫f(x)ϕ(x) dx, and let W be any continuous bidistribution. For the regular quadratic functionals F(ϕ)=ℓf(ϕ)2 and G(ϕ)=ℓg(ϕ)2, the finite contraction formula is F⋆WG=ℓf2ℓg2+4ηW(f,g)ℓfℓg+2η2W(f,g)2. The formula is exact in the formal parameter η.

Facts & Assumptions

[A1]

Let d≥1, X=Rd, f,g∈D(X), and define ℓf(ϕ)=∫Xf(x)ϕ(x) dx and ℓg analogously. Let W∈D′(X×X) be a continuous complex-bilinear distribution, and let η be formal.

[F1]

The first two derivative kernels of ℓf2 are 2ℓf(ϕ)f and 2f⊗f, and higher derivatives vanish; the same formulas hold for g. The integrals defining ℓf and ℓg use the componentwise complex Riemann convention of Regular polynomial field functional algebra.

[F2]

A distribution is a continuous complex-linear functional on the test space with bilinear pairing (Distribution).

[F3]

For continuous bidistributions, the regular star product is the finite contraction sum F⋆WG=∑kηk⟨W⊗k,F(k)⊗G(k)⟩/k! (Regular Wick-star contractions are well defined and associative).

Verification

Given: [A1]–[F3].

1.1givenA1F1F2F3algebra

Substituting the derivatives in [F1] into [F3], terms with k≥3 vanish, so the only contributions are k=0,1,2.

2.1step 1.1A1F1F2F3algebra

The k=0 term is ℓf2ℓg2. The k=1 term is η⟨W,(2ℓff)⊗(2ℓgg)⟩=4ηW(f,g)ℓfℓg.

3.1step 1.1F1F2F3algebra∎

The k=2 term is η22⟨W⊗2,(2f⊗f)⊗(2g⊗g)⟩=2η2W(f,g)2, because the two independent pairings each equal W(f,g). Adding the three contributions proves the displayed formula.

Depends on

Dependency tree · 2 levels

Sources