« first day (3141 days earlier)      last day (1877 days later) » 
02:00 - 20:0020:00 - 23:00

2:11 AM
Do algebraic numbers minus the rationals form a field
yes
 
2:24 AM
There's something called the Natural density for natural numbers which measures how dense a subset of the natural numbers is. Is there anything like that for a subset of the algebraic numbers?
 
 
1 hour later…
3:39 AM
Say we start at point $a$ on the real number line, move right and left haphazardly for a while, and end at point $b$. The net distance, a state function, is the distance between $a$ and $b$. The total distance, a path function, is the number on our pedometer. For the net distance, the exact differential $dx$ is a tiny move along the $x$-axis, the entity that shows up from the very beginning of Calculus.
For the total distance, however, I don't understand what the inexact differential $đx$ actually represents. Does it have the same geometric interpretation as $dx$?
 
3:52 AM
I'm sure this is simple algebra - however, I still can't understand this.
Take the equation: 2x^2=x
Normally, I would solve it by factoring:
2x^2 - x = 0
x(2x-1)=0
x=0,1/2
However, why cant we solve by dividing by x on both sides?
2x^2=x
2x = 1
x=1/2
It appears as I only get one solution from this
 
Then you will miss the x=0 solution because of the assumption that 0/0=1
wheb you divide x
 
$det(A)det(b)$ is commutative right? Since multiplacation is commutative?
 
det(X) is a number thus it is commutative.
 
thats what I was thinking
 
Hmm, so for the following equation for example
 
3:55 AM
thanks!
 
[(mg)/cos(theta)]sin(theta) = ma
How come we can eliminate m by dividing m on both sides?
 
Because mass cannot be zero in Newtonian equations. That physics context
 
I see, so it is only possible if the variable we are eliminating can never be 0?
 
Yes
 
Makes sense, thanks a lot!
 
 
3 hours later…
6:30 AM
Is it just me or this reminds of some spiritual paintings?
 
 
1 hour later…
8:00 AM
What does "$d$ " mean in $\overset d\to$ ?
 
Another way of writing $f:A\to B$ is $A\overset f\to B$
 
@ahorn Might be a metric and they want to emphasize that something converges in that metric
ohh, @AkivaWeinberger probably has the more likely one
 
There is a $\overset p\to$ in my econometrics textbook, which I take to be the probability limit.
 
then it might stand for distribution
 
In cohomology you often have things like $A\overset d\to B\overset d\to C$ where $A$ and $B$ are vector spaces (or abelian groups or modules) and $d\circ d=0$
 
8:03 AM
@TobiasKildetoft Ah! Yes, I think distribution makes sense.
 
9:00 AM
So the index of a quadratic form is a measure of how badly it fails to be positive semidefinite?
where we can also throw in the nullity to see how badly it fails to be positive definite
 
9:43 AM
[Random]
Recall that $\omega + 1$ has $0,1,2,3,4,5,...,\omega$
starting from any finite number and add any finite number a finite number of times, the result is always finite, meaning that the distance between $\omega$ and any finite starting point $\alpha$ does not reduce
(will need to figure out how to define distance between ordinals, because of the fact that they do not commute under addition)
 
What you're thinking of is that $\omega\setminus n$ and $\omega$ are isomorphic
 
hmm that's true
 
 
2 hours later…
12:04 PM
0
Q: Group Automorphisms of Norm 1 Groups in Quaternion Algebras

