Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-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 zero-evidence fiber has no normalized fiberwise update

Example

Let X=R with its usual real Banach norm, let U=D={0,1} with the Borel subspace structure, and let the forward map be the constant map F(u)=0. Give the parameter the Borel probability μ0(A)=121{0∈A}+121{1∈A} for Borel A⊆R. Take data space Y={0,1} with the usual subspace metric, its power-set sigma-algebra and counting measure, and deterministic sampling kernel Q(u,⋅)=δF(u)=δ0. Its density is L(u;y)=1 for y=0 and L(u;y)=0 for y=1, with potential Φ(u;0)=0 and Φ(u;1)=+∞. Thus Z(0)=1 but Z(1)=0. At y=1 no normalized fiberwise update is defined; the data law assigns {1} probability zero, so a posterior-kernel version may use the prior filler there or any other probability measure on D. The finite-potential propriety theorem does not apply at y=1.

Facts & Assumptions

Given: The finite parameter domain D={0,1}, the half-half prior, the constant forward map, the deterministic sampling kernel and its counting-measure density.

[F1]

A prior on a forward domain is a Borel probability on X with full mass on D. A Borel prior concentrated on a forward-map domain

[F2]

Evidence is the integral of the nonnegative likelihood section; the normalized update is defined only when that evidence is positive and finite. Misfit evidence and the potential posterior law

[F3]

A proper Bayesian model consists of a probability prior and a parameter-measurable probability kernel. Bayesian model as a prior and sampling kernel

[F4]

The Dirac set function gives mass one to sets containing its point and zero otherwise, and is a probability measure. The Dirac set function at a point, A Dirac set function is a probability measure

[F5]

Counting measure on P(X) assigns finite sets their cardinality and infinite sets +∞. Counting measure on an arbitrary set

[F6]

Counting measure is a measure on the power-set sigma-algebra. Counting measure is a measure

[F7]

A probability kernel has probability sections at every parameter and measurable evaluations. Measure kernel and probability kernel

[F8]

In a dominated model, the evidence is the data-marginal density and the kernel with prior fillers on zero and infinite fibers is a conditional law version. Bayes formula for dominated kernels

[F9]

A finite positive scaling of the zero likelihood measure cannot be a probability. Fiberwise posterior propriety is equivalent to finite positive evidence

[F10]

Changing a data-indexed conditional kernel on a measurable data-marginal-null set preserves its conditional identities. Conditional law given a random element

[F11]

The propriety theorem assumes every potential section in its specified data set is finite and continuous. Function-space posterior propriety from a common lower envelope

[F12]

An inverse-problem forward map has metric parameter and data spaces, a nonempty admissible truth set, and a map defined on it. Inverse-problem models and solution classes

[F13]

The product sigma-algebra is generated by measurable rectangles, and a map is measurable when preimages of target-measurable sets are measurable. The product sigma-algebra and its finite iterates, A measurable function between measurable spaces

Verification

Given: The hypotheses and conventions in the Statement.

1.1givenF1F3F4F7F12construct

The half-half set function μ0 is a probability: in any disjoint Borel sequence each of 0 and 1 occurs in at most one member, so the mass of the union equals the sum of the masses, and μ0(R)=1. Since μ0(D)=1, it is a prior on D by [F1]. The constant map F(u)=0 is a forward map on the nonempty truth set U=D by [F12], and its restriction is measurable because every preimage is D or ∅. For each u∈D, Q(u,⋅)=δ0 is a probability measure by [F4], and every evaluation u↦Q(u,B) is measurable on finite D; hence [F7] makes Q a probability kernel. Thus [F3] gives a proper Bayesian model.

2.1F2F5F6F9F11F13step 1.1givenalgebra

With counting measure on Y, the density is L(u,y)=1{y=0} for both parameter values; its sum over y∈{0,1} is one, so it represents the stated kernel. The potential and density are jointly measurable: each singleton rectangle {u}×{y} is measurable, so every subset of finite D×Y is a finite union of measurable rectangles by [F13]. Integrating the kernel against the half-half prior gives data law concentrated at 0, and the same density gives Z(0)=12+12=1 and Z(1)=0. At y=1, [F9] rules out any finite positive scaling of the zero likelihood measure as a probability. The potential equals +∞ on D at this datum, so the finite-section hypothesis in [F11] fails.

3.1F4F8F10step 2.1given∎

The explicit dominated kernel from [F8] uses the normalized update at y=0 and prior filler μ0 at y=1. The data law gives {1} probability zero by step 2.1, so [F10] allows replacing that filler by δ1 without changing the conditional identities. Both fillers are probability measures on D by [F4], but neither is obtained by normalizing the zero-evidence fiber.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

69 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