请输入您要查询的字词:

 

单词 64CirclesAndSpheres
释义

6.4 Circles and spheres


We have already discussed the circle 𝕊1 as the higher inductive type generated by

  • A point 𝖻𝖺𝗌𝖾:𝕊1, and

  • A path 𝗅𝗈𝗈𝗉:𝖻𝖺𝗌𝖾=𝕊1𝖻𝖺𝗌𝖾.

Its inductionMathworldPlanetmath principle says that given P:𝕊1𝒰 along with b:P(𝖻𝖺𝗌𝖾) and :b=𝗅𝗈𝗈𝗉Pb, we have f:(x:𝕊1)P(x) with f(𝖻𝖺𝗌𝖾)b and 𝖺𝗉𝖽f(𝗅𝗈𝗈𝗉)=.Its non-dependent recursion principle says that given B with b:B and :b=b, we have f:𝕊1B with f(𝖻𝖺𝗌𝖾)b and f(𝗅𝗈𝗈𝗉)=.

We observe that the circle is nontrivial.

Lemma 6.4.1.

𝗅𝗈𝗈𝗉𝗋𝖾𝖿𝗅𝖻𝖺𝗌𝖾.

Proof.

Suppose that 𝗅𝗈𝗈𝗉=𝗋𝖾𝖿𝗅𝖻𝖺𝗌𝖾.Then since for any type A with x:A and p:x=x, there is a function f:𝕊1A defined by f(𝖻𝖺𝗌𝖾):x and f(𝗅𝗈𝗈𝗉):=p, we have

p=f(𝗅𝗈𝗈𝗉)=f(𝗋𝖾𝖿𝗅𝖻𝖺𝗌𝖾)=𝗋𝖾𝖿𝗅x.

