« first day (4269 days earlier)      last day (756 days later) » 

12:15 AM
Let R be a Euclidean domain. Let a and b be non zero elements of R. I want to show that lcm (a,b)= ab/(a,b)
Let e:=ab/(a,b). a|e, b|e
Suppose that e’ in R is such that a|e’, b|e’. By Euclid Algorithm in e’,e, it follows that e’=qe +r where r=0 or N(r)<N(e)
I am stuck in showing that r=0.
Suppose on the contrary, r is not zero. Clearly, a|r and b|r. But I don’t know how to proceed from here.
 
@Koro No. I refuse to let $R$ be a Euclidean domain.
YOU CAN'T MAKE ME!
 
if there's a gcd in it you wanna use bezout's lemma
 
I concur. Have you shown that if $(a,b)=1$, then $\text{lcm} = ab$?
 
12:41 AM
@leslietownes Can we use a bezoar instead?
 
let's not and say we did
 
0
Q: An image filled with circles

Akiva WeinbergerHere is an image. My question is simple: what is this? (As a side note, I did not invent this, and it was not intended by its creator to be a puzzle.) PS: If you believe you have solved it, see if you can figure out this second image.

Puzzle: What is this?^
I may have posted this here before. I don't remember.
 
you did. but i won't spoil it, for people who want to play your sick game.
 
1:16 AM
Is it correct to say that $\inf\{x^2-2y^2 \ | \ 0\le x \le y\}=-\infty$ because the limit $\lim_{\|x\| \to \infty} (x^2-2y^2)$, along the curve $(x,x)$ with $x \ge 0$ with $\|(x,x)\|=\sqrt{x^2+x^2}=2|x|=2x \to \infty$ when $x \to \infty$, is such that $\lim_{x \to \infty} (x^2-2x^2)=-\infty?$
 
sure, although the inf could exist even if that limit as ||x|| goes to infinity did not.
 
Thank you leslie)
 
 
1 hour later…
2:30 AM
@XanderHenderson you want me to denote that by E?
@leslietownes not sure how that will be useful here :(
Every ED is UFD so a and b will have unique factorisation and then I could go from there.
*unique upto associates
But I want to show this using definition of ED.
 
2:59 AM
@Koro what's your question, bro?
Oh, it's $\text{lcm}(a,b) = (ab)/\gcd(a,b)$
@Koro where are you stuck?
 
@Koro In a ED h Euclidean algorithm works, just as in $\Bbb Z$. But be your usual stubborn self and ignore what Leslie and I suggested. Since you clearly did.
 
Got windows 10 installed on my dad's old dual monitor desktop
Qt install is 20GB, lol, prays internet stays stable
So I got one construction gig, perhaps a tutoring gig next week, and then an odd job at a higher rate (coding for my dad).
STEM is a slog :D
@Koro, you done vacated the room :>
 
3:43 AM
i just googled it and the solutions on math.SE that popped up do use bezout, but you do you.
 
@PurpleHaze I got stuck at step trying to prove that lcm(a,b) in a Euclidean domain is ab/(a,b). I described my question above.
@TedShifrin I didn’t understand how Bezout’s will be useful here. I mentioned that above. Writing ab/(a,b) as ab/(x a+yb) and then what? I got stuck. To your comment: the statement in case (a,b)=1 seemed as strong as what I am trying to prove.
 
4:01 AM
No. Start by proving the gcd=1 case. You aren’t using Bezout correctly at all.
This is a completely standard argument that you need to master.
 
4:12 AM
Trying to think how to fit in Bezout’s
xa+yb=1 for some x and y. If a|e and b|e then it should be shown that ab|e.
 
Perfect.
One step.
 
@leslietownes if you had to teach a lecture on something cool from analysis to a bunch of students who are only starting to learn how to prove things in math, what would you show?
Like something that has a low bar for understanding.
 
Why analysis?
Maybe Darboux’s theorem that the derivative has the IVP.
Descartes law of signs :) Rolle’s theorem plus induction.
 
