« first day (1352 days earlier)      last day (3670 days later) » 

7:00 PM
@Shisui The answer you don't understand is not in terms of elementary functions.
 
@Mike I see. So elementary functions include polynomials, trigonometric functions, hyperbolic functions, inv. trig, inv. hyp, exponential and logarithmic functions?
 
Something like that. But it includes the dilogarithm, which definitely isn't anything anyone would call elementary:
$$\text{Li}_2(z) = -\int_0^z \frac{\ln(1-u)}{u}du$$
 
@user127001 this would go way beyond real analysis
 
@PedroTamaroff What was the cause of that assessment?
 
Back.
 
7:04 PM
The axiom of choice stuff
 
@Mike That sounds pretty interesting! I've not heard of the dilogarithm before :)
 
@MattN. It comes on at 4-11 PM here. I will be watching and my wife will join in when she gets home.
@Mike definitely a special function
 
Hello again.
Quick question-for space filling curves, they're describe as a limit of curves, how do you know the limit exists…?
 
@Chris'ssis: I can finally recognize you in the avatar bar :-)
 
@robjohn :D
 
7:09 PM
@Shisui Personally, I find it dreadfully uninteresting.
 
@Anthony because the sequence of curves converge uniformly
 
@robjohn I think I'm about to produce something like Ramanujan, honestly ...
 
@robjohn To show it converges uniformly, don't we need to know what it converges to…?
 
@Chris'ssis how are you going to produce a Ramanujan-like entity?
is that like having a cow?
 
@robjohn :-))) I'm going to use a family of identities I just came across ...
I'm working on that right now.
 
7:13 PM
I don't see why the Peano curve is so counter intuitive… Can someone explain?
 
@Anthony we do... given a point in $[0,1]$ we can give the point in $\mathbb{R}^n$ to an arbitrary precision.
 
Hi guys, how do you show that $\sum_{n=1}^{\infty}{(-1)^n}{(1+2\cos {\pi n \over 4}) \over 3^n\ln n}$ diverges?
Sorry, meant $\sum_{n=1}^{\infty}{(-1)^n}{(1+2\cos {\pi n \over 4})^n \over 3^n\ln n}$
 
@mirgee from $n=1$?
 
@Chris'ssis $\sum_{n=2}^{\infty}{(-1)^n}{(1+2\cos {\pi n \over 4})^n \over 3^n\ln n}$ :)
 
@robjohn What do you mean the point? How would I check to see it converges uniformly?
Oh this site uses a Cauchy sequence...
 
7:16 PM
@Anthony actually, the differences can also be shown to converge absolutely with uniform bounds.
 
I'm not sure what you mean. The differences between…?
 
@Anthony $\sum|\gamma_{n-1}(t)-\gamma_n(t)|\lt B$ for some $B$ and all $t\in[0,1]$
@Anthony that gives uniformly Cauchy
 
Ah.
@robjohn But why is the result so counterintuitive?
 
0
Q: Do I need to handle recursion in this new kind of machine?

Enjoys Math(Question at the very bottom) Def 1. Let $F = \Bbb{Z}_p$ be a finite field. Then an $F^k$-machine is a machine with $k$ input / output memory slots. All computations are done in the field $F$ and in a problem-specific amount of arithmetic registers. Thus algorithms on a $F^k$-machine can be ...

 
@Anthony because the curve is fractal. It is Hölder-$1/n$ at all points.
 
7:20 PM
@robjohn I'm afraid I don't know what that means.
 
@mirgee split the sum and then you're done. Analyze the behaviour of $(1+2\cos {\pi n \over 4})^n$ and see it yields $3$ sometimes. You have a finite sum + $\displaystyle \sum_{n=2}^{\infty} \frac{1}{\log(n)}$
 
@Anthony it is very kinky
 
The stuff I've read just says it's surprising because you're filling a square with a line in finite time
 
I've shown that $F^k$-machine algorithms have same computational complexity class as their counterparts on standard machines
 
