Consider the collection of all $n$-colorings of $\mathbb{Z^{d}}$ (i.e. the collection of all ways to color each lattice point one of $n$ colors). What are some non-trivial ways to define a topology on this collection?
1 Answer
$\begingroup$ $\endgroup$
3 Hint: what topologies do you know on $\{0,1\}^{\mathbb{Z}}$, which is the set of $2$-colorings of $\mathbb{Z}^1$? Can you extend them to this case?
- $\begingroup$ Thanks....subspace topology of the box/product topology? Are there any other that you know of? I'm playing around with a function defined on this collection and would like to have different topologies to work with. $\endgroup$user13255– user132552011-12-01 23:39:43 +00:00Commented Dec 1, 2011 at 23:39
- $\begingroup$ The discrete topology is another one unless it counts as trivial. If you define a "metric" in the spirit of Hamming distance (even though the value may be infinite) is that the same as the product topology? $\endgroup$Ross Millikan– Ross Millikan2011-12-01 23:52:52 +00:00Commented Dec 1, 2011 at 23:52
- $\begingroup$ The 'Hamming Distance' topology is discrete; e.g. the set B({1,0,0,0...}, 1.5) intersected with B({0,1,0,0,0...}, 1.5) intersected with B({0,0,1,0,0,0...}, 1.5) is just the one-point set {0,0,0,0,0...}. $\endgroup$Lopsy– Lopsy2011-12-31 23:48:20 +00:00Commented Dec 31, 2011 at 23:48