请输入您要查询的字词:

 

单词 82ConnectednessOfSuspensions
释义

8.2 Connectedness of suspensions


Recall from \\autorefsec:connectivity that a type A is called n-connected if An is contractibleMathworldPlanetmath.The aim of this sectionPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath is to prove that the operationMathworldPlanetmath of suspension from \\autorefsec:suspension increases connectedness.

Theorem 8.2.1.

If A is n-connected then the suspension of A is (n+1)-connected.

Proof.

We remarked in \\autorefsec:colimitsMathworldPlanetmath that the suspension of A is the pushout 𝟏A𝟏, so we need toprove that the following type is contractible:

𝟏A𝟏n+1.

By \\autorefreflectcommutespushout we know that𝟏A𝟏n+1 is a pushout in (n+1)-𝖳𝗒𝗉𝖾 of the diagram

\\xymatrixAn+1\\ar[d]\\ar[r]&𝟏n+1𝟏n+1&.

Given that 𝟏n+1=𝟏, the type𝟏A𝟏n+1 is also a pushout of the following diagram in(n+1)-𝖳𝗒𝗉𝖾 (because both diagrams are equal)

𝒟=\\xymatrixA_n+1\\ar[d] \\ar[r] & 𝟏 
𝟏 & 
.

We will now prove that 𝟏 is also a pushout of 𝒟 in(n+1)-𝖳𝗒𝗉𝖾.Let E be an (n+1)-truncated type; we need to prove that the following mapis an equivalence

{(𝟏E)𝖼𝗈𝖼𝗈𝗇𝖾𝒟(E)y(y,y,λu.𝗋𝖾𝖿𝗅y()).

where we recall that 𝖼𝗈𝖼𝗈𝗇𝖾𝒟(E) is the type

(f:𝟏E)(g:𝟏E)(An+1(f()=Eg())).

The map {(𝟏E)Eff() is an equivalence, hencewe also have

𝖼𝗈𝖼𝗈𝗇𝖾𝒟(E)=(x:E)(y:E)(An+1(x=Ey)).

Now A is n-connected hence so is An+1 becauseAn+1n=An=𝟏, and (x=Ey) is n-truncated becauseE is (n+1)-connected. Hence by \\autorefconnectedtotruncated thefollowing map is an equivalence

{(x=Ey)(An+1(x=Ey))pλz.p

Hence we have

𝖼𝗈𝖼𝗈𝗇𝖾𝒟(E)=(x:E)(y:E)(x=Ey).

But the following map is an equivalence

{E(x:E)(y:E)(x=Ey)x(x,x,𝗋𝖾𝖿𝗅x).

Hence

𝖼𝗈𝖼𝗈𝗇𝖾𝒟(E)=E.

Finally we get an equivalence

(𝟏E)𝖼𝗈𝖼𝗈𝗇𝖾𝒟(E)

We can now unfold the definitions in order to get the explicit expression ofthis map, and we see easily that this is exactly the map we had at thebeginning.

Hence we proved that 𝟏 is a pushout of 𝒟 in (n+1)-𝖳𝗒𝗉𝖾. Usinguniqueness of pushouts we get that 𝟏A𝟏n+1=𝟏which proves that the suspension of A is (n+1)-connected.∎

Corollary 8.2.2.

For all n:N, the sphere Sn is (n-1)-connected.

Proof.

We prove this by inductionMathworldPlanetmath on n.For n=0 we have to prove that 𝕊0 is merely inhabited, which is clear.Let n: be such that 𝕊n is (n-1)-connected. By definition 𝕊n+1is the suspension of 𝕊n, hence by the previous lemma 𝕊n+1 isn-connected.∎

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/5 0:14:09