Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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 massive Euclidean Gaussian generalized field exists

Statement

Assume the Axiom of Choice and let m>0. Write SR(R2) for the smooth real-valued functions with finite seminorms pαβ(f)=sup⁡x∣xα∂βf(x)∣ for all α,β∈N02, with the topology whose basic neighborhoods of f0 impose finitely many inequalities pαβ(f−f0)<ε with positive tolerances. Define f^(p)=∫R2e−ip⋅xf(x) d2x; this convention has inverse factor (2π)−2. For real f,g∈SR(R2) set

Cm(f,g):=∫R2f^(p)‾ g^(p)∣p∣2+m2 d2p(2π)2.

For v>0, the centered scalar normal law N(0,v) has density (2πv)−1/2e−x2/(2v) on R; N(0,0) is the point mass at zero. A finite real vector X=(X1,…,Xk) is centered jointly Gaussian with covariance matrix Σ when ∑jtjXj has law N(0,∑i,jtitjΣij) for every t∈Rk. Let SR′(R2) be the continuous real-linear dual of SR(R2), and give it the cylinder σ-algebra generated by the evaluation maps u↦u(f). There is a probability measure on this cylinder σ-algebra, equivalently a measurable SR′(R2)-valued random variable Φ, such that every finite vector (Φ(f1),…,Φ(fk)) is centered jointly Gaussian and E[Φ(f)Φ(g)]=Cm(f,g). The construction gives tempered-distribution samples on one common full-measure set; it makes no pointwise-sample-field or interaction-measure claim.

Facts & Assumptions

Given: the Axiom of Choice, its countable-family consequence, m>0, the real Schwartz test space, and the Fourier convention from the Statement.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function.

[A2]

The Axiom of Countable Choice (ACω): every countable family of nonempty sets has a choice function; this is the countable-family instance of [A1].

[F1]

Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces: under the Axiom of Choice, a consistent family of finite-dimensional probability laws on standard-Borel coordinate spaces has a unique probability law on the cylinder σ-algebra of the full product.

[F2]

Anisotropic Hermite oscillator and quadratic form basis: under Countable Choice, for N=2 and a1=a2=c=1 there is a complete orthonormal product Hermite basis with oscillator eigenvalues 2∣α∣+2.

[F3]

Rapid Hermite coefficient decay for Schwartz functions: for this basis, every Schwartz test has weighted-square-summable Hermite coefficients of every polynomial order, and Parseval gives its unweighted coefficient norm.

[F4]

Standard Borel spaces: the Borel measurable space of a Polish space is standard Borel; R with its usual complete separable metric is such a space.

[F5]

Euclidean Gaussian transform with the 2π normalization: the Gaussian integral normalizes γ(dx)=(2π)−1/2e−x2/2 dx to a probability measure.

[F6]

Fubini's theorem for L^1 functions on a sigma-finite product: finite products of the Gaussian density have the stated lower-dimensional marginals after integrating out the other coordinates.

[F7]

Fourier transform on complex L1 classes: F2πf(ξ)=∫e−2πix⋅ξf(x) d2x.

[F8]

Fourier transform is a topological automorphism of Schwartz space: F2π maps Schwartz space continuously and bijectively to itself, with inverse RF2π.

[F9]

Parseval pairing on Schwartz space: for Schwartz functions, ∫F2πf F2πg‾=∫fg‾.

[F10]

Fourier expansion in a Hilbert space: for a complete orthonormal family, the coefficient expansion converges in norm and Parseval's identity holds.

[F11]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: for a square-summable family, ∣∑aαbα∣≤(∑∣aα∣2)1/2(∑∣bα∣2)1/2, first for finite sums and then by limits.

[F12]

Schwartz topology and convergence: the Schwartz topology is generated by finite intersections of positive-radius seminorm balls. The real test space has the induced real topology.

[F13]

Uniqueness of a law from its characteristic function: under AC, two Borel probability laws on R with the same characteristic function t↦∫eitxdμ(x) are equal.

Proof

technique · direct

Given: [A1]–[A2], m>0, the suppliers [F1]–[F9], and real Schwartz tests on R2.

1.1A1F1F4F5F6construct

Let I=N02, enumerated by total degree and lexicographic order. For each finite F⊂I, let μF have density ∏α∈F(2π)−1/2e−xα2/2 on RF. [F5] makes these probability laws; integrating out coordinates with [F6] proves their consistency. Each coordinate space (R,B(R)) is standard Borel by [F4]. Applying [F1] with [A1] yields Ω=RI with its cylinder σ-algebra and a probability P having these finite marginals. The coordinate variables ξα(ω)=ωα are therefore independent standard normals.

