Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Massive free Euclidean covariance is reflection positive

Statement

Assume the Axiom of Choice. Let d≥1 be an integer, Ed=R×Rd−1, and m>0. Set ΔE=∂t2+∑j=1d−1∂xj2, and for p=(p0,k)∈Rd use the Fourier transform f^(p)=∫Ede−ip⋅xf(x) dx and its blockwise version on products. When d=1, give R0 its one-point measure of mass one. For Ψ∈S(Ed×Ed) and N∈N, write

PN(Ψ)=max⁡∣α∣,∣β∣≤Nsup⁡(x,y)∈Ed2∣(x,y)α∂βΨ(x,y)∣.

Define the translation-invariant two-point distribution Cm(2) by its double Fourier formula

⟨Cm(2),Φ⟩=(2π)−d∫RdΦ^(−p,p)p02+∣k∣2+m2 dp,Φ∈S(Ed×Ed).

For f,g∈S(Ed) put Cm(f,g)=⟨Cm(2),f⊗g⟩. Then Cm(fˉ,f)≥0. For f,g∈Cc∞(Ed,+;C), where Ed,+={t>0}, let ϑ(t,x)=(−t,x) and f^(t,k)=∫Rd−1e−ik⋅xf(t,x) dx. With ωk=∣k∣2+m2,

Cm(f∘ϑ‾,g)=∫Rd−1dk(2π)d−12ωk ∫0∞e−ωktf^(t,k) dt‾∫0∞e−ωksg^(s,k) ds.

Thus the reflected two-point form is a Gram form. Define S0=1, Sn=0 for odd n, and for even n=2r define the Schwinger distributions by

⟨S2r,f1⊗⋯⊗f2r⟩=∑π∈Pair⁡(2r)∏{i,j}∈πCm(fi,fj),

where Pair⁡(2r) is the finite set of partitions of {1,…,2r} into two-element subsets. These are tempered distributions whose associated normalized moment functional on Td is positive and reflection positive on the positive-time algebra. This assertion does not assert a probability measure on S′(Ed) or any Osterwalder–Schrader reconstruction.

Facts & Assumptions

Given: Full Axiom of Choice, an integer d≥1, a parameter m>0, the Fourier convention and Cm(2) in the Statement, and the positive-time algebra of Definition Euclidean Schwinger hierarchies and controlled limit data.

[A1]

Assume the full Axiom of Choice; it is an explicit hypothesis of the finite-dimensional normal-law supplier. The Axiom of Choice

[F1]

Euclidean Schwinger hierarchies and controlled limit data: Sd,n=S(Edn), Td is the algebraic tensor test algebra, and Θ is the anti-linear time-reflection involution used to form ωS(Θa a).

[F2]

Tensor products of tempered distributions: finite tensor products of tempered distributions are tempered, are uniquely determined by their Schwartz product-test values, and associate.

[F3]

Positive tempered moments on the tensor test algebra: at d=4, the tensor test algebra, its involution, and ordinary positivity ωS(1)=1, ωS(a∗a)≥0 have exactly the convention used here; the dimension-d version is defined in [F1].

[F4]

Finite Euclidean quartic interacting measure: under the Axiom of Choice, for every finite positive-semidefinite covariance matrix G, γG=NN(0,G) is a Borel probability law, including singular G.

[F5]

Finite Gaussian normalization and Wick moments: under full Choice, moments of every finite centered Gaussian vector are finite and equal the sum over covariance pairings.

[F6]

Fourier transform of a tempered distribution and Fourier transform is a topological automorphism of Schwartz space: the Fourier transform maps Schwartz functions continuously to themselves and extends by bilinear transposition to tempered distributions.

[F7]

Fourier inversion on Schwartz space: with the e−2πix⋅ξ convention, Fourier inversion holds on Schwartz functions; the substitution p=2πξ gives the stated e−ip⋅x convention and factor (2π)−d.

Proof

technique · direct Fourier-kernel construction and finite Gaussian Wick pairing

