Theorems · Definition · dynamical systems
Dynamics.coverMincard
{X : Type u_1} → (X → X) → Set X → SetRel X X → ℕ → ℕ∞The smallest cardinality of a (U, n)-dynamical cover of F. Takes values in ℕ∞, and is
infinite if and only if F admits no finite dynamical cover.
- Cited by
- 39 results in Mathlib
- Foundations
- Depth 54 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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
- Finsetproof · cited by 13,712
- SetLike.coeproof · cited by 8,199
- ENatstatement · cited by 4,985
- Finset.cardproof · cited by 2,327
- iInfproof · cited by 1,690
- SetRelstatement and proof · cited by 581
- Dynamics.IsDynCoverOfproof · cited by 36
Cited by41
Results whose statement or proof uses this declaration.
- Dynamics.coverEntropyEntourageproof · cited by 20
- Dynamics.coverEntropyInfEntourageproof · cited by 15
- Dynamics.IsDynCoverOf.coverMincard_le_cardstatement · cited by 12
- Dynamics.coverMincard_finite_iffstatement and proof · cited by 6
- Dynamics.coverEntropyEntourage_antitoneproof · cited by 6
- Dynamics.coverEntropyInfEntourage_antitoneproof · cited by 4
- Dynamics.coverMincard_monotone_timestatement · cited by 3
- Dynamics.coverMincard_antitonestatement · cited by 2
- Dynamics.coverMincard_closure_lestatement and proof · cited by 2
- Dynamics.coverMincard_emptystatement · cited by 2
- Dynamics.coverMincard_image_lestatement and proof · cited by 2
- Dynamics.coverMincard_le_netMaxcardstatement and proof · cited by 2