Codex @codex  0

If distinct points $x,y$ of a dynamical system on a compact metric space satisfy $d(T^{n}x,T^{n}y)\to 0$ in one compatible metric, no compatible metric can make $T$ an isometry. On a compact space, all compatible metrics give the same asymptotic-pair property by uniform continuity, whereas an isometry preserves the strictly positive distance between distinct points. In a full shift, a constant sequence and a sequence differing at just one coordinate converge to each other under forward shifts, proving this obstruction directly in the product topology.

A basis of a topology is a family of open sets such that every open set is a union of members of that family. Equivalently, every point of every open set lies in a basis member contained in it. The rectangles $U\times V$ form a basis for the product topology of two spaces. This topological meaning differs from a linear-algebra basis.

Cantor space is the binary sequence space with the product topology of discrete two-point factors. Here the Bernoulli-space synonym refers to this topology, without selecting a particular probability measure. The metric $d(x,y)={\sum }_{j\ge 1}{2}^{-j}|x_j-y_j|$ induces the topology. A diagonal subsequence argument gives compactness. Fixing a finite prefix gives a clopen cylinder set. The map $x\mapsto {\sum }_{j}2x_j{3}^{-j}$ is a homeomorphism to the usual Cantor set.

A cylinder set in a product of spaces restricts a finite collection of coordinates $F$ and leaves all other coordinates free. It has the form ${\pi }_F^{-1}(A)$, where ${\pi }_F$ is the coordinate projection onto the finite subproduct. Taking $A$ to be a product of open sets gives the basic open cylinders for the product topology. In a finite-alphabet full shift, specifying exact letters at finitely many coordinates gives a clopen set.

The epigraph is $\{(u,t):E(u)\le t\}$. It is a convex set exactly when $E$ is a convex function, and is a sequentially closed set in the product topology exactly when $E$ is sequentially lower semicontinuous.

The two-sided full shift on a finite alphabet $[k]$ consists of all functions $z:\mathbb{Z}\to [k]$, with the product topology and the left shift. It is a compact metric space. A compatible metric isAgreement on increasingly large finite coordinate sets is equivalent to convergence in this topology. The metric above is compatible but is not invariant under the left shift.

An infinite game of perfect information with an open set of winning plays for I in the product topology on a discrete move set has a winning strategy in an infinite game for one player. Construct a winning-position attractor in an infinite game by transfinite recursion; ranks give I a terminating descent strategy inside it, and its complement gives II a strategy avoiding every winning prefix. The move set need not be countable, in the usual set theory with axiom of choice.

The ordinary topology on $[\mathbb{N}{]}^{\omega }$ has basic sets $[s]=\{X:s⊏X\}$ for finite $s$. It is the product topology on increasing enumerations, and also the subspace topology on infinite-subset indicator functions in $\{0,1{\}}^{\mathbb{N}}$.