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

Regular Wick-star contractions are well defined and associative

Statement

Let X=Rd, d≥1, and let W∈D′(X×X) be any continuous complex bidistribution. For a real formal parameter η and F,G∈Preg(X), define F⋆WG=∑k≥0ηkk!⟨W⊗k,F(k)(ϕ)⊗G(k)(ϕ)⟩. The pairing is over k independent pairs of variables; W⊗k is formed by iterated distributional tensor products, not by multiplying distributions at coincident points. The sum is finite because the inputs are polynomial. It defines an element of Preg(X)[η], and ⋆W is associative. Here complex conjugation is a+ib‾=a−ib for a,b∈R. If W is Hermitian in the sense ⟨W,g‾⊗f‾⟩‾=⟨W,f⊗g⟩, then (F⋆WG)∗=G∗⋆WF∗, where F∗(ϕ)=F(ϕ)‾. For ℓf(ϕ)=∫Xf(x)ϕ(x) dx, [ℓf,ℓg]⋆W=η(W(f,g)−W(g,f)),W(f,g):=⟨W,f⊗g⟩.

Facts & Assumptions

Given: [A1], the regular polynomial class, the continuous bidistribution W, and the supplier statements below.

[A1]

The formal parameter η is fixed by the involution and has no analytic or physical interpretation in this mathematical item.

[F1]

A regular polynomial is a finite sum with unique symmetric test kernels; its k-th derivative is the smooth compact kernel displayed in the definition, and complex Riemann integrals of its compact kernels are evaluated componentwise as defined there (Regular polynomial field functional algebra, Tensor-product tests are dense in smooth compact kernel topology).

[F2]

Tensor products of distributions exist as continuous distributions; their iterated pairings associate and agree on product tests (Tensor product distributions and iterated pairings).

[F3]

Pairing a distribution against a smooth parameter family with locally common compact support produces a smooth function, and derivatives pass through the pairing (Distribution pairing with smooth parameter families).

Proof

Given: [A1] and [F1]–[F3].

1.1A1F1F2F3construct

For each k, [F2] constructs W⊗k on the independent variable pairs. The kernels F(k)(ϕ) and G(k)(ϕ) in [F1] are smooth and compactly supported, so the displayed pairing is defined. In each homogeneous term of F and G, pairing the k contracted variables leaves a smooth compact kernel in the remaining variables: the support lies in the projection of the original compact coefficient supports, and [F3] passes every remaining-variable derivative through the pairing. The raw remaining-variable kernel need not be symmetric under permutations exchanging a variable from the F block with one from the G block. For each output degree r, replace it by its full symmetrization Sym⁡rh=1r!∑π∈Srh(xπ(1),…,xπ(r)). This preserves smoothness and compact support, and its field evaluation is unchanged because both the product ∏j=1rϕ(xj) and the product integration measure are invariant under permutations. The resulting symmetric coefficient therefore represents each summand in Preg(X).

2.1step 1.1F1algebra

If F and G have degrees m and n, then F(k)=0 for k>m and G(k)=0 for k>n. Hence only 0≤k≤min⁡(m,n) contribute; the sum is finite, independent of a coefficient presentation by [F1], and belongs to Preg(X)[η].

2.2F1F2step 1.1algebra

For f∈D(X), define the auxiliary formal generator by Ef(s,ϕ):=∑m≥0smℓf(ϕ)m/m! in the formal power-series ring; it is not asserted to be an element of Preg(X). For a zero-constant formal series Z, exp⁡Z means ∑r≥0Zr/r!, with all equalities interpreted coefficientwise. The k-th derivative of Ef in ϕ is skf⊗kEf. Substitution into the finite coefficient formula gives, coefficientwise in s,t,η, Ef(s)⋆WEg(t)=exp⁡ ⁣(ηstW(f,g))Esf+tg.

3.1step 2.2algebra

Applying step 2.2 twice, both bracketings of three generators equal exp⁡ ⁣(η(stW(f,g)+srW(f,h)+trW(g,h)))Esf+tg+rh, by bilinearity of W. Comparing coefficients of s,t,r proves associativity for powers of linear functionals. For distinct tests in one input, replace f by ∑j=1msjfj in the same coefficientwise identity; its coefficient of s1⋯sm is the symmetrized product ℓf1⋯ℓfm. Make this substitution independently in each of the three inputs. Thus the associator vanishes for every symmetrized elementary tensor-product coefficient kernel and for their finite sums.

4.1F1F2F3step 3.1algebra

By [F1], symmetrized finite product-test kernels are dense in every coefficient test space. Each fixed coefficient of the associator is a finite sum of compositions of continuous tensor-distribution pairings from [F2] and smooth parameter pairings from [F3], hence is continuous in the coefficient kernels. Passing to the limits of the product-test approximants from the preceding coefficient comparison proves associativity for arbitrary F,G,H∈Preg(X).

5.1F1F2step 2.1algebra∎

For linear functionals only k=0,1 occur. The k=0 term cancels in the commutator, while the k=1 terms are ηW(f,g) and ηW(g,f); this gives the displayed commutator. If W is Hermitian, conjugating each finite contraction reverses its two variable groups and gives (F⋆WG)∗=G∗⋆WF∗.

Depends on

Dependency tree · 2 levels

Sources