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.

✓ 2 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 2 also cleared it.

Kriging

1 · Prerequisites

2 · Summary

Kriging chooses a linear predictor from finitely many field observations. With a known mean and positive-definite observation covariance, the simple weights solve the covariance normal equations and minimize mean-square prediction error. When the mean is an unknown constant or a specified trend, unbiasedness imposes linear constraints and the unique predictor solves an augmented covariance system under explicit rank and invertibility hypotheses. Under AC and Gaussianity, the simple predictor is a conditional mean. For finite-second-moment fields, the covariance theorem establishes best-affine optimality; conditional-mean equality requires a separate argument. Plug-in estimates and variogram systems require their own conditions.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Simple, ordinary, and universal kriging

Definition

Let X=(X(s))s∈T be a real random field in the sense of Random fields, stationarity, covariance, and variograms, and suppose the finite vector of field values considered below is square-integrable. Choose n≥1 observation sites s1,…,sn and a target site s0. Write Z=(X(s1),…,X(sn))⊤, Y=X(s0), Σ=Cov⁡(Z,Z), c0=Cov⁡(Z,Y), and v0=Var⁡(Y). A positive-definite matrix Σ means u⊤Σu>0 for every nonzero u∈Rn.

If the mean vector m=EZ and target mean m0=EY are known, a simple-kriging linear predictor with weight vector λ∈Rn is Y^SK(λ)=m0+λ⊤(Z−m). Its mean-square prediction error is E[(Y−Y^SK(λ))2].

For an ordinary-kriging model, the mean is an unknown common constant θ: EZ=θ1n and EY=θ. The predictor is Y^OK(λ)=λ⊤Z. The admissible ordinary weights satisfy 1n⊤λ=1.

For a universal-kriging model, fix a trend map p:T→Rq, where q≥1, and an unrestricted coefficient vector β∈Rq. Define the finite-site design matrix P∈Rn×q by row i equal to p(si)⊤, and put p0=p(s0). The model means are EZ=Pβ and EY=p0⊤β. The predictor is Y^UK(λ)=λ⊤Z; its unbiasedness for every β∈Rq is expressed by P⊤λ=p0. Ordinary kriging is the special case q=1, P=1n, and p0=1.

The covariance-based optimality statements on this page use the actual finite covariance matrix and vector. In particular, the inverse formula for simple kriging is not asserted when Σ is singular.

Remarks

The covariance formulations above require finite second moments. A variogram formulation has a separate hypothesis: for an order-two intrinsically stationary field indexed by all of Rd, its variogram γ is conditionally negative definite over real coefficients, meaning ∑i,jaiajγ(si−sj)≤0 whenever ∑iai=0 (Order-two intrinsic variograms are conditionally negative definite). This non-strict inequality does not by itself assert invertibility of a variogram augmented system; any such system needs its own full-rank and invertibility conditions. The theorem on this page proves the covariance systems.

The optimality claims are oracle claims for fixed mean and covariance quantities. Replacing those quantities by estimates defines a different procedure; no optimality or coverage guarantee for that plug-in procedure is asserted here.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Kriging systems and mean-square optimality

Statement

Use the notation of Simple, ordinary, and universal kriging. For simple kriging, if Σ is positive definite, the unique mean-square minimizing weight vector is λSK=Σ−1c0, and its mean-square prediction error is v0−c0⊤Σ−1c0.

For an unknown trend with design matrix P and target vector p0, λ⊤Z is unbiased for every β∈Rq if and only if P⊤λ=p0. Suppose Σ is positive definite and P has full column rank (that is, Py=0 implies y=0 for y∈Rq). Then the unique unbiased mean-square minimizing weights λ∈Rn and Lagrange multiplier ν∈Rq solve (ΣPP⊤0)(λν)=(c0p0). The augmented matrix is invertible under these hypotheses. The resulting mean-square prediction error is v0−λ⊤c0−ν⊤p0. For ordinary kriging, take P=1n and p0=1, giving (Σ1n1n⊤0)(λν)=(c01).

Facts & Assumptions

Given: A square-integrable target Y and observation vector Z from the definition, with covariance matrix Σ, covariance vector c0, and target variance v0.

[F1]

Simple, ordinary, and universal kriging: simple prediction centers Z at its known mean and the target at its known mean.

[F2]

Simple, ordinary, and universal kriging: in a finite trend model, unbiasedness for every β is constrained by P⊤λ=p0.

[F3]

Normal equations for best affine L2 prediction: the best affine L2 predictor exists as a unique almost-sure class, and its centered coefficients satisfy the covariance normal equations.

[F4]

Moments, variance, and covariance on a probability space and Variance and covariance identities for random variables: variance is the expectation of a centered square, and covariance is symmetric and bilinear on finite linear combinations of square-integrable variables.

Proof

Given: The finite second-moment model, Σ≻0, and, for the unknown-trend case, full column rank of P.

1.1givenF1F4algebra

For a centered error vector ε=Z−EZ and centered target error ε0=Y−EY, every unbiased linear predictor has error ε0−λ⊤ε. Expanding its squared expectation by [F4] gives the common objective Q(λ)=v0−2λ⊤c0+λ⊤Σλ. The centered predictor in the simple case has this same error expression.

