Posterior Dist eq prior of output Indist
Cslib.Probability.PMF.posteriorDist_eq_prior_of_outputIndist
Plain-language statement
If the output distribution of a channel does not depend on the input, then conditioning on any output with positive probability leaves the prior unchanged.
Exact Lean statement
theorem posteriorDist_eq_prior_of_outputIndist (p : PMF α) (f : α → PMF β)
(h : ∀ a₀ a₁ : α, f a₀ = f a₁)
(b : β) (hb : b ∈ (p.bind f).support) :
posteriorDist p f b hb = pFormal artifact
Lean source
theorem posteriorDist_eq_prior_of_outputIndist (p : PMF α) (f : α → PMF β) (h : ∀ a₀ a₁ : α, f a₀ = f a₁) (b : β) (hb : b ∈ (p.bind f).support) : posteriorDist p f b hb = p := by ext a rw [posteriorDist_apply, bind_pair_apply, PMF.bind_apply] have hf : ∀ a', f a' b = f a b := fun a' => by rw [h a' a] simp_rw [hf] rw [ENNReal.tsum_mul_right, PMF.tsum_coe, one_mul] have hb' : (p.bind f) b ≠ 0 := (PMF.mem_support_iff _ _).mp hb have hmarg : (p.bind f) b = f a b := by rw [PMF.bind_apply] simp_rw [hf] rw [ENNReal.tsum_mul_right, PMF.tsum_coe, one_mul] exact ENNReal.mul_div_cancel_right (hmarg ▸ hb') (ne_top_of_le_ne_top ENNReal.one_ne_top (PMF.coe_le_one _ _))- Project
- Lean Computer Science Library
- License
- Apache-2.0
- Commit
- f36649cff2c9
- Source
- Cslib/Probability/PMF.lean:116-131
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Unique minimal
Cslib.Automata.DA.FinAcc.unique_minimal
Plain-language statement
The minimal DFA M accepting the language l is unique up to unique isomorphism.
Source project: Lean Computer Science Library
Person-level attribution pending.
Buchi Family cover
Cslib.Automata.NA.Buchi.buchiFamily_cover
Project documentation
na.buchiFamily is a cover if na has only finitely many states. This theorem uses the Ramsey theorem for infinite graphs and does not depend on any details of na.BuchiCongruence other than that it is of finite index.
Source project: Lean Computer Science Library
Person-level attribution pending.
Buchi Family saturation
Cslib.Automata.NA.Buchi.buchiFamily_saturation
Plain-language statement
na.buchiFamily saturates the ω-language accepted by na.
Source project: Lean Computer Science Library
Person-level attribution pending.