From 8f4df44d55974ecfaaff4850ebdb4d54a4b0757d Mon Sep 17 00:00:00 2001 From: Bokuan Li Date: Wed, 16 Sep 2026 13:27:08 -0400 Subject: [PATCH] Fixed typo. --- src/dyn/top/def.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/dyn/top/def.tex b/src/dyn/top/def.tex index 8cbddbe..51c5712 100644 --- a/src/dyn/top/def.tex +++ b/src/dyn/top/def.tex @@ -149,7 +149,7 @@ \begin{example}[The Shift] \label{example:bernoulli-shift-z} - Let $\integer \curvearrowright 2^\integer$ be the Bernoulli shift of $G$, then: + Let $\integer \curvearrowright 2^\integer$ be the Bernoulli shift of $\integer$, then: \begin{enumerate} \item For any $x, y \in 2^\integer$, $y \in \ol{\integer x}$ if and only if for each $A \subset \integer$, there exists $n \in \integer$ such that $y|_A = nx|_A$. In other words, $x$ contains a copy of any segment of $y$\footnote{Topological conditions in Bernoulli shifts translate into combinatorial information. }. \item $\integer \curvearrowright 2^\integer$ is point transitive, and hence topologically transitive\footnote{It is easier to show topological transitivity: move the trees until they are disjoint}.