@Anthony well, the length of the curve is infinite of course.
 
7:22 PM
But like, doesn't it make sense that you can stretch the domain infinitely far to cover it?
 
@Anthony Any curve I can normally imagine doesn't cover the square.
 
@Mike But why?
 
Draw a curve.
 
Haha.
But like doesn't infinite stretching seem to imply the possibility?
 
No really.
 
7:23 PM
@mirgee I'M WRONG THERE! It's a sum like that, but smaller. Even so, it goes to $\infty$.
 
@Anthony I guess that depends on what your preconceptions of curves are. Most curves we think of are differentiable or at least rectifiable. These are not.
 
"infinite stretching"?
 
Well I mean that's what we're doing right?
I guess it doesn't make sense. I don't know.
I have a very twisted sense of math.
I'll be back, gotta go take a test. Thanks for the help.
 
You need to be precise with your thoughts.
This will help - a lot.
 
Are there polynomials in $\Bbb{Z}_p[x_1, \dots, x_k]$ that cannot be computed in time polynomial in $p, k$?
 
7:26 PM
what do you mean computed
 
I mean on a standard machine mon
your home desktop
in $O(t(p,k))$ time
where $t$ is poly
 
what are you computing
 
I don't know if I stated that correctly though
I'm doing an existence proof:
0
Q: Do I need to handle recursion in this new kind of machine?

Enjoys Math(Question at the very bottom) Def 1. Let $F = \Bbb{Z}_p$ be a finite field. Then an $F^k$-machine is a machine with $k$ input / output memory slots. All computations are done in the field $F$ and in a problem-specific amount of arithmetic registers. Thus algorithms on a $F^k$-machine can be ...

 
@mirgee It's $$\displaystyle \sum_{n=8,16,24 ... }^{\infty} \frac{1}{\log(n)} \rightarrow \infty$$ Q.E.D.
 
what are you computing that you want to compute in polynomial time
 
7:27 PM
@mirgee all the terms except those for which $n\equiv0\pmod{8}$ converge absolutely. Those for which $n\equiv0\pmod{8}$ form the series $\sum\limits_{n=1}^\infty\frac1{\log(8n)}$ which diverges by the integral test
So the series is the sum of 7 convergent series and one divergent series
 
@Mike, I want to see whether there exists a polynomial time algorithm for all $F^k$-compatible problems
 
@mirgee that was a funny question! :-)
 
@mirgee so you could replace the $\log(n)$ by $n$ and the series would still diverge.
@Chris'ssis did you mention that the other 7 equivalence classes mod 8 give series that are convergent?
 
@robjohn I said above the other series are all convergent. (in other words)
 
@Chris'ssis okay, I didn't see that, and it is an important point that all of the others are convergent.
 
7:33 PM
@robjohn And why do they converge? By comparison test with geometric series?
 
@mirgee comparison with geometric, yes
 
@robjohn Sure, that is clear.
 
@robjohn @Chris'ssis Thank you guys :)
Have test tomorrow... So nervous! :)
 
@DanielFischer them's fightin' words
 
@mirgee Welcome!
 
7:37 PM
@mirgee anytime... good luck tomorrow!
 
@EnjoysMath That's fine, I'm not too interested in that. But you asked a specific question: "Are there polynomials in $\Bbb{Z}_p[x_1, \dots, x_k]$ that cannot be computed in time polynomial in $p, k$?" And I don't know what you are trying to compute. Are you trying to evaluate the polynomial?
 
@Mike do there exist polynomial expressions for $f \in \Bbb{Z}_p[x_1, \dots, x_k]$ such that, directly using the expression : e.g. $(x + y)^8$ takes $1 + \ln(8)$ ops
such that they cannot be Evaluated
in easy time
 
okay
 
Or, wait...
For each $f \in \Bbb{Z}_p[x_1, \dots, x_k]$ does there exist an expression for $f(x)$ that can directly be evaluated in a certain time. Hard to define here... have to think
 
