OAI/Combinatorics/UniformKServer/ConditionalLaw.lean
19 declarations, 0 contain sorry, 0 declared as axioms
Finite posterior calculus for the finite-law construction. All conditional laws are computed from fiber weights, including the zero-probability fibers. This supplies, rather than assumes, the all-step filtering identities.
- def
OAI.UniformKServer.ConditionalLaw.massline 18 - def
OAI.UniformKServer.ConditionalLaw.kernelline 21 - def
OAI.UniformKServer.ConditionalLaw.posteriorline 24 - def
OAI.UniformKServer.ConditionalLaw.measurableline 27 - theorem
OAI.UniformKServer.ConditionalLaw.mass_nonnegline 30 - theorem
OAI.UniformKServer.ConditionalLaw.weight_le_massline 36 - theorem
OAI.UniformKServer.ConditionalLaw.mass_eqline 42 - theorem
OAI.UniformKServer.ConditionalLaw.kernel_nonnegline 49 - theorem
OAI.UniformKServer.ConditionalLaw.kernel_sumline 56 - theorem
OAI.UniformKServer.ConditionalLaw.balanceline 67 - theorem
OAI.UniformKServer.ConditionalLaw.weighted_kernel_sumline 75 - theorem
OAI.UniformKServer.ConditionalLaw.posterior_measurableline 84 - theorem
OAI.UniformKServer.ConditionalLaw.test_identityline 94Source documentation
The finite conditional-expectation identity. The test function is old history measurable; no restriction to a later selected event is made.
theorem test_identity {w : Ω → ℝ} (hw : ∀ ω, 0 ≤ w ω) (F : Setoid Ω) (a X : Ω → ℝ) (ha : measurable F a) : (∑ ω, w ω*a ω*posterior w F X ω) = ∑ ω, w ω*a ω*X ω := by …Mentions: OAI.UniformKServer.ConditionalLaw.measurable, OAI.UniformKServer.ConditionalLaw.posterior
- theorem
OAI.UniformKServer.ConditionalLaw.filteringline 110 - theorem
OAI.UniformKServer.ConditionalLaw.posterior_nonnegline 116 - theorem
OAI.UniformKServer.ConditionalLaw.posterior_le_oneline 120 - theorem
OAI.UniformKServer.ConditionalLaw.posterior_subline 128 - theorem
OAI.UniformKServer.ConditionalLaw.posterior_absline 132 - theorem
OAI.UniformKServer.ConditionalLaw.expected_contractionline 140