@TedShifrin The free group on 2 generators contains any countable free group but it cant have a surjective homomorphism to a free group on more than 2 generators
I find it less weird, personally. I see no reason you can't pick a bunch of "algebraically independent" letters in the free group; indeed I would generically expect that this be true.
@PaulPlummer: Is there an obvious, non-topological reason free groups should only have finitely many subgroups of a given finite index?
Oh, nevermind. Subgroups of index dividing n are the same as the stabilizer subgroups of an action on a finite set, of which there are finitely many (actions are determined by how the generating elements act). Similar to the topological idea.
I just think that long discussions on certain topics should go in that topics room, so then multiple discussions on different topics can work concurrently
I know trying not to interrupt a conversation has deterred me from talking in the past
You know if you open up the site rooms page and ctrl click all of the relevant ones and close the tabs all of them stay on the right of the page until you log off?
I never realized that the Well-Ordering Theorem was so easy to prove.
You legitimately choose random elements, one-by-one, until there aren't any left.
(With minor details, of course, since usually the set to be well-ordered is uncountable. Basically, if you've already chosen an infinite amount of elements, and there are still more left, keep choosing elements.)
The unsuccessful self-treatment of a case of "writer's block" is a humorous academic article by psychologist Dennis Upper about writer's block. It contains no content outside title and journal formatting elements, including a humorous footnote. Published in 1974 in a peer reviewed journal, Journal of Applied Behavior Analysis, it is recognized as the shortest academic article ever and a classic example of humour in science, or at the very least among behavioral psychologists. It has been cited at least ten times.
The article received a humorous positive review which was published alongside the...
@Committingtoachallenge Drawing pictures help to motivate your proof. I see a sequence converging to a point as dots getting closer and closer to some point.
Fun triangle inequality fact: when people talk about the twin paradox in special relativity, it pretty much amounts to the reversal of the triangle inequality in minkowski space
right. one has to be careful that one is talking about timelike paths (which is physically reasonable, since observers don't move faster than the speed of light)
I can do a textbook and I will learn it properly, or I can do an assignment and get the grades, or I can read the course work, which seems to have holes(but is most related to grades), then even if I do the textbooks I don't know which is best for me to do
Then I have 5 courses all with different expectations and I have no idea how long each are meant to take me, so I can't dictate my time well
Maybe this is why people focus on one field of math......
If I just do the assignments I will do bad on the exams, and if I do the textbooks I will run out of time for the assignments and do well on the exams
@ᴇʏᴇs I think abeutiful mind is asking if you want the space to be a metric space since you mention boundedness and normally that is defined only for metric spaces (I actually don't know a def that does not use a metric)
Any of you guys know how to do the underline style shown on second like here: math4ged.com/wp-content/uploads/2011/07/… in microsoft word? i don't know the name of the underline style
I'm trying to put a nice square bracket over a complex text, it should look like an \overline but with ending like
\ulcorner and \urcorner.
The presence of \overrightarrow and \overleftarrow makes me believe that is possible to decorate the end of the \overline bar.
I know the existence of \ove...
@MikeMiller: the spacetime interval between two spacetime points on the path of a light ray is zero. hence, that interval had best be a pseudometric :P
I know an example of a compact set that is not closed, but I was curious if there's an example of a compact set that is not closed and also not bounded or just not bounded
@ᴇʏᴇs to summarize what's been pointed out: there's no notion of boundedness in a topological space, so one has to talk about metric spaces. there, compactness is equivalent to complete + totally bounded; complete implies closed, totally bounded implies bounded
if you want a noncompact set in a metric space that's bounded, pick the closed unit ball in an infinite-dimensional Banach space
pet peeve of the day: finding a useful review paper that covers something strongly related to what you want, but explicitly sidelines the thing you're actually interested in :P
"Our focus is always on geometric rates of convergence associated with analytic functions, not on the next-order algebraic estimates that depend on behavior at the edge of analyticity." but it's the next-order stuff i care about now, sigh
My example before was a bit tongue-in-cheek-it is natural to associate the "bounded" condition in the real numbers with the natural field order. But $\Bbb R$ can have many topologies on it.
@Semiclassical Yeah, I was working on that-had the denominator, but needed a "sign-switching" function, I suppose some shifted trig function on top would do, too
just installed texlive for the first time on an old computer, trying to compile a document. click the start button for pdflatex (in TeXworks) and nothing happens.
Really? @DavidWheeler I'd like to learn more about polynomials. I feel like I know nothing. What's a good book to read about them? My uncle gave me this book Topics in Algebra, but I don't really think they cover polynomials extensively in there
and let me further assume that, for whatever reason, my matrix is of such a form that all of the m-by-m blocks commute
in that case, those blocks must all belong to some commutative ring, and i'll be able to think of the determinant of that n-by-n matrix
whose output will be a member of the ring, i.e. an m-by-m matrix. i can then take the determinant of that, and get the same determinant as i got from starting with nm-by-nm
(i have this on the brain for practical reasons. for a nice summary, see this paper)