I am trying to think of something cool from each major branch of mathematics that would be nice to introduce someone to.
So if you have other topics you'd recommend for other branches, feel free to recommend.
 
If ab doesn’t divide e then e= ab q+r where N(r)< N(ab) and r is non zero. But this is not one step :(. What did I miss?
 
4:25 AM
Screw contradiction.
 
@anak direct proof for proving that $\sqrt 2$ is irrational ?
@TedShifrin ok.
 
@Koro That one they would have already seen on the first day of their intro to proofs course. :P
 
You have an equation written down. You proceed to ignore it, even after I said perfect.
 
@anak the direct one? I think it’s not very famous.
 
Buffon needle and Crofton’s formula .
Direct proof? How do you prove not rational directly? I know Liouville # proofs, but not this.
 
4:31 AM
@TedShifrin yes, that uses Bezout’s :)
 
If I am thinking of the same one that you are, that one is not direct, Koro
@TedShifrin Buffon's needle is pretty cool. Makes for a good experiment, too.
 
e=ak=bs and therefore xa+yb=1 becomes x(ak)+ybk=k. It follows that x(ak)s+ybsk = sk. (xs+yk)e=sk. So e|sk. $ abks =e^2$
 
@TedShifrin A number is rational if and only if it has a finite continued fraction.
 
Since e|ks, it follows that ab|e.
I got it now. Thanks @Ted et @leslietownes.
The case when gcd=d is straightforward now.
 
anak: oof. that is a tough one.
the original request, i mean. the examples given are good.
 
4:37 AM
Bonus points if it is something they can then potentially do some basic proofs built off of it, leslie.
 
@Koro you made that way too hard.
Just do $k=s$ and you’re done.
 
If k=s then a=b, which is not possible.
:(
 
You have $xa+yb=1$. Multiply by $s$.
 
proving that log(2) is irrational is pretty easy (base ten log). you can use that to prove that there is a power of 2 whose decimal expansion begins with any given sequence of decimal digits.
which is nonobvious even in the one-digit case, e.g. students know powers of 2 beginning with 2, 3, 1, 5, but maybe not 7 or 9.
i'm not sure if that counts as analysis.
you need to do some work with the real logarithm and manipulate a few inequalities. it's a density argument.
 
Analysis seemed arbitrary.
 
4:42 AM
Send me your thesis, I will just pull something elementary out of there.
 
LOL, not mine.
 
I don't want to risk damaging the papyrus that yours is written on, Ted.
 
anak: would you not want to introduce proofs of some inequalities?
 
You could do Chern’s thesis on web geometry.
 
Web geometry sounds neat.
 
4:44 AM
if you do the density argument and pay attention to what you're pigeonholing i guess you can work on the kind of size of the N you might need to be sure that 2^something less than N begins with your phone number.
lots of silyl analysis proofs become slightly less silly if you try to quantify the bounds on the things you prove the existence of, but this might be bad to do for beginning students. because it will fool them into looking for the best delta for the epsilon, etc.
 
Yup.
Sobolev estimates
 
too many f'in quantifiers in beginning analysis.
 
Do Lagrange interpolation as an application of linear algebra?
Probably don’t know linear maps on abstract vector spaces.
 
Some of the students might know linear maps, actually. Oddly enough.
 
axler's linear algebra has that good problem, he uses the L^2 inner product on [-pi, pi] to come up with low degree polynomials whose graphs look a lot better than the taylor polynomial at 0. i say it's a "good" problem because it looks cool and expands the mind a bit. it's a horrible problem because the calculations, if done by hand, are so bad that even he doesn't include them in the book.
 
4:48 AM
@leslietownes yes :).
 
and if you're using a calculator, why not just play with decimals to fiddle with the graph.
so, it's a good concept for a problem. it's a shitty problem.
 
That example approximates sine better than Taylor’s on [-pi, pi]
 
in the L^2 sense, anyway. :D
 
