6.5 Suspensions

6.5 Suspensions

The

suspension

of a type

A

is the

universal

way of making the points of

A

into paths (and hence the paths in

A

into 2-paths, and so on).
It is a type

Σ

⁢

A

defined by the following

generators

:

1

1

There is an unfortunate clash of notation with dependent pair types, which of course are also written with a

Σ

.
However,

context

usually disambiguates.

•

a point

𝖭

:

Σ

⁢

A

,

•

a point

𝖲

:

Σ

⁢

A

, and

•

a

function

𝗆𝖾𝗋𝗂𝖽

:

A

→

(

𝖭

=

Σ

⁢

A

𝖲

)

.

The names are intended to suggest a “globe” of sorts, with a

north pole

, a south pole, and an

A

’s worth of meridians
from one to the other.
Indeed, as we will see, if

A

=

𝕊

1

, then its suspension is

equivalent

to the surface of an ordinary sphere,

𝕊

2

.

The

recursion

principle for

Σ

⁢

A

says that given a type

B

together with

•

points

n

,

s

:

B

and

•

a function

m

:

A

→

(

n

=

s

)

,

we have a function

f

:

Σ

⁢

A

→

B

such that

f

⁢

(

𝖭

)

≡

n

and

f

⁢

(

𝖲

)

≡

s

, and for all

a

:

A

we have

f

(

𝗆𝖾𝗋𝗂𝖽

(

a

)

)

=

m

(

a

)

.
Similarly, the

induction

principle says that given

P

:

Σ

⁢

A

→

𝒰

together with

•

a point

n

:

P

⁢

(

𝖭

)

,

•

a point

s

:

P

⁢

(

𝖲

)

, and

•

for each

a

:

A

, a path

m

⁢

(

a

)

:

n

=

𝗆𝖾𝗋𝗂𝖽

⁢

(

a

)

P

s

,

there exists a function

f

:

∏

(

x

:

Σ

A

)

P

⁢

(

x

)

such that

f

⁢

(

𝖭

)

≡

n

and

f

⁢

(

𝖲

)

≡

s

and for each

a

:

A

we have

𝖺𝗉𝖽

f

(

𝗆𝖾𝗋𝗂𝖽

(

a

)

)

=

m

(

a

)

.

Our first observation about suspension is that it gives another way to define the circle.

Lemma 6.5.1

.

Σ

⁢

𝟐

≃

𝕊

1

.

Proof.

Define

f

:

Σ

⁢

𝟐

→

𝕊

1

by recursion such that

f

(

𝖭

)

:

≡

𝖻𝖺𝗌𝖾

and

f

(

𝖲

)

:

≡

𝖻𝖺𝗌𝖾

, while

f

(

𝗆𝖾𝗋𝗂𝖽

(

0

𝟐

)

)

:=

𝗅𝗈𝗈𝗉

but

f

(

𝗆𝖾𝗋𝗂𝖽

(

1

𝟐

)

)

:=

𝗋𝖾𝖿𝗅

𝖻𝖺𝗌𝖾

.
Define

g

:

𝕊

1

→

Σ

⁢

𝟐

by recursion such that

g

(

𝖻𝖺𝗌𝖾

)

:

≡

𝖭

and

g

(

𝗅𝗈𝗈𝗉

)

:=

𝗆𝖾𝗋𝗂𝖽

(

0

𝟐

)

\centerdot

𝗆𝖾𝗋𝗂𝖽

⁢

(

1

𝟐

)

-

1

.
We now show that

f

and

g

are

quasi-inverses

.

First we show by induction that

g

⁢

(

f

⁢

(

x

)

)

=

x

for all

x

:

Σ

⁢

𝟐

.
If

x

≡

𝖭

, then

g

⁢

(

f

⁢

(

𝖭

)

)

≡

g

⁢

(

𝖻𝖺𝗌𝖾

)

≡

𝖭

, so we have

𝗋𝖾𝖿𝗅

𝖭

:

g

⁢

(

f

⁢

(

𝖭

)

)

=

𝖭

.
If

x

≡

𝖲

, then

g

⁢

(

f

⁢

(

𝖲

)

)

≡

g

⁢

(

𝖻𝖺𝗌𝖾

)

≡

𝖭

, and we choose the

equality

𝗆𝖾𝗋𝗂𝖽

⁢

(

1

𝟐

)

:

g

⁢

(

f

⁢

(

𝖲

)

)

=

𝖲

.
It remains to show that for any

y

:

𝟐

, these equalities are preserved as

x

varies along

𝗆𝖾𝗋𝗂𝖽

⁢

(

y

)

, which is to say that when

𝗋𝖾𝖿𝗅

𝖭

is transported along

𝗆𝖾𝗋𝗂𝖽

⁢

(

y

)

it yields

