Complete metric space

Metric completion

The completion ――𝑋 of a metric space 𝑋 may be thought of as the smallest possible metric space containing 𝑋 but with all limits added, #m/def/anal i.e. a complete metric space. This notion is made rigorous by the universal property, which ensures uniqueness up to unique isomorphism.

Universal property

The metric completion is characterized up to unique isomorphism in 𝖨𝗌𝗈𝖬𝖾𝗍 by the following universal property:

――𝑋 is complete. If 𝑌 is a complete metric space and 𝑓 𝖨𝗌𝗈𝖬𝖾𝗍(𝑋,𝑌) such that 𝑓(𝑋) is dense in 𝑌, then there exists a unique isometry ¯𝑓 𝖨𝗌𝗈𝖬𝖾𝗍(――𝑋,𝑌) such that 𝑓 =¯𝑓𝜄, i.e. the following diagram commutes

https://q.uiver.app/#q=WzAsMyxbMCwwLCJYIl0sWzIsMCwiXFxiYXIgWCJdLFsyLDIsIlkiXSxbMCwxLCJcXGlvdGEiXSxbMSwyLCJcXGJhciBmIiwwLHsic3R5bGUiOnsiYm9keSI6eyJuYW1lIjoiZGFzaGVkIn19fV0sWzAsMiwiZiIsMl1d

This of course forms a Free-forgetful adjunction into the full subcategory of complete metric spaces and isometries.

Construction

Let ˜𝑋 denote the set of all Cauchy sequences on 𝑋, For any sequences 𝑥,𝑦 ˜𝑋, let

𝑥𝑦lim𝑛𝑑(𝑥𝑛,𝑦𝑛)=0

which defines an equivalence relation. The completion ――𝑋 is the quotient ˜𝑋/ with a metric 𝑑 given by

𝑑([𝑥],[𝑦])=lim𝑛𝑑(𝑥𝑛,𝑦𝑛)

and 𝜄(𝑥) =[(𝑥,𝑥,𝑥,)].

Validity of construction

First we will show that indeed defines an equivalence relation. reflexivity and symmetry are clear, and transitivity follows from triangle inequality: If 𝑥 𝑦 and 𝑦 𝑧, then lim𝑛𝑑(𝑥𝑛,𝑧𝑛) lim𝑛(𝑑(𝑥𝑛,𝑦𝑛) +𝑑(𝑦𝑛,𝑧𝑛)) 0 so 𝑥 𝑧.

Next we show that the metric on ――𝑋 is well-defined. Let 𝑥 𝜉 and 𝑦 𝜂. Then by the triangle inequality

𝑑([𝑥],[𝑦])=lim𝑛𝑑(𝑥𝑛,𝑦𝑛)lim𝑛(𝑑(𝜉𝑛,𝜂𝑛)+𝑑(𝑥𝑛,𝜉𝑛)+𝑑(𝑦𝑛,𝜂𝑛))=lim𝑛𝑑(𝜉𝑛,𝜂𝑛)=𝑑([𝜉,𝜂])

but by symmetry the reverse inequality holds too, so 𝑑([𝑥],[𝑦]) =𝑑([𝜉,𝜂]). symmetry and positive definite follow immediately. For positive definite note

𝑑([𝑥],[𝑦])=lim𝑛𝑑(𝑥𝑛,𝑦𝑛)lim𝑛(𝑑(𝑥𝑛,𝑧𝑛)+𝑑(𝑧𝑛,𝑦𝑛))=𝑑([𝑥],[𝑧])+𝑑([𝑧],[𝑦])

as required.

Now we need to show that the given construction is indeed complete. We make the following observations

  • Let ――𝑥 ――𝑋. If 𝑥 ――𝑥, then so too is every subsequence 𝑥𝑛 ――𝑥.
  • Let 𝑥 ――𝑥 ――𝑋. Since 𝑥 is Cauchy, for every 𝜖 >0 there exists a subsequence 𝑥𝑛 such that 𝑑(𝑥𝑛𝑘,𝑥𝑛) <𝜖 for all 𝑘, .

Let ――𝑥 be a Cauchy sequence in ――𝑋. For each 𝑛 , we fix a representative 𝑥𝑛, ――𝑥𝑛 in 𝑋 such that for all 𝑘, we have 𝑑(𝑥𝑛,𝑘,𝑥𝑛,) <1𝑛. Since ――𝑥 is Cauchy, for every 𝑗 there exists an 𝑁𝑗 such that for all 𝑚,𝑛,𝑘 𝑁𝑗 we have 𝑑(𝑥𝑛,𝑘,𝑥𝑚,𝑘) <1𝑗 (using that sufficiently large 𝑚,𝑛 have lim𝑘𝑑(𝑥𝑚,𝑘,𝑦𝑛,𝑘) <1𝑗). Now let 𝜆𝑗 =𝑥𝑁𝑗,𝑁𝑗 which is Cauchy in 𝑋, since for any if 𝑖,𝑗 and thus 𝑁𝑖,𝑁𝑗 𝑁 we have

𝑑(𝜆𝑖,𝜆𝑗)=𝑑(𝑥𝑁𝑖,𝑁𝑖,𝑥𝑁𝑗,𝑁𝑗)𝑑(𝑥𝑁𝑖,𝑁𝑖,𝑥𝑁𝑖,𝑁𝑗)+𝑑(𝑥𝑁𝑖,𝑁𝑗,𝑥𝑁𝑗,𝑁𝑗)1𝑖+12

We claim ――𝑥 =[𝜆] is the limit of ――𝑥.

Let 𝑗 and 𝑛 max{𝑁𝑗,𝑗}. Then

𝑑(――𝑥𝑛,――𝑥)=lim𝑘𝑑(𝑥𝑛,𝑘,𝜆𝑘)=lim𝑘𝑑(𝑥𝑛,𝑘,𝑥𝑁𝑘,𝑁𝑘)lim𝑘(𝑑(𝑥𝑛,𝑁𝑘,𝑥𝑁𝑘,𝑁𝑘)+𝑑(𝑥𝑛,𝑘,𝑥𝑛,𝑁𝑘))1𝑗+1𝑛2𝑗

so ――𝑥 ――𝑥.

It remains to show that ――𝑋 satisfies the universal property. Let 𝑌 be a complete metric space and 𝑓 𝖨𝗌𝗈𝖬𝖾𝗍(𝑋,𝑌).


#state/tidy | #lang/en | #SemBr