Oooh, talk about the cordic akgorithm for all calculators!
 
leslie, in electronic version of the book, you can zoom into that graph and you’ll see two graphs -one plotted using Taylor’s and the other using Gram Schmidt’s. ;)
The two graphs are not otherwise visible clearly.
 
4:54 AM
i remember in my print edition the graphs were indistinguishable, except at the very end. that's another reason it's not that great of an exercise. :D
when i taught engineering linear algebra once (the book assumed the use of computers and the students had experience with them) i had them do it, but made sure they set the plotting window so they could really see that the 5th order polynomial was, in fact, a polynomial.
 
@leslietownes how do you know for sure that it is a polynomial from its graph, and not just a really close approximation of one by another function?
 
you don't. i meant informally. if you do the [-pi, pi] window you might not see the difference, but if you pull back to e.g. [-2pi, 2pi] you see it bending away and adopting a more classic quintic shape.
it's obvious from the formula that the polynomial is a polynomial, but not obvious from the graph if you zoom in like axler did.
 
5:11 AM
I've emerged from the academic trenches.......
 
fix bayonets and charge the enemy line
we're right behind you
 
I'm getting ready to do just that...had quite the hellish 2 weeks of work....and I can't comprehend how it came about.....I'm miffed about it.
taking a break today and maybe tomorrow and then going to dial in and finish Ted's book and this linear algebra....
 
work sucks, although it is sometimes more fun than math
unless your work is math, then you're kind of stuck with them being the same
 
oh i meant school work......so they are one in the same......learned a lot and it was pleasurable to retain the ideas and see how to use them....but damn it was gruelling
 
unless your work is school, then you are again stuck with them being the same
everything is the same
 
5:18 AM
is that a blessing or a curse?
actually a good question for you since you did do math for work for a time...
 
it's both of them at once
 
5:40 AM
jewel lake is fairly full again, i am happy to report
 
we got maybe 10 minutes of rain before dinner.
just enough to make me change into outdoor shoes to put the trash out.
 
tilden was more or less bone dry when i went there this afternoon.
 
 
4 hours later…
9:35 AM
If you have:
If you have: (fraction a × fraction b × fraction c)÷prime number d. Suppose that prime number d is bigger than fraction a,b and c. Does that mean that prime d does not divide (fraction a × fraction b × fraction c)
 
10:26 AM
i am thinking we shd choose two conditionally convergent series but unable to find so
 
10:40 AM
Take $a_n=(-1)^n/n$
I have difficulty in showing that an ideal is maximal if the ring is complicated. For example: Is (2,x,y) maximal ideal of Z[x,y]?
I don’t know. Can anyone please suggest me some source where I can see some solved problems of this type?
 
Usually one uses $I\subset R$ is maximal if and only if $R/I$ is a field.
 
I tried to use third isomorphism theorem. (2) is an ideal of Z[x,y] and that of (2,x,y). So Z[x,y]/(2) /(2,x,y)/(2) is isomorphic to Z[x,y]/(2,x,y).
Z[x,y]/(2) is isomorphic to $Z_2[x,y]$ (using proposition 2, chapter 9.1 from Dummit and Foote)
But I don’t know how to handle (2,x,y)/(2)
@love_sodam yes, I know that. But I have problem mostly when I is generated by more than 1 element.
Can anyone please give me some advice on this? Thanks.
There used to be a website called searchonmath wherein one could type in latex and see the relevant posts. But something happened to it. Approach0 is just horrible and doesn’t work properly.
I’ll post the question on mse.
 
 
3 hours later…
2:04 PM
then what shd be my $b_n$
I was thinking the same for $a_n$
 
@Koro No. I'm not going to let you do that. No way, no how.
 
2:52 PM
$$f(n,s)=\frac{(s+1)^{n-1}+s-1}{s}$$
I find this elementary function to be special.
 
very aesthetic with all those s's.
 
