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.
Belief states and the finite Bayes filter
Definition
For a finite POMDP with state set , define its belief simplex by , with the Euclidean subspace topology and its Borel sigma-algebra. At time , the observed-history random variable is , and a realized history is ; at both histories are empty. A (possibly randomized) history policy assigns to each finite history a probability distribution on ; a deterministic choice is the point-mass case. Let be the induced finite law: multiply the initial belief, these action probabilities, and the one-step factors , and sum out hidden states and unobserved rewards when taking marginals. Thus policy randomization depends only on the observed history and is conditionally independent of the hidden state given that history. The history is reachable when . Its belief state is
where both probabilities are finite sums of products of the specified initial, action, transition, joint reward-transition, and observation probabilities, with unobserved rewards summed out. At , the empty history has belief .
For and , define the predicted state distribution and, for , the observation probability
When , the Bayes filter is the probability vector
When , is undefined; no quotient or filler value is assigned. For each , the belief-state transition kernel on Borel sets is
and the expected one-step reward at belief under action is , where denotes the indicator function of .
Definition references
The finite known transition and next-state observation laws used by the finite filter.
A probability kernel assigns a probability measure at every input and has measurable event sections.
Finite sums are defined independently of an enumeration of the finite index set.
Kaelbling, Littman, and Cassandra, Brown Technical Report CS-96-08.
Depends on
Used by
- A finite POMDP family has exponentially many witnessed alpha vectors Example
- A two-state POMDP update changes a three-to-one prior to nine-to-one Example
- A zero-likelihood observation has no posterior update Example
- An observation with identical state likelihoods leaves the belief unchanged Example
- The finite POMDP Bayes filter is a probability kernel Lemma
- Finite-horizon POMDP values are piecewise-linear and convex Theorem
- The belief state is a sufficient statistic for finite POMDP control Theorem
Dependency tree · two levels
19 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
- Kaelbling, Littman, and Cassandra, Planning and Acting in Partially Observable Stochastic Domains, Brown Technical Report CS-96-08 (standard reference, not scraped)
- Russ Tedrake, Planning Under Uncertainty: Partially-observable Markov decision processes, MIT Underactuated Robotics course notes (standard reference, not scraped)
- Pascal Poupart, CS 886 Lecture 13: POMDPs, University of Waterloo (standard reference, not scraped)