Alphabeta Math
DefinitionDefinition: 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.

Small-ball MAP conventions and Cameron–Martin relative modes

Definition

Let B be a separable Banach space with norm ∥⋅∥B, and let Π be a Borel probability measure on B. For z∈B and r>0, write B‾B(z,r)={u∈B:∥u−z∥B≤r} and mr(z)=Π(B‾B(z,r)). A strong small-ball MAP is a point z∈B for which mr(z)sup⁡x∈Bmr(x)⟶1(r↓0). Assume AC for the covariance-induced Cameron–Martin notation. In this Gaussian branch, regard B as a real Banach space, restricting scalars if B is complex; B∗ denotes its continuous real dual, and Gaussianity is tested against these real functionals. The norm, Borel sets, and balls are unchanged by this restriction. If Π is a posterior law formed by weighting a centered Borel Gaussian prior Π0 on B, let Cℓ=∫Bℓ(u)u Π0(du) be its covariance operator and let E be the completion of B∗/ker⁡C with inner product ⟨[ℓ],[m]⟩E=m(Cℓ); the canonical injection i:E→B extends [ℓ]↦Cℓ. A Cameron–Martin ratio mode is a point ih∈iE such that, for every k∈E, the denominator is positive for all sufficiently small r and lim⁡r↓0mr(ih)mr(ik) exists and is at least 1. This pairwise comparison over fixed Cameron–Martin centers does not assert the global strong small-ball MAP condition.

For every r>0, sup⁡x∈Bmr(x)>0: a countable dense subset gives a countable cover of B by radius-r open balls, each contained in its corresponding closed ball, and countable subadditivity rules out all such closed balls having zero probability.

Depends on

Used by

Dependency tree · two levels

51 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