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 process
Definition
Assume the Axiom of Choice. A real stochastic process is a Gaussian process if, for every integer , every time list , and every , the random variable
has a normal law for some and . Variance zero is allowed, so constant linear combinations are included.
Equivalently, for every such time list the evaluation vector has a possibly singular multivariate normal law in the sense of Multivariate normal law, including singular covariance. Indeed, that definition says exactly that every scalar projection of the vector is normal. This also covers repeated times, zero coefficients, and singular covariance matrices; no distinct-time convention is needed for this definition.
Choice is declared because the library's scalar and multivariate normal-law interfaces construct their probability laws and independent standard-normal realizations under AC. The equivalence itself is only an unpacking of the finite-dimensional projection definition and makes no further selection.
Definition references
Source notes
Sousi, Section 6.1, defines a Gaussian process through normal finite linear combinations. Yoshida, Section 6.1 (printed p. 173), uses the equivalent finite-dimensional multivariate-normal formulation. The present definition retains singular laws explicitly, as required by the library's normal-law interface.
Depends on
Used by
- Finite-candidate Gaussian-process acquisition search with explicit statuses Algorithm
- Finite Gaussian-process regression posterior and predictive law Corollary
- Finite Gaussian-process regression observation model Definition
- A deterministic integral construction of a Gaussian process Example
- Brownian bridge from Brownian motion Example
- Linear combinations of Brownian values are Gaussian Example
- Noisy interpolation on two independent coordinates Example
- Positive observation noise with a singular rank-one prediction Example
- Brownian covariance is equivalent to independent stationary normal increments Lemma
- Continuous and strictly increasing norm distributions for density bridges Lemma
- Mean and covariance determine Gaussian finite-dimensional laws Lemma
- Computational costs and limits of finite Gaussian-process regression Remark
- A mean and positive-semidefinite kernel define a Gaussian process Theorem
- Adaptive finite-candidate Gaussian-process search uses the correct sequential posterior Theorem
- Brownian scaling Theorem
- Brownian time inversion Theorem
- Finite Gaussian-process posterior and predictive laws Theorem
- Finite linear Gaussian inverse posterior with singular prior covariance Theorem
- Gaussian field existence from a mean and a positive-semidefinite kernel Theorem
- Gaussian posterior law in an isonormal inverse experiment Theorem
- Gaussian simple kriging is a conditional mean Theorem
- Kernel ridge regression equals the Gaussian-process posterior mean Theorem
- Kolmogorov construction of the canonical Gaussian process Theorem
- Log marginal likelihood for a finite Gaussian-process regression model Theorem
Dependency tree · two levels
17 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
- Perla Sousi, Advanced Probability, Section 6.1 (standard reference, not scraped)
- Nobuaki Yoshida, Probability Theory, Section 6.1 (standard reference, not scraped)