Theorems · Definition · dynamical systems
Dynamics.IsDynNetIn
{X : Type u_1} → (X → X) → Set X → SetRel X X → ℕ → Set X → PropGiven a subset F, an entourage U and an integer n, a subset s of F is a
(U, n)-dynamical net of F if no two orbits of length n of points in s shadow each other.
- Cited by
- 18 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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
- SetRelstatement and proof · cited by 581
- Set.PairwiseDisjointproof · cited by 275
- UniformSpace.ballproof · cited by 113
- Dynamics.dynEntourageproof · cited by 28
Cited by19
Results whose statement or proof uses this declaration.
- Dynamics.netMaxcardproof · cited by 23
- Dynamics.IsDynNetIn.card_le_netMaxcardstatement and proof · cited by 3
- Dynamics.netMaxcard_antitoneproof · cited by 2
- Dynamics.netMaxcard_emptyproof · cited by 2
- Dynamics.netMaxcard_le_coverMincardproof · cited by 2
- Dynamics.netMaxcard_monotone_subsetproof · cited by 2
- Dynamics.netMaxcard_univproof · cited by 2
- Dynamics.coverMincard_le_netMaxcardproof · cited by 2
- Dynamics.IsDynNetIn.card_le_card_of_isDynCoverOfstatement and proof · cited by 1
- Dynamics.IsDynNetIn.monotone_subsetstatement and proof · cited by 1
- Dynamics.IsDynNetIn.of_entourage_subsetstatement and proof · cited by 1
- Dynamics.IsDynNetIn.of_lestatement and proof · cited by 1