7:56 PM
@EnjoysMath Hey are you doing plant medicine again?
 
Let $m(f)$ be a minimal expression for the polynomial $f \in F[x_1, \dots, x_k]$, i.e. number of operations for computing $f(x)$ at any $x$ directly using the expression spec of $m(f)$ is minimal.
 
8:14 PM
$$\frac{\sin(1) \cos(1)^1}{1^2}+\frac{\sin(2) \cos(1)^2}{2^2}+\frac{\sin(3) \cos(1)^3}{3^2}+\cdots=\int_0^{\tan(1)} \frac{\arctan(t)}{t} \ dt+\frac{\pi}{2}\log(\cos(1))-\log(\sin(1))$$
 
Hey guys, I'm having a discussion with a friend about this:
Algebraic number theory is:
(Algebraic number) theory
 
@Chris'ssis Is that a variation of the earlier series you mentioned?
 
or algebraic (number theory)?
 
@Shisui not really. (although they might look similar to a certain extent)
 
@FernandoMartin (Algebraic) number theory.
IMO.
 
8:29 PM
@FernandoMartin Algebra(ic number theory)
 
@Pedro: please join the IRC channel
 
8:42 PM
@FernandoMartin what is the IRC channel
 
0
Q: $\iff$ conditions for $\rm P \neq NP$ maybe?

Enjoys MathPlease review the $\rm P \neq NP$ problem here. I'm working on an algebraic approach to this problem, and all my notes are currently here. Conjecture 1 If there exists no polynomial $f \in F[x_1, \dots, x_k]$ such that $f$ has a minimal expression $e(f)$, e.g. $e(x^2 + y^2 + xy + xy) = (x + y)^...

 
Is it just me, or is this integral an algebraic slog at best? $$ \int \dfrac{x^2 + x - 1}{(x+1)(x^2 + x + 1)} \text{ d}x $$
 
@Shisui this is elementary.
 
Just a quick off-topic question: do you know how executives at SE pay for server-related expenses ? I haven't seen any donation button, or any ads that may generate money.
@Chris'ssis you always say that :P
 
@GabrielR. I always like to tell the truth. ;)
 
8:56 PM
@Chris'ssis I decided to split the integral up as follows: $$ \begin{aligned} \int \dfrac{x^2 + x - 1}{(x+1)(x^2 + x +1)} \text{ d}x & = \int \left( \dfrac{1}{x+1} - \dfrac{2}{(x+1)(x^2 + x + 1)} \right) \text{ d}x \\ & \overset{\text{Partial frac}}= \int \left( \dfrac{2x+1}{x^2+x+1} - \dfrac{1}{x+1} - \dfrac{1}{x^2 + x +1} \right) \text{ d}x \end{aligned} $$ Would you have followed a similar route?
 
@Shisui Yeah, I'd follows such a way.
 
@Chris'ssis Thank goodness. I had two pages of working to pull out the correct answer and thought there might've been a shorter and neater way that I may have overlooked.
 
@Shisui This is the way to follow.
 
@Chris'ssis What's your favorite equation/identity ?
 
@DanielFischer what are your thoughts on my post above ^^ if you have time
 
9:01 PM
@Chris'ssis There's an error in my post above. It should read $2x$ as opposed to $2$ in the numerator of the second part of my first integral on the RHS.
 
@EnjoysMath The $P\neq NP$ thing? Haven't looked yet.
 
@GabrielR. This question reminds of job interview questions where I cannot answer such questions and annoy many people there. :-))) I love many things, and when I say "many" that really means "many".
 
@Chris'ssis yeah, that is to say more than one right ? ;)
 
@GabrielR. Exactly.
 
@Chris'ssis I have another question to ask: if you had only one thing to take with you on a desert island, what would it be ? ;)
 
9:06 PM
@GabrielR. One of my all time favourites is for a triangle, $ \alpha + \beta + \gamma = 180^{\circ} $, where the greek letters are the angles of a triangle.
 
