Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

The finite POMDP Bayes filter is a probability kernel

Statement

Let a finite POMDP be fixed, let b∈Δ(S) and a∈A, and put bˉ(s′)=∑s∈ST(s′∣s,a)b(s), q(o)=∑s′∈SO(o∣s′)bˉ(s′), and, when q(o)>0, τ(o)(s′)=O(o∣s′)bˉ(s′)/q(o). For Borel C⊆Δ(S) define K(C)=∑o:q(o)>0q(o)1C(τ(o)). Then the joint next-state/reward/observation mass in the POMDP definition is normalized; bˉ and q are probability distributions; every defined τ(o) is a probability distribution and is the conditional law of the next state given observation o; and K is a probability measure. Moreover, (b,a)↦K(C∣b,a) is Borel measurable for each Borel C, so K is a probability kernel from Δ(S)×A to Δ(S). No Axiom of Choice is used.

Facts & Assumptions

Given: A finite POMDP, b∈Δ(S), and a∈A. Write bˉb,a(s′)=∑sT(s′∣s,a)b(s) and q(o∣b,a)=∑s′O(o∣s′)bˉb,a(s′).

[F1]

Finite partially observable Markov decision process: for each (s,a), p(s′,ρ∣s,a) is a probability mass, T(s′∣s,a)=∑ρp(s′,ρ∣s,a), and O(⋅∣s′) is a probability distribution on the finite set Ω.

[F2]

Belief states and the finite Bayes filter: Δ(S) consists of nonnegative coordinates summing to one; τ(b,a,o)(s′)=O(o∣s′)bˉb,a(s′)/q(o∣b,a) when q>0; and K(C∣b,a)=∑o:q>0q(o∣b,a)1C(τ(b,a,o)).

[F3]

Measure kernel and probability kernel: a probability kernel has a probability-measure section at every input and measurable event evaluations.

[F4]

Bayes formula for dominated kernels: if a probability kernel has a specified density relative to a sigma-finite measure, then at a positive finite marginal density its posterior coordinates are the prior-weighted likelihood divided by that marginal; the explicit-kernel event identities are choice-free.

[F5]

Measurability of integration against a kernel: integrating a product-measurable function against a finite kernel gives a measurable function of the input.

[F6]

The sum ∑i∈Sai over a finite index set, and its product form: finite sums are independent of the chosen enumeration, and may be reindexed along a bijection.

Proof

1.1givenF1F6F7

For fixed s,a, the mass J(s′,ρ,o∣s,a)=p(s′,ρ∣s,a)O(o∣s′) is nonnegative. Summing first over observations gives ∑s′,ρ,oJ=∑s′,ρp(s′,ρ∣s,a)∑oO(o∣s′)=∑s′,ρp(s′,ρ∣s,a)=1 by [F1]; all index sets are finite, so the reordering is justified by [F6] and [F7]. Thus the joint next-state/reward/observation mass is normalized.

1.2givenF1F2F7

The predicted coordinates bˉb,a(s′) are nonnegative, and ∑s′bˉb,a(s′)=∑sb(s)∑s′T(s′∣s,a)=∑sb(s)=1 by [F1], [F2], and finite double-sum interchange [F7]. Hence bˉb,a is a probability distribution.

2.1step 1.2F1F7

Every q(o∣b,a) is nonnegative, and ∑oq(o∣b,a)=∑s′bˉb,a(s′)∑oO(o∣s′)=∑s′bˉb,a(s′)=1 by [F1], step 1.2, and [F7]. Thus q(⋅∣b,a) is a probability distribution, so each q is finite and lies in [0,1].

3.1step 1.2step 2.1F2F4

Fix o with q(o∣b,a)>0. Apply [F4] with prior π=bˉb,a on the finite state set, observation kernel Q(s′,⋅)=O(⋅∣s′), counting measure on finite Ω, and density ℓ(s′,o)=O(o∣s′). The density is nonnegative and jointly measurable, and its marginal is exactly q(o∣b,a), which is finite and positive by step 2.1. The theorem's posterior is therefore τ(b,a,o), with coordinates summing to one. At q=0 the Bayes theorem supplies a filler for its everywhere kernel, but the partial update defined here remains undefined and K omits that zero-mass observation.

3.2step 2.1F2F3

For fixed b,a, the formula for K is a finite nonnegative sum of point masses at the defined τ(b,a,o). For pairwise disjoint Borel sets (Cn)n≥1, each point τ(b,a,o) lies in at most one Cn, so 1∪nCn(τ)=∑n1Cn(τ) with at most one nonzero term. Since there are finitely many observations, distributing the finite weighted sum over these finitely many nonzero terms gives K(∪nCn)=∑nK(Cn). Also K(Δ(S))=∑o:q>0q(o∣b,a)=1 by step 2.1. Thus K(⋅∣b,a) is a probability measure.

4.1step 1.2step 2.1step 3.1F3F5

On Δ(S)×A, the predicted law Kˉ({s′}∣b,a)=bˉb,a(s′) is a probability kernel: step 1.2 gives probability sections, and each evaluation is a finite linear function of b on each discrete action. The function ((b,a),s′)↦O(o∣s′) is product-measurable, so [F5] makes q(o∣b,a)=∫O(o∣s′)Kˉ(ds′∣b,a) measurable; its displayed finite formula also shows it is continuous in b. On the Borel set where q(o∣b,a)>0, every coordinate of τ is a quotient of continuous functions with positive denominator and is Borel. For Borel C, the function equal to q(o∣b,a)1C(τ(b,a,o)) there and zero where q=0 is Borel; summing these functions over the finite set Ω proves that K(C∣b,a) is Borel measurable. By [F3], K is a probability kernel.

5.1F2F4∎

The only conditional law used in step 3.1 is the explicit dominated-kernel formula at a positive finite marginal. The finite history beliefs are ratios on positive-probability atoms, and all other constructions use specified finite sums and kernels; no version selection or arbitrary-family choice is used.

Depends on

Used by

Cited to discharge well-definedness by Belief states and the finite Bayes filter and Finite partially observable Markov decision process.

Dependency tree · two levels

31 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