Theorems · Definition · dynamical systems
SymbolicDynamics.FullShift.Subshift.ofForbidden
{A : Type u_1} →
[inst : TopologicalSpace A] →
[inst_1 : Inhabited A] →
{G : Type u_2} →
[inst_2 : AddMonoid G] →
[IsLeftCancelAdd G] →
[DiscreteTopology A] →
Set (SymbolicDynamics.FullShift.Pattern A G) → SymbolicDynamics.FullShift.Subshift A GThe subshift defined by a family of forbidden patterns F.
This is a standard way to construct subshifts:
Subshift.ofForbidden F consists of all configurations x : G → A in which no pattern
p ∈ F occurs at any position.
Formally:
* the carrier is forbidden F (configurations avoiding F),
* it is closed because each occurrence set is open, and
* it is shift-invariant since avoidance is preserved by shifts.
- Defined in
- Mathlib.Dynamics.SymbolicDynamics.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 85 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- AddMonoidstatement and proof · cited by 2,864
- DiscreteTopologystatement and proof · cited by 373
- IsLeftCancelAddstatement and proof · cited by 72
- SymbolicDynamics.FullShift.Patternstatement and proof · cited by 21
- SymbolicDynamics.FullShift.Subshiftstatement · cited by 5
- SymbolicDynamics.FullShift.forbiddenproof · cited by 2
- SymbolicDynamics.FullShift.isClosed_forbiddenproof · cited by 0
- SymbolicDynamics.FullShift.Pattern.mapsTo_shift_forbiddenproof · cited by 0
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.