Theorems · Theorem · dynamical systems
SymbolicDynamics.FullShift.isClosed_mulForbidden
∀ {A : Type u_1} [inst : TopologicalSpace A] [inst_1 : Inhabited A] {G : Type u_2} [inst_2 : Monoid G]
[IsLeftCancelMul G] [DiscreteTopology A] (F : Set (SymbolicDynamics.FullShift.Pattern A G)),
IsClosed (SymbolicDynamics.FullShift.mulForbidden F)Avoiding a fixed family of patterns is a closed condition (in the product topology on G → A).
Since each occurrence set { x | p.mulOccursInAt x v } is open (when A is discrete),
its complement { x | ¬ p.mulOccursInAt x v } is closed; forbidden F is the intersection
of these closed sets over p ∈ F and v ∈ G.
- Defined in
- Mathlib.Dynamics.SymbolicDynamics.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 84 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
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
- TopologicalSpacestatement and proof · cited by 24,529
- Set.ofPredproof · cited by 6,101
- Monoidstatement and proof · cited by 3,887
- Compl.complproof · cited by 2,925
- Set.extproof · cited by 2,266
- IsClosedstatement and proof · cited by 1,639
- Set.iInterproof · cited by 1,084
- DiscreteTopologystatement and proof · cited by 373
- IsLeftCancelMulstatement and proof · cited by 51
- isClosed_iInterproof · cited by 43
- SymbolicDynamics.FullShift.Patternstatement and proof · cited by 21
Cited by1
Results whose statement or proof uses this declaration.
- SymbolicDynamics.FullShift.MulSubshift.ofForbiddenproof · cited by 0