1.2F7F8givenalgebra

For p∈R2 put wm(p)=(∣p∣2+m2)−1/2. Since m>0, wm is smooth, and every derivative is bounded: its derivatives are finite sums of polynomial factors divided by positive powers of ∣p∣2+m2, bounded near the origin and decaying at infinity. The product rule therefore shows multiplication by wm maps Schwartz space continuously to itself. Define Tmf=F2π−1(wm(2π⋅)F2πf). By [F8], Tmf is Schwartz; because wm is real and even, Tmf is real for real f. Under the exact convention in the Statement, f^(p)=F2πf(p/(2π)), and the change of variables p=2πξ gives Tmf^(p)=wm(p)f^(p).

2.1F5F6step 1.1algebra

For a finite initial segment IN of the fixed enumeration set SN=∑α∈IN(1+∣α∣)−4ξα2. The density in [F5] is normalized, and integration by parts using (−xe−x2/2)′=(x2−1)e−x2/2 gives Eξα2=1. Hence ESN=∑α∈IN(1+∣α∣)−4≤∑n≥0(n+1)(n+1)−4=∑n≥0(n+1)−3=:C<∞: grouping n+1 in dyadic blocks [2j,2j+1) bounds each block by 2j2−3j=2−2j, a summable geometric series. Markov's inequality, which follows from 1{SN>M}≤SN/M, gives P(SN>M)≤C/M. Since the events increase to {S:=∑α(1+∣α∣)−4ξα2>M}, countable additivity gives P(S>M)≤C/M; letting integer M→∞ shows S<∞ on a common event Ω0 of probability one.

3.1A2F2F3F11F12step 2.1algebra

For f∈SR(R2) put cα(f)=⟨f,hα⟩. On Ω0, [F11] and [F3] give ∑α∣ξαcα(f)∣≤S1/2(∑α(1+∣α∣)4∣cα(f)∣2)1/2<∞. Thus W0(f):=∑αξαcα(f) converges absolutely for every f on the same event, is real-linear, and satisfies ∣W0(f)∣≤S1/2∥H2f∥2. The last quantity is a continuous Schwartz seminorm by [F3], so each sample is a tempered distribution. Set W0=0 outside Ω0. Every evaluation W0(f) is measurable as the almost-sure limit of measurable finite sums, hence W0 is measurable for the cylinder σ-algebra.

4.1F2F5F10F13step 1.1step 3.1algebra

The partial sums for W0(f) converge in L2(Ω,P) as well: independence, unit variance, and Parseval in [F10] make their squared L2 tail equal to the corresponding tail of ∑α∣cα(f)∣2=∥f∥22. For any finite real combination ∑jtjW0(fj), a finite partial sum is a linear combination of independent standard normals, with characteristic function ∏αe−t2cα2/2=e−t2∑αcα2/2; by [F10] its variance converges to ∥∑jtjfj∥22. If XN→X in L2, then ∣EeitXN−EeitX∣≤∣t∣ E∣XN−X∣≤∣t∣∥XN−X∥2→0, so the limit has the centered normal characteristic function with that variance. For positive variance this is the characteristic function of the density defining N(0,v), by [F5] and scaling; at zero variance it is the characteristic function of the point mass at zero. Applying [F13] to these Borel probability laws identifies the limit law. Hence the family is jointly Gaussian, centered, and E[W0(f)W0(g)]=∫f(x)g(x) d2x.

5.1F7F9F12step 4.1step 1.2algebra∎

Set Φ(f)=W0(Tmf). Each sample in Ω0 is a continuous real-linear functional of f because both W0 and Tm are continuous on Schwartz space; outside Ω0 it is zero. Thus Φ is a measurable SR′-valued random variable for the cylinder σ-algebra. From step 4.1 its covariance is E[Φ(f)Φ(g)]=∫Tmf(x)Tmg(x) d2x. Applying [F9] and changing variables p=2πξ gives (2π)−2∫Tmf^(p)Tmg^(p)‾ d2p. Since f,g are real, f^(−p)=f^(p)‾ and g^(−p)=g^(p)‾; the substitution p↦−p changes this to (2π)−2∫f^(p)‾g^(p)wm(p)2 d2p=Cm(f,g) by step 1.2. The finite-dimensional distributions remain centered Gaussian by step 4.1 and linearity of Tm.

Depends on

Dependency tree · 2 levels

Sources