Topology/Order

From testwiki
Revision as of 03:15, 5 June 2023 by imported>DaGizza (typo)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Navigation


Recall that a set X is said to be totally ordered if there exists a relation satisfying for all x,y,zX

  1. (xy)(yx)x=y (antisymmetry)
  2. (xy)(yz)xz (transitivity)
  3. (xy)(yx) (totality)

The usual topology 𝒰 on is defined so that the open intervals (a,b) for a,b form a base for 𝒰. It turns out that this construction can be generalized to any totally ordered set (X,).

Definition

Let (X,) be a totally ordered set. The topology 𝒯 on X generated by sets of the form (,a) or (a,) is called the order topology on X


Template:Navigation Template:Subjects