Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Gaussian field existence from a mean and a positive-semidefinite kernel

Statement

Assume the Axiom of Choice. Let T⊆Rd, d≥1, be an index set, let m:T→R, and let K:T×T→R be a symmetric positive-semidefinite kernel, meaning that every finite real quadratic form ∑i,jaiajK(ti,tj) is nonnegative. There is a unique probability measure μ on the cylinder sigma-algebra CT of RT whose nonempty finite-coordinate marginal on F={t1,…,tn}⊆T is Nn((m(ti))i=1n,[K(ti,tj)]i,j=1n). The empty-coordinate marginal is the unique law on the singleton empty product. Under μ, the coordinate maps form a Gaussian field with mean function m and covariance kernel K. No sample-path continuity or joint measurability is asserted.

Facts & Assumptions

Given: AC, a set T⊆Rd, a function m:T→R, and a real symmetric positive-semidefinite kernel K on T.

[A1]

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

[F1]

Multivariate normal law, including singular covariance: under AC, every finite real symmetric positive-semidefinite matrix and mean vector define a possibly singular multivariate normal law with the stated mean and covariance.

[F2]

Characteristic function of a multivariate normal law: under AC, Nn(a,Σ) has characteristic function u↦exp⁡(iuTa−uTΣu/2), and this transform uniquely determines the law, including when Σ is singular.

[F3]

Second-countable locally compact Hausdorff spaces are Polish, and homogeneous quotients are standard Borel: under AC, every second-countable locally compact Hausdorff space is Polish and hence standard Borel.

[F5]

A consistent family of finite-dimensional distributions: finite coordinate laws form a consistent family when every restriction pushforward agrees with the law on the smaller coordinate set.

[F6]

Coordinate maps, finite-coordinate cylinders, and the cylinder σ-algebra: CT is generated by all finite-coordinate cylinders, and each coordinate projection RT→R is measurable for this sigma-algebra.

[F7]

Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces: under AC, any consistent family of finite-dimensional laws on standard-Borel coordinate spaces extends uniquely to a probability measure on the cylinder sigma-algebra.

[F8]

Gaussian process: a real process is Gaussian when every finite coordinate vector has a possibly singular multivariate normal law; its probability-law construction follows the library's AC convention.

[F9]

Random fields, stationarity, covariance, and variograms: a real field is a family of real random variables on one common probability space, with each coordinate measurable there.

Axiom use: AC selects the finite coordinate enumerations and is used by the finite Gaussian-law supplier [F1] in step 1.1 and by Kolmogorov extension [F7] in step 3.1. Dependent choice is not used.

Proof

Given: AC, T, m, and K as in the statement.

1.1A1F1F2givenconstruct

For each nonempty finite F⊆T, use AC to choose an enumeration eF:{1,…,nF}→F. Put ti=eF(i), mF=(m(ti))i=1nF, and KF=[K(ti,tj)]i,j=1nF. Let rF:RnF→RF relabel coordinates by rF(x)(eF(i))=xi. The matrix KF is symmetric positive semidefinite by the hypothesis on K, so [F1] supplies NnF(mF,KF); define the probability measure on the actual coordinate space by μF:=(rF)#NnF(mF,KF). If F=∅, use the unique probability law on the singleton empty product. Changing the enumeration permutes mF and both indices of KF by the same permutation. The characteristic-function formula in [F2] shows that the corresponding permutation of RnF carries one Gaussian law to the other; after relabelling, the resulting measure on RF is unchanged. Thus μF is independent of the chosen enumeration.

1.2F3F4givenchoose

The intervals (p,q) with rational endpoints form a countable family by the countability of Q and [F4]. They form a base: if U is open and x∈U, choose r>0 with (x−r,x+r)⊆U; rational density supplies p,q∈Q with x−r<p<x<q<x+r, so x∈(p,q)⊆U. Thus R is second-countable by [F4]. If x≠y, the open balls about x and y of radius ∣x−y∣/3 are disjoint: a point in both would give ∣x−y∣<2∣x−y∣/3 by the triangle inequality. Hence the metric topology is Hausdorff. It is locally compact since each x has the compact interval [x−1,x+1] as a neighborhood by [F4]. Therefore [F3] makes (R,B(R)) standard Borel.

2.1F2F5step 1.1algebra

Let F⊆H be finite and nonempty, and use the enumerations fixed in step 1.1. Write πH,F:RH→RF for restriction. For u∈RF, define u~∈RnH by u~j=u(eH(j)) when eH(j)∈F, and u~j=0 otherwise. Under the coordinate relabelling rH, the characteristic function of (πH,F)#μH at u is the characteristic function of NnH(mH,KH) at u~. By [F2] this is exp⁡ ⁣(i∑t∈Fu(t)m(t)−12∑s,t∈Fu(s)u(t)K(s,t)). This is also the characteristic function of μF=(rF)#NnF(mF,KF) at u, by [F2]. Identifying RF with RnF through rF, uniqueness of characteristic functions in [F2] gives (πH,F)#μH=μF. Empty sets give the unique singleton marginal. Hence the family is consistent in the sense of [F5].

3.1A1F3F5F7step 1.2construct

The consistent family from step 2.1 now satisfies the standard-Borel hypotheses of [F7]. Kolmogorov extension gives a unique probability measure μ on CT with the specified finite-coordinate marginals.

4.1F1F6F7F8F9step 3.1∎

On (RT,CT,μ) define X(t)(ω):=ω(t). Each coordinate is measurable by [F6], and for every finite set F its joint law is μF by [F7]. The means and covariances are therefore m(t) and K(s,t) by [F1]. For any finite list t1,…,tn, possibly with repeated sites, and coefficients a1,…,an, collect the distinct sites in F={t1,…,tn} and put bt:=∑j:tj=taj. Then ∑jajX(tj)=∑t∈FbtX(t) is a linear projection of the F-coordinate Gaussian vector, so it has a normal law by [F1]. This is the Gaussian-process condition [F8], and the coordinates form a real field by [F9]. The extension supplies only the cylinder sigma-algebra; no continuity or joint-measurability conclusion was used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

124 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources