OAI/Probability/CriticalZ3/Resampling.lean
18 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.FiniteResampling.lowerline 18 - def
OAI.FiniteResampling.upperline 19 - theorem
OAI.FiniteResampling.lower_leline 21 - theorem
OAI.FiniteResampling.le_upperline 23 - theorem
OAI.FiniteResampling.le_lowerline 25 - theorem
OAI.FiniteResampling.upper_leline 27 - theorem
OAI.FiniteResampling.lower_le_upperline 29 - structure
OAI.FiniteResampling.Transitionline 33 - def
OAI.FiniteResampling.Transition.actline 40 - theorem
OAI.FiniteResampling.Transition.act_constline 43 - theorem
OAI.FiniteResampling.Transition.act_monoline 47 - theorem
OAI.FiniteResampling.Transition.lower_le_actline 51 - theorem
OAI.FiniteResampling.Transition.act_le_upperline 55 - theorem
OAI.FiniteResampling.Transition.lower_le_lower_actline 59 - theorem
OAI.FiniteResampling.Transition.upper_act_le_upperline 62 - theorem
OAI.FiniteResampling.Transition.common_atom_boundsline 66Source documentation
Subtracting the same atom from each row exposes a nonnegative remainder.
theorem common_atom_bounds (z : I) (a : ℝ) (ha : ∀ i, a ≤ K.weight i z) (f : I → ℝ) (i : I) : a * f z + (1-a) * lower f ≤ K.act f i ∧ K.act f i ≤ a * f z + (1-a) * upper f := by …Mentions: OAI.FiniteResampling.lower, OAI.FiniteResampling.upper
- theorem
OAI.FiniteResampling.Transition.oscillation_contractline 90 - theorem
OAI.FiniteResampling.Transition.iterates_tendsto_constantline 99Source documentation
All finite transition iterates converge to a constant when every row shares one positive atom. Zero-probability states are permitted and not discarded.
theorem iterates_tendsto_constant (z : I) (a : ℝ) (ha0 : 0 < a) (ha1 : a ≤ 1) (ha : ∀ i, a ≤ K.weight i z) (f : I → ℝ) : ∃ c : ℝ, lower f ≤ c ∧ c ≤ upper f ∧ ∀ i, Tendsto (fun n : ℕ => ((K.act)^[n] f) i) atTop (nhds c) := by …Mentions: OAI.FiniteResampling.lower, OAI.FiniteResampling.upper