Alphabeta Math
Pipeline-generated
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.

Finite Euclidean quartic interacting measure

1 · Prerequisites

2 · Summary

For finite N, this page defines a Borel Gaussian reference law on RN with finite covariance and its normalized tilt by a nonnegative homogeneous quartic polynomial. It proves all polynomial moments are finite; the partition function and polynomial insertions have derivatives of every finite order for λ>0, extending continuously by right derivatives at λ=0. It also establishes the finite-dimensional Wick pairing formula and gives finite-order asymptotic expansions with explicit order-dependent remainders. Wick-normal powers are defined by a covariance generating function. These are exact finite-dimensional mathematical constructions under the stated normal-law and Choice hypotheses; no continuum Euclidean field measure, reflection-positive reconstruction, or cutoff removal is asserted.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite Euclidean quartic interacting measure

Definition

Assume the Axiom of Choice. Let N≥1 be finite and let C be a real symmetric positive-semidefinite N×N matrix; positive-semidefinite means uTCu≥0 for every u∈RN. The centered multivariate normal Borel probability law with covariance C is γC:=NN(0,C) as defined by Multivariate normal law, including singular covariance: every linear projection q↦uTq has scalar normal law N(0,uTCu), and the law exists even when C is singular. Here N(0,σ2) is the law specified in Standard normal and normal laws, with density e−x2/2/2π for the standard case.

Let U:RN→[0,∞) be a real homogeneous quartic polynomial, meaning U is a polynomial and U(sq)=s4U(q) for all s∈R and q∈RN. For a coupling λ≥0, define the partition integral and its weighted measure by

ZC,U(λ):=∫RNe−λU(q) dγC(q),νC,U,λ(A):=∫Ae−λU(q) dγC(q)

for Borel A⊆RN. Whenever 0<ZC,U(λ)<∞, the finite Euclidean interacting measure is the Borel probability measure

dμC,U,λ(q):=ZC,U(λ)−1e−λU(q) dγC(q).

For a polynomial P:RN→R with finite integral, write ⟨P⟩C,U,λ:=∫P dμC,U,λ. The exact supplier Actual finite Euclidean polynomial measure and moments ↗ proves that ZC,U(λ) is positive and finite and that every polynomial insertion is integrable. This is a Borel measure on finite-dimensional RN; it is not a measure on distributions on continuum Euclidean spacetime and does not by itself assert reflection positivity or reconstruction of a continuum field.

Facts & Assumptions

Given: Assume the Axiom of Choice and take N,C,U,λ as in the Definition.

[A1]

The Axiom of Choice is the stated hypothesis of the finite-dimensional normal-law construction. The Axiom of Choice

[F1]

For finite N and positive-semidefinite C, γC=NN(0,C) is a Borel probability law on RN. Multivariate normal law, including singular covariance

[F2]

A nonnegative measurable density f relative to a measure μ defines the measure f dμ by (f dμ)(A)=∫Af dμ. The measure with density f relative to μ

[F3]

For nonnegative measurable f, the set function A↦∫Af dμ is a measure. The indefinite integral of a nonnegative measurable function is a measure

[F4]

The real exponential is the all-real power series and is continuous and strictly increasing; for x≥0 its nonnegative terms give exp⁡(x)≥1, and it is positive with exp⁡(−x)=1/exp⁡(x). Hence 0<exp⁡(−x)≤1 for x≥0. The real exponential function and the number e by a power series, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x), The exponential function is strictly increasing

Proof

technique · direct verification of the density construction
1.1A1F1F2F3F4givenalgebra

A polynomial U is continuous and hence Borel measurable. Since U≥0 and λ≥0, [F4] gives f(q):=exp⁡(−λU(q)) Borel with 0<f(q)≤1. Thus Z=∫f dγC is finite, and [F2] defines ν=f dγC; [F3] gives its measure property. Its total mass is ν(RN)=Z by definition.

2.1F3givenstep 1.1algebra∎

Under the displayed side condition 0<Z<∞, the scaled measure μ=Z−1ν is a Borel measure and has total mass Z−1ν(RN)=1, so it is a probability measure by [F3] and step 1.1. For a polynomial P integrable under μ, ⟨P⟩C,U,λ is then its well-defined integral by the notation in the Definition.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite Gaussian normalization and Wick moments

Statement