abenthyLet $A$ be a quaternion algebra over a field $K$ of characteristic zero. By the famous Skolem-Noether theorem, every $K$-algebra automorphism $\varphi \colon A \to A$ is of the form $$ \varphi(x) = gxg^{-1}, $$ for some invertible element $g \in A^\times$. Question: Does it follow that also eve...

 
12:19 PM
@Secret You could think of them as surreals, where addition and multiplication are commutative and subtraction and nonzero division are defined
(There's also the "natural sum" $\alpha\oplus\beta$ and the "natural product" $\alpha\otimes\beta$, which is the same as the restriction of surreal addition and multiplication to the ordinals)
$(\omega+1)\oplus(\omega+1)=\omega2+2$
 
12:39 PM
yeah, natural sum can capture that, though the surreal $\omega -1 $is not the same as $\omega \setminus \{1\}$, it is not even of the same order type if I recall
 
In other news, figured out how to solve this old problem
Jan 14 at 2:59, by Secret
Proposition: There is no finite number such that multiplying it with some finite number gives an infinite number:
The resolution is that: The proposition here is indeed true, but the point is that addition is unaffected
Put it simply, the multiplicative law of inequality breaks in this extension of a number system based on the ordinals
$a < b \implies ca < cb$ breaks
So... for this system, given the axioms for addition of ordinal arithmetic, and the following axioms:
 
So in Riemannian geometry, due to a quirk of definitions, the diameter of the unit sphere is $\pi$
 
1. There exists $c$, such that $2<c<3$
2. $c+c+\underbrace{\cdots}_{\text{n times}} + c = nc$
3. $5c = \omega$
 
(The distance between two points is defined to be the infimum of the arclengths of all paths between the two points, and the diameter is defined to be the maximum distance between two points)
(In essence it's because Riemannian manifolds are defined intrinsically without reference to an ambient space)
 
Then using these, and adding numbers on the left and on the right, some examples can be derived:
$(4c+2 = 2+4c) < 5c = \omega < (3+4c = 4c+3)$
$3c+4<4c+2<3c+5$
$(4c+2 = 3c+2+c)<5c<(3c+3+c = 4c+3)$
$3c+5<4c+3<3c+6$
and most importantly, for any finite $n,m$ we have:
$(\omega=2+\omega=2+5c)<6c<(3+5c=3+\omega=\omega)$
This can be fixed easily by having $c+\omega = \omega$
Meanwhile $\omega +c$ can stay. This is consistent with $\omega + \alpha$ remains unchanged for every $\alpha < \omega$
Thus with this new system, it is now possible to have a new pathway, besides taking one step at a time from a finite number towards $\omega$ (which means one can never reach $\omega$ in any finite number of steps), or to take $\omega$ steps at once and thus going from $n$ to $\omega$ to $\omega 2$
It is now possible to take e.g. $5$ steps to reach from $n$ to $\omega$, by choosing a suitable element $c$ that is between finite numbers
However, I am still mapping the partial order (I suspect there are actually incomparable elements, but I so far yet to found any) of this system. The problem of allowing these strange "finite" elements $c$, is that the ordering becomes more and more strange the higher up the hierarchy I go
(and as you might have noticed, because $a < b \implies ca < cb$ fails in general, associativity of addition is actually broken. But then, this is not a big deal, because in the usual ordinal arithmetic, $\omega+ \omega$ is really $(1+1+\cdots)+(1+1+\cdots)$ and hence there is no associativity here, thus what we done here is basically defining something that behaves like "$\frac{\omega}{5}$"
Now, this system is still impredictive (cannot be defined in terms of encoding of natural numbers), because one still cannot reach $\omega$ from any combination of term involving $c,2c,3c,4c$. To even hop from one $c$ to another level of $c$, $c$ steps need to be taken
I don't know if there is even a predicative way to define infinity, or anything that can reach infinity in finite steps
 
1:11 PM
I've read that the Bott Periodicity Theorem is one of the most celebrated theorems in all of (algebraic?) topology. So correct me if I'm wrong but Bott's Periodicity Theorem shows that the homotopy groups of the classical groups are all periodic, and it gives rise to a homomorphism $J : \pi_i(O(n)) \to \pi_{n+i}(S^n)$ and this tells us some things about the homotopy groups of spheres, but which part of this make it into such a celebrated result?
Because for example framed cobordism tells us more about the homotopy groups of spheres (I think) because we get an explicit isomorphism
Plus even though we get the $J$ homomorphism from the Bott Periodicity Theorem, does it help us actually calculate any homotopy groups of spheres? Spectral sequences seem a more pwerful tool to calculate the homotopy groups of spheres in some cases
I do not know enough algebraic topology to know what I don't know about these specific topics, but if someone could point out what it is that I'm missing that would be very helpful
 
Are all polynomials of the form $x^s+(1-x)^s$ irreducible? Why?
Over $\Bbb Q$ for natural $s$
 
1:28 PM
@Ultradark I doubt it, but I have no idea
 
Okay, I'll try to work on it
 
how many did you test?
 
I tested it for 2,3,4
 
Guys, quick question. $f_{n}(x)=\[ \begin{cases}
2n^2x & x\in[0,\frac{1}{2n}] \\
\frac{2n^2}{2n-1}(1-x) & x\in\langle\frac{1}{2n},1] \\
\end{cases} $
is not convergent on $\langle 0,1 \rangle$ , right ?
as n->inf by all means
 
@Ultradark using PARI/GP:
(13:42) gp > factor(x^5+(1-x)^5)
%1 =
[5*x^4 - 10*x^3 + 10*x^2 - 5*x + 1 1]

(13:43) gp > factor(x^6+(1-x)^6)
%2 =
[              2*x^2 - 2*x + 1 1]

[x^4 - 2*x^3 + 5*x^2 - 4*x + 1 1]
 
2:03 PM
@Elsa This seems right. For example, $f_n(1/2)$ goes to infinity
In fact, they all go to infinity except for $0$ and $1$
 
@AkivaWeinberger Thanks :D
 
 
1 hour later…
3:12 PM
a question (not homework, I'm self-studying)
if f_n are non-increasing real-valued functions and we know that their sum converges to a finite real number everywhere (denote the sum by f), then is $\lim_{x\uparrow a}f(x)=\lim_{n\to\infty}\lim_{x\uparrow a}f_n(x)$?
that uparrow means left-side limit
and a is an arbitrary real number
sorry there was a mistake, I'll try again, the question is: is $\lim_{x\uparrow a}f(x)=\sum_{n=0}^\infty\lim_{x\uparrow a}f_n(x)$?
which is the same as $\lim_{x\uparrow a}\sum_{n=0}^\infty f_n(x)=\sum_{n=0}^\infty\lim_{x\uparrow a}f_n(x)$, so can we exchange the order of the limit and the sum?
 
 
2 hours later…
5:01 PM
Is it possible to find natural number solutions for something like $3a^2+2b^2+3c^2+2d^2+4f^2+2g^2+3h^2+2k^2+3l^2 = 8m$, where all the variables are different from each other?
Yes. It's definitely possible.
 
5:25 PM
hi chat.
 
I just found a way to generate pythagorean quadruples.
A pythagorean quadruple is an equation in the form $a^2+b^2+c^2=d^2$. You can say that $d=m^2+n^2+o^2$, $c=m^2-n^2+o^2$, $b=m^2+n^2-o^2$, and $a=m^2-n^2-o^2$, where m, n, and o are different natural numbers, in order to generate values for a, b, c, and d that work.
 
@happyEddie: In general you can interchange limits only when you have uniform convergence of the sequence (series) of functions.
 
Does anybody see any problem with how I am generating pythagorean quadruples?
Any way to make it better?
Oh. $m>n>o$
 
5:48 PM
Let's say I have a group $G$ acting on a set $X$ in two different ways, but both produce the same orbits for all $x \in X$ are the actions equivalent in some way then?
 
@Perturbative: Do you have an example?
 
hi @ted
 
hi @Semiclassic, @Eric
 
how goes
 
5:52 PM
It goes ... ready for another crazy week?
 
oh no
it's gonna be a nightmare, i have so much work before i leave lol
 
LOL ... you'll deal.
 
hi chat
 
@TedShifrin we'll see lol
 
Hi Dair
 
5:54 PM
bah, i hate casework
making me be all specific about things. barbaric, i say
 
@TedShifrin Hi Ted, how's the daylight savings time going?
 
Not a huge fan, but we survive ...
 
I'm dying here lmao.
 
@Perturb: My suggestion is that this arises only by relabeling elements of your set $X$ in such a way as to preserve the orbits. So you choose any bijection of $X$ that maps orbits to orbits and one group action is the composition of the other with this bijection.
Dair, you don't look dead.
 
friggin woke up at 6:15 telling myself I'd just get through it on saturday... just hit the snooze like 12 times and woke up two hours later still tired.
@TedShifrin Checks window to see if Ted is stalking me
 
5:56 PM
invisible stalker
 
i just gave up on the 6 am dream.
 
You shouldn't renounce dreams without a struggle.
 
I struggled with the snooze button like 12 times.
I'm waking up at like 8 and I'm slowly bringing it down.
 
I hardly ever use alarm clocks ... only when I have to get up at 4:30 AM to get an early flight.
 
At this point since I'm not doing anything, I could afford to do that, but I don't want to get sloppy when school starts.
 
6:00 PM
@TedShifrin Sorry for the long wait, so consider $C_3$ as $\langle (123) \rangle$ which is a subgroup of $S_4$ acting on $X = \{1, 2, 3, 4\}$. This produces orbits $\Omega_1 = \{1, 2, 3\}$ and $\Omega_2 = \{4\}$ and if we consider $C_3$ as $\langle (132) \rangle$ we get the same orbits. Perhaps this is completely wrong in any case since they both are the natural action of $S_4$ on $X$
 
That fits with my suggestion, @Perturb.
 
@TedShifrin there is only one struggle
 
They're restrictions of the action of $S_4$ to different subgroups, yes.
 
and that’s the class struggle
 
@Eric: You going to give your annual Marxism lecture this afternoon? :)
 
6:02 PM
long live the proletariat.
 
annual?
biweekly at least
 
you should go to berkeley and join the communist party.
 
Oh, I've missed a few. :)
 
im visiting so i’ll hit up some comrades
 
yeah, there were quite a few fliers last time I was there.
but at least i have energy this morning. Just going to get more coffee and work on my programming projects and I'm kind of interested in investigating non-standard analysis.
 
6:10 PM
Ahh okay @TedShifrin, I think I get what you're saying
 
You just define the bijection orbit by orbit, @Perturb ...
 
just heard a horror story of a TA letting students start an exam 15 minutes early and end 10 minutes late
 
@Ted hey
 
without having informed the students ahead of time
i mean, that's a questionable choice in any case---not every student has that time available---but to not inform them ahead of time is...yikes
 
a fun question for the chat: n people wear a different hat each; I collect the hats, shuffle them, and then distribute the hats back so that each person gets a hat; what is the expected number of people getting their original hats?
 
6:17 PM
So, given a random permutation of $n$ elements, what's the expected number of fixed points?
that's in the same ballpark as derangements, though that one is a bit different: How many permutations on n elements have 0 fixed points?
 
I wonder if there exists an example of a sequence of non-decreasing functions $f_n:\mathbb{R}\to\mathbb{R}$ so that $f(x)=\sum_{n=0}^\infty f_n(x)$ is defined and finite for all $x$ and a point $a\in\mathbb{R}$ for which $\lim{x\uparrow a}f(x)\neq\sum_{n\to\infty}\lim_{x\uparrow a}f_n(x)$.
 
@TedShifrin Okay then in that case the number of ways $C_3$ can act on $\{1, 2, 3, 4\}$ is $4\times 3! = 24$
That calculation above was my end goal
 
You can think of each hat permutation as an element of $S_n$, and then count the number of elements with 1 fixed point, then number of 2 fixed points, ect.
 
the prob that any person gets their hat is 1/n so ipso facto
 
6:25 PM
Or does the equality actually hold? I have no idea at the moment...
 
UGH! My method for generating pythagorean quadruples fails sometimes
Oh. You just have to say that $m^2>n^2+o^2$
 
First things I note is that $f$ is non-decreasing too so that $\lim{x\uparrow a}f(x)$ exists (and $\leq f(x)$) but could it be the case that the limit $\sum_{n\to\infty}\lim_{x\uparrow a}f_n(x)$ does not even exist at all?
(and $\leq f(a)$) I should have said.
 
@ÉricoMeloSilva tested in mathematica because I felt like it, and yeah that's exactly it
So, kudos
 
@Semiclassical it's expectation of the sum of random variables that are 1 when i is fixed and 0 otherwise
ez pz fam
 
6:36 PM
Well, 1/n is the probability that any one person gets their hat back, but what is the average number of fixed hats in terms of n?
 
n * 1/n
 
Ah, that's a shorter calculation than I was expecting.
 
it's not ur fault, leaky said it was interesting
 
hate this polynomial:
$F=1 - u^2 - v^2 + u^2 v^2 - w^2 - 2 u v w x - x^2 + w^2 x^2 + 2 u w y +
2 v x y - y^2 + 2 v w z + 2 u x z - 2 u v y z - 2 w x y z - z^2 +
y^2 z^2$
If it seems arbitrary, it's not, but it might as well be
(everything is arbitrary when you don't understand how to use it)
 
6:40 PM
Where did this polynomial come from?
 
@Semiclassical uhm can u not tho thx
 
It's the determinant of the matrix M={{1,u,x,y},{u,1,z,w},{x,z,1,v},{w,y,v,1}}
 
O I C.
 
Wish I did.
 
Well, what are you trying to do with the determinant?
 
6:44 PM
Well, a matrix is said to be PSD if it has no negative eigenvalues. (there's other equivalent definitions but that's the simplest one)
You can show, without too much trouble, that if M is PSD then the matrix elements satisfy the following inequality: $$|xy-zw|\leq \sqrt{1-x^2}\sqrt{1-y^2}+\sqrt{1-z^2}\sqrt{1-w^2}$$
So that's something I know how to do.
What I don't know how to prove is the following: Suppose $x,y,z,w$ satisfy that inequality. Show that there exists $u,v$ such that $M$ is PSD.
Frustratingly, I can -almost- prove it
 
Hmmm, sounds fiddly.
 
7:20 PM
Give me some nonsense technobabble
 
I made a program that lists pythagorean quadruples
 
Hi chat
 
Next semester I am taking Lie Groups, Lie Algebras and Their Representations, and Combinatorial/geometric group theory---very exciting!
 
hi @Astyx, DogAteMy
 
7:41 PM
Ah, I wish I were still in 8th grade still...I would spend more time studying math, science, and literature instead of wasting my time.
 
Oh, that wasn't so bad, @Spencer1O1.
 
Yes
I already know past 10th grade math
 
I've taught plenty of college students who didn't take advantage of the opportunities they had.
hi demonic @Alessandro
 
I am taking 9th grade math this year, but next year I am going to test out of 10th grade math
 
7:43 PM
Don't be too impatient, @Spencer1O1. Sometimes kids are in too much of a hurry.
 
it's true kids suck
 
@TedShifrin Hi. I just got offered a job as an IT-consultant. I will have a phone meeting with their HR department on Wednesday and arrange stuff like when I start and wages and all that stuff.
 
It's just that I have already learned all of it because of math competitions...
 
Well, good for you, @Tobias. I know it's not necessarily your 100% ideal job, but it sounds promising!
 
Yeah, it sounds like it will be very interesting and varied work
 
7:45 PM
In 7th grade I learned about matrices, and we are only now learning about them in 9th grade...
 
Well, there's lots more conceptual stuff to learn, @Spencer.
 
Right now I am making a computer program to help with the magic square of squares problem
 
@Spencer1O1 Wait were you the kid yesterday that was trying to solve the square magic square problem?
 
I looked at the 9th and 10th grade curriculum and I know 99% of it
@Dair that was me
 
7:47 PM
Hi @AlessandroCodenotti
 
oh you changed your profile lol.
 
I know 99% of nothing
 
Linear algebra is a lot more interesting than you'll see in high school, @Spencer1O1. See some of my YouTube lectures :P
 
@Dair I changed my profile logo because it was me and my brother's youtube channel logo
 
I got 99 problems but knowing 99% of nothing aint one of them
 
7:49 PM
@TedShifrin I remember after taking an intro linear algebra class I didn't appreciate (well, I did but not that much) it, but then literally every other math class was like: Lol, so here we're going to use linear algebra in some way you probably would not have expected.
 
@Ted what is your youtube channel?
 
It's linked in my profile, Spencer.
 
@Spencer1O1 I am programming too. I
 
@Ultradark Cool!
 
7:51 PM
What up with you? @AlessandroCodenotti
 
Linear algebra is a bit odd insofar as a linear algebra course means such different things depending on the level
 
@Ted I am going to try to watch all of your videos... There are a lot of them...
 
@PaulPlummer I've just been studying algebraic geometry since I'll have an exam soonish
 
@Semiclassical is this not true of many intro subjects
 
@Spencer1O1: You're not ready for most of them. You need to learn single-variable calculus before you do the (harder) multivariable stuff. But most of the linear algebra you can have fun with.
 
7:51 PM
I'm looking forward to the next semester though, I'll take a lot of set theory and logic
 
@Semiclassical Also, it feels artificial af, which is part of the issue I had with it originally... but you slowly realize it's actually super friggin fundamental to so many things.
 
@Ted I already know single-variable calculus
 
it is the underpinning of modern statistical theory
 
@ÉricoMeloSilva it is, but linear algebra is particularly stark insofar as it can show up in high school, lower-division college, upper-division college, graduate school...
 
liking algebraic geometry? Do you know what subjects will be in the set theory and logic stuff? @AlessandroCodenotti
 
7:52 PM
with each of them serving a different role
 
wut high school/grad school is it showing up in
i aint never heard of no us high school offering lin alg
 
high school linear algebra = solving systems of simultaneous equations, with matrices being a convenient way to organize them
not as a full course, no
 
OK, @Spencer1O1. I would still recommend spending a year or two playing with Spivak's Calculus book first. My course is a natural sequel to that.
 
@PaulPlummer Hmm it's not too bad, but I discovered alggeo is not my cup of tea
 
oh ok so like the topic u see in like alg 2 u mean
 
7:53 PM
right
 
@Ted Okay! Thanks for the advice! :)
 
But I hope you'll find my lectures fun, if not interesting :P
 
@Spencer1O1 I'm programming reducible and irreducible polynomials
 
I'll take models of set theory I, which will go up to forcing and type theory, I'm not sure about the syllabus for the latter
 
at the lower-division level it's about matrices/eigenvalues/etc
 
7:54 PM
And I'm doing a grad seminar on large cardinals, my talk will be on Kunen's inconsistency theorem
 
at the higher-division level, vector spaces etc
 
@Ultradark Cool! I am trying to solve the magic square of squares problem
 
Are you going to solve it soon?
 
So depending on context, saying that one is working on a "linear algebra problem" can mean a lot of different things
 
@Ultradark I am using python because I don't want to have to compile it every time I test it like in C or C++
 
7:55 PM
Awesome, it is on my mathematics bucket list to somehow prove something using forcing(in GGT or something like that)
 
@Semiclassical eigenvalues will show up in higher div courses too ofc considering their ubiquity in certain parts of advancedmath
 
Like in rando matrix theory
eigenvalue spacings and distributinos
 
@Ultradark I am maybe 30% of the way done. That is, if it is even possible. If it isn't possible, I will have to prove it.
 
@Spencer1O1 If you're gonna brute force it, you're gonna have a bad time. That problem has been extensively studied. Norvig has ran an exhaustive search for the answer utilizing optimized distributed programs...
 
7:57 PM
@Dair I am not completely brute-forcing it
 
@Spencer1O1 you need to think outside the square
 
@PaulPlummer That'd be cool for sure! There was a famous problem in group theory that turned out to be independent of ZFC but I can't remember its name
 
I know the problem relates to spheres
 
@Ultradark sounds like nerd shit for nerds to me
 
Whiteheads problem I am guessign
 
7:58 PM
@ÉricoMeloSilva I don't know anything about it i just know the words
 
Yes, that one, whether having vanishing first Ext module implies being free
 
i also was not serious
 
@Ultradark I just found out about Project Euler yesterday. It is really cool!
 
Ultradark's and Spencer's profile pics are too similar for me to keep track of which is which.
 
@Dair if you look really closely mine has purple
 
7:59 PM
@Spencer1O1 well, see, that's the problem I don't want to look closely :p
 
02:00 - 20:0020:00 - 23:00

« first day (3141 days earlier)      last day (1877 days later) »