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

Finite MDP with bounded real rewards

Definition

Let S be a finite nonempty state set and let A(s) be a finite nonempty action set for each s∈S, as in the finite-MDP convention. Put D={(s,a):s∈S, a∈A(s)} with its discrete sigma-algebra. Equip S with its power-set sigma-algebra, [0,1] with its Borel sigma-algebra, and S×[0,1] with the product sigma-algebra. A finite MDP with bounded real rewards specifies a probability kernel Q from D to S×[0,1]; equivalently, each admissible (s,a) has a probability measure Q(⋅∣s,a) on that product measurable space. The reward-coordinate projection (s′,ρ)↦ρ is measurable because the preimage of each Borel set B⊆[0,1] is the product rectangle S×B. Define the next-state law by P(s′∣s,a)=Q({s′}×[0,1]∣s,a) and the mean reward by r(s,a)=∫S×[0,1]ρ Q(ds′,dρ∣s,a)∈[0,1]. At each time, conditional on the observed history and the selected action, the next-state/reward pair has this law. Assume the Axiom of Choice for the path-space construction under policies.

Definition references

Finite-MDP supplier: supplies the finite state/action and joint one-step-law conventions; its reward alphabet is finite, while this definition explicitly permits every Borel reward law on [0,1].

Borel sigma-algebra: specifies the Borel events on the reward interval.

Product sigma-algebra: specifies measurable events on S×[0,1].

Probability measure: Q(⋅∣s,a) is a probability measure for each admissible pair.

Probability kernel: the family Q has measurable event sections over the finite pair set D.

Expectation as an integral: defines the mean reward integral.

UCRL2 model and reward scope: Introduction, finite state/action, reward, and transition model (PDF lines 34–41).

Ionescu–Tulcea path-law construction: unique path law from a specified initial probability law and sequential probability kernels under Choice.

Axiom of Choice: assumed by the path-law construction.

Axiom use

The Axiom of Choice is assumed exactly for the path-space construction under policies. The one-step kernel and its finite state marginal require no choice.

For a measurable history-dependent policy and an initial state distribution μ on S, start the construction with S0∼μ (use the point mass δx when starting at a specified state x). Alternate the policy action kernels with the observation kernels Q(⋅∣s,a). The cited Ionescu–Tulcea theorem then supplies a unique interaction law for this initial distribution and policy. The MDP kernel alone does not specify an initial distribution.

Depends on

Used by

Dependency tree · two levels

39 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