@Shisui Good one. It has a beautiful proof
 
Could you link me to it? @GabrielR.
 
@Shisui Hold on, let me draw it
 
@GabrielR. The point is that life is not a static thing, but a dynamic one, things change permanently, and all it depends on time you go there. If I were to go there now, I'd probably take Ramanujan's notebook and keep reading it there. Almost each identity there really impress me.
@GabrielR. After some years it might seem boring to me, but not now.
 
9:14 PM
@GabrielR. DAT BE COOL
 
@GabrielR. isn't it the other way around for the final two angles you wrote down?
I thought that the z-angles (alternate angles I think they are called) were supposed to be equal.
 
@Shisui right
 
@GabrielR. I changed to black square like you
 
As for triangle identities, I like $$A = \frac{1}{4}\left(\pi - \alpha - \beta - \gamma\right).$$
 
@GabrielR. sketchtoy.com/60367681 right?
 
9:23 PM
@Shisui yes exactly, I apologize for this embarrassing mistake
@DanielFischer is $A$ the area ?
 
@GabrielR. Yes. And $\alpha,\beta,\gamma$ are the angles.
 
@DanielFischer so if I scale a triangle by 2 the area remains the same ?
 
@GabrielR. What does "scale by $2$" mean for hyperbolic triangles?
 
@DanielFischer scaling lengths by $2$
 
@GabrielR. Changes the angles.
(If at all possible)
 
9:29 PM
@Mike
Suppose $M$ is a module over a PID.
 
@DanielFischer but what about similar triangles ?
 
@GabrielR. All similar triangles are congruent in hyperbolic geometry.
 
@DanielFischer Did you just kill Euclid ?
 
I'm baaaaaaaack
 
@GabrielR. Nah, Gauss and Bolyai did in the $19^{\text{th}}$ century.
 
9:30 PM
@DanielFischer Euclide se retourne dans sa tombe
@DanielFischer what exactly are the axioms of hyperbolic geometry ?
 
@GabrielR. Euclidean minus parallel postulate, plus there are infinitely many parallels through each point not on the line, iirc.
 
$$\sum_{k \ge 0}\left \lfloor\frac{n+2^k}{2^{k+1}} \right \rfloor, n \in \mathbb{N}$$
 
@DanielFischer is there an intuitive approach ? I cannot picture it
 
@Alyosha This seems trivial too. Try Hermite's identity.
 
@DanielFischer By the end of next week I'll have proven the Gel'fand-Naimark theorem.
Then C* algebras will really by operator algebras.
 
9:39 PM
@GabrielR. Take the unit disk model. Points are points, straight lines are arcs of orthocircles, that is, circles intersecting the unit circle at right angles.
 
@Alyosha You finally get a telescoping sum and you're done.
 
@Chris'ssis Thanks.
I'll try to post less trivial ones in future.
 
@Alyosha It's interesting and nice. Some would really be in trouble with this one.
 
@Chris'ssis As, admittedly, was I (which is why I posted).
 
@DanielFischer this makes sense. How do you define areas though without integration ?
 
9:45 PM
$$\sum_{k \ge 0}\left \lfloor\frac{n+2^k}{2^{k+1}} \right \rfloor=n$$
 
@GabrielR. Not, we have integration. The area element is $$\frac{dx\,dy}{(1-\lvert z\rvert^2)^2}.$$
 
@DanielFischer $z$ is the curvature?
 
@Alyosha No, $z = x+iy$ is the point.
 
Can someone explain to me once more why the Peano curve is counterintuitive?
The reason I feel it isn't is because we can distort the line as much as we want. Why doesn't it make sense you can fill the square just like you can color in a square with a pencil?
 
10:01 PM
@Anthony I think some of the problem lie in the "width" of the line
 
But don't we construct areas from integrals with infinitely thin rectangles?
 
When drawing functions, mathematically a line consists of points each having width zero'
So by filling a rectangle with lines each of width zero, in some sense one should expect that no matter how many lines one use, you should never be able to fill the square.
 
