« first day (2965 days earlier)      last day (2353 days later) » 

00:00
Ted Shifrin has been automatically appointed as owner of this room. (What does this mean?)
22
00:15
I'm confused by the damn analysts terminology: is the stronger operator topology bigger than or smaller than the weak operator topology?
01:05
@TedShifrin Congrats Ted :D
01:20
@user193319 originally just thought that meant topology of operator norm, but it seems like wikipedia says that the strong operator topology has more open sets
01:44
Automatic appointment of room owners
> If a reasonably active room has no owner, or none of the owners have been in the room for a certain time, a new owner may be automatically appointed, to ensure that there's somebody who can administrate.
2 hours ago, by Feeds
Ted Shifrin has been automatically appointed as owner of this room. (What does this mean?)
02:20
how did the exam go? @Daminark
 
1 hour later…
03:41
@user193319 for a start they dont use bigger or smaller there usually both infinite...
@user193319 the weak op0erator topology is finer
@KasmirKhaan u alive
Morning @XanderHenderson
hello, but I am not really here
goodbye
this is my kitten his name is thor
@user1732 it was rough, I think I did well, not sure if I'm gonna get 800+ (which is the score where I'd be comfortable not redoing it), hopefully at least 700+ though, so idk
I have registered for the October one just in case
It's annoying that it takes almost a month to get scores back though. It's a scantron, just put it in the computer and boom
03:57
Well congrats
Thanks!
how many rewrites do they allow?
There are 3 instances of this test per year, one in April, one in September (today), and one in October
Though since grad school apps are in the fall/early winter, you can only really take September and October unless you start while you're still in third year
iirc Gates scored 800+
he and Jobs wrote it for fun
04:27
in Logic, 2 mins ago, by Secret
> Are impredicative and nonconstructive objects like: Amorphous sets, Dedekind cardinals, Uncomputable functions, Bernstein sets, Banach Tarski paradox, Large cardinals, Hamel functions etc. have any application outside of itself (not just adding footnotes to existing theorems in core mathematics), set theory and mathematical foundations, or all they all useless artefacts of ZF and ZFC that can only exist within the world they create?
I won't care about how fantasy they are if I don't love them
Just like division by zero, you either demonstrate an example, or you crawl through the entirely of mathematical space to convince me that they never exist forever and ever
Impossible is a very strong word to me. It means that it cannot be realised when you look at every nook and cranny
This is why I like explosive generalisation, because it allows me to find the most general (and hence most unforgiving) proof of something such that not only it answers the question, but it answers it so well that in the far future, nobody will dared to raise it again
Inefficient things will be erased from existence, and in the mathematical world to ensure that is to have a proof so airtight that only nature can screw it by producing an experimental counterexample, and hence generating the 4th mathematical crisis
I must be have a personal Vedentta on the existence of questions lol :D
My attitude to the truth of something, assuming it is either true or false, is to prove that my belief is right and you shut up forever about its negation, or prove that my belief is wrong and I will shut up forever about its affirmative
In other news (assuming anyone had paid attention) the workings of the irrational slopes are wrong and they don't do anything because I implicitly assumed that the polynomials that has $s+t$ as root must be a combination of the individual polynomials of s and t when it is not
What I should have done instead is to pick one generic polynomial, and then plug int the values s, t and s+t, and then try to find a relationship if s+t is a root
will work on that shortly
Also: It appears the auto posters are not respected by the chat and the Rambles get frozen again
04:52
Hmmm, @Kasmir congratulated me. I was never consulted or asked if I was willing to be owner. Interesting. ... :P I guess robjohn and others are hardly ever around.
They rarely did nowadays
yup, anon also.
You are the most frequent professor in this room, thus you deserve room ownership
@TedShifrin now you can kick people out instead of smacking them! :P
LOL @Leaky. I wonder if I'll still get banned ... :P
I truly miss @anon. :(
04:55
after the Putnam he faded away
Studying all the rules will be harder than passing the drivers license exam.
I don't even know if anon is in grad school. Maybe he's avoiding here 'cuz he knows I'd ask.
I think you, Mike, and Tobias are the only professors here? (not counting Asaf cause he is too infrequent)
Mike and Asaf are graduate students, still, as far as I know. Tobias is a faculty member (for now, anyhow).
robjohn used to be a faculty member. But even he is scarcely around.
Right
04:59
I thought retirement meant I could be a total bum.
wait what :o
Ted you dont work anymore?
I retired 3 1/3 years ago.
I'm only teaching a few high school kids for fun.
BTW I starred that thing :D you being owner of the room
oh nice =p
You look young on the vid ._.
never saw when they were made tho :D
Not young ... Well, but that was 3-4 years ago.
05:00
It was the calendar year 2015.
Well Ted
So now everyone has to behave or else I can kick-mute them :P
Got some time for kasmir ?
I'm going to sleep soon. But a few minutes.
okay :o well I need to understand limes sup and limes inf
from the book let me see what i dont get
05:02
is it spelled limes over there? I say limsup and liminf.
for any sequence of real numbers {c_k}k=1 to inf ,the sequence {d_k} given by
d_k := inf_n>=k ( c_n) = inf {c_k,c_k+1 ........
I dont get what they want us to belive here ._.'
@TedShifrin limsup also used here, but first time introduced was limes sup
Is limes the swedish word for limit?
yes
not pure swedish tho
latin
gränsvärde is "limit"
no one sais "limit"
whats the question kasmir?
it is limes
05:05
Anyhow ...
well Joe, the think is i dont get what I wrote there
You look at the inf of the tail (stuff past $k$).
do you understand the definition of limsup?
yes to Ted and no to Joe
Joe that is what Ted trying to explain to me :D
Are you more comfortable with sups or with infs?
05:07
ok lets start there
OK, stick with infs.
so after a certain k, we take the sequence d_k to be the inf of all values after c_k
Right. How is $d_k$ related to $d_{k+1}$?
we should get monotone increasing sequence no ?
or wait no need for montone
nondecreasing for sure
05:08
okay hmm
OK ... so is the sequence of $d_k$ bounded above?
we cant tell
we know it is bounded below
since there is an inf
OK, if it is bounded above, it has a sup. That's the definition of liminf.
hmm very comfusing
why the need of this constuction ?
we are ok with inf and sup
You need to play with examples. Write down something like 1,1/2,1,1/3,1,1/4,1,1/5,...
05:10
or am missing something ?
The idea of liminf and limsup (and this is a good exercise) is to think about all convergent subsequences.
The inf of all the limits of all convergent subsequences is liminf. The sup of all the limits of convergent subsequences is limsup.
But, as I always tell you, playing with examples is the way to understand the definitions.
okay i think i got it :D
because bolzano
has proved that in each bounded sequence we can extract a convergent subsequence
:D
So look at the sequence I gave you. What is its limsup? liminf?
05:12
give me one second to think :D
well limsup =1
and lim inf is 0
OK. Can you see this from both ways we've discussed?
what do you mean ?
i think i understood it right
the sequence is increasing
I should be sleeping.
:D
okay thanks Ted :D
I need to give you a more interesting sequence.
05:15
ill keep reading and tomorrow we can talk more :D
okay :D
But I meant for you to use the $d_k$ definition and also my statement about convergent subsequences to verify you were right.
You need to do lots of examples.
will do ! :)
OK
nighty night.
Bonne nuit ! @TedShifrin and thanks alot again :D
@KasmirKhaan exercise: when does liminf of a sequence exist?
05:21
when the sequence is bounded!!
-.-
:D
that's sufficient but not necessary
exercise: come up with an unbounded sequence with liminf 0
grrrrrr hmm let me think
if the sequence has only negative values
exercise: come up with a sequence with liminf L such that every element of the sequence is strictly smaller than L
hmm
n+1 / n
btw leaky
can you do fourrir series?
and find coefficients?
Somehow this course am taking is about fourir transform but does not show exercies about making such series ._.'
I don't know much about fourier stuff
05:27
okay thanks anyway :D
Well kasmir gotta keep working on his book =p i hope you still here
we can talk about analysis or commutative algebra later if you are
Ill text ya :D
05:45
bahhhh made a mistake x.x
Hey, hey
why OH WHY!
is it nottt linking well? D:
Soft question here.
D:!!
0
Q: Finding the value of $\alpha$ such that P is a measure for $P(\{2,3 \})$

usukidollQuestion: Find $\alpha$ so that P is a measure, where: $\Omega = \{1,2,3,4 \}, \mathscr{F} = P(\Omega), P(\{1 \})=\frac{1}{4}, P(\{2 \})=\frac{1}{6}, P(\{2,4 \})=\frac{1}{2}, P(\{3 \})= \alpha$ What is $P(\{2,3 \})$? Here's my attempt: Given $\Omega = \{1,2,3,4 \}, \mathscr{F} = P(\Omega), ...

there we go
I'm very amused by the fact that, when introducing an extension of the reals with those curious properties like in the complex numbers, we can deduct incredible things about reals
I've just met a problem that goes like "prove that for any integers $a, b$ and $n > 0$, $(a^2+b^2)^n = x^2 + y^2$ for some integers $x, y$"
I had no idea on how to solve it. But, looking carefully, it's an (almost!) trivial result from $\Bbb Z[i]$
I find it curious that extensions of things can tell new facts about the "original" things.
When reading about logical systems, I always go for the "straighforward-est" way to approach any problem. So it would not make sense to extend a thing and, then, get any result from it
But since I stopped to think about this, $\Bbb C \twoheadrightarrow \Bbb R \twoheadrightarrow \Bbb Q \twoheadrightarrow \Bbb Z \twoheadrightarrow \Bbb N$
Either way, I can't see how a new structure with completely new operations can give any interesting result about the structured that generated it
Opinions, gentlemen?
Oh, for example: you can make quotient rings, mappings modulo R, etc. But creating new operations is so... insecure (?)
Like, how'd I guess that I have to create this?
06:03
IMO, extensions generally help illuminate the properties of the parent structure, unless you are going into set theory territory
in Logic, 2 hours ago, by Secret
> Are impredicative and nonconstructive objects like: Amorphous sets, Dedekind cardinals, Uncomputable functions, Bernstein sets, Banach Tarski paradox, Large cardinals, Hamel functions etc. have any application outside of itself (not just adding footnotes to existing theorems in core mathematics), set theory and mathematical foundations, or all they all useless artefacts of ZF and ZFC that can only exist within the world they create?
2
At least for complex numbers, the reason it works is because new routes become available to get from A to B by using the extended structure, such as contour integration of some real functions
which otherwise will be extremely complicated to get to via the direct route
In fact, going as far back to the axiom of choice, the reason it is useful even though ultimately everything relevant to real life can be formulated in finite terms is because many theorems and results become much nicer when infinity is used as a shortcut
(though I am being inaccurate here, cause using axiom of choice vs using only finitist foundations is not really an example of an extension)
Examples where the extended structure does not tell anything extra about the original structure are for example $\text{No} \twoheadrightarrow \Bbb{R}$
where $\text{No}$ are the surreals, though as it turns out the surreals are very useful to reason about certain game theoric games
Another example are the fractional wheels, which extends the field of rationals with involutions, but otherwise it does not tell anything more about rationals
So it is not always true that algebraic extension will give us more
06:28
@Secret That's the weird part for me. Like... how?
It's not natural.
I think it is mainly because while we lose total order when going from reals to complex, we gained algebraic closure, which give us the fundamental theorem of algebra, which give us a very powerful tool to query about reals.
But can we predict what we get before the extension is being created, I don't think we can do that without working out what happens when we add axioms to extend a structure
Alessandro and Tobias might be able to give you more detail on when is an algebraic extension will tell us more about the parent structure and when it does not
@LucasHenrique this is so incredibly powerful and so easy to prove. Can't understand how it is possible even though you've already explained the total-order/algebraic-closure relation
06:52
Ok for that particular question, think about it this way: In the complex plane, I am sure you are aware that it can be rewritten as $e^{ir^2n}=e^{is^2}$ and thus the result is apparent when the exp are rotations about the origin. Yet if you only have $\Bbb{Z}$, then all you have is the x axis projections of these rotation thus the result is less obvious that there has to be pairs of integers that satisfy the result
So in a way,some relationships of the reals is a shadow of the relationships in the complex plane
which is why extensions to complex plane helped solved many problems of the reals
I think I got it
Thanks, @Secret
Now your question makes me wonder... did Fermat last theorem has a nice proof in the complex plane...?
it's all because of the residue theorem
$x^n+y^n=z^n \implies x^n-i^2y^n=z^n \implies r^{\frac{n}{2}}e^{i\theta}=z^n$
that road's been explored
07:06
ok nvm
9
Q: What was Lame's proof?

RghtHndSdIn 1847, Lame gave a false proof of Fermat's Last Theorem by assuming that $\mathbb{Z}[r]$ is a UFD where $r$ is a primitive $p$th root of unity. The best description I've found is in the book Fermat's Last Theorem A Genetic Introduction to Algebraic Number Theory. For the equation $x^n + y^n = ...

07:20
@MaryStar "$$a_1=0 \\ a_{n+1}=(-1)^{n+1}\cdot (a_n+2\cdot n)$$": try to write it directly without recursion:$$ a_{n+1}=(-1)^{n+1}\cdot \Bigg( \bigg((-1)^{n} \Big( (-1)^{n-1}\cdot (\big(\cdots\big) + 2\cdot (n-2) \Big)+2\cdot (n-1) \bigg) +2\cdot n \Bigg)$$
correction: $$ a_{n+1}=(-1)^{n+1}\cdot \Bigg( (-1)^{n}\bigg((-1)^{n-1} \Big(\big(\cdots\big) + 2\cdot (n-2) \Big)+2\cdot (n-1) \bigg) +2\cdot n \Bigg)$$
07:42
We have $$ a_{n+1}=(-1)^{n+1}\cdot \Bigg( (-1)^{n}\bigg((-1)^{n-1} \Big(\big(\cdots\big) + 2\cdot (n-2) \Big)+2\cdot (n-1) \bigg) +2\cdot n \Bigg)=\prod_{i=2}^{n+1}(-1)^i\cdot a_1+\sum_{i=0}^{n}(-1)^{i+1}\cdot 2i=\prod_{i=2}^{n+1}(-1)^i\cdot 0+\sum_{i=0}^{n}(-1)^{i+1}\cdot 2i=2\cdot \sum_{i=0}^{n}(-1)^{i+1}\cdot i$$ or not?
How can we calculate that sum? @Rudi_Birnbaum
no, but observe that $$ a_{n+1}= (-1)^{n+1}\Bigg(\cdots \bigg((-1)^{2}\Big((-1)^{2}\big((-1)^{1}(2\cdot1)+2\cdot2\big)+2\cdot3\Big)\bigg‌​)\cdots+2\cdot n\Bigg) $$
[Random]
$c_0+c_1s+c_2s^2+\cdots=k$
$c_0+c_1t+c_2t^2+\cdots=l$
$c_0+c_1(s+t)+c_2(s+t)^2+\cdots=0$
$\implies c_0+c_1s+c_2s^2+\cdots+c_1t+c_2t^2+\cdots+2c_2st+3c_3s^2t+3c_3st^2+\cdots=0$
@MaryStar then $$ a_{n+1} = (-2)^{n+1}\Bigg(\cdots \bigg((-1)^{3}\Big((-1)^{2}\big((-1)^{1}(1)+2\big)+3\Big)\bigg)\cdots+ n\Bigg) $$
$\implies k+l-c_0+2c_2st+3c_3s^2t+3c_3st^2+\cdots=0$
$\implies P(s)+P(t)-c_0+2c_2st+3c_3s^2t+3c_3st^2+\cdots=0$
$c_0+c_1st+c_2s^2t^2+\cdots=m$
08:00
hi @Ted
ugh, this is absolutely not useful, there is no obvious way to handle those cross terms
@MaryStar and then $$ = (-2)^{n+1}\Bigg(n+(-1)^{n}\bigg(\cdots\bigg(4-\Big(3+\big(2-1\big)\Big)\bigg) \cdots \Bigg)$$
or similar ...
Hmm... how about...
$P(s)+P(n)-c_0+2c_2sn+3c_3s^2n+3c_3sn^2+\cdots=q_n$
Set $n=0$ kills off all cross terms and give:
What's the question?
Not really a question cause it is incomplete. It is once again those episode of having an irresistible urge to solve $\pi+e$ (or more generally, the rationality of the sum of two transcendentals) whenever some users reminded me of its existence by e.g. mentioning about transcendental numbers
somehow the fact that this is an open question bothers me like there is no tomorrow
08:16
Is $\sum\frac1{n^2+1}$ rational?
Probably not
$\dfrac12(1+\pi\coth(\pi))$ according to W|A (summing from $n=0$)
$\coth(\pi)$ is $\dfrac{e^\pi+e^{-\pi}}{e^\pi-e^{-\pi}}$ I think
$$\int_{-\infty}^\infty\frac{\cos x}{x^2+1}\operatorname d\!x=\frac\pi e$$
I think sometimes, we might need to ask the reverse question: what exactly makes $e^{i\pi}$ algebraic while $e$, $i\pi$ is transcendental
Then we might be able to get closer to query about $e^{\pi}$ and $\pi^e$
08:42
$e^{i\theta} = \cos \theta + i \sin \theta$
$e^{i(-i\pi)} = \cos (-i\pi) + i \sin (-i\pi)$
$= \cosh \pi + \sinh \pi$
hmm... why is $\cos \pi$ rational...
sure it is by definition, but is it really a consequence of the definition of the radian
According to the plot of the set of irrationals, irrational numbers closest to 0,1 are the most irrational, followed by those closest to 1/2, then 1/3, 2/3 and so on
and this relation is periodic with a period of 1 as shown by the Thomae's function
09:05
$e^\pi$ is known to be transcendental
Hi akiva
what is an acumulation point ?
@KasmirKhaan 0 is an accumulation point of the interval (0,1)
or the set {1,1/2,1/3,1/4,...}
so given a set X and a point p, if some sequence in X converges to the point p, then p is an accumulation point of X
09:30
@LeakyNun Thanks Leaky :D
I did not see you were on :D
ok... will try this one more time before going back to global structure of irrationals (cause that one is more interesting and less discouraging since it does not involve a famous open question)
@MaryStar then you see $$ a_n = \begin{cases} n-3,\, for \; odd\; n>3 \\ n+4,\, for\; even\; n >2 \end{cases}$$
you can also use induction to show that.
Suppose $s, t \in \Bbb{I}$ $c_i \in \Bbb{A}$ for all $i \in \Bbb{N}$, $n \in \Bbb{N}$ and all other letters unlabelled are assumed to be real. Consider a generic element $P \in \Bbb{P}(\Bbb{A})$ as follows:
$P(x) = c_0+c_1x+c_2x^2\cdots = \sum_{k < \omega} c_kx^k$
Now consider for any $x,y \in \Bbb{R}$ compute:
$P(x+y)=c_0+c_1(x+y)+c_2(x+y)^2+\cdots$
Since $P$ is a polynomial, which always terminate under some finite terms $k < \omega$ (that is there exists some $M$ such that for all $k > M$, $c_k = 0$), it follows rearrangement is possible. Rearranging give us:
$P(x+y)= c_0+c_1x+c_2x^2+\cdots + c_1y+c_y^2+\cdots + 2c_2xy+3c_3xy^2+3c_3x^2y+\cdots$
This can be simplified into:
$P(x+y) = P(x)+P(y)-c_0+Q(x,y)$
where $Q(x,y)=2c_2xy+3c_3xy^2+3c_3x^2y+\cdots$
Observe that $Q(0,y)=Q(x,0)=0$
@Rudi_Birnbaum Ok, I think about that! Thank you!!
Plugging this in, we have:
09:42
@MaryStar in nutshell I would recommend to first guess the law (by making a table and looking sharply at the formula, you will observe that even and odd make their own series, and that the first members $n<4$ are "not in the trend") and then you can use induction.
$P(x)=P(x)+P(0)-c_0 \implies P(0)=c_0$
Thus the master equation we can work with is:
$P(x+y) = P(x)+P(y)-P(0)+Q(x,y)$
and then I kinda lost track...
Also by plugging in any pairs of $y,z$ the following is derivable:
$P(x+z)-P(x+y) = P(z)-P(y) + Q(x,z)-Q(x,y)$
I see your rambles room got frozen again, shouldn't the feed have kept it alive?
It has not, I have no idea why
Perhaps open a rambles 2
and copy-paste all that stuff in to it :-)
or you could bookmark it as a conversation
10:12
hmm...
$P(x+h)-P(x) = P(h)-P(0)+Q(x,h)$
$\frac{P(x+h)-P(x)}{h} = \frac{P(h)-P(0)}{h}+\frac{Q(x,h)}{h}$
$\frac{dP(x)}{dx} = \lim_{h\to 0} \frac{P(h)-P(0)}{h} + \lim_{h\to 0}\frac{Q(x,h)}{h}$
analysis?
Hello what is$-\infty × 7^{-\infty}$
$\infty$ is not a number
it in the intégrale $\int_{-\infty}^0 x7^x dx$
all zero divisors nilpotent implies primary ideal
10:18
$\frac{dP(x)}{dx} = \lim_{h\to 0} \frac{Q(x,h)}{h}$
all zero divisors nilpotent implies primary ideal is this statement true?
@LeakyNUN
hmm... so the derivative of any polynomial is entirely determined by the cross terms obtained when computing $P(x+h)$
@Ashcatcham yes
$=\frac{x7^x}{ln(7)}]_{-\infty}^0 -\frac{1}{ln(7)}[\frac{7^x}{ln(7)]_{-\infty}^0$ @mercio
$7^{-\infty}=0$?
@PolineSandra all zero divisors nilpotent implies primary ideal is this statement true?
10:22
$\int_{-\infty}^0 x7^x dx = \lim_{y \to -\infty} \int_y^0 x7^x dx$
i don't know Andy thing about this @Ashcatcham
hmm... I need more special values of $Q(x,y)$ otherwise this is going nowhere
you have to evaluate the limit of those terms as the lower bound of integration goes to $- \infty$
@mercio then what is please $ lim_{x\to -\infty} x 7^x$
have you tried graphing that function ?
10:26
@SohamChowdhury ideal(4,t) contains 2t or not
in The h Bar, 2 days ago, by Secret
And in the scenario when a help vampire is also on and one of the comment is a response to a help vampire, I have the irresistible urge to flood the chat because since the conservation does not flow anymore, might as well accelerate it to chaos and restart the chat anew
have you tried computing $-10. 7^{-10}$ or $-100. 7^{-100}$ ?
There are currently 2 help vampires in the room
however, because I am too busy solving my own problems, I am not even bothered to be annoyed
consider yourself lucky :D
11:11
Hi Ted @TedShifrin
Hi all @mercio I posted something in the other room.
@Faust People often speak of one topology being bigger or smaller than other; what one means when saying this is that one topology is set theoretically contained in the other. You say that the weak operator topology is finer (bigger) than the strong operator topology, but this seems to conflict with Daminark's comment, which states that the strong operator topology contains more open sets than the weak operator topology (i.e., the SOT is bigger than the WOT).
 
1 hour later…
12:28
A textbook on functional equations
I think I still don't have enough knowledge on polynomials to try to tackle $\pi + e$, so I will return to this later. Hopefully future me when got triggered to solve $\pi + e$ again, will remember that we have already tried the very general investigation above and obtain:
$$P(x+y) = P(x) + P(y) - P(0) + Q(x,y)$$
and that nothing further can be said unless there are other special values besides $Q(x,0)=Q(0,y)=0$ were found to simplify it further
12:58
Hi everyone
I have a basic doubt lurking around. I have 3 subspaces of R4 and I need to prove they are a direct sum, but I do not see how they are a direct sum.
$V_1 = \{(x,y,z,t) : x = y = z\}$, $V_2 = [(2,1,1,1)])$, $V_3 = [(2,2,1,1)]$
13:18
Is the basis of the first subspace not $\{(1,1,1,0) , (0,0,0,1)\}$?
Oops, never mind, I see my error I think, apologies...
13:58
@Ashcatcham what ring is that an ideal of?
also, perhaps stop pinging random people in chat? (I don't mind it myself, but others might)
Please someone help me find the value of this determinant.
I tried to differentiate one column but it seemed complicated
@Jasmine did you try simply calculating $A$ and $B$?
14:14
@SohamChowdhury i didnt
But now i am doing
But its little complicated
What did you try?
@SohamChowdhury found the integrals
Good.
Although if this is a JEE-style problem there's probably some way to find a relation between $A$ and $B$ so that you don't have to calculate them explicitly (nothing of this sort comes to mind at the moment, but you can try transforming one integral into another)
@SohamChowdhury yes this is from jee test
I have a set of N-vectors, in d-dimensional space such that, $\vec{r_{i+1}} -\vec{r_i} = l\vec{a_i}$ wherein $a^{(k)}_i = {-1,0,1}$ (i.e the k-th component of the i-th vector takes one of these three values.

And my goal is to compute the n-th moment of the $\langle |\vec{r_N}-\vec{r_i}|^n\rangle$

In general, one can write the ened to end distance $\vec{r_N}-\vec{r_i} \sum_{i=1}^{N} \vec{r_i} = \sum_{i=1}^{N} l \vec{a_i}$

say, for the second moment, the we need $|\vec{r_N}-\vec{r_i}|^2 = l^2 \sum_{i,j=1}^N \vec{a_i} \boldsymbol{\cdot} \vec{a_j} = l^2\sum_{i,j=1}^N \sum_{k=1}^d a^{(k)}_i a
14:22
I dont know why my phone not supporting marhjax now and i cant read mathjax text
@SohamChowdhury if i just go on solving in a conventional way it will become very difficult. Can you suggest some other way?
Hmm... I don't get what the irrationality measure is doing. There is no point in this stack that there are countably many solutions of $(p,q)$, other than those stacks seemed to follow a pattern of 7
user131753
@DavidReed There is an alternative interpretation of the situation.
What all is going on in that graphic?!
user131753
It is simply that the domain of a variable (see here) doesn't include that variable.
user131753
Which I think is not entirely unexpected but I need a rigorous proof of it (unless this itself is a definition) @DavidReed.
14:37
@KarlKronenfeld That is a plot of the rationals (white lines) up to denominator 100, with 4 irrational numbers plotted on it. I am trying to make sense of what the irrationality measure is doing by running from q = 1 to 30 and then the purple lines showed the distances $|x-\frac{p}{q}|$ for each given q that satisfy the inequality
But so far, there is no indication that there are infinitely many solutions because at each integer value of q, I only ever get two solutions
so I have no idea how to reason with the irrationality measure
So, you're picking those five numbers (like $\pi-3$) as your $x$ somehow when you're generating the purple lines?
Yup, the purple lines are the distances $|\pi-3 - \frac{p}{q}|$ that satisfy the inequality and the first rational of each $q$s are labelled by the light yellow lines e.g. $\frac{1}{2}, \frac{1}{3}, \frac{1}{4},...$
It should be noted that only up to q=19 is visible and done by inspection, anything beyond are calculated
Ah. You should get within $\frac 1{q^2}$, at least, for infinitely many $q$. (As there will be finitely many $(p,q)$ for any $q$)
I guess what you're showing is that it does not have to happen for the majority (of small) $q$.
Basically, select $\frac pq$ using the continued fraction expansion of $\pi-3$ to get an infinite sequence of approximations within $\frac 1{q^2}$.

« first day (2965 days earlier)      last day (2353 days later) »