An equivalence relation must also satisfy reflexivity, so that <math>\gamma_0 \sim \gamma_1</math> implies that <math>\gamma_1 \sim \gamma_0</math>. To prove that homotopy of loops satisfy this, suppose that <math>\gamma_0 \sim \gamma_1</math>. Then there is a homotopy <math>H_0(t,s) : [0,1] \times [0,1] \to X</math> satisfying the requisite conditions. A homotopy from <math>\gamma_1</math> to <math>\gamma_0</math> is provided by running <math>H_0</math> in reverse: set <math>H(t,s) = H_0(t,1-s)</math>. | An equivalence relation must also satisfy reflexivity, so that <math>\gamma_0 \sim \gamma_1</math> implies that <math>\gamma_1 \sim \gamma_0</math>. To prove that homotopy of loops satisfy this, suppose that <math>\gamma_0 \sim \gamma_1</math>. Then there is a homotopy <math>H_0(t,s) : [0,1] \times [0,1] \to X</math> satisfying the requisite conditions. A homotopy from <math>\gamma_1</math> to <math>\gamma_0</math> is provided by running <math>H_0</math> in reverse: set <math>H(t,s) = H_0(t,1-s)</math>. |