Assume the Axiom of Choice. Let N≥1 be finite, let C be a real symmetric positive-semidefinite N×N covariance matrix, and let Q∼γC=NN(0,C) be the law of Finite Euclidean quartic interacting measure. For k≥0 and vectors u1,…,uk∈RN, every product ∏j=1k(ujTQ) is integrable. For k=0 its expectation is 1. If k is odd, its expectation is 0; if k=2m, then

E ⁣[∏j=12mujTQ]=∑π∈Pair⁡(2m)∏{a,b}∈πuaTCub,

where Pair⁡(2m) is the finite set of partitions of {1,…,2m} into unordered two-element subsets. Thus every real polynomial P in Q satisfies E∣P(Q)∣<∞, and its expectation E[P(Q)] is computed by expanding P into monomials and applying finitely many covariance pairings.

Facts & Assumptions

Given: Assume the Axiom of Choice. Let N≥1, C be a real symmetric positive-semidefinite matrix, and Q∼γC.

[A1]

The Axiom of Choice is explicitly assumed; the normal-law suppliers below use it. The Axiom of Choice

[F1]

Finite Euclidean quartic interacting measure defines γC=NN(0,C) as a Borel probability law on RN. The supplied multivariate normal law exists under Choice and every linear projection uTQ has law N(0,uTCu). Multivariate normal law, including singular covariance

[F2]

The scalar standard normal has density e−x2/2/2π, and N(0,σ2) is its pushforward by x↦σx, including the point mass at zero when σ=0. Standard normal and normal laws

[F3]

For X∼NN(0,C), the characteristic function is φX(t)=e−tTCt/2 for t∈RN. Characteristic function of a multivariate normal law

[F4]

If E∣X∣k<∞, then φX(j)(t)=E[(iX)jeitX] for 0≤j≤k. Moments give derivatives of the characteristic function

[F5]

For k measurable factors in Lk, their product is integrable; this follows by iterating generalized H"older with exponents chosen so the reciprocal exponents sum to one. Generalized Holder inequality puts products into Lr

[F6]

∫Re−x2 dx=π and a positive scalar substitution gives the corresponding finite Gaussian integral with any positive quadratic scale. The Gaussian integral ∫−∞∞e−x2 dx=π, Change of variable in an improper integral

[F7]

For x≥0 and every integer r≥0, ex≥xr/r! by the nonnegative terms in the defining power series. The real exponential function and the number e by a power series

Proof

technique · direct, via scalar Gaussian moments and polarization
1.1F2F6F7F8algebra

Let Z∼N(0,1). For an integer k≥0, choose an integer r with 2r≥k. On ∣x∣≥1, [F7] gives ex2/4≥(x2/4)r/r!, so ∣x∣ke−x2/2≤4rr!e−x2/4. The right side is integrable by [F6], and the integrand is bounded on [−1,1]. Since [F2] represents any scalar N(0,v) as vZ with v supplied by [F8], every scalar normal has finite absolute moments of every integer order, including the degenerate v=0 case.

2.1A1F1F5step 1.1algebra

For fixed k≥1, define Tk(u1,…,uk):=E∏j=1k(ujTQ). Each projection has a finite kth absolute moment by step 1.1 and [F1]. Applying [F5] successively shows the product is integrable. Linearity of each scalar projection and of the integral makes Tk a symmetric k-linear form. The law exists under the stated Choice hypothesis [A1]. Since every polynomial is a finite linear combination of coordinate monomials, the triangle inequality also gives every polynomial a finite absolute moment.

3.1F1F3F4F7step 1.1step 2.1algebra

On the diagonal, Tk(u,…,u)=E[(uTQ)k]. Put v=uTCu≥0. By [F1], uTQ∼N(0,v), so [F3] gives its characteristic function e−vt2/2. At zero, [F4] gives φ(k)(0)=ikE[(uTQ)k]; extracting the tk coefficient of e−vt2/2 and dividing by ik yields zero for odd k, and for k=2m gives T2m(u,…,u)=(2m)!2mm!vm=(2m−1)!! (uTCu)m. The identity also holds for v=0, when the projected law is the point mass at zero.

4.1step 2.1step 3.1constructalgebra

For even k=2m, define W2m(u1,…,u2m) by the pairing sum in the Statement; for odd k, define Wk=0. This is a symmetric k-linear form. On the diagonal, every pairing contributes (uTCu)m, and there are (2m−1)!! pairings: pair index 1 with one of 2m−1 indices and repeat on the remaining 2m−2. Hence Wk(u,…,u)=Tk(u,…,u) by step 3.1, also for odd k.

