Limit closure of metric spaces Michael Barr, John Kennison, Robert - - PowerPoint PPT Presentation

limit closure of metric spaces
SMART_READER_LITE
LIVE PREVIEW

Limit closure of metric spaces Michael Barr, John Kennison, Robert - - PowerPoint PPT Presentation

Limit closure of metric spaces Michael Barr, John Kennison, Robert Raphael McGill Univ., Clark Univ., and Concordia Univ. What is a uniform space? Essentially a uniform space is described by the proportion: topology : uniformity = continuous :


slide-1
SLIDE 1

Limit closure of metric spaces

Michael Barr, John Kennison, Robert Raphael

McGill Univ., Clark Univ., and Concordia Univ.

slide-2
SLIDE 2

What is a uniform space?

Essentially a uniform space is described by the proportion: topology : uniformity = continuous : uniformly continuous Created in A. Weil (1938), Sur les espaces ` a structure uniforme et sur la topologie g´ en´

  • erale. Act. Sci. Ind. 551, Paris.

2 / 13

slide-3
SLIDE 3

Pseudometrics

A pseudometric d on a set X is a function d : X ⇥ X

/ R that

satisfies:

  • d(x, x) = 0
  • d(x, y) = d(y, x)
  • d(x, z)  d(x, y) + d(y, z)
  • But not d(x, y) = 0 implies x = y

3 / 13

slide-4
SLIDE 4

Uniformities

A (separated) uniformity on a set X is a family D of pseudometrics

  • n X that satisfies:
  • d 2 D and r > 0 implies rd 2 D
  • d, e 2 D implies d _ e 2 D
  • for x 6= y 2 X, there is d 2 D such that d(x, y) > 0

A function f : (X, D)

/ (X 0, D0) is uniform if for all d0 2 D0,

there is a d 2 D such that d(x, y) < 1 , d0(fx, fy) < 1

4 / 13

slide-5
SLIDE 5

Uniform topology

Let (X, D) be a uniform space. For A ✓ X, x 2 X, d 2 D, define d(x, A) = infa2A d(x, a). Then x 2 cl(A) if d(x, A) = 0 for all d 2 D. This is a closure operator and defines a topology, called the uniform topology. Distinct uniformities can give the same topology.

5 / 13

slide-6
SLIDE 6

Embedding into Qmetric

For each d 2 D define Ed by xEdy if d(x, y) = 0. Then let Xd = X/Ed with qd : X

/ Xd. Then d induces a metric on Xd,

qd is uniform and X , ! Q Xd is an embedding. Thus, Every (separated) uniform space can be embedded into a product

  • f metric spaces.

6 / 13

slide-7
SLIDE 7

Closed subspaces and equalizers

Suppose X ✓ Y is closed. Define f , g : Y

/ RD by

f (y)(d) = d(y, X) and g(y)(d) = 0. clearly the equalizer of f and g is X. Conversely, since separated uniform spaces are Hausdorff, the equalizer of any two maps Y ) Z is closed. If X , ! Y is an embedding of uniform spaces, X is closed in Y if and only if there is an equalizer diagram X

/ Y // Z

7 / 13

slide-8
SLIDE 8

When is a uniform space closed in a product of metric?

If (X, D) is Cauchy complete (defined next slide), then it is closed in every embedding. But completeness is too strong since every metric space is a closed subspace of a product of metric spaces, namely itself. James Cooper conjectured and we proved that this holds iff every strongly Cauchy net converges.

8 / 13

slide-9
SLIDE 9

Cauchy and strongly Cauchy nets

A net {xi} in X is Cauchy if for all d 2 D, there is an i such that j i implies d(xi, xj) < 1. The net converges to x if for all d 2 D, there is an i such that j i implies d(xj, x) < 1. X is complete if every Cauchy net converges. A net {xi} is strongly Cauchy if for all d 2 D there is an i such that j > i implies d(xi, xj) = 0. X is Cooper complete if every strongly Cauchy net converges.

9 / 13

slide-10
SLIDE 10

Limits of metric spaces are Cooper complete

Metric spaces are Cooper complete. One readily sees that the Cooper complete spaces are closed under products and closed subspaces, in particular limits. This shows one half of A space is a limit of metric spaces if and only if it is Cooper complete.

10 / 13

slide-11
SLIDE 11

Some useful maps

  • product projection pd : Q Xd

/ Xd.

  • pd|X = qd.
  • If d  e, Ee ✓ Ed induces qde : Xe

/ Xd.

  • Xe

Xd

qde

/

X Xe

qe

{wwwwwww X

Xd

qd

# G G G G G G G

commutes so that qdeqe = qd.

  • Therefore qdepe|X = pd|X.
  • Therefore qdepe|cl(X) = pd|cl(X).

11 / 13

slide-12
SLIDE 12

Some useful maps

  • product projection pd : Q Xd

/ Xd.

  • pd|X = qd.
  • If d  e, Ee ✓ Ed induces qde : Xe

/ Xd.

  • Xe

Xd

qde

/

X Xe

qe

{wwwwwww X

Xd

qd

# G G G G G G G

commutes so that qdeqe = qd.

  • Therefore qdepe|X = pd|X.
  • Therefore qdepe|cl(X) = pd|cl(X).

11 / 13

slide-13
SLIDE 13

Some useful maps

  • product projection pd : Q Xd

/ Xd.

  • pd|X = qd.
  • If d  e, Ee ✓ Ed induces qde : Xe

/ Xd.

  • Xe

Xd

qde

/

X Xe

qe

{wwwwwww X

Xd

qd

# G G G G G G G

commutes so that qdeqe = qd.

  • Therefore qdepe|X = pd|X.
  • Therefore qdepe|cl(X) = pd|cl(X).

11 / 13

slide-14
SLIDE 14

Some useful maps

  • product projection pd : Q Xd

/ Xd.

  • pd|X = qd.
  • If d  e, Ee ✓ Ed induces qde : Xe

/ Xd.

  • Xe

Xd

qde

/

X Xe

qe

{wwwwwww X

Xd

qd

# G G G G G G G

commutes so that qdeqe = qd.

  • Therefore qdepe|X = pd|X.
  • Therefore qdepe|cl(X) = pd|cl(X).

11 / 13

slide-15
SLIDE 15

Some useful maps

  • product projection pd : Q Xd

/ Xd.

  • pd|X = qd.
  • If d  e, Ee ✓ Ed induces qde : Xe

/ Xd.

  • Xe

Xd

qde

/

X Xe

qe

{wwwwwww X

Xd

qd

# G G G G G G G

commutes so that qdeqe = qd.

  • Therefore qdepe|X = pd|X.
  • Therefore qdepe|cl(X) = pd|cl(X).

11 / 13

slide-16
SLIDE 16

Some useful maps

  • product projection pd : Q Xd

/ Xd.

  • pd|X = qd.
  • If d  e, Ee ✓ Ed induces qde : Xe

/ Xd.

  • Xe

Xd

qde

/

X Xe

qe

{wwwwwww X

Xd

qd

# G G G G G G G

commutes so that qdeqe = qd.

  • Therefore qdepe|X = pd|X.
  • Therefore qdepe|cl(X) = pd|cl(X).

11 / 13

slide-17
SLIDE 17

A strongly Cauchy net

Let y 2 cl(X). Define a net {xd} of elements of X indexed by D, which is directed by  : choose xd 2 X so that pdy = qdxd which is always possible since qd is surjective. Then

  • qdxd = pdy, by definition
  • = qdepey, since y 2 cl(X)
  • = qdeqexe, by definition
  • = qdxe, by preceding slide
  • and therefore d(xd, xe) = 0.

12 / 13

slide-18
SLIDE 18

A strongly Cauchy net

Let y 2 cl(X). Define a net {xd} of elements of X indexed by D, which is directed by  : choose xd 2 X so that pdy = qdxd which is always possible since qd is surjective. Then

  • qdxd = pdy, by definition
  • = qdepey, since y 2 cl(X)
  • = qdeqexe, by definition
  • = qdxe, by preceding slide
  • and therefore d(xd, xe) = 0.

12 / 13

slide-19
SLIDE 19

A strongly Cauchy net

Let y 2 cl(X). Define a net {xd} of elements of X indexed by D, which is directed by  : choose xd 2 X so that pdy = qdxd which is always possible since qd is surjective. Then

  • qdxd = pdy, by definition
  • = qdepey, since y 2 cl(X)
  • = qdeqexe, by definition
  • = qdxe, by preceding slide
  • and therefore d(xd, xe) = 0.

12 / 13

slide-20
SLIDE 20

A strongly Cauchy net

Let y 2 cl(X). Define a net {xd} of elements of X indexed by D, which is directed by  : choose xd 2 X so that pdy = qdxd which is always possible since qd is surjective. Then

  • qdxd = pdy, by definition
  • = qdepey, since y 2 cl(X)
  • = qdeqexe, by definition
  • = qdxe, by preceding slide
  • and therefore d(xd, xe) = 0.

12 / 13

slide-21
SLIDE 21

A strongly Cauchy net

Let y 2 cl(X). Define a net {xd} of elements of X indexed by D, which is directed by  : choose xd 2 X so that pdy = qdxd which is always possible since qd is surjective. Then

  • qdxd = pdy, by definition
  • = qdepey, since y 2 cl(X)
  • = qdeqexe, by definition
  • = qdxe, by preceding slide
  • and therefore d(xd, xe) = 0.

12 / 13

slide-22
SLIDE 22

Conclusion

Thus this is a strongly Cauchy net and therefore converges to some x 2 X. But it is immediate that d(x, y) = 0 for all d 2 D and therefore y = x 2 X and therefore X is closed in Q Xd.

13 / 13