Don't we do that with integrals?
 
no
 
There are "infinitely many" rectangles...
 
10:03 PM
I think I found my problem….
 
What I'm saying is I though that integrals were the sum of infinitely many infinitely thin rectangles.
But I guess infinitely thin doesn't mean a line?
 
be precise with your thoughts
if you think you can fill in a square that way, then describe a way you think it can be done
 
$$ \int_0^\pi x \cos^2n(x)\,\mathrm{d}x = \frac{\pi^2}{2^{2n+1}}\binom{2n}{n} $$
I "discovered" this =)
 
what is it
scam site?
 
10:06 PM
My thoughts are that if integrals construct areas from arbitrarily small rectangles, which would approach a line, then we should have no trouble constructing a square from lines, albeit a lot of them.
@Ethan lol
 
lol
 
@Anthony Well with integrals you start of with rectangles and make them smaller and smaller. Each of them actually have a width, even though no matter how small you make them
 
@N3buchadnezzar I see.
 
@Anthony In the line case you are going the other way, in some sense. You are trying to add something togheter wich has no width, into something that has width.
If that made sense..
 
@Anthony No. A curve is a function from $[0,1]$ to your target space. You're describing something vaguely and noncommittally.
 
10:08 PM
@N3buchadnezzar I see, I see. Is the finite time part also significant?
 
How do you do what you want to do so that it's a curve?
 
Mike, I suppose I'd have to make a limit…?
 
Skull all you're going to do is muddy the water for someone who's already a little confused.
 
A lot...
 
sorry
 
10:09 PM
@anthony Desceibe the limit you want to do. Put it on paper.
 
@Anthony I do not know. I have not taken many deep analysis courses yet, but soon..
 
@skull no problem, man, just chat it up when someone's not already coddled about that stuff :)
confused*
 
$$\frac{1}{2}\left(\frac{\pi}{2}\right)^2\binom{2n}{n}$$
 
Perhaps something like sin(n(x)) is what I was thinking?
 
@Anthony Anyway, you should write down your idea on paper and see why it doesn't work out.
 
10:11 PM
Where you just start scribbling things tighter together.
 
Well, what's the limit of that as $n$ goes to infinity, for fixed $x$?
 
1, 2, 3, 4,...
 
@Mike Yeah, there's no limit. But you still fill in more and more of the space.
But we're looking for a function?
 
@Anthony that's the definition of a curve
A continuous function $[0,1] \rightarrow X$
 
Indeed.
So what about going across the square with some squiggle, like sine.
Then going back over some gaps.
Repeatedly? I don't know how I would write that.
 
10:15 PM
Try it. Be precise.
You can write your functions piecewise, if you want.
 
Agh so hard. Go over it with sin(x) for the first part, then double back with sin(2x), etc?
For a square of side length $a$ for $t \in$ the $i$th partition of $[0,1]$, we have $sin(\frac{2it\pi}{a}-a)$ if i is even and $sin(\frac{2it\pi}{a})$ if i is odd? I think that's continuous…. @Mike
 
How are you partitioning the interval?
 
Evenly into $i$ pieces.
 
Well, that's not going to cover the square.
So now you're going to want to take the limit of these?
 
Yeah!
 
10:27 PM
You're going to fall into the same trap as before :)
 
:(
 
I guess I shouldn't be smiling.
 
Why is that the same trap?
Shouldn't every point eventually be hit?
 
Fix $x$. If $x$ is rational... the limit of this is gonna be zero!
 
Wait, what I meant to be saying it to wave through the square once, you've hit some points. Next time, do that twice as fast, and then wave back through at a higher frequency, hitting more points. Etc.
 
10:30 PM
Or $t$ I guess.
@Well, you want to do this in "unit time" (a map from the interval). So you should be doing that at 2x speed, then 4x speed, then 8x speed... right?
 
Yeah.
 
Two problem.
1) I doubt that will cover the square. It will probably cover a dense subset of the square. But not the whole thing. 2) What's $f(1)$ going to be? You won't be able to find an $f(1)$ that makes that continuous.
 
