Download data/lean/OAI/Dynamics/EntropyCounterexample/EntropyBounds.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.57 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Dynamics/EntropyCounterexample/EntropyBounds.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Dynamics/EntropyCounterexample/EntropyBounds.lean
-
curl -L -o EntropyBounds.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Dynamics/EntropyCounterexample/EntropyBounds.lean
5.57 kB
| import Mathlib | |
| namespace OAI | |
| open Filter Set Uniformity | |
| open scoped Topology ENNReal | |
| namespace Problem340 | |
| lemma log_nat_div_tendsto_zero : | |
| Tendsto (fun n : β => Real.log (n : β) / n) atTop (π 0) := by | |
| simpa [Function.comp_def] using (Real.tendsto_pow_log_div_mul_add_atTop 1 0 1 one_ne_zero).comp | |
| (tendsto_natCast_atTop_atTop : Tendsto (fun n : β => (n : β)) atTop atTop) | |
| lemma expGrowthSup_nat_pow (d : β) : | |
| ExpGrowth.expGrowthSup (fun n : β => (n : ββ₯0β) ^ d) = 0 := by | |
| have h : Tendsto (fun n : β => (d : β) * (Real.log (n : β) / n)) | |
| atTop (π 0) := by | |
| simpa using log_nat_div_tendsto_zero.const_mul (d : β) | |
| have h' := EReal.tendsto_coe.mpr h | |
| have heq : (fun n : β => ENNReal.log ((n : ββ₯0β) ^ d) / (n : EReal)) | |
| =αΆ [atTop] (fun n : β => (((d : β) * (Real.log (n : β) / n) : β) : EReal)) := by | |
| filter_upwards [eventually_gt_atTop 0] with n hn | |
| have hnR : (0 : β) < n := by exact_mod_cast hn | |
| rw [ENNReal.log_pow] | |
| have hlog : ENNReal.log (n : ββ₯0β) = (Real.log (n : β) : EReal) := by | |
| rw [β ENNReal.ofReal_natCast, ENNReal.log_ofReal_of_pos hnR] | |
| rw [hlog] | |
| change (((d : β) * Real.log (n : β) / n : β) : EReal) = _ | |
| congr 1 | |
| ring | |
| exact (h'.congr' heq.symm).limsup_eq | |
| lemma expGrowthSup_le_zero_of_polynomial_bound {u : β β ββ₯0β} (C d : β) | |
| (h : βαΆ n in atTop, u n β€ (C : ββ₯0β) * (n + 1) ^ d) : | |
| ExpGrowth.expGrowthSup u β€ 0 := by | |
| have hbound : βαΆ n in atTop, | |
| u n β€ ((C : ββ₯0β) * 2 ^ d) * (n : ββ₯0β) ^ d := by | |
| filter_upwards [h, eventually_ge_atTop 1] with n hn hn1 | |
| apply hn.trans | |
| calc | |
| (C : ββ₯0β) * (n + 1) ^ d β€ (C : ββ₯0β) * (2 * (n : ββ₯0β)) ^ d := by | |
| gcongr | |
| exact_mod_cast (show n + 1 β€ 2 * n by omega) | |
| _ = ((C : ββ₯0β) * 2 ^ d) * (n : ββ₯0β) ^ d := by rw [mul_pow, mul_assoc] | |
| exact (ExpGrowth.expGrowthSup_le_of_eventually_le (by finiteness) hbound).trans_eq | |
| (expGrowthSup_nat_pow d) | |
| lemma coverEntropy_eq_zero_of_polynomial_cover_bound {X : Type*} [UniformSpace X] | |
| (T : X β X) {F : Set X} (hF : F.Nonempty) | |
| (h : β U β π€ X, β C d : β, β n : β, | |
| Dynamics.coverMincard T F U n β€ (C * (n + 1) ^ d : β)) : | |
| Dynamics.coverEntropy T F = 0 := by | |
| apply le_antisymm _ (Dynamics.coverEntropy_nonneg T hF) | |
| apply iSupβ_le | |
| intro U hU | |
| obtain β¨C, d, hboundβ© := h U hU | |
| apply expGrowthSup_le_zero_of_polynomial_bound C d | |
| exact Filter.Eventually.of_forall fun n => by | |
| simpa using ENat.toENNReal_mono (hbound n) | |
| lemma coverEntropy_eq_zero_of_polynomial_net_bound {X : Type*} [UniformSpace X] | |
| (T : X β X) {F : Set X} (hF : F.Nonempty) | |
| (h : β U β π€ X, β C d : β, β n : β, | |
| Dynamics.netMaxcard T F U n β€ (C * (n + 1) ^ d : β)) : | |
| Dynamics.coverEntropy T F = 0 := by | |
| apply le_antisymm _ (Dynamics.coverEntropy_nonneg T hF) | |
| rw [Dynamics.coverEntropy_eq_iSup_netEntropyEntourage] | |
| apply iSupβ_le | |
| intro U hU | |
| obtain β¨C, d, hboundβ© := h U hU | |
| apply expGrowthSup_le_zero_of_polynomial_bound C d | |
| exact Filter.Eventually.of_forall fun n => by | |
| simpa using ENat.toENNReal_mono (hbound n) | |
| lemma netMaxcard_le_card_of_orbit_code {X ΞΉ : Type*} [Fintype ΞΉ] | |
| (T : X β X) (F : Set X) (U : SetRel X X) [U.IsRefl] (n : β) | |
| (code : X β ΞΉ) | |
| (hcode : β x β F, β y β F, code x = code y β | |
| (x, y) β Dynamics.dynEntourage T U n) : | |
| Dynamics.netMaxcard T F U n β€ (Fintype.card ΞΉ : β) := by | |
| classical | |
| apply iSupβ_le | |
| intro s hs | |
| have hinj : Set.InjOn code (s : Set X) := by | |
| intro x hx y hy hxy | |
| exact Set.PairwiseDisjoint.elim_set hs.2 hx hy y | |
| (hcode x (hs.1 hx) y (hs.1 hy) hxy) | |
| (SetRel.rfl (Dynamics.dynEntourage T U n)) | |
| have hcard : s.card β€ Fintype.card ΞΉ := by | |
| simpa using Finset.card_le_card_of_injOn code (fun x _ => Finset.mem_univ (code x)) hinj | |
| exact_mod_cast hcard | |
| lemma coverEntropy_eq_zero_of_eventually_polynomial_net_bound {X : Type*} [UniformSpace X] | |
| (T : X β X) {F : Set X} (hF : F.Nonempty) | |
| (h : β U β π€ X, β C d : β, βαΆ n in atTop, | |
| Dynamics.netMaxcard T F U n β€ (C * (n + 1) ^ d : β)) : | |
| Dynamics.coverEntropy T F = 0 := by | |
| apply le_antisymm _ (Dynamics.coverEntropy_nonneg T hF) | |
| rw [Dynamics.coverEntropy_eq_iSup_netEntropyEntourage] | |
| apply iSupβ_le | |
| intro U hU | |
| obtain β¨C, d, hboundβ© := h U hU | |
| apply expGrowthSup_le_zero_of_polynomial_bound C d | |
| filter_upwards [hbound] with n hn | |
| simpa using ENat.toENNReal_mono hn | |
| lemma coverEntropy_eq_zero_of_polynomial_orbit_codes {X : Type*} [PseudoMetricSpace X] | |
| (T : X β X) {F : Set X} (hF : F.Nonempty) | |
| (h : β Ξ΅ : β, 0 < Ξ΅ β β C d : β, βαΆ n in atTop, | |
| β code : X β Fin (C * (n + 1) ^ d), | |
| β x β F, β y β F, code x = code y β | |
| β j < n, dist (T^[j] x) (T^[j] y) < Ξ΅) : | |
| Dynamics.coverEntropy T F = 0 := by | |
| apply coverEntropy_eq_zero_of_eventually_polynomial_net_bound T hF | |
| intro U hU | |
| obtain β¨Ξ΅, hΞ΅, hΞ΅Uβ© := Metric.mem_uniformity_dist.mp hU | |
| obtain β¨C, d, hcodeβ© := h Ξ΅ hΞ΅ | |
| refine β¨C, d, ?_β© | |
| filter_upwards [hcode] with n hn | |
| obtain β¨code, hshadowβ© := hn | |
| have : SetRel.IsRefl U := isRefl_of_mem_uniformity hU | |
| simpa using netMaxcard_le_card_of_orbit_code T F U n code (by | |
| intro x hx y hy hxy | |
| apply Dynamics.mem_dynEntourage.mpr | |
| intro j hj | |
| exact hΞ΅U (hshadow x hx y hy hxy j hj)) | |
| end Problem340 | |
| end OAI | |