Question

Let X be path-connected and let b∈X . Show that every path in X is homotopic...

Let X be path-connected and let b∈X . Show that every path in X is homotopic with endpoints fixed to a path passing through b

Homework Answers

Answer #1

Let be a path with fixed end point say, x and y. Then we need to find a path with the same end point passing through b, which is homotopic to . Since X is path connected there is a path from x to b.

Define , by , , and

Then note that is a path passing through b. Also note that and are homotopic, as .

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Show that an open disk D in the plane ℝ2 is path connected.
Show that an open disk D in the plane ℝ2 is path connected.
Let a = 2i -3k; b= i+j-k 1) Find a x b. 2) Find the vector...
Let a = 2i -3k; b= i+j-k 1) Find a x b. 2) Find the vector projection of a and b. 3) Find the equation of the plane passing through a with normal b. 4) Find the equation of the line passing through the points a and b. Please help and show your steps. Thank you in advance.
let G be a connected graph such that the graph formed by removing vertex x from...
let G be a connected graph such that the graph formed by removing vertex x from G is disconnected for all but exactly 2 vertices of G. Prove that G must be a path.
Show that if X is an infinite set, then it is connected in the finite complement...
Show that if X is an infinite set, then it is connected in the finite complement topology. Show that in the finite complement on R every subspace is compact.
Let E = {x + iy : x = 0, or x > 0, y =...
Let E = {x + iy : x = 0, or x > 0, y = sin(1/x)}. Prove that the set E is connected, but that is not path-connected or connected by trajectories and consider B = {z ∈ C : |z| = 1}. prove ( is easy to see it but how to prove it ) the following questions ¿is B open?¿is B closed?¿connected?¿compact?
Let G be a simple graph with n(G) > 2. Prove that G is 2-connected iff...
Let G be a simple graph with n(G) > 2. Prove that G is 2-connected iff for every set of 3 distinct vertices, a, b and c, there is an a,c-path that contains b.
let A be a subset of Rn and let x be a point in Rn. Show...
let A be a subset of Rn and let x be a point in Rn. Show that x is a limit point of A if and only if every open ball about x contains a point of A that is not equal to x
1.- Prove the intermediate value theorem: let (X, τ) be a connected topological space, f: X...
1.- Prove the intermediate value theorem: let (X, τ) be a connected topological space, f: X - → Y a continuous transformation and x1, x2 ∈ X with a1 = f (x1), a2 = f (x2) ( a1 different a2). Then for all c∈ (a1, a2) there is x∈ such that f (x) = c. 2.- Let f: X - → Y be a continuous and suprajective transformation. Show that if X is connected, then Y too.
Let (X , X) be a measurable space. Show that f : X → R is...
Let (X , X) be a measurable space. Show that f : X → R is measurable if and only if {x ∈ X : f(x) > r} is measurable for every r ∈ Q.
Show that an undirected graph G = (N,A) is connected if and only if for every...
Show that an undirected graph G = (N,A) is connected if and only if for every partition of N into subsets N1 and N2, some arc has one endpoint in N1 and the other endpoint in N2.