𝗆𝖾𝗋𝗂𝖽

⁢

(

1

𝟐

)

.
By transport in

path spaces

and pulled back fibrations, this means we are to show that

g

(

f

(

𝗆𝖾𝗋𝗂𝖽

(

y

)

)

)

-

1

⁢

\centerdot

⁢

𝗋𝖾𝖿𝗅

𝖭

⁢

\centerdot

⁢

𝗆𝖾𝗋𝗂𝖽

⁢

(

y

)

=

𝗆𝖾𝗋𝗂𝖽

⁢

(

1

𝟐

)

.

Of course, we may cancel

𝗋𝖾𝖿𝗅

𝖭

.
Now by

𝟐

-induction, we may assume either

y

≡

0

𝟐

or

y

≡

1

𝟐

.
If

y

≡

0

𝟐

, then we have

g

(

f

(

𝗆𝖾𝗋𝗂𝖽

(

0

𝟐

)

)

)

-

1

⁢

\centerdot

⁢

𝗆𝖾𝗋𝗂𝖽

⁢

(

0

𝟐

)

=

g

(

𝗅𝗈𝗈𝗉

)

-

1

⁢

\centerdot

⁢

𝗆𝖾𝗋𝗂𝖽

⁢

(

0

𝟐

)

=

(

𝗆𝖾𝗋𝗂𝖽

⁢

(

0

𝟐

)

⁢

\centerdot

⁢

𝗆𝖾𝗋𝗂𝖽

⁢

(

1

𝟐

)

-

1

)

-

1

⁢

\centerdot

⁢

𝗆𝖾𝗋𝗂𝖽

⁢

(

0

𝟐

)

=

𝗆𝖾𝗋𝗂𝖽

⁢

(

1

𝟐

)

⁢

\centerdot

⁢

𝗆𝖾𝗋𝗂𝖽

⁢

(

0

𝟐

)

-

1

⁢

\centerdot

⁢

𝗆𝖾𝗋𝗂𝖽

⁢

(

0

𝟐

)

=

𝗆𝖾𝗋𝗂𝖽

⁢

(

1

𝟐

)

while if

y

≡

1

𝟐

, then we have

g

(

f

(

𝗆𝖾𝗋𝗂𝖽

(

1

𝟐

)

)

)

-

1

⁢

\centerdot

⁢

𝗆𝖾𝗋𝗂𝖽

⁢

(

1

𝟐

)

=

g

(

𝗋𝖾𝖿𝗅

𝖻𝖺𝗌𝖾

)

-

1

⁢

\centerdot

⁢

𝗆𝖾𝗋𝗂𝖽

⁢

(

1

𝟐

)

=

𝗋𝖾𝖿𝗅

𝖭

-

1

⁢

\centerdot

⁢

𝗆𝖾𝗋𝗂𝖽

⁢

(

1

𝟐

)

=

𝗆𝖾𝗋𝗂𝖽

⁢

(

1

𝟐

)

.

Thus, for all

x

:

Σ

⁢

𝟐

, we have

g

⁢

(

f

⁢

(

x

)

)

=

x

.

Now we show by induction that

f

⁢

(

g

⁢

(

x

)

)

=

x

for all

x

:

𝕊

1

.
If

x

≡

𝖻𝖺𝗌𝖾

, then

f

⁢

(

g

⁢

(

𝖻𝖺𝗌𝖾

)

)

≡

f

⁢

(

𝖭

)

≡

𝖻𝖺𝗌𝖾

, so we have

𝗋𝖾𝖿𝗅

𝖻𝖺𝗌𝖾

:

f

⁢

(

g

⁢

(

𝖻𝖺𝗌𝖾

)

)

=

𝖻𝖺𝗌𝖾

.
It remains to show that this equality is preserved as

x

varies along

𝗅𝗈𝗈𝗉

, which is to say that it is transported along

𝗅𝗈𝗈𝗉

to itself.
Again, by transport in path spaces and pulled back fibrations, this means to show that

f

(

g

(

𝗅𝗈𝗈𝗉

)

)

-

1

⁢

\centerdot

⁢

𝗋𝖾𝖿𝗅

𝖻𝖺𝗌𝖾

⁢

\centerdot

⁢

𝗅𝗈𝗈𝗉

=

𝗋𝖾𝖿𝗅

𝖻𝖺𝗌𝖾

.

However, we have

f

(

g

(

𝗅𝗈𝗈𝗉

)

)

=

f

(

𝗆𝖾𝗋𝗂𝖽

(

0

𝟐

)

\centerdot

𝗆𝖾𝗋𝗂𝖽

⁢

(

1

𝟐

)

-

1

)

=

f

(

𝗆𝖾𝗋𝗂𝖽

(

0

𝟐

)

)

\centerdot

f

(

𝗆𝖾𝗋𝗂𝖽

(

1

𝟐

)

)