I don't get 2), and how do I know it doesn't fill the square? Why is it less likely, intuitively, than the pean curve filling the space?
 
The trouble for continuity at $f(1)$ is that even as time goes on, you keep traveling huge chunks of the square. (To be precise, with the thing you describe, I can find a sequence $x_n$ converging to $1$, with $f(x_n)=f(0)$ for all $n$; but I can find another sequence that converges to $1$ but which always has $f(y_n)$ equal to the other corner!)
 
So again, the curve has to approach the function.
I see.
 
10:36 PM
So if you want it continuous, you'll need to make sure you only cover chunks of the square; your first half of the unit interval should map to, say, the left half of the square; your first quarter should map to the bottom left quarter of the square...
 
And then you get to the Peano curve.
Ish.
I think I understand more of my troubles.
 
This line of thought... eventually brings you to thinking about Peano-like curves.
 
Thank you Mike.
 
No prob. BTW, my guess as to why it wouldn't cover the whole interval is that sine is too nice. I can't prove it off the top of my head and don't want to.
 
I see.
The curve can be piecewise continuous, right?
Or differentiable!
 
10:38 PM
Well, the curve has to be continuous.
 
Didn't mean that! Sorry.
 
And... no. It can't be differentiable. :D
 
I meant differentiable.
Not piecewise?
I can't have one little part that is?
 
Not continuously.
Or maybe.
I don't know too much about that stuff. The derivative would fail to exist at infinitely many points, at least.
 
@Anthony Have you tried to put together a question and asking on main?
 
10:49 PM
http://math.stackexchange.com/questions/758391/please-give-feedback-to-my-answers-sets

duplicate!!!!
 
@skullpatrol No...
 
Give it some thought.
 
I mean I've asked a question.
Just not for this.
Also why do they say "Show a limit exists and is equal to L"? I feel like showing existence and finding the limit are one in the same.
 
not necessarily
 
Is it possible to find a limit without going through the work of showing it exists?
 
10:54 PM
You could find that the limit of a series going to infinity exists by the ratio test, without finding the limiting value
 
^Point taken. But so can you do the opposite?
Somehow find a limit for something that doesn't have one?
 
You can't find something that doesn't exist first, right?
 
I mean, straightforwardly no… I guess.
 
@Anthony can you find me my car keys real quick?
 
It just seems weird to not just say find the limit.
@MickLH :p
 
10:56 PM
@Anthony It's easy to find out that the limit of the following exists.
$a_n1+1/4+1/9+1/16+...+1/n^2$
 
I guess I just didn't like that it said show the limit exists and is equal to something, as opposed to just saying find the limit.
 
Finding what it is is harder.
 
Indeed.
 
meant $a_n=$
 
Gracias all.
 
10:58 PM
thank mike, he's the best :-)
 
He is indeed.
 
I hope I didn't confuse you...
...if I did I apologize.
 
11:20 PM
Are these equal: $$(1+2+3+\dots)=(1+2+2^2+2^3+\dots)(1+3+3^2+\dots)(1+5+5^2+\dots)\dots$$ Where the RHS has a series for each prime. Looks like they are the same series by the fundamental theorem of arithmetic.
 
11:49 PM
@saadtaame In a sense, though neither side converges.
$$\left( 1+ 2^{-s}+ 3^{-s}+ \cdots \right)=\left( 1+ 2^{-s}+ 2^{-2s}+ \cdots \right)\left( 1+ 3^{-s}+ 3^{-2s}+ \cdots \right)\left( 1+ 5^{-s}+ 5^{-2s}+ \cdots \right)\cdots$$
Both sides converge for $s>1$, and LHS$=$RHS.
@saadtaame See here for some related stuff.
 

« first day (1352 days earlier)      last day (3670 days later) »