Box topology

Box topology

In topology, the cartesian product of topological spaces can be given several different topologies. The canonical one is the product topology, because it fits rather nicely with the categorical notion of a product. Another possibility is the box topology. The box topology has a somewhat more obvious definition than the product topology, but it satisfies fewer desirable properties. In general, the box topology is finer than the product topology, although the two agree in the case of direct products (or when all but finitely many of the factors are trivial).

Let "I" be an arbitrary index set and suppose "Xi" is a topological space for every "i" in "I". Set "X" = Π "Xi", the cartesian product of the sets "Xi". Now consider the topology generated by the collection "B" = { Π "Ui" | "Ui" open in "Xi"}, the cartesian products of every open set of every "Xi". We call this the box topology (so called because in the case of R"n", the basis sets look like boxes or unions thereof). It is easily verified that "B" is actually a basis for the topology.

One often wonders how this topology compares with the product topology. The basis sets in the product topology have almost the same definition as the above, "except" with the proviso that "all but finitely many" "Ui" are equal to the whole space "Xi" This may seem like a rather irksome detail, but the product topology satisfies a very desirable property for maps "fi" : "Y" → "Xi" into the component spaces: the product map "f": "Y" → "X" defined by the component functions "fi" is continuous if and only if all the "fi" are continuous. This does not always hold in the box topology, because it is in general a much finer topology, so therefore mapping into the range space makes it much harder for functions to be continuous. This actually makes the box topology very useful for providing counterexamples — many qualities such compactness, connectedness, metrizability, etc., if possessed by the factor spaces, are not in general preserved in the product with this topology.

Example

Here is an example given by Munkres, based on the Hilbert cube. Let R"ω" denote the countable cartesian product of R with itself, i.e. the set of all sequences in R. Let "f" : RR"ω" be the product map whose components are all the identity, i.e. "f"("x") = ("x, x, x," ...). Obviously the component functions are continuous. Consider the open set U = prod_{n=1}^{infty}(-1/n, 1/n). If "f" were continuous, a preimage would have to contain an interval ("−ε, ε") about 0 (since "f"(0) = (0,0,0,...) is in "U"). The image of this interval must, in turn, be contained in "U". But the image of ("−ε,ε") is its own countable cartesian product. But ("−ε,ε") cannot be contained in (−1/"n", 1/"n") for every "n"; thus one concludes that "f" is not continuous even though all its components are.

Intuitive Description of Convergence; Comparisons

Topologies are often best understood by describing how sequences converge. In general, a cartesian product of a space "X" with itself over an indexing set "S" is precisely the space of functions from "S" to "X"; the product topology yields the topology of pointwise convergence; sequences of functions converge if and only if they converge at every point of "S". The box topology, once again due to its great profusion of open sets, makes convergence very hard. One way to visualize the convergence in this topology is to think of functions from R to R — a sequence of functions converges to a function "f" in the box topology if, when looking at the graph of "f", given any set of "hoops", that is, vertical open intervals surrounding the graph of "f" above every point on the "x"-axis, eventually, every function in the sequence "jumps through all the hoops." For functions on R this looks a lot like uniform convergence, in which case all the "hoops", once chosen, must be the same size. But in this case one can make the hoops arbitrarily small, so one can see intuitively how "hard" it is for sequences of functions to converge. The hoop picture works for convergence in the product topology as well: here we only require all the functions to jump through any given "finite" set of hoops. This stems directly from the fact that, in the product topology, almost all the factors in a basic open set is the whole space. Interestingly, this is actually equivalent to requiring all functions to eventually jump through just a "single" given hoop; this is just the definition of pointwise convergence.

ee also

* Cylinder set

References

*


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Topology (electronics) — The topology of an electronic circuit is the form taken by the network of interconnections of the circuit components. Different specific values or ratings of the components are regarded as being the same topology.Strictly speaking, replacing a… …   Wikipedia

  • Product topology — In topology and related areas of mathematics, a product space is the cartesian product of a family of topological spaces equipped with a natural topology called the product topology. This topology differs from another, perhaps more obvious,… …   Wikipedia

  • Trivial topology — In topology, a topological space with the trivial topology is one where the only open sets are the empty set and the entire space. Such a space is sometimes called an indiscrete space, and its topology sometimes called an indiscrete topology.… …   Wikipedia

  • Electronic filter topology — An elementary filter topology introduces a capacitor into the feedback path of an op amp to achieve an unbalanced active implementation of a low pass transfer function Electronic filter topology defines electronic filter circuits without taking… …   Wikipedia

  • Counterexamples in Topology —   Author(s) Lynn Arthur Steen J. Ar …   Wikipedia

  • Link Layer Topology Discovery — (LLTD) is a proprietary Link Layer protocol for network topology discovery and quality of service diagnostics. It was developed by Microsoft as part of the Windows Rally set of technologies. The LLTD protocol operates over both wired (IEEE 802.3… …   Wikipedia

  • Direct product — In mathematics, one can often define a direct product of objects already known, giving a new one. This is generally the Cartesian product of the underlying sets, together with a suitably defined structure on the product set. More abstractly, one… …   Wikipedia

  • List of mathematics articles (B) — NOTOC B B spline B* algebra B* search algorithm B,C,K,W system BA model Ba space Babuška Lax Milgram theorem Baby Monster group Baby step giant step Babylonian mathematics Babylonian numerals Bach tensor Bach s algorithm Bachmann–Howard ordinal… …   Wikipedia

  • Field-programmable gate array — FPGAs should not be confused with the flip chip pin grid array, a form of integrated circuit packaging. A field programmable gate array is a semiconductor device containing programmable logic components called logic blocks , and programmable… …   Wikipedia

  • Cofiniteness — Not to be confused with cofinality. In mathematics, a cofinite subset of a set X is a subset A whose complement in X is a finite set. In other words, A contains all but finitely many elements of X. If the complement is not finite, but it is… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”