-

1

=

𝗅𝗈𝗈𝗉

⁢

\centerdot

⁢

𝗋𝖾𝖿𝗅

𝖻𝖺𝗌𝖾

so this follows easily.
∎

Topologically, the two-point space

𝟐

is also known as the

0-dimensional sphere

,

𝕊

0

.
(For

instance

, it is the space of points at

distance

1

from the origin in

ℝ

1

, just as the topological 1-sphere is the space of points at distance

1

from the origin in

ℝ

2

.)
Thus, Lemma 6.5.1 (

http://planetmath.org/65suspensions#Thmprelem1

) can be phrased suggestively as

Σ

⁢

𝕊

0

≃

𝕊

1

.
In fact, this pattern continues: we can define all the spheres inductively by

𝕊

0

:

≡

𝟐

and

𝕊

n

+

1

:

≡

Σ

𝕊

n

.

(6.5.2)

We can even start one

dimension

lower by defining

𝕊

-

1

:

≡

𝟎

, and observe that

Σ

⁢

𝟎

≃

𝟐

.

To prove carefully that this agrees with the definition of

𝕊

n

from the previous

section

would require making the latter more explicit.
However, we can show that the recursive definition has the same

universal property

that we would expect the other one to have.
If

(

A

,

a

0

)

and

(

B

,

b

0

)

are pointed types (with

basepoints

often left implicit), let

𝖬𝖺𝗉

*

⁢

(

A

,

B

)

denote the type of based maps:

𝖬𝖺𝗉

*

(

A

,

B

)

:

≡

∑

f

:

A

→

B

(

f

(

a

0

)

=

b

0

)

.

Note that any type

A

gives rise to a pointed type

A

+

:

≡

A

+

𝟏

with basepoint

𝗂𝗇𝗋

⁢

(

⋆

)

; this is called

adjoining a

disjoint

basepoint

.

Lemma 6.5.3

.

For a type

A

and a pointed type

(

B

,

b

0

)

, we have

𝖬𝖺𝗉

*

(

A

+

,

B

)

≃

(

A

→

B

)

Note that on the right we have the ordinary type of

unbased

functions from

A

to

B

.

Proof.

From left to right, given

f

:

A

+

→

B

with

p

:

f

⁢

(

𝗂𝗇𝗋

⁢

(

⋆

)

)

=

b

0

, we have

f

∘

𝗂𝗇𝗅

:

A

→

B

.
And from right to left, given

g

:

A

→

B

we define

g

′

:

A

+

→

B

by

g

′

(

𝗂𝗇𝗅

(

a

)

)

:

≡

g

(

a

)

and

g

′

(

𝗂𝗇𝗋

(

u

)

)

:

≡

b

0

.
We leave it to the reader to show that these are quasi-inverse

operations

.
∎

In particular, note that

𝟐

≃

𝟏

+

.
Thus, for any pointed type

B

we have

𝖬𝖺𝗉

*

(

𝟐

,

B

)

≃

(

𝟏

→

B

)

≃

B

.

Now recall that the

loop space

operation

Ω

acts on pointed types, with definition

Ω

(

A

,

a

0

)

:

≡

(

a

0

=

A

a

0

,

𝗋𝖾𝖿𝗅

a

0

)

.
We can also make the suspension

Σ

act on pointed types, by

Σ

(

A

,

a

0

)

:

≡

(

Σ

A

,

𝖭

)

.

Lemma 6.5.4

.

For pointed types

(

A

,

a

0

)

and

(

B

,

b

0

)

we have

𝖬𝖺𝗉

*

⁢

(

Σ

⁢

A

,

B

)

≃

𝖬𝖺𝗉

*

⁢

(

A

,

Ω

⁢

B

)

.

Proof.

From left to right, given

f

:

Σ

⁢

A

→

B

with

p

:

f

⁢

(

𝖭

)

=

b

0

, we define

g

:

A

→

Ω

⁢

B

by

g

(

a

)

:

≡

p

-

1

\centerdot

f

(

𝗆𝖾𝗋𝗂𝖽

(

a

)

\centerdot

𝗆𝖾𝗋𝗂𝖽

⁢

(

a

0

)

-

1

)

\centerdot

p

.

Then we have

g

⁢

(

a

0

)

≡

p

-

1

\centerdot

f

(

𝗆𝖾𝗋𝗂𝖽

(

a

0

)

\centerdot

𝗆𝖾𝗋𝗂𝖽

⁢

(

a

0

)

-

1

)

\centerdot

p

=

p

-

1

\centerdot

f

(

𝗋𝖾𝖿𝗅

𝖭

)

\centerdot

p

=

p

-

1

⁢

\centerdot

⁢

p

=

𝗋𝖾𝖿𝗅

b

0

.

