Theorems · Theorem · dynamical systems
Dynamics.coverEntropyInf_eq_iSup_netEntropyInfEntourage
∀ {X : Type u_1} [inst : UniformSpace X] (T : X → X) (F : Set X),
Dynamics.coverEntropyInf T F = ⨆ U ∈ uniformity X, Dynamics.netEntropyInfEntourage T F UBowen-Dinaburg's definition of topological entropy using nets is
⨆ U ∈ 𝓤 X, netEntropyEntourage T F U. This quantity is the same as the topological entropy using
covers, so there is no need to define a new notion of topological entropy. This version of the
theorem relates the liminf versions of topological entropy.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 179 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- UniformSpace
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites26
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Filterstatement · cited by 8,121
- LE.le.transproof · cited by 3,151
- iSupstatement · cited by 2,415
- le_antisymmproof · cited by 2,068
- UniformSpacestatement and proof · cited by 2,040
- ERealstatement · cited by 793
- uniformitystatement and proof · cited by 765
- LE.le.trans'proof · cited by 140
- SetRel.compproof · cited by 136
- iSup₂_leproof · cited by 96
- SetRel.IsSymmproof · cited by 93
Cited by2
Results whose statement or proof uses this declaration.
- Dynamics.coverEntropyInf_eq_iSup_basis_netEntropyInfEntourageproof · cited by 0
- Dynamics.netEntropyInfEntourage_le_coverEntropyInfproof · cited by 0