Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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 MAP feature test

Definition

Assume the Axiom of Choice. Let X,H be separable real Hilbert spaces, let K:X→H be bounded and linear, and let ϵ>0. Let U be a Borel Gaussian prior with mean m0 and positive self-adjoint, injective, trace-class covariance C0, independent of a jointly Gaussian centered family Z indexed by H, linear into L2 with covariance E[Z(g)Z(k)]=⟨g,k⟩H. For parameter x∈X, the observation field is Yx(g)=⟨Kx,g⟩H+ϵZ(g). Fix a feature vector h∈X. Let S=C01/2,B=SK∗KS,R=(B+ϵ2IX)−1,Φh=KSRSh, and define the raw threshold ch=⟨Km0,Φh⟩H−⟨m0,h⟩X. Input a white-noise observation field y∈RH. Compute q=y(Φh)−ch. Return 1 when q>0 and return 0 when q≤0. This strict raw comparison defines the Gaussian MAP feature test for every field input y.

Depends on

Used by

Dependency tree · two levels

35 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