Thus, denoting this path by

q

:

g

⁢

(

a

0

)

=

𝗋𝖾𝖿𝗅

b

0

, we have

(

g

,

q

)

:

𝖬𝖺𝗉

*

⁢

(

A

,

Ω

⁢

B

)

.

On the other hand, from right to left, given

g

:

A

→

Ω

⁢

B

and

q

:

g

⁢

(

a

0

)

=

𝗋𝖾𝖿𝗅

b

0

, we define

f

:

Σ

⁢

A

→

B

by

Σ

-recursion, such that

f

(

𝖭

)

:

≡

b

0

and

f

(

𝖲

)

:

≡

b

0

and

f

(

𝗆𝖾𝗋𝗂𝖽

(

a

)

)

:=

g

(

a

)

.

Then we can simply take

p

to be

𝗋𝖾𝖿𝗅

b

0

:

f

⁢

(

𝖭

)

=

b

0

.

Now given

(

f

,

p

)

, by passing

back and forth

we obtain

(

f

′

,

p

′

)

where

f

′

is defined by

f

′

⁢

(

𝖭

)

≡

b

0

and

f

′

⁢

(

𝖲

)

≡

b

0

and

f

′

(

𝗆𝖾𝗋𝗂𝖽

(

a

)

)

=

p

-

1

\centerdot

f

(

𝗆𝖾𝗋𝗂𝖽

(

a

)

\centerdot

𝗆𝖾𝗋𝗂𝖽

⁢

(

a

0

)

-

1

)

\centerdot

p

,

while

p

′

≡

𝗋𝖾𝖿𝗅

b

0

.
To show

f

=

f

′

, by function extensionality it suffices to show

f

⁢

(

x

)

=

f

′

⁢

(

x

)

for all

x

:

Σ

⁢

A

, so we can use the induction principle of suspension.
First, we have

f

⁢

(

𝖭

)

⁢

=

𝑝

⁢

b

0

≡

f

′

⁢

(

𝖭

)

.

(6.5.5)

Second, we have

\includegraphics

HoTT_fig_6.5.1.png

And thirdly, as

x

varies along

𝗆𝖾𝗋𝗂𝖽

⁢

(

a

)

we must show that the following

diagram

of paths commutes (invoking the definition of

f

′

(

𝗆𝖾𝗋𝗂𝖽

(

a

)

)

):

\includegraphics

HoTT_fig_6.5.2.png

This is clear.
Thus, to show that

(

f

,

p

)

=

(

f

′

,

p

′

)

, it remains only to show that

p

is identified with

p

′

when transported along this equality

f

=

f

′

.
Since the type of

p

is

f

⁢

(

𝖭

)

=

b

0

, this means essentially that when

p

is composed on the left with the

inverse

of the equality (

6.5.5

), it becomes

p

′

.
But this is obvious, since (

6.5.5

) is just

p

itself, while

p

′

is

reflexivity

.

On the other side, suppose given

(

g

,

q

)

.
By passing back and forth we obtain

(

g

′

,

q

′

)

with

g

′

⁢

(

a

)

=

𝗋𝖾𝖿𝗅

b

0

-

1

⁢

\centerdot

⁢

g

⁢

(

a

)

⁢

\centerdot

⁢

g

⁢

(

a

0

)

-

1

⁢

\centerdot

⁢

𝗋𝖾𝖿𝗅

b

0

=

g

⁢

(

a

)

⁢

\centerdot

⁢

g

⁢

(

a

0

)

-

1

=

g

⁢

(

a

)

using

q

:

g

⁢

(

a

0

)

=

𝗋𝖾𝖿𝗅

b

0

in the last equality.
Thus,

g

′

=

g

by function extensionality, so it remains to show that when transported along this equality

q

is identified with

q

′

.
At

a

0

, the induced equality

g

⁢

(

a

0

)

=

g

′

⁢

(

a

0

)

consists essentially of

q

itself, while the definition of

q

′

involves only canceling inverses and reflexivities.
Thus, some tedious manipulations of naturality finish the proof.
∎

In particular, for the spheres defined as in (

6.5.2

) we have

𝖬𝖺𝗉

*

⁢

(

𝕊

n

,

B

)

≃

𝖬𝖺𝗉

*

⁢

(

𝕊

n

-

1

,

Ω

⁢

B

)

≃

⋯

≃

𝖬𝖺𝗉

*

⁢

(

𝟐

,

Ω

n

⁢

B

)

≃

Ω

n

⁢

B

.

Thus, these spheres

𝕊

n

have the universal property that we would expect from the spheres defined directly in terms of

n

-fold loop spaces as in §6.4 (

http://planetmath.org/64circlesandspheres

).

Title

6.5 Suspensions

\metatable

Generated on Thu Feb 8 19:38:17 2018 by

LaTeXML