Given: [A1], m>0, d≥1, and [F1]–[F7].

1.1A1F6F7givenalgebra

The full Axiom of Choice assumed in [A1] implies Countable Choice: if (Xn)n∈N is any sequence of nonempty sets, AC supplies a choice function g on the family {Xn:n∈N}, and n↦g(Xn) chooses from every Xn. Thus the actual Countable Choice hypotheses of [F6] and [F7] are satisfied before those suppliers are used. The full Fourier transform Φ^ of Φ∈S(Ed×Ed) is Schwartz by [F6]. For ∣p∣≥1, some coordinate pj satisfies ∣pj∣≥∣p∣/d; the monomial-weight seminorm PN includes the weight given by the Nth power of that coordinate in the first Fourier block. For ∣p∣<1, its zero-weight seminorm bounds the value. Thus, with the finite dimension/order constant Kd,N:=2NdN/2, ∣Φ^(−p,p)∣≤Kd,NPN(Φ^)(1+∣p∣)−N. For an integer N>d, this proves absolute convergence and bounds the defining pairing by (2π)−dm−2Kd,NPN(Φ^)∫Rd(1+∣p∣)−N dp. The last integral is finite: dyadic annuli have volume O(2jd) while the integrand is O(2−jN). Fourier continuity in [F6] bounds PN(Φ^) by finitely many Schwartz seminorms of Φ, so Cm(2) is continuous and tempered. Under simultaneous translation by a∈Ed, the full Fourier transform acquires the factor e−i(q1+q2)⋅a; at (q1,q2)=(−p,p) this factor is 1, proving translation invariance. On product tests, Cm(fˉ,g)=(2π)−d∫Rdf^(p)‾ g^(p)p02+∣k∣2+m2 dp, which is nonnegative for g=f.

2.1A1F1F2F3F4F5step 1.1

The zeroth term S0=1 is a continuous functional on C, and every odd-order term Sn=0 is the zero continuous functional. For even n, each pairing π partitions the n test-variable blocks into disjoint pairs. The corresponding tensor product of copies of Cm(2) is a tempered distribution by [F2]; the finite sum over π is therefore in Sd,n′. Its values on elementary tests are the displayed Wick formula. The bilinear form Cm is symmetric by changing p to −p in step 1.1, so the sum is invariant under every permutation of its argument blocks. For any finite list of real Schwartz tests, Gij=Cm(fi,fj) is symmetric and real: for real fi, f^i(−p)=f^i(p)‾, so the Fourier pairing is Hermitian, while symmetry makes it real. It is positive semidefinite because ∑i,jzˉiGijzj=Cm(∑izifi‾,∑jzjfj)≥0. By [A1] and [F4] the finite centered Gaussian law γG exists, including when G is singular, and [F5] shows its moments are exactly the displayed pairing values. Splitting complex tests into real and imaginary parts gives the same multilinear extension. The symmetry of the moments makes the algebraic moment functional commute on this finite family of generators, so every finite polynomial a satisfies ωS(a∗a)=EγG∣a(Q)∣2≥0 and ωS(1)=S0=1.

2.2F6F7step 1.1givenalgebra

By step 1.1, the Countable Choice hypotheses of [F6] and [F7] are satisfied. Put ωk=∣k∣2+m2>0. The function Kω(u)=e−ω∣u∣/(2ω) is integrable. Splitting its Fourier transform into the two half-lines gives ∫Re−ip0uKω(u) du=12ω(1ω+ip0+1ω−ip0)=1p02+ω2. By injectivity of the Fourier automorphism on tempered distributions [F6], this identifies the inverse kernel of (p02+ω2)−1; the inverse normalization is 1/(2π) under the stated convention [F7]. Since f,g are compactly supported in t>0, reflecting the first time variable changes t−s to −(t+s); its absolute value is t+s. Integrating the spatial variables by their Fourier transforms yields the stated formula. The exchanges of integrals are valid: ∫R(p02+ωk2)−1dp0=π/ωk≤π/m, while repeated spatial integration by parts gives rapid k-decay of f^(t,k) and g^(s,k) uniformly on their compact time supports.

