But well I think no harm done, if the question stays open for a while. (Not that I fell particularly good about abandoning question like that, but we have plenty of such questions at MSE.)
I'm currently working my way through Harvard's online abstract algebra lectures (if you're interested, you can find them here). The lectures come complete with notes and homework problems. Of course, since I don't actually go to Harvard, I can't hand in the homework assignments to find out if I...
@Matt I believe the correct way is to flag for moderator attention. Then you'll get a window where you can write message explaining what you're asking from moderators.
I don't think it is possible to flag a user, so you probably have to flag question to do this.
In the question whose link I just posted, OP wants us to apparently grade all the problems assigned at Harvard Algebra course in Group Theory! Is it a good idea for the site?
@Srivatsan Well I was looking if it is possible to flag a person rather than question. (I wasn't sure.) My guess was that Matt might be looking for that too.
That was the reason why I tried to elaborate that much.
I was sure I'll get Taxonomist on [descriptive-set-theory] but I ended up getting it for [examples-counterexamples] which I don't even recall starting :-D
When I saw Mariano at the chat today, I thought he wants to talk about algebra retagging. (You mentioned he left a comment at some post you edited, Srivatsan.)
I think that my favourite comments correspondence with Gerry was one that I tagged something as desc. set theory and he untagged it saying that it's a technical term and whatnot, then posted another comment that he may have been wrong and he'll let someone familiar with the topic retag. Then I told him I've just finished a course on the topic and I have at least the basic knowledge to say that this is indeed a fitting tag :-P
Dedekind infinite means can be bijected with a proper subset, which in ZF is exactly as saying that there exists an injective function from $\omega$ into $x$.
@Srivatsan Not without some choice, as I said you can have this situation. It's one of the basic examples, actually.
@AsafKaragila OK. I suspected that, but off the top of my head, I cannot distinguish proofs using choice vs. proofs not using choice vs. proofs using choice but can be reworded to avoid it.
@AsafKaragila I think I know the overall story. Pair of injective functions $\rightarrow$ bijective can be done without choice. Other situations need some choice.
Sweet. I am beginning to see the picture of how I'm supposed to prove something complicated. However I don't see immediately the fine details and it seems some combinatorics will be in order.
@Srivatsan David Roberts' question about Cohen's second model. I want to prove that thing I mentioned not long ago, that every infinite set in that model surjects over $\omega$. I have an idea how to show this, but it's not a trivial idea. It might also be wrong.
@QED @Srivatsan: I added the stuff we worked out, plus a proof of the roots, here. I think it is pretty much the same as the proof by David Speyer. Should I just remove it, or do you think it is unique enough?
In analytic geometry, an asymptote () of a curve is a line such that the distance between the curve and the line approaches zero as they tend to infinity. Some sources include the requirement that the curve may not cross the line infinitely often, but this is unusual for modern authors. In some contexts, such as algebraic geometry, an asymptote is defined as a line which is tangent to a curve at infinity.
The word asymptote is derived from the Greek ἀσύμπτωτος (asímptotos) which means "not falling together," from ἀ priv. + σύν "together" + πτωτ-ός "fallen." The term was introduced by...
@Srivatsan Equation $(5)$ was the part that took a long time. It took me a long time to get to the point that I realized $\operatorname{Re}\left(\frac{1}{e^{ix}+1}\right)=\frac12$
@robjohn One more problem I found with David's answer is that it is very back-and-forth. It is somehow how he discovered the solution, not the solution itself. =)
@QED Yeah, even my book states it by that name. alas no means to find the asymptote. Or the behaviour of the functions when x becomes arbitarily large.
@N3buchadnezzar, anyway the first thing you should d obefore trying to solve the problem is get the definitions of all the things in involved formalized and clear
@Srivatsan Yeah, I had everything but Equation $(5)$ as soon as the question was posted. I had a day of work getting ready for yesterday's 6 hour meeting and then yesterday gone for the meeting. I finally finished $(5)$ this morning
Let $f(x)$ denote my function, I am then looking for a function g(x) on the form $g(x) = ax + b$ such that $$\lim_{x\to \pm \infty} [f(x) - g(x)] = 0$$
@robjohn See: for the given interval $[0,1]$, the error is exponentially small. Why? Because the norm of the polynomial $(x-\frac12)^n$ is constant times $2^{-n}$. But I think the question is more interesting for $[-1,1]$. There plugging in $x^n$ gives a distance of $\frac{\mathrm{const}}{n+1}$. But is the minimum distance much smaller?
@Srivatsan Why would the problem be much different on [-1,1] than on [0,1]? For a polynomial $P(x)$ on $[0,1]$, $P\left(\frac{x+1}{2}\right)$ is a function on $[-1,1]$
So we have a factor of $2^n$ on the lead coefficient
@robjohn Yes, I think that $2^{-n}$ is a distraction. My point is that: let's say that the error for QED's question is $3^{-n}$; that doesn't seem surprising. But that implies that the error for my question is $(3/2)^{-n}$: this seems quite surprising to me. I know this is just psychological or whatever, but it helps bring the relevant question to the fore.
Now, I can simply ask: is the error in $[-1, 1]$ exponentially small or polynomially small? =)
Well, you don't necessarily have to see it the same way. As long as you understood my question, it's fine. =)
@Srivatsan I think the error in the $[0,1]$ problem is $2^{-n}$ times the error in the $[0,1]$ case because of the scaling of the polynomials. Assuming a lead coefficient of $1$.
@robjohn OK, @robjohn, I feel that you think the scaling is not a big deal (and I agree). I just wanted to convey that I like to think of [-1,1] more than [0,1]; that's all. I think I blew up the difference a bit; so let's stop this discussion here. =)
@QED I thought you were wondering about "what is QED's problem" which has a negative second meaning. I thought changing to "what is QED's question" would be better.
to get adefinition of asmyptote that actually applies to the curve defined in the question
Srivatsan asked about the L_1 distance from x^2 to a line, and I was wondering if that was just one example of a more general question - Approximation theory generalizes it greatly
I guess I could define the definition as: Let A describe my curve, and let g, be a function on the form ax + b. Assume that A tends to infinity then the distance between A and g, should tend to zero, as A tends to infinity. If g is a asymptote to A.
This happened 1-2 days prior to my posting the problem in this chat to you. I focused on a special case (thinking that an analytical solution is impossible).
My first instinct was to ask for some lower bound on the distance (an upper bound is easy), even if it wasn't the tightest one. The motivation for that is that the compactness argument naturally gives an ineffective bound, so I was led to wonder what the distance would look like.
@Srivatsan Unsurprisingly it seems that entirely new techniques are needed for answering such questions. As QED says and as GEdgar (?) pointed out in a comment, approximation theory is all about such questions. This might even be some standard problem somewhere (but nobody has supplied a reference to literature yet).
@robjohn If that is true, there should be a direct explanation of that, no? Like: if $p$ is the best $L^{\infty}$ approximation, then the best $L^1$ approximation is blah.
After all, $\infty$ and $1$ are like duals or something.
@Srivatsan: Hmm... In David Speyer's answer, he claims that from $\left( 1+a_1 x + a_2 x^2 + \cdots + a_m x^m \right) \sqrt{1-x} = \left( 1+b_1 x + b_2 x^2 + \cdots + b_m x^m \right) + O(x^{n+1})$, he was able to solve for $a_n$ and $b_n$ by solving some linear equations. However, for any sequence $a_n$ we can find a sequence $b_n$ that satisfies that. Am I missing something there?