Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedprecheck passjudge 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.

An impossible observation has zero evidence and only a filler filter value

Example

Let E0=E1={0,1} and F1={a,b} with counting measure. Set μ0=δ0 and let the transition kernel preserve the state, K1(x,⋅)=δx. Let G1(0,{a})=1 and G1(1,{b})=1. Then the predictive law is δ0, and the evidence for observing b is zero. The update at b is therefore the supplied predictive filler δ0; it is not a quotient posterior. Because P(Y1=b)=0, any probability assigned at b would satisfy the same RCD identities.

Verification

Given: AC and the finite model and kernels in the Example.

[A1] AC states that every family of nonempty sets has a choice function. The Axiom of Choice

[F1] Filtering laws are conditional kernels defined by event identities; their values on observation-null fibers may be replaced by a fixed probability. Filtering, predictive, and smoothing laws in a finite-horizon state-space model

[F2] For dominated observations, zero and infinite evidence fibers receive the predictive probability as a conditional-kernel filler. Exact state-space filtering recursion under dominated observations

[F3] The state-space path law is the ordered product of the supplied probability kernels. Finite-horizon state-space kernel law exists and is unique

[F4] The recursive filtering procedure uses the predictive measure on zero or infinite evidence fibers. Recursive Bayesian filtering under dominated observations

1.1A1F2F3F4given

With counting measure on F1, set g1(x,y)=G1(x,{y}); it is jointly measurable on the finite discrete spaces, sums to one over y, and gives G1(x,C)=∑y∈Cg1(x,y). The predictive state law is δ0, so the evidence is z1(a)=1 and z1(b)=0; the update at a is δ0 and [F2] and [F4] make the update at b the predictive filler δ0. The factorized law [F3] gives P(Y1=b)=0.

2.1A1F1step 1.1algebra∎

Let ρ be any probability measure on E1 and define q(a,⋅)=δ0 and q(b,⋅)=ρ. This is a measurable probability kernel because the observation space is finite discrete. For every A⊆{0,1} and C⊆{a,b}, the path law gives P(X1∈A,Y1∈C)=1A(0)1C(a), while E[1{Y1∈C}q(Y1,A)]=1C(a)δ0(A)+0⋅1C(b)ρ(A)=1A(0)1C(a). These are all conditioning events in the finite observation space, so every probability ρ at b gives the same conditional identities.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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