3.1F1F2F5step 2.1step 2.2givenalgebra∎

Define hf(k)=∫0∞e−ωktf^(t,k) dt and use the measure dνm(k)=dk/((2π)d−12ωk), with the one-point convention from the Statement when d=1. Compact time support and the rapid spatial decay just proved give hf∈L2(νm), and step 2.2 gives Cm(f∘ϑ‾,g)=⟨hf,hg⟩L2(νm), where ⟨u,v⟩L2(νm):=∫u(k)‾v(k) dνm(k) is linear in its second argument. To pass from this Gram form to the full Gaussian reflection form, fix any finite set of positive-time tests f1,…,fN used by a. Since all Sn are symmetric, their moment functional on this finite set of field variables factors through its commutative polynomial algebra. Write X(fi) for the degree-one generator fi in Td. The formal Wick exponential W(z)=exp⁡ ⁣(∑iziX(fi)−12∑i,jzizjCm(fi,fj)) has polynomial coefficients; no analytic convergence is asserted. Write si# for the formal conjugate of si: reflection conjugates coefficients, so ΘW(s) uses si# and conjugates the coefficients of the quadratic counterterm. Put Gij=Cm(fi,fj) and Rij=Cm(fi∘ϑ‾,fj). Applying [F5] to the joint finite real list consisting of the real and imaginary parts of fi and fi∘ϑ‾ gives, by complex multilinearity, the coefficientwise formal identity. Each coefficient on the right is the sum over pairings of the corresponding finite test list: the quadratic exponential chooses unordered pairs, and its factorial denominator cancels their ordering multiplicity. Thus the identity follows coefficient by coefficient, with no convergence of an infinite series asserted. ωS ⁣(exp⁡ ⁣(∑isi#X(fi∘ϑ‾))exp⁡ ⁣(∑jzjX(fj)))=exp⁡ ⁣(12∑i,jsi#Gij‾sj#+∑i,jsi#Rijzj+12∑i,jziGijzj). The identity Cm(fi∘ϑ‾,fj∘ϑ‾)=Gij‾ for the reflected covariance follows from f∘ϑ‾^(p0,k)=f^(p0,−k)‾: substitute this in the Fourier formula for Cm and change k to −k, using the real multiplier p02+∣k∣2+m2. Multiplying by the two Wick counterterms therefore cancels the first and third quadratic sums and leaves ωS(ΘW(s) W(z))=exp⁡ ⁣(∑i,jsi#Cm(fi∘ϑ‾,fj)zj), where s and z are independent formal variables and the symbol si# is conjugated when coefficients are evaluated. The coefficient of unequal degrees in s#,z is zero. Differentiating k times in each variable gives the cross-pairing matrix ∑σ∈Σk∏j=1kRijℓσ(j), where Riℓ=⟨hfi,hfℓ⟩. Write the finite Wick expansion of a polynomial as a=∑k=0K∑i1,…,ikai1…ik(k)∂zi1⋯∂zikW(0), with symmetric coefficient tensors, and let Ak=∑ai1…ik(k)ei1⊗⋯⊗eik. The triangular relation between ordinary monomials and Wick polynomials, whose leading terms agree and whose remaining terms have lower degree, proves that every finite polynomial has such a finite expansion. Let H:CN→L2(νm) be the linear map Hei=hfi, and let Sym⁡ be the average over the k! permutations of tensor factors. Expanding the squared norm of Sym⁡H⊗kAk gives 1/k! times the sum over those permutations, so the displayed cross-pairing matrix makes the degree-k reflected quadratic form exactly k!∥Sym⁡H⊗kAk∥2≥0. There are no cross terms between different degrees. Therefore for every a∈Td,+, ωS(Θa a) is a finite sum of nonnegative squared norms.

Depends on

Dependency tree · 2 levels

Sources