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.
Kriging
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Brownian Motion Construction and Continuity
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Finite-history linear prediction
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Random fields and variograms
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Stationary means and sample autocovariance
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
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
Simple, ordinary, and universal kriging
Definition
Let 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 observation sites and a target site . Write , , , , and . A positive-definite matrix means for every nonzero .
If the mean vector and target mean are known, a simple-kriging linear predictor with weight vector is Its mean-square prediction error is .
For an ordinary-kriging model, the mean is an unknown common constant : and . The predictor is . The admissible ordinary weights satisfy .
For a universal-kriging model, fix a trend map , where , and an unrestricted coefficient vector . Define the finite-site design matrix by row equal to , and put . The model means are and . The predictor is ; its unbiasedness for every is expressed by . Ordinary kriging is the special case , , and .
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 , its variogram is conditionally negative definite over real coefficients, meaning whenever (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.
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 , and its mean-square prediction error is
For an unknown trend with design matrix and target vector , is unbiased for every if and only if . Suppose is positive definite and has full column rank (that is, implies for ). Then the unique unbiased mean-square minimizing weights and Lagrange multiplier solve The augmented matrix is invertible under these hypotheses. The resulting mean-square prediction error is For ordinary kriging, take and , giving
Facts & Assumptions
Given: A square-integrable target and observation vector from the definition, with covariance matrix , covariance vector , and target variance .
Simple, ordinary, and universal kriging: simple prediction centers at its known mean and the target at its known mean.
Simple, ordinary, and universal kriging: in a finite trend model, unbiasedness for every is constrained by .
Normal equations for best affine prediction: the best affine predictor exists as a unique almost-sure class, and its centered coefficients satisfy the covariance normal equations.
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, , and, for the unknown-trend case, full column rank of .
For a centered error vector and centered target error , every unbiased linear predictor has error . Expanding its squared expectation by [F4] gives the common objective . The centered predictor in the simple case has this same error expression.
In the trend model, . This expression is zero for every if . Conversely, if it is zero for every , taking successively to be each coordinate vector shows every coordinate of is zero. Thus the unbiased weights are exactly the affine constraint .
Let and suppose . The lower block gives . Taking the inner product of with the upper block gives ; the second term is , so positive definiteness gives . The upper block now gives , and full column rank gives . Hence the finite square matrix is injective and therefore invertible.
In the simple case, [F3] gives the covariance normal equations for the minimizing centered affine predictor. Positive definiteness makes the solution unique, ; substituting it into step 1.1 gives .
Invertibility gives a unique solution of the displayed augmented system, and its lower block makes feasible. For any other feasible vector , one has . Using the upper block in the quadratic from step 1.1 gives . This is positive for nonzero and zero for , so is the unique constrained minimizer.
Multiplying on the left by and using yields . Substitution in from step 1.1 gives , as claimed.
Gaussian simple kriging is a conditional mean
Statement
Assume the Axiom of Choice. Let be a Gaussian real field, meaning every finite coordinate vector has a possibly singular multivariate-normal law. For the target and observations of Simple, ordinary, and universal kriging, suppose is positive definite. Then the simple-kriging predictor equals almost surely, where is the sigma-algebra generated by the observation vector.
Facts & Assumptions
Given: AC, a finite jointly Gaussian vector with finite second moments, and positive-definite observation covariance .
The Axiom of Choice says every family of nonempty sets has a choice function. The Axiom of Choice
Gaussian process: under AC, every finite coordinate vector of a Gaussian field has a possibly singular multivariate-normal law.
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.
Independent random elements and Independent sigma-algebras and independent events: independent random elements generate independent sigma-algebras, so their measurable events factor.
Kriging systems and mean-square optimality: under , the simple-kriging weights are .
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.
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.
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.
Let and . By [F1], is jointly Gaussian because each of its linear combinations is a linear combination of . Its residual mean is zero, and by the equation .
Applying [F2] to the jointly Gaussian blocks and from step 1.1 shows that is independent of .
By [F3], independence from step 2.1 gives the Borel-event factorization required by [F5] for and . The residual is integrable because it is a finite linear combination of square-integrable variables. AC is stated in [A1], so [F5] gives ; by [F6], this means for every .
Put . This is -measurable and integrable. For each , step 3.1 and give . Thus [F6] makes a version of , 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.