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 and with counting measure. Set and let the transition kernel preserve the state, . Let and . Then the predictive law is , and the evidence for observing is zero. The update at is therefore the supplied predictive filler ; it is not a quotient posterior. Because , any probability assigned at 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
With counting measure on , set ; it is jointly measurable on the finite discrete spaces, sums to one over , and gives . The predictive state law is , so the evidence is and ; the update at is and [F2] and [F4] make the update at the predictive filler . The factorized law [F3] gives .
Let be any probability measure on and define and . This is a measurable probability kernel because the observation space is finite discrete. For every and , the path law gives , while . These are all conditioning events in the finite observation space, so every probability at gives the same conditional identities.
Depends on
- The Axiom of Choice
- Filtering, predictive, and smoothing laws in a finite-horizon state-space model
- Recursive Bayesian filtering under dominated observations
- Filtering and finite-horizon smoothing laws exist
- Exact state-space filtering recursion under dominated observations
- General finite-horizon state-space models by kernels
- Finite-horizon state-space kernel law exists and is unique
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
- Simo Särkkä and Lennart Svensson, Bayesian Filtering and Smoothing, 2nd ed., Chapter 6 (standard reference, not scraped)
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §2.2 (standard reference, not scraped)