3:28 PM
How does one generalize a discrete function in math? What method, for example, was used to find the Gamma function?
I am analyzing the XOR function and looking for ways to describe the variation between any set of numbers discretely but uniquely.
XOR gives you the variance between two bit strings, but what about four? It is then the variance of a variance as $(a\veebar b) \veebar (c \veebar d)$.
More formally, given an arbitrary number of bit strings, I'd like to find the position of a continuous sequence of bits common to all of them at the same position and number of bits, and for which the value of this sequence for each bit string is unique.
If $n$ is the number of strings, then intuitively, the minimum length of a sequence is $\lceil\log_2(n)\rceil$ bits, and the maximum is the length of the string with the longest length in its representation (excluding leading zeroes).
 
4:24 PM
@AMDG the simplest route i know is to notice "hey, $\int_0^\infty x^n e^{-x}\,dx$ always gives $n!$
at which point it's natural enough to ask what happens if you replace integer $n$ with real numbers
 
@Semiclassical Ok, but where does that integral originate from?
 
it comes up in applications frequently enough
enough that i'm not sure what the true "origin" would be
e.g. it comes up from moments of the exponential distribution
 
@Muzammilahmed take $b_n=a_n=(-1)^n/\sqrt n$
 
some discussion of the history here: en.wikipedia.org/wiki/Gamma_function#History
apparently one answer was originally an inner product, and the other was equivalent to the integral i wrote
that dates back to Euler in 1729-1730
so who tf knows how he came up with it
 
Interesting
 
4:32 PM
that's not the only possible generalization of the factorial function iirc, but in some sense it's the most natural
 
4:50 PM
I'm wondering why the Warsaw circle is not an image of the unit interval
I know that image of an unit interval is a Peano continuum, but I thought there might be a more elementary way to prove this
 
5:10 PM
actually, I'll just use that result, I mean, why bother
 
5:26 PM
@Koro yo got it thanks never tht answer wud be that simple
 
@Koro Mod out first by $(x,y)$ to get $\Bbb Z$.
 
 
3 hours later…
8:48 PM
can someone pls help me understanding this measure $\mu^{*}(E)=\limsup _{n \rightarrow \infty} \frac{\#\{E \cap\{1,2, \ldots, n\}\}}{n}$, like, how to calculate some examples for some $E \in 2^{\mathbb{N}}$
 
it's related to, or part of, the definition of en.wikipedia.org/wiki/Natural_density
an example there is the measure of the even positive integers, which you ought to be able to generalize to compute mu^* of {kn: n in N}
for positive k
 
9:31 PM
@AlekMurt: that is not a measure for it is not countably additive. It is one expletives of a Banach limit. It happens to be an example of a charge ( a nonnegative finitely additive function on the power set of $mathbb{N}$) the extension to the power set depends in the Hahn-Banach theorem.
 
i'm just happy to see somebody not putting 0 in N for once
 
thank for your comments, it seems like theres is alot behind of that number or"measure"
 
@leslietownes: in many European schools they use $\mathbb{N}$ to denote $\{0,1,2,3,\ldots\}$ In my side of the Atlantic, my teachers instilled in me (with a big wooden ruler to slap you on the hands) the use $\mathbb{Z}_)+$ for $\{0,1,\ldots,\}$.
@AlekMurt: just don't call it measure, not even a a joke ;) charges get quite upset when they are called measures, when they are even much more than merely measures, that are much more exotic.
 
10:17 PM
No one every goes to into a pub and orders zero glasses of Guinness. Therefore zero is not a natural number in my country of birth.
 
@copper.hat Why bother ordering?
You have not placed an order, thus calling that an order seems unnatural to me. :P
 
I suppose one needs to account for the possibility of not having sufficient wherewithal to pay for the pint.
Otherwise, when in Rome...
 
10:52 PM
oliver: nobody's perfect. :D
 
@copper.hat: there are people who when it is time to pay the tab they claim to have $0$ dollars...
 
11:07 PM
@AlekMurt like the odd numbers i guess
 
