Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)verified 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.

A Borel prior concentrated on a forward-map domain

Definition

Let X be a specified real separable Banach or Hilbert parameter space with metric dX(x,x′)=∥x−x′∥X and its norm topology. Let (Y,dY) be a metric data space equipped with a sigma-algebra ΣY, let U⊆X be a nonempty admissible truth set, and let F:U→Y be a forward map. Choose a Borel set D∈B(X) with D⊆U such that the restriction G:=F∣D:D→Y is measurable for the trace Borel sigma-algebra B(D):={D∩A:A∈B(X)}. A prior on this forward domain is a Borel probability measure μ on X such that μ(D)=1. Its restriction μ∣D, defined by μ∣D(A)=μ(A) for A∈B(D), is then a probability measure on D, and the induced data law is G#(μ∣D), defined by G#(μ∣D)(E)=(μ∣D)(G−1(E)) for E∈ΣY. A Borel probability on X with μ(D)<1 is not a prior on this declared forward domain.

Depends on

Used by

Dependency tree · two levels

26 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