5.1step 2.1step 4.1givenalgebra∎

For k≥1, two symmetric k-linear forms agreeing on every diagonal agree everywhere. Indeed, for their difference A, expand ∑ε∈{−1,1}k(∏j=1kεj)A ⁣(∑iεiui,…,∑iεiui). In the multilinear expansion, the sum over signs cancels every term unless each label 1,…,k occurs an odd number of times among the k slots. Thus every surviving term uses each label once; symmetry makes all k! such terms equal to A(u1,…,uk), and the sign sum is 2kk!A(u1,…,uk). Since the diagonal of A=Tk−Wk vanishes by step 4.1, this sum is zero and Tk=Wk. For k=0, the empty product has expectation one and Pair⁡(0) contains just the empty pairing, whose empty product is one, so the formula also holds.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Actual finite Euclidean polynomial measure and moments

Statement

Assume the Axiom of Choice. Let N≥1 be finite, let C be a real symmetric positive-semidefinite covariance matrix, let γC=NN(0,C), let U:RN→[0,∞) be a real homogeneous quartic polynomial, and let λ≥0. Define Z(λ)=∫e−λU dγC and NP(λ)=∫Pe−λU dγC for every real polynomial P.

Then 0<Z(λ)≤1, and μλ:=Z(λ)−1e−λUγC is a Borel probability measure. Every polynomial insertion is integrable under μλ. For each integer r≥0,

Z(r)(λ)=(−1)r∫Ure−λU dγC,NP(r)(λ)=(−1)r∫PUre−λU dγC

for λ>0, with continuous right derivatives of every finite order at λ=0. No continuum field measure is asserted.

Facts & Assumptions

Given: Assume the Axiom of Choice and use C,U,γC,Z,NP as in the Statement.

[A1]

The Axiom of Choice is an explicit hypothesis of the finite-dimensional normal-law supplier and is carried here. The Axiom of Choice

[F1]

Finite Euclidean quartic interacting measure defines γC, Z(λ), and the density-weighted measure.

[F2]

Every polynomial insertion has finite absolute Gaussian moment, and its covariance pairings are given by Wick's formula. Finite Gaussian normalization and Wick moments

[F3]

If fn→f almost everywhere under a measure and ∣fn∣≤g for one integrable g, then ∫fn→∫f. Dominated convergence

[F4]

For nonnegative measurable w, the set function A↦∫Aw dγC is a measure; dividing by its positive total mass normalizes it. The indefinite integral of a nonnegative measurable function is a measure, The measure with density f relative to μ

[F5]

For x≥0 and every integer n≥0, the real exponential power series gives exp⁡(x)≥xn/n!; the exponential is positive and strictly increasing, with exp⁡(0)=1. Thus 0<exp⁡(−x)≤1 for x≥0. The real exponential function and the number e by a power series, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x), The exponential function is strictly increasing

[F6]

The exponential is C∞ and has derivative itself. The exponential function is smooth and (exp⁡)′=exp⁡

[F7]

The chain rule differentiates a composition of totally differentiable maps. The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)

[F8]

If a scalar function is continuous on a closed interval and differentiable in its interior, its difference quotient equals an interior derivative at some point. The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a)

Proof

technique · direct
1.1A1F1F5algebra

Since U(q)≥0 and λ≥0, [F5] gives 0<exp⁡(−λU(q))≤1 for every q, so Z(λ)≤1. For each positive integer n, let En={q:exp⁡(−λU(q))≥1/n}. These are Borel and their union is RN, because the integrand is strictly positive at every q. Since γC is a probability measure, not all En can have measure zero: otherwise countable subadditivity would give γC(RN)=0. Thus some En has positive measure, and Z(λ)≥γC(En)/n>0.

1.2F2F3F5F6F7F8algebra

