and a loop is trivial in Y, it needn't be trivial X...for example if the loop encloses a hole in X and we attach the boundary of a 2-cell to cover the hole
well, i'd have done it by proving that no noncontractible loop of $X$ on the place your cell gets attatched to is contractible on $D^3 \sqcup_\varphi X$.
@Incurrence Honestly, it seems like a political atmosphere dominating here instead of the freedom of asking questions which leads to absolutely a better community, at least that is what I think. I am not sick to ask a question that I have not made any kind of attempt on, I may be sloppy and forgetful but I am absolutely not that kind of guy.
@FreeMind Unfortunately noone really knows that, and the main answerers deal with so many people it would be unlikely they remember specifically you until after a long time. I find it unlikely that you would truly be stuck without being able to try anything - I can normally try more than 5 things for any given problem.
i dunno, @Mike, the proof looks okay to me, and it's not really that long either [most of the proof goes into proving basic stuff, like contractibility of $S^\infty$]. Do you have a different proof in mind that doesn't use homology/homotopy?
i've never seen a proof of non contractibility of $S^2$ using elementary stuff.
complexification is the tensor product with V x C, where C is complex numbers, V is a vector space over some ring R and tensor product is with respect to R
@TedShifrin consider (a, b, kb, a) under matrix mult. This is the same as a+b i with i^2=k what do you call these things? For example k=-1 is complex nums, k=1 is split comp and k=0 is dual.
@BalarkaSen I am having a doubt understanding generators and relations. ......I know what both of them are but I can't understand how they are used to define a group?
Before he studies X, he will ask about Y. And then before he studies Y, he will ask about Z, and it never ends. And in the end he still has not studied X.
So before scolding me, please know the context @ᴇʏᴇs.
@JasperLoy I did hammock when I first saw it because hammock is a lot similar to my 11 grade so I was able to do it very quickly and the last 5 months I have just been doing apostol and aylast I have been able to finish it without a question left
@BalarkaSen: The proof is not elementary, and uses tools that Lipschitz uses in his research (symmetric products). It's an amusing way of proving that $S^2$ is non-contractible, but it's far from elementary. It is secretly - but not out loud - doing homotopy theory. The point of my comment on the question is that the problem is not at all elementary.
If you want an "elementary" way, prove that a smooth manifold is contractible iff it's smoothly contractible; define the degree of a map $S^n \to S^n$ by picking a regular value and counting its (oriented) preimages (if you don't want to deal with orientation, count points in the preimage mod 2); show that it's a smooth homotopy invariant.
okay serious problem. rotational rigid motion makes total sense with calculus and algebra. this is something i don't get though. we have a trapezoid with coordinates (-1,1),(-1, 4),(3,4), and (3,-3). the rotational isometry at R(1,0) is (0,-1). The rotational isometry at (0,1) is (1,0). Why?
Ah, the exercise that $\text{Sym}^n(\Bbb CP^1) = \Bbb CP^n$ is super important. Sadly, for manifolds of dim > 1, the symmetric product has singularities.
@BalarkaSen: He's proving that $\Bbb{CP}^infty$ is not contractible, and doing so by calculating that $\pi_2(\Bbb{CP}^\infty) = \pi_1(\Omega \Bbb{CP}^\infty)$; and by demonstrating a nontrivial covering space of the latter space he shows that this is nontrivial.
My phone vibrates whenever you ping me. I'm trying to work right now. Please ping me less frequently.
I am learning quantum information/computation. I am reading Neilson and chuang for that . While reading whenever I am stuck on an exercise or have a doubt I post the same on physics stack exchange. But most of my doubts are purely mathematical and I am asked to migrate the question on math exchan...
Let's pick a point $z \in \text{Sym}^n(\Bbb C - \{0\})$ : this corresponds to $n$-tuples in $\Bbb C - \{0\}$ which are permutations of each other (let there be $k$ of them). Consider the tuple $(a_0, a_1, ..., a_k, 0, ..., 0) \in \Bbb C^n$ which are coefficients of the polynomial the roots of which are the $k$ of the tuples that correspond to $z$. This coefficient tuple is never zero, as we are considering $\text{Sym}^n(\Bbb C - \{0\})$, so this is in $\Bbb C^n - \{0\}$.
Obviously $(\lambda a_0, \lambda a_1, ..., \lambda a_k, 0, ..., 0)$ is the same thing as $(a_0, a_1, ..., a_k, 0, 0, ..., 0)$ (i.e., same in the preimage of the map Sym^n(S^2) --> C^n - {0} we constructed) as the polynomial obtained from this coefficient tuple has the same roots, the ones corresponding to $z$. Thus, $\text{Sym}^n(\Bbb C - \{0\}) \cong \Bbb CP^n$.