11:25 PM
Definition: Let $\mathscr{F}$ be a sheaf on a topological space $X$, and let $s \in \mathscr{F}(U)$ be a section over an open subset $U$. The support of $s$ is defined to be $\{p \in U : s_p \}$, where $s_p$ denotes the germ of $s$ in the stalk $\mathscr{F}_p$.
Question: What exactly is the germ $s_p$? I don't understand this term.
 
@AlekMurt It is often called the density of $E$ in $\mathbb{N}$. For example, the primes have density $0$. Multiples of $5$ have density $\frac15$.
 
You didn’t finish the definition of support. The sheaf is a sheaf of germs of functions, we presume. Your course/book should have given a definition, no?
Hi @robjohn.
 
Hey, @Ted. I have been digging for documents (for taxes) and my sinuses are about to explode.
It's either the dust, or I am simply allergic to taxes. Dear IRS: I am sorry, but due to my allergies, I cannot pay taxes this year.
 
Whoops...The definition is $\{p \in U : s_p \neq 0\}$. As far as I can tell, the book doesn't explicitly define the term "germ."
$s$ is supposed to be an element of a certain abelian group, so I don't know how to interpret $s_p$ nor $s_p \neq 0$.
 
Did you look up germ on the web?
 
11:34 PM
Yes, I am currently looking. But nothing seems helpful. Is $s_p$ some sort of evaluation of $s$ at $p$?
 
No, they said it’s the germ of $s$ at $p$.
 
Okay, I see. So, what exactly does that mean?
Is $s_p$ supposed to be some element in $\mathscr{F}_p$? I thought $\mathscr{F}_p$ consisted of equivalence classes.
 
Tell me what the precise definition of $F$ is.
 
My books defines $\mathcal{F}_p$ as consisting of pairs $\langle U,s \rangle$ where $U$ is an open neighborhood of some point $p \in X$ and $s \in \mathscr{F}(U)$ is some group element. Two pairs $\langle U,s \rangle$ and $\langle V,t \rangle$ are declared equivalent iff there exists an open nbhd $W$ of $p$ in $U \cap V$ such that $s|_W = t|_W$.
So, if $s_p$ is supposed to be an element of $\mathscr{F}_p$, doesn't this suppress some notation, namely the open set it's paired with?
$\mathscr{F}$ is any sheaf on some topological space $X$.
 
You should think about concrete examples. Sheaf of abelian groups, presumably. How is the stalk $F_p$ Defined?
No, no suppression. It’s an equivalence class, and that is what a germ is.
 
11:42 PM
Sorry, I didn't realize there were sheaves on different objects. Yes, we're looking at a sheaf of abelian groups on $X$. I defined $F_p$ above. It's equivalence classes of pairs $\langle U, s \rangle$.
Oh, so are you saying that $s_p = \langle U,s \rangle$?
 
For arbitrarily small $U$.
 
And any $U$ at that, right?
 
Huh?
 
Any arbitrarily small $U$?
$s_p = \langle U, s \rangle$ for any arbitrarily small $U$?
 
Think of the sheaf of continuous functions.
 
11:46 PM
What are the abelian groups in that case?
 
A function may be continuous on a small $U$ containing $p$ bit not on a large $U$.
 
Okay, sure. That's true. But how does that tell me what $s_p$ and $s_p \neq 0$ mean? Is $\mathscr{F}_p$ also some abelian group?
 
$F(U)$ is continuous (say real) functions on $U$.
 
Oh, so it's an abelian group under pointwise addition?
 
Yes
Usually called a presheaf. The sheaf is the sheaf of germs of … functions.
 
11:50 PM
Okay, I think I see.
 
What book? You can read this in lots of good books.
 
Hartshorne's book.
 
He is meticulously pedantic, but you will find the book very hard going.
Maybe read Wells or Warner.
 
Okay. I'll take a look. Maybe they'll explain terms better.
 

« first day (4269 days earlier)      last day (756 days later) »