Fix r≥0. For s=0,1,…,r, [F6] and [F7] give the pointwise derivative (−1)sP(q)U(q)sexp⁡(−λU(q)) and its next derivative (−1)s+1P(q)U(q)s+1exp⁡(−λU(q)). If λ0>0 and ∣h∣<λ0/2, [F8] bounds the difference quotient of the sth derivative by ∣P(q)∣U(q)s+1exp⁡(−λ0U(q)/2), since every intermediate parameter is at least λ0/2 and [F5] makes the exponential increasing. Put x=U(q). If x=0 the scalar factor is zero; if x>0, put y=λ0x/4. The power-series estimate in [F5] at 2y gives exp⁡(2y)≥(2y)s+1/(s+1)!, so its reciprocal gives xs+1exp⁡(−λ0x/2)≤(2/λ0)s+1(s+1)!. Thus these difference quotients are bounded by a finite constant times ∣P(q)∣, integrable by [F2]. [F3] permits differentiation under the integral inductively through order r, giving NP(r)(λ)=(−1)r∫PUrexp⁡(−λU) dγC for λ>0. Taking P=1 gives the formula for Z.

2.1F1F2F4F5step 1.1

The nonnegative Borel density exp⁡(−λU)/Z(λ) has integral one by the definition of Z and step 1.1. By [F4], it defines a Borel probability measure μλ. For any polynomial P, [F2] gives ∫∣P∣ dγC<∞; since [F5] gives exp⁡(−λU)≤1 and step 1.1 gives Z(λ)>0, ∫∣P∣ dμλ≤Z(λ)−1∫∣P∣ dγC<∞.

3.1F2F3F5F6F7F8step 1.2givenalgebra∎

At λ=0, use right limits and right difference quotients. For r=0, dominated convergence [F3] with dominator ∣P∣ and [F5] gives NP(λ)→NP(0) as λ↓0; taking P=1 gives the same for Z. Now fix r≥1. For each s=0,1,…,r−1 and h>0, [F8] bounds the difference quotient of (−1)sPUsexp⁡(−λU) at zero by ∣P∣Us+1, since [F5] gives 0<exp⁡(−cU)≤1 for c≥0. This bound is integrable by [F2]. Dominated convergence [F3] inductively gives NP,+(r)(0)=(−1)r∫PUr dγC; applying [F3] to the formula in step 1.2 as λ↓0 shows these derivatives converge continuously to their endpoint values. Taking P=1 gives the same assertions for Z.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite covariance Wick normal powers

Definition

Assume the Axiom of Choice, let Q∼NN(0,C) be the centered finite-dimensional Gaussian vector of Finite Gaussian normalization and Wick moments, and write Cjj=E[Qj2]≥0 for the variance of its jth coordinate. For each coordinate j and integer n≥0, its finite covariance Wick normal power is the polynomial :Qjn:C defined by the formal generating identity

exp⁡ ⁣(tQj−12t2Cjj)=∑n=0∞:Qjn:C tnn!.

Equivalently,

:Qjn:C=n!∑s=0⌊n/2⌋(−Cjj/2)sQjn−2ss!(n−2s)!,:Qj4:C=Qj4−6CjjQj2+3Cjj2.

This is a finite-dimensional polynomial definition; it does not define a product of unsmeared continuum fields.

Facts & Assumptions

Given: Assume the Axiom of Choice, let Q∼NN(0,C), and fix a coordinate j with 1≤j≤N.

[A1]

The Axiom of Choice is explicit in the finite Gaussian-law construction. The Axiom of Choice

[F1]

The finite Gaussian vector has covariance C, so Cjj=E[Qj2] is a well-defined nonnegative variance. Finite Gaussian normalization and Wick moments

Proof

technique · formal power-series coefficient extraction
1.1A1F1givenalgebra

Multiply the formal series for etQj and e−Cjjt2/2. The coefficient of tn is the finite sum over 0≤s≤⌊n/2⌋ of Qjn−2s(−Cjj/2)s/((n−2s)!s!). By the defining identity, multiplying this coefficient by n! gives the displayed formula for :Qjn:C. This is formal coefficient algebra and requires no convergence assertion.

2.1step 1.1algebra∎

For n=4, the terms s=0,1,2 are respectively Qj4, −6CjjQj2, and 3Cjj2, which gives the stated quartic Wick polynomial. The formula also covers Cjj=0.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite interacting asymptotic Wick expansion with remainder

Statement

Assume the Axiom of Choice and the hypotheses and notation of Finite Euclidean quartic interacting measure. Let P∈R[q1,…,qN], Z(λ)=EγC[e−λU], NP(λ)=EγC[Pe−λU], and ⟨P⟩λ=NP(λ)/Z(λ). For every integer M≥0,

