Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Belief states and the finite Bayes filter

Definition

For a finite POMDP with state set S, define its belief simplex by Δ(S)={b:S→[0,1]:∑s∈Sb(s)=1}, with the Euclidean subspace topology and its Borel sigma-algebra. At time t, the observed-history random variable is Ht=(A0,O1,…,At−1,Ot), and a realized history is ht=(a0,o1,…,at−1,ot); at t=0 both histories are empty. A (possibly randomized) history policy assigns to each finite history ht a probability distribution πt(⋅∣ht) on A; a deterministic choice is the point-mass case. Let Pr⁡π be the induced finite law: multiply the initial belief, these action probabilities, and the one-step factors p(s′,ρ∣s,a)O(o∣s′), 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 ht is reachable when Pr⁡π(Ht=ht)>0. Its belief state is

bt(s)=Pr⁡π(St=s∣Ht=ht)=Pr⁡π(St=s,Ht=ht)Pr⁡π(Ht=ht),

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 t=0, the empty history has belief b0.

For b∈Δ(S) and a∈A, define the predicted state distribution bˉb,a(s′)=∑s∈ST(s′∣s,a)b(s) and, for o∈Ω, the observation probability

q(o∣b,a)=∑s′∈SO(o∣s′)bˉb,a(s′).

When q(o∣b,a)>0, the Bayes filter is the probability vector

τ(b,a,o)(s′)=O(o∣s′)bˉb,a(s′)q(o∣b,a).

When q(o∣b,a)=0, τ(b,a,o) is undefined; no quotient or filler value is assigned. For each (b,a), the belief-state transition kernel on Borel sets C⊆Δ(S) is

K(C∣b,a)=∑o∈Ω:q(o∣b,a)>0q(o∣b,a) 1C(τ(b,a,o)),

and the expected one-step reward at belief b under action a is rˉ(b,a)=∑s∈Sb(s)r(s,a), where 1C denotes the indicator function of C.

Depends on

Used by

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