Reputation
6,028
Next privilege 10,000 Rep.
Access moderator tools
Badges
2 10 30
Newest
 Investor
Impact
~50k people reached

Jan
11
answered Schwarz reflection over $S(0,1)$
Jan
11
revised The pushout of an open/closed injective map is open/closed
added 24 characters in body
Jan
11
revised The pushout of an open/closed injective map is open/closed
added 6 characters in body
Jan
11
revised The pushout of an open/closed injective map is open/closed
added bottom line
Jan
11
answered The pushout of an open/closed injective map is open/closed
Jan
11
revised Eilenberg–Steenrod axioms for homology without pairs of spaces
edited body
Jan
10
comment Proof that a sequence is bounded.
For all $n ∈ ℕ$, $|a_n| = n$? To prove things, it is very helpful to define them in a rigorous manner. Define $a_n = …$
Jan
10
revised Application of the mean value theorem to find $\lim_{n\to\infty} n(1 - \cos(1/n))$
edited tags
Jan
10
answered Application of the mean value theorem to find $\lim_{n\to\infty} n(1 - \cos(1/n))$
Jan
10
comment Can we take a tensor product of algebra and module?
Have a look at scalar extensions, maybe you will find there what you are looking for.
Jan
10
comment Intermediate fields of $X^p - 2 $
What is $\{1\}'$?
Jan
10
comment Proving this function is an open map
@hallaplay835 My answer still applies: Check what I wrote in parantheses.
Jan
10
revised Proving this function is an open map
added 4 characters in body
Jan
10
answered Proving this function is an open map
Jan
10
comment Intermediate fields of $X^p - 2 $
If by $S_n$ you mean the symmetric group on the $n$-element set, how is $S_{p-2}$ normal in $S_p$?
Jan
10
revised The pushout of an open/closed injective map is open/closed
edited title
Jan
10
asked The pushout of an open/closed injective map is open/closed
Jan
9
revised Eilenberg–Steenrod axioms for homology without pairs of spaces
added 58 characters in body
Jan
9
asked Eilenberg–Steenrod axioms for homology without pairs of spaces
Jan
7
comment Chinese Remainder Theorem for prime powers
You can’t in general. The system $x \equiv 1 \bmod 2$, but $x \equiv 0 \bmod 2^k$ for some $k > 1$ is impossible to solve for $x$. I didn’t read the linked question & answer, though.