Z(λ)=∑j=0Mzjλj+RM,1(λ),zj=(−1)jj!EγC[Uj],∣RM,1(λ)∣≤λM+1(M+1)!EγC[UM+1]

for λ≥0. Likewise,

NP(λ)=∑j=0Maj(P)λj+RM,P(λ),aj(P)=(−1)jj!EγC[PUj],∣RM,P(λ)∣≤λM+1(M+1)!EγC[∣P∣UM+1].

Define b0(P)=a0(P) and, for m≥1, bm(P)=am(P)−∑j=1mzjbm−j(P). Then

⟨P⟩λ=∑j=0Mbj(P)λj+O(λM+1)as λ↓0.

Every coefficient is computed from finitely many Gaussian polynomial moments and hence from finitely many covariance pairings by Finite Gaussian normalization and Wick moments. These estimates hold separately for each finite M; they do not assert convergence of the infinite formal series or any continuum limit.

Facts & Assumptions

Given: Assume the Axiom of Choice, fix N,C,U as in Finite Euclidean quartic interacting measure, take P∈R[q1,…,qN], and let λ≥0.

[A1]

The Axiom of Choice is carried from the finite-dimensional normal-law construction. The Axiom of Choice

[F1]

The Borel probability γC, the nonnegative quartic U, Z(λ) and the polynomial insertion NP(λ) are defined in Finite Euclidean quartic interacting measure.

[F2]

All Gaussian polynomial moments are absolutely finite and are sums over the finite set of covariance pairings. Finite Gaussian normalization and Wick moments

[F3]

The normalized measure exists, Z(0)=1, and Z(λ)→1 as λ↓0. Actual finite Euclidean polynomial measure and moments

[F4]

For a CM+1 function on an interval, the Lagrange remainder is f(M+1)(ξ)xM+1/(M+1)! for some ξ between 0 and x. The Lagrange and Cauchy forms of Taylor's remainder

[F5]

The real exponential is smooth with derivative itself, and the chain rule applies to its composition with x↦−x. The exponential function is smooth and (exp⁡)′=exp⁡, The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)

[F6]

For x≥0, the real exponential power series gives exp⁡(x)≥1, and the exponential is positive with exp⁡(−x)=1/exp⁡(x). Thus 0<exp⁡(−x)≤1. The real exponential function and the number e by a power series, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x)

Proof

technique · direct finite-order remainder and formal division
1.1A1F4F5F6given

By [F5], f(x)=exp⁡(−x) is CM+1 and ∣f(M+1)(ξ)∣=exp⁡(−ξ). Apply [F4] at x=λU(q)≥0; [F6] gives exp⁡(−ξ)≤1. Thus pointwise ∣exp⁡(−λU(q))−∑j=0M(−λU(q))jj!∣≤λM+1U(q)M+1(M+1)!. The case λU(q)=0 has zero remainder.

1.2givenalgebra

Let ZM(λ)=∑j=0Mzjλj and AM(λ)=∑j=0Maj(P)λj. By the recurrence defining bj(P), every coefficient through degree M in AM(λ)−(∑j=0Mbj(P)λj)ZM(λ) is zero, because z0=1. The remaining polynomial terms have degree at least M+1, so their absolute value is bounded by a finite constant times λM+1 on 0≤λ≤1.

2.1step 1.1F1F2algebra

Integrate the inequality in step 1.1 against γC to obtain the stated partition-function expansion and bound. Multiply the same pointwise inequality by ∣P(q)∣ and integrate to obtain the numerator expansion and bound. Every right-hand expectation is finite by [F2].

3.1step 2.1step 1.2F2F3algebra∎

On 0≤λ≤1, the polynomial BM(λ)=∑j=0Mbj(P)λj is bounded. Using the remainder bounds in step 2.1 and the polynomial identity in step 1.2 therefore gives ∣NP(λ)−BM(λ)Z(λ)∣≤KMλM+1 for some finite KM. As λ↓0, exp⁡(−λU(q))→1 pointwise and 0<exp⁡(−λU(q))≤1 by [F6], so [F3] gives Z(λ)→Z(0)=1. Choose δ>0 such that Z(λ)≥1/2 for 0≤λ<δ. Dividing by Z(λ) yields ∣⟨P⟩λ−BM(λ)∣≤2KMλM+1 there. Finally, [F2] writes every coefficient moment as a finite covariance-pairing sum; no limit in M was taken.

5 · Examples, experiments and counterexamples

None yet.

Sources