1.2F2algebra

In the trend model, E[λ⊤Z−Y]=(P⊤λ−p0)⊤β. This expression is zero for every β∈Rq if P⊤λ=p0. Conversely, if it is zero for every β, taking β successively to be each coordinate vector shows every coordinate of P⊤λ−p0 is zero. Thus the unbiased weights are exactly the affine constraint P⊤λ=p0.

1.3givenalgebra

Let M=(ΣPP⊤0) and suppose M(xy)=0. The lower block gives P⊤x=0. Taking the inner product of x with the upper block gives x⊤Σx+x⊤Py=0; the second term is (P⊤x)⊤y=0, so positive definiteness gives x=0. The upper block now gives Py=0, and full column rank gives y=0. Hence the finite square matrix M is injective and therefore invertible.

2.1givenF3step 1.1algebra

In the simple case, [F3] gives the covariance normal equations Σλ=c0 for the minimizing centered affine predictor. Positive definiteness makes the solution unique, λ=Σ−1c0; substituting it into step 1.1 gives Q(λ)=v0−c0⊤Σ−1c0.

2.2step 1.1step 1.2step 1.3algebra

Invertibility gives a unique solution (λ,ν) of the displayed augmented system, and its lower block makes λ feasible. For any other feasible vector λ+h, one has P⊤h=0. Using the upper block Σλ+Pν=c0 in the quadratic from step 1.1 gives Q(λ+h)−Q(λ)=2h⊤(Σλ−c0)+h⊤Σh=h⊤Σh. This is positive for nonzero h and zero for h=0, so λ is the unique constrained minimizer.

3.1step 1.1step 1.2step 2.2algebra∎

Multiplying Σλ+Pν=c0 on the left by λ⊤ and using P⊤λ=p0 yields λ⊤Σλ+ν⊤p0=λ⊤c0. Substitution in Q(λ) from step 1.1 gives Q(λ)=v0−λ⊤c0−ν⊤p0, as claimed.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Gaussian simple kriging is a conditional mean

Statement

Assume the Axiom of Choice. Let X be a Gaussian real field, meaning every finite coordinate vector has a possibly singular multivariate-normal law. For the target Y=X(s0) and observations Z of Simple, ordinary, and universal kriging, suppose Σ is positive definite. Then the simple-kriging predictor m0+(Σ−1c0)⊤(Z−m) equals E[Y∣σ(Z)] almost surely, where σ(Z) is the sigma-algebra generated by the observation vector.

Facts & Assumptions

Given: AC, a finite jointly Gaussian vector (Y,Z) with finite second moments, and positive-definite observation covariance Σ.

[A1]

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

[F1]

Gaussian process: under AC, every finite coordinate vector of a Gaussian field has a possibly singular multivariate-normal law.

[F2]

Uncorrelated jointly Gaussian blocks are independent: under AC, jointly Gaussian finite blocks with zero cross-covariance are independent, including when a covariance matrix is singular.

[F3]

Independent random elements and Independent sigma-algebras and independent events: independent random elements generate independent sigma-algebras, so their measurable events factor.

[F4]

Kriging systems and mean-square optimality: under Σ≻0, the simple-kriging weights are Σ−1c0.

[F5]

Conditioning a known variable and an independent variable: under AC, an integrable variable whose Borel events are independent of the conditioning sigma-algebra has conditional expectation equal to its mean.

[F6]

Conditional expectation as an ae class and Conditional expectation given a sigma algebra: the conditional-expectation class consists of measurable integrable versions with the same integrals as the input on every event in the conditioning sigma-algebra.

[F7]

Conditional expectation is unique almost surely: two versions with the same conditioning sigma-algebra and event integrals agree almost surely.

Proof

Given: AC, the Gaussian field, and the target and observation vector as in the statement.

1.1A1F1F4givenalgebra

Let λ=Σ−1c0 and R=Y−m0−λ⊤(Z−m). By [F1], (R,Z) is jointly Gaussian because each of its linear combinations is a linear combination of (Y,Z). Its residual mean is zero, and Cov⁡(R,Z)=c0⊤−λ⊤Σ=0 by the equation Σλ=c0.

2.1A1F2step 1.1

Applying [F2] to the jointly Gaussian blocks R and Z from step 1.1 shows that R is independent of Z.

3.1A1F3F5F6step 2.1

By [F3], independence from step 2.1 gives the Borel-event factorization required by [F5] for R and G=σ(Z). The residual is integrable because it is a finite linear combination of square-integrable variables. AC is stated in [A1], so [F5] gives E[R∣G]=E[R]=0; by [F6], this means E[R1B]=0 for every B∈G.

4.1F6F7step 3.1∎

Put Y^=m0+λ⊤(Z−m). This is σ(Z)-measurable and integrable. For each B∈σ(Z), step 3.1 and Y=Y^+R give E[Y1B]=E[Y^1B]. Thus [F6] makes Y^ a version of E[Y∣σ(Z)], and [F7] gives the asserted almost-sure equality. AC is used only through the Gaussian-law, Gaussian-independence, and conditional-expectation suppliers.

5 · Examples, counterexamples and false statements

None yet.

Sources