Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Finite Gaussian-process regression observation model

Definition

Let X be a set, let m:X→R, and let k:X×X→R be symmetric and positive semidefinite, meaning that for every finite ordered list t1,…,tr in X and every a∈Rr, ∑i,j=1raiajk(ti,tj)≥0. For finite ordered lists A=(ai)i=1r and B=(bj)j=1s in X, define KAB=(k(ai,bj))i,j; repeated indices are allowed.

Given a real Gaussian process f=(ft)t∈X with mean m(t)=E[ft] and covariance k(s,t)=E[(fs−m(s))(ft−m(t))], and a nonempty finite training list X=(xi)i=1n in X, define fX=(fxi)i=1n and mX=(m(xi))i=1n. For a centered Gaussian noise vector ε∼Nn(0,R) with symmetric positive-semidefinite covariance R that is independent of f, define the observation vector Y=fX+ε and the matrix AX=KXX+R.

For a nonempty finite test list X∗=(xj∗)j=1p in X, define the latent test vector f∗=fX∗. If a centered Gaussian vector η∗∼Np(0,R∗) with symmetric positive-semidefinite covariance R∗ is independent of the pair (f,ε), define the noisy test vector Y∗=f∗+η∗.

Model diagram

f»GP(m;k)fXf¤"Y=fX+"´¤Y¤=f¤+´¤

The single prior node represents one process, so fX and f∗ may be correlated. Arrows into Y and Y∗ denote vector addition. The training noise ε is independent of f, and the test noise η∗ is independent of the pair (f,ε); the diagram records no posterior independence claim.

Depends on

Used by

Dependency tree · two levels

19 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