Lexicographic order topology on the unit square

In general topology, the lexicographic ordering on the unit square (sometimes the dictionary order on the unit square[1]) is a topology on the unit square S, i.e. on the set of points (x,y) in the plane such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.[2]

Construction

The lexicographical ordering gives a total ordering on the points in the unit square: if (x,y) and (u,v) are two points in the square, (x,y) (u,v) if and only if either x < u or both x = u and y < v. Stated symbolically,

The lexicographic ordering on the unit square is the order topology induced by this ordering.

Properties

The order topology makes S into a completely normal Hausdorff space.[3] It is an example of an order topology in which there are uncountably many pairwise-disjoint homeomorphic copies of the real line. Since the lexicographical order on S can be proven to be complete, then this topology makes S into a compact set. At the same time, S is not separable, since the set of all points of the form (x,1/2) is discrete but is uncountable. Hence S is not metrizable (since any compact metric space is separable); however, it is first countable. Also, S is connected but not path connected, nor is it locally path connected.[1] Its fundamental group is trivial.[2]

gollark: I mean, given that they make 1TB and 120GB ones in the same size, there must be some empty space.
gollark: Weird.
gollark: Wait, no, that connector looks SATA-y.
gollark: I assume it's M.2 somethingsomething.
gollark: `The multicore CPU on the Cisco ISR G2 platforms runs classic Cisco IOS Software. Since Cisco IOS Software is a single threaded operating system, only a single core is active. ` - why add multiple cores then? What a weird thing for them to do.

See also

Notes
  1. 1950-, Lee, John M. (2011). Introduction to topological manifolds (2nd ed.). New York: Springer. ISBN 978-1441979391. OCLC 697506452.CS1 maint: numeric names: authors list (link)
  2. Steen & Seebach (1995), p. 73.
  3. Steen & Seebach (1995), p. 66.

References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.