Views
3 years ago

# Algebraic Topology Problem Set 6 â Solutions - Strickland, Neil

Algebraic Topology Problem Set 6 â Solutions - Strickland, Neil

## Algebraic Topology Problem Set 6 â Solutions - Strickland,

Algebraic Topology Problem Set 6 — SolutionsQ1: First note that g ∗ f ∗ = (gf) ∗ = 1 X∗ = 1 π0X, so g ∗ f ∗ (u) = u for all elements u ∈ π 0 X.(a) Suppose that f ∗ (u) = f ∗ (v). Then g ∗ f ∗ (u) = g ∗ f ∗ (v), or in other words u = v. This showsthat f ∗ is injective.(b) Suppose that u ∈ π 0 X. If we put v = f ∗ (u) ∈ π 0 Y , we find that g ∗ (v) = g ∗ f ∗ (u) = u. Asu = g ∗ (v) we see that u is in the image of g. This holds for all u, so g ∗ is surjective.(c) Suppose that A = {a 1 , . . . , a n }. (We assume that this lists all the elements without repetition,so a i ≠ a j when i ≠ j, and |A| = n.) Suppose that j : A −→ B is injective. Thenj(a 1 ), . . . , j(a n ) are all elements of B, and they are all different because j is injective. ThusB has at least n different elements, ie |B| ≥ n. Suppose instead that q : B −→ A is surjective.Each element a i must lie in the image of q, so a i = q(b i ) for some b i ∈ B. If b i = b j then wemust have q(b i ) = q(b j ), or in other words a i = a j , but this only happens when i = j. Thisshows that b 1 , . . . , b n are distinct elements of B, so again |B| ≥ n.Q2:(a) Put u(t) = h(t, x) and v(t) = h(t, y), so u is a path from x to a, and v is a path from y toa. Then put w = u ∗ v, or equivalently{h(2t, x) if 0 ≤ t ≤ 1/2w(t) =h(2 − 2t, y) if 1/2 ≤ t ≤ 1This gives a path from x to y.(b) First put b = f(a) and h ′ (t, y) = f(h(t, g(y))). Then h ′ (0, y) = f(h(0, g(y))) = f(g(y)) andh ′ (1, y) = f(h(1, g(y))) = f(a) = b for all y. In other words, h ′ is a homotopy between fgand the constant map c b with value b. We are also given a homotopy k from 1 Y to fg, andwe can combine these to get a homotopy m: I × Y −→ Y between 1 Y and c b . Explicitly, theformula ism(t, y) ={k(2t, y) if 0 ≤ t ≤ 1/2h ′ (2t − 1, y) if 1/2 ≤ t ≤ 1.Q3:( ) a b(a) Suppose that A = . Thenc d( ) ( ) ( )a b 0 1 b aAM ==c d 1 0 d c( ) ( ) ( )0 1 a b c dMA ==1 0 c d a b( ) a bThus AM = MA if and only if c = b and d = a, so A has the form . If so thenb adet(A) = a 2 − b 2 = (a + b)(a − b).( ) a b(b) Put X = {A ∈ GL 2 C | AM = MA}. If A ∈ X then A must have the form withb a(a + b)(a − b) = det(A) ≠ 0, so a + b and a − b are nonzero. We can thus define a mapf : X −→ C \ {0} × C \ {0} by f(A) = (a + b, a − b). Note that if u = a + b and v = a − bthen a = (u + v)/2 and b = (u − v)/2. It follows that f is a homeomorphism, with inversef −1 (u, v) = 1 ( )u + v u − v.2 u − v u + v(c) As C\{0} is homotopy equivalent to S 1 , we deduce that X is homotopy equivalent to S 1 ×S 1 ,which is the torus.

Solution to Digital Island Problem - SET
Biowaste and biofuels â problems and possible solutions within the ...
Algebraic Topology Problem Set 7 â Solutions - Neil Strickland
Algebraic Topology Problem Set 5 â Solutions - Strickland, Neil
Algebraic Topology Problem Set 2 â Solutions - Strickland, Neil
SOME ALGEBRAIC EXAMPLES IN TOPOLOGY A ... - Neil Strickland
Rings, Modules and Linear Algebra â Exam solutions - Neil Strickland
TOPOLOGY PROBLEMS (1) State the Arzela-Ascoli ... - Neil Strickland
NOTES ON POINT-SET TOPOLOGY 1. Basic ... - Neil Strickland
A bestiary of topological objects. - Strickland, Neil
Solution - Neil Strickland
Solution - Neil Strickland
MAS243 PROBLEMS â WEEK 8 â POLAR ... - Strickland, Neil
MAS243 PROBLEMS â WEEK 11 â STOKES'S ... - Neil Strickland
solutions - Strickland, Neil
MAS243 PROBLEMS â WEEK 9 THE TWO ... - Neil Strickland
Solutions to Problem Set #6
Problem Set 6 Solutions
Problem Set 6 Solutions
Problem Set #6 Solutions
Solutions to problem set 6
Solutions to Problem Set #6
Problem Set #6 - Solution
Galois theory â Exam - Neil Strickland
Problem Set #6 Solutions
Solution to Problem Set 6
Galois theory â Exam - Neil Strickland
Problem Set 6 Suggested Solutions
PY1052 Problem Set 6 â Autumn 2004 Solutions