But this implies that every type is a set, which as we have seen is not the case (see Example 3.1.9 (http://planetmath.org/31setsandntypes#Thmpreeg6)).∎

The circle also has the following interesting property, which is useful as a source of counterexamples.

Lemma 6.4.2.

There exists an element of (x:S1)(x=x) which is not equal to xreflx.

Proof.

We define f:(x:𝕊1)(x=x) by 𝕊1-induction.When x is 𝖻𝖺𝗌𝖾, we let f(𝖻𝖺𝗌𝖾):𝗅𝗈𝗈𝗉.Now when x varies along 𝗅𝗈𝗈𝗉 (see Remark 6.2.4 (http://planetmath.org/62inductionprinciplesanddependentpaths#Thmprermk3)), we must show that 𝗍𝗋𝖺𝗇𝗌𝗉𝗈𝗋𝗍xx=x(𝗅𝗈𝗈𝗉,𝗅𝗈𝗈𝗉)=𝗅𝗈𝗈𝗉.However, in §2.11 (http://planetmath.org/211identitytype) we observed that 𝗍𝗋𝖺𝗇𝗌𝗉𝗈𝗋𝗍xx=x(p,q)=p-1\\centerdotq\\centerdotp, so what we have to show is that 𝗅𝗈𝗈𝗉-1\\centerdot𝗅𝗈𝗈𝗉\\centerdot𝗅𝗈𝗈𝗉=𝗅𝗈𝗈𝗉.But this is clear by canceling an inverseMathworldPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath.

To show that f(x𝗋𝖾𝖿𝗅x), it suffices by function extensionality to show that f(𝖻𝖺𝗌𝖾)𝗋𝖾𝖿𝗅𝖻𝖺𝗌𝖾.But f(𝖻𝖺𝗌𝖾)=𝗅𝗈𝗈𝗉, so this is just the previous lemma.∎

For instance, this enables us to extend Example 3.1.9 (http://planetmath.org/31setsandntypes#Thmpreeg6) by showing that any universePlanetmathPlanetmath which contains the circle cannot be a 1-type.

Corollary 6.4.3.

If the type S1 belongs to some universe U, then U is not a 1-type.

Proof.

The type 𝕊1=𝕊1 in 𝒰 is, by univalence, equivalentMathworldPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath to the type 𝕊1𝕊1 of autoequivalences of 𝕊1, so it suffices to show that 𝕊1𝕊1 is not a set.For this, it suffices to show that its equality type 𝗂𝖽𝕊1=(𝕊1𝕊1)𝗂𝖽𝕊1 is not a mere proposition.Since being an equivalence is a mere proposition, this type is equivalent to 𝗂𝖽𝕊1=(𝕊1𝕊1)𝗂𝖽𝕊1.But by function extensionality, this is equivalent to (x:𝕊1)(x=x), which as we have seen in Lemma 6.4.2 (http://planetmath.org/64circlesandspheres#Thmprelem2) contains two unequal elements.∎

We have also mentioned that the 2-sphere 𝕊2 should be the higher inductive type generated by

  • A point 𝖻𝖺𝗌𝖾:𝕊2, and

  • A 2-dimensional path 𝗌𝗎𝗋𝖿:𝗋𝖾𝖿𝗅𝖻𝖺𝗌𝖾=𝗋𝖾𝖿𝗅𝖻𝖺𝗌𝖾 in 𝖻𝖺𝗌𝖾=𝖻𝖺𝗌𝖾.

The recursion principle for 𝕊2 is not hard: it says that given B with b:B and s:𝗋𝖾𝖿𝗅b=𝗋𝖾𝖿𝗅b, we have f:𝕊2B with f(𝖻𝖺𝗌𝖾)b and 𝖺𝗉f2(𝗌𝗎𝗋𝖿)=s.Here by “𝖺𝗉f2(𝗌𝗎𝗋𝖿)” we mean an extensionPlanetmathPlanetmathPlanetmath of the functorial action of f to two-dimensional paths, which can be stated precisely as follows.

Lemma 6.4.4.

Given f:AB and x,y:A and p,q:x=y, and r:p=q, we have a path apf2(r):f(p)=f(q).

Proof.

By path induction, we may assume pq and r is reflexivityMathworldPlanetmath.But then we may define 𝖺𝗉f2(𝗋𝖾𝖿𝗅p):𝗋𝖾𝖿𝗅f(p).∎

In order to state the general induction principle, we need a version of this lemma for dependent functions, which in turn requires a notion of dependent two-dimensional paths.As before, there are many ways to define such a thing; one is by way of a two-dimensional version of transport.

Lemma 6.4.5.

Given P:AU and x,y:A and p,q:x=y and r:p=q, for any u:P(x) we have transport2(r,u):p*(u)=q*(u).

Proof.

By path induction.∎

Now suppose given x,y:A and p,q:x=y and r:p=q and also points u:P(x) and v:P(y) and dependent paths h:u=pPv and k:u=qPv.By our definition of dependent paths, this means h:p*(u)=v and k:q*(u)=v.Thus, it is reasonable to define the type of dependent 2-paths over r to be

(h=rPk):(h=𝗍𝗋𝖺𝗇𝗌𝗉𝗈𝗋𝗍2(r,u)\\centerdotk).

We can now state the dependent version of Lemma 6.4.4 (http://planetmath.org/64circlesandspheres#Thmprelem3).

Lemma 6.4.6.

Given P:AU and x,y:A and p,q:x=y and r:p=q and a function f:(x:A)P(x), we haveapdf2(r):apdf(p)=rPapdf(q).

Proof.

Path induction.∎

Now we can state the induction principle for 𝕊2: given P:𝕊2P with b:P(𝖻𝖺𝗌𝖾) and s:𝗋𝖾𝖿𝗅b=𝗌𝗎𝗋𝖿P𝗋𝖾𝖿𝗅b, there is a function f:(x:𝕊2)P(x) such that f(𝖻𝖺𝗌𝖾)b and 𝖺𝗉𝖽f2(𝗌𝗎𝗋𝖿)=s.

Of course, this explicit approach gets more and more complicated as we go up in dimensionMathworldPlanetmath.Thus, if we want to define n-spheres for all n, we need some more systematic idea.One approach is to work with n-dimensional loops directly, rather than general n-dimensional paths.

Recall from §2.1 (http://planetmath.org/21typesarehighergroupoids) the definitions of pointed types 𝒰*, and the n-fold loop spaceMathworldPlanetmath Ωn:𝒰*𝒰*(Definition 2.1.7 (http://planetmath.org/21typesarehighergroupoids#Thmpredefn1) and Definition 2.1.8 (http://planetmath.org/21typesarehighergroupoids#Thmpredefn2)). Now we can define then-sphere 𝕊n to be the higher inductive type generated by

  • A point 𝖻𝖺𝗌𝖾:𝕊n, and

  • An n-loop 𝗅𝗈𝗈𝗉n:Ωn(𝕊n,𝖻𝖺𝗌𝖾).

In order to write down the induction principle for this presentationMathworldPlanetmathPlanetmathPlanetmath, we would need to define a notion of “dependent n-loop”, along with the action of dependent functions on n-loops.We leave this to the reader (see http://planetmath.org/node/87769Exercise 6.4); in the next sectionPlanetmathPlanetmathPlanetmath we will discuss a different way to define the spheres that is sometimes more tractable.

随便看

 

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

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 17:12:37