« first day (2569 days earlier)      last day (2748 days later) » 

00:08
I seem to remember it being necessary to represent sets of integers as well.
Holy shit, it's Karl again!
Hello @KarlKronenfeld long time no see.
@JasperLoy Yeah, I thought I would stop by. :)
My intention is to exclude statements which quantify over sets of integers, so maybe "arithmetic statement" isn't the correct term.
00:14
I was trying to ensure that the incompleteness theorem based argument worked for the paradox
Now, there's a particular theory I'm thinking of.
Consider the theory Q, which is made by starting with Peano arithmetic, and then, whenever Q proves a statement S, adding the statement "PA + S is consistent" to Q.
Is Q really different from PA?
Q seems to be arithmetically sound. All of its axioms are true, after all, right?
Yes, Q proves that PA is consistent, but PA does not.
True.
I doubt I can decide whether it is permissible to take the limit like that.
We can define Q0 = PA, then Q1 = Q0 plus "PA is consistent with S" for all statements S proved by Q0, then Q2 = Q1 + "PA is consistent with S" for all statements S proved by Q1, and so on.
Then Qn is defined for all natural numbers n. Q itself is just the union of all of these.
00:23
You unfortunately still do not gain the provability of the statement that Q is consistent.
If Qn is consistent for all n, then Q is consistent by compactness.
Since a proof of a contradiction in Q must also be a proof of a contradiction in some Qn, since a proof can only use finitely many axioms.
Ah, I'm just showing how much I have forgotten in mathematical logic.
Q now sounds good to me, but who am I to say? :)
Oh, but it's not "good" in the original sense, of course.
So Q doesn't prove its own consistency—presumably—but Q does prove the consistency of PA + any finite subset of Q.
Now, I certainly believe that Q is consistent. Is the statement "Q is consistent" an arithmetic statement?
That sounds like Q would have to have its own Godel numbering system.
Let's see. There's a computer program which enumerates all of the statements Q proves. So the consistency of Q is equivalent to the statement that this computer program never outputs "0 = 1".
Right? That makes "Q is consistent" an arithmetic statement.
00:38
Right.
Well, I'm a little tired of thinking about this.
So lemme pivot a bit. Really, there are only two things I don't like about PA. The minor problem is that it doesn't prove Goodstein's theorem, but I don't care that much about Goodstein's theorem.
The major problem is that it doesn't allow you to talk about infinite sets.
I did a Google search to try to find out if there's a set theory which is a conservative extension of PA.
The good news is, apparently there is. "ALPO", defined by H Friedman, 1980.
The bad news is, I haven't yet found a freely accessible description of ALPO.
Morning
lol, some reason I don't have access to the original @TannerSwett
00:56
I found a document that describes ALPO, although not in words I can easily understand!
It's a set of lecture notes by Friedman, titled "Aspects of constructive set theory and beyond".
A listing of axioms (by name, not formula) is found in sec. 7.2 of pdfs.semanticscholar.org/dbb1/…
@Faust7 It's actually morning here, but I guess for most people in this chat, it's night.
I see that the axioms are numbered the same way in that document as in the lecture notes I found.
I see they're found in the lecture notes.
Yeah, I do not know what $\Delta_0$ means.
I am supposed to be writing, so I will get back to that. This all is interesting to me, thank you.
No problem, thanks for your help.
01:03
@JasperLoy you feeling better?
@KarlKronenfeld Looks to me like a $\Delta_0$ formula is one that contains only bounded quantifiers.
 
1 hour later…
02:26
@Faust7 Nope, it has been many years, but I hope it will end soon, thanks. =D
user147690
03:25
@BalarkaSen I love that Ulver album you mentioned. Thanks for that :D.
04:51
@AlexClark Good to hear, I like it a lot too.
05:31
0
Q: Looking for a more efficient way to solve the Straight Line Equation problem.

Abcd If the straight line through the point $P(3,4)$ makes an angle $\dfrac{\pi}{6}$ with the $x$ axis and meets the line $12x +5y + 10=0$ at Q, find the length of PQ. My method: Equation of the given line is; $y- \sqrt3x+3\sqrt3-4=0$ // using Point slope form. Now, solving the simultaneous ...

Hi @LeakyNun, needed an advice from you (if you don't mind...)
use vectors lol
@LeakyNun No.... Not this question
why not?
@LeakyNun Trigonometry was intuitive to me but Coordinate Geometry is not, what should I do? (This is my question to you.) Need your advice...
@LeakyNun I wasn't referring to the question that I posted/.
@Abcd do more questions :P
05:37
@LeakyNun What if I am unable to solve them?
ask us
Ohkay...
06:00
@Secret Let's say I define an order in the infinite subsets of $\Bbb N$ as such: Let i=0. If i is in A but not in B, then A<B. If i is in B but not in A, then B<A. Otherwise, increment i by 1 and repeat.
Formally, $A < B \iff \operatorname{min}((A \setminus B) \cup (B \setminus A)) \in A$
Is this a total order? Is this a well-order?
06:28
If the sum of the distances of a point from 2 perpendicular lines in a plane is 1, then it's locus is a square. How @LeakyNun?
@Abcd try drawing the two lines on an actual paper
@LeakyNun How do I prove it?
@Abcd WLOG let the two lines be the x-axis and the y-axis. The equation of the locus becomes |x| + |y| = 1
@LeakyNun How did you get that equation?
$|x|+|y|=1 $ How did you obtain this @LeakyNun?
@Abcd the distance between (x,y) and the x-axis is |y|, and the y-axis |x|
07:01
Hey @Alessandro and @Tobias!
@Daminark Hi
o..o
How's it going guys?
Working on my grant proposal. It is really hard to figure out how to formulate things nicely
07:23
"Just give me the money, we both know you won't understand my project anyway" :^)
@SteamyRoot Hmm, it does have a certain ring to it.
"Please I have a wife and 17 children to feed"
But there is the issue that one or more of the reviewers might actually be an expert in the subject
Oh sorry I didn't see this earlier, and lolol
@Alessandro's suggestion is bulletproof
They might just give you tenure after that tbh
@TobiasKildetoft "If you do understand it, I'll cite all your papers."
Problem solved
@AlessandroCodenotti Bonus points for a prime number of children
07:25
@SteamyRoot Sounds good. Then it is just a matter of finding out the identity of the reviewer'
07:38
Hi chat!
@LeakyNun for total order, still checking. For well order, guess not as one can pick infinite subsets forming a chain where the next element in the chain has more elements than the previous hence smaller and thus can form an indefinitely decreasing sequence. The same thing can be said in the other direction by building an increasing chain starting from any infinite proper subset that has no finite support
So one can make chains that go infinitely up or down starting at any proper subset with no finite support, hence there cannot be a well order
Concrete examples: Indefinite decreasing chain, start from $2\Bbb{N}$, and then for the next members, continue to union sets of multiples of prime $p\Bbb{N}$
07:56
Hey @Perturbative!
Indefinite increasing chain. Start with $2\Bbb{N} \cup \{1,6,5,8,90,3,4,7,...\}$, and construct the next element by throwing away one element at a time
Heya! @Daminark
How you doing?
Everything's alright, how about you?
Aight over here too
Hi chat
08:03
Yo
@Balarka someone's diffgeo lecture notes for tomorrow:
instant quality hit
"Elegant"
Hey guys. I'm putting together an experiment with two artificial sweeteners (acesulfame potassium and sucralose). Ace-K is supposedly 200 times the sweetness of sugar, sucralose is supposedly 600 times the sweetness of sugar. I'm just about done putting the experiment together on paper, but I suspect I'm going to need a sanity check on the math. Is this a good place to get feedback about such an issue?
@Jolenealaska Sure
Great. I need to call it a night, but I'll come back with what I think should work.
08:14
ina finite group what is the order of the identity?
i always considered it to be 2
but is it 1 somehow or 0?
@Faust7 It is $1$
why
the smallest positive integral power that gives the identity
fail
thx
Quick sanity check, if $X$ and $Y$ are two smooth manifolds, with $\dim(X) = m < \dim(Y) = n$ the inclusion map isn't an immersion right? Because $i : X \to Y$ defined by $i(x) =x$, has derivative at a point $a \in X$ of $di_a(x) = 1$, and hence $T_a(Y)$ is the span of the identity matrix which is just $\mathbb{R}^n$. But because $di_a(x)$ maps all $x \in \mathbb{R}^m$ to the identity in $\mathbb{R}^n$, $i$ is not an immersion, correct?
08:18
Sorry im fresh out of sanity
Get yir pipin hot sanity right here
So unfortunately you're insane
Not actually insane but this isn't right
So $f$ being an immersion isn't saying that the map $x\mapsto df_x$ is injective
Uh, the inclusion map of a submanifold is an immersion.
Any embedding is automatically an immersion.
It's that the maps $df_x$ are injective linear maps
But then even in your case, you need to keep in mind that $df_x$ is a map from $T_x(X)$, which may differ for each case even if though they're isomorphic
I am addicted to that tune.
oHHoHoHoHOhHhHhHHHHSMACK
Honestly I love it
08:27
Okay thanks @Dami and @BalarkaSen!
Glad to be of no help.
@Balarka I guess I never got around to mentioning that the inclusion is an immersion
So you were of some help
If$\lvert\dfrac{z-2}{z-3}\rvert= 2$ and $z=x +iy$, show that $3(x^2+y^2)-20x+32=0$
I have found $x^2+y^2 = 16$. How do I find the value of $x$?
@Daminark Have you seen this?
Very classic.
Yeah
08:30
Anyone?
Have you ever played the Big Smoke stuff? I never did but I watched a friend try to play the train mission
@Abcd okay so
Gimme a sec to chalk it out
@Daminark Yeah
The train mission is super annoying
Im going to take a nap now but it was good to see you @Daminark and @BalarkaSen maybe c u in the next morning
or in a hour if nur still up
Okay so @Abcd what's the proof that $x^2 + y^2 = 16$?
See you @Faust7!
@Daminark Just a minute. Uploading a pic
@Daminark ^ (Tell me if you can't understand my messy handwriting)
08:40
Any chance to render math on mobile?
is it correct @Daminark?
Yeah that's absolutely false
$|z-2| \ne |z| - |2|$
Oh
Sorry :/
@Daminark How do I solve it then?
08:44
What's your question, @Abcd ?
Okay, so in the example I gave above, the immersion $i$ is trivially injective since $di_a$ is the identity matrix $\left(\frac{I_m}{0}\right)$ and maps $T_a(X)$ into $T_a(Y)$
17 mins ago, by Abcd
If$\lvert\dfrac{z-2}{z-3}\rvert= 2$ and $z=x +iy$, show that $3(x^2+y^2)-20x+32=0$
@Kirill ^
Do not know what \dfrac is..
@Kirill ^
Thanks
08:48
There should be automatic rendering of Math Jax! I face the same problem while using mobile!
Yes, I've asked about that, nb answered.
@Kirill that's unfair. Why not post this as a meta suggestion?
That's to epic for me. I'll solve it somehow.
@Kirill What do you mean by "that's too epic for me"?
You want an official post referring that here on the forum? @Abcd
08:57
@Kirill yes
09:53
@abcd $|\dfrac{(x-2)+yi}{(x-3)+yi}| = 2$
@Secret nice
@LeakyNun I'm not 100% sure but iirc it's consistent with $\sf ZF$ that the only well-orderable subsets of $\mathcal P(\Bbb N)$ are countable since it's consistent that $\omega_1$ doesn't inject into $\mathcal P(\omega)$
Hey does anyone here think that the blue colour used to highlight your own messages in this chat is too light?
@AlessandroCodenotti Wai u drop choice?
Like aside from my GCH memeing, it seems like losing choice actually makes set theory really sketchy
0
Q: Blue colour used to highlight your own messages in math chat is too light

Jasper LoyI frequent the SE chat rooms quite a bit and noticed that in room 36, the main room for Math SE, the blue colour used to highlight your own messages is a bit too light, to the point where it is almost invisible, at least for myself. In contrast, the orange used to highlight pings to you is very b...

Hey guys, I just typed a meta post talking about what I just did, please give your feedback there, thanks.
10:10
Sometimes it's interesting to see what happens without, just for the sake of it
Grade: F+
@AlessandroCodenotti I mean I guess but like... I dunno it just seems like so many things which are absolute nonsense become legal when you drop choice
Sure, but it's interesting to see what can be proved in $\sf ZF$ alone
@Jasper I'd say I'm okay with the color as is, and the issue is that if it were made darker, you might have an issue with text contrast
@Daminark Oh no, there are so many kinds of blue! That won't be a problem.
10:19
@Alessandro I guess my point is, why not kill off one of the other axioms instead?
$\sf AC$ is interesting because there are a lot of weird consequences, but I find equally interesting to know that, say, $\sf ZF$-$\sf P$ can't prove that there is an uncountable set
(Where $\sf P$ is the powerset axiom)
P is pairing or power set?
Lol sniped
10:21
But yeah anyway, I dunno, there's a professor here who does proof complexity, and I've been told to take a class by him to try it out
I find reverse mathematics quite interesting
I find reverse engineering quite interesting
Until then I'm just gonna religiously go with AC because a world without it sounds horrible. I'd sooner drop infinite sets, and I refuse to drop infinite sets
(I know nothing about it apart from the fact that they try to determine what's the weakest set of axioms a result can be proved from)
@Daminark AC is Alex Clark, lol.
10:23
He has been officially replaced with the axiom of choice
Hacked, I think
@AlexClark let me know how it feels to have transformed into the axiom of choice
:P
@Daminark I think ZF-I and ZFC-I are the same (I is the axiom of infinity)
user147690
Feels bad man :(.
Yeah I think choice is provable in finite sets
@AlexClark Oh hey, I just sent you an email.
ok, no, that's obviously wrong, there are models of the first which are not models of the second
I think I want ZF-I+not I and likewise for ZFC
10:27
Wait no I think you're right here
In finite sets you can prove choice by induction probably
Oh I mean... okay sure
sure, but say you have a model of $\sf ZFC$, that's also a model of $\sf ZFC$-$\sf I$ despite being full of infinite sets
Lol get sniped m8
fair revenge
I mean I tend to be extremely loose in conversation, so I took ZF-I to mean, we're banning infinite sets
Technically not the same thing but it was implied
yeah, but one needs to be very precise with axioms since there are a lot of subletlies everywhere
10:31
We're not really doing any formal stuff though, so I think it's fair that certain things go without necessarily being said explicitly
fair enough
anyway it's lunchtime, I'll be back later! Bye
Aight, see you!
This is basically just a test.
user147690
@quid You mean life?
user147690
Yeah...
10:35
@Alex well, originally I meant me posting this particular comment. But I guess this is a trivial corollary of your theorem. :-)
user147690
@quid ;D
Now @quid can see the colours I talked about in my meta post. =D
Right, that was the point. It appears the math theme is the issue. My take would be that the gray of the other messages should be more white-ish as it's on various other sites, but that's a detail.
I think Christian Blatter is a first rate mathematician. I have seen his posts and he has a brilliant mind.
Yes. He wrote well known books too.
10:38
Hi
Bye :-()
Oh I didn't know you are a moderator on Math Ed.
Yeah, maybe they should change the whole colour theme in the room.
I need to learn chemistry.
Darnit
Chemistry is the science that ties all sciences together, I read.
But I don't like it either.
@BalarkaSen don't drink anything in the lab and keep hydrogen away from fire and you should be fine
I mean you'll have to learn the subject of chemistry as wel though
10:44
@AlessandroCodenotti Also, keep yourself away from fire.
@Alessandro Put hydrogen in the fire and drink everything in the lab, gottem.
@Balarka become the hydrogen
BALEETED
That was an immature meme, pls delete that
10:59
[DATA SPONGE]
so i can still get back data by squeezing the sponge?
doesn't sound very efficient
shrug
11:35
@Abcd then just do it. I am not a big fan of this.
@AlessandroCodenotti Store the water in a container made from Alkali metals :^)
@SteamyRoot
if you have a characteristic polynomail $(x-4)^4$ of a $4 \times 4$ matrix, and your Jordan blocks of a diagonalised form are of the length 1 and 3, does it true, that your minimal polynomial is $(x-3)^3$?
Okay I don't know anything about Jordan stuff
@Kirill Of course not
Michael Jordan is a basketball player.
11:41
But the set of roots of the characteristic polynomial and minimal polynomials should be the same
If the minimal polynomial has a factor $(x-3)$, then the matrix has eigenvalue $3$
@JasperLoy ... and he has a good form
The minimal polynomial has the same factors as the characteristic polynomial, just of lower degree.
@Kirill LOL, you are becoming as good as Balarka.
sorry, it was nonsense, @SteamyRoot. It was meant $(x-4)^3$ for a polynomial.
11:44
I don't think I am particularly good at pun
3
I am good at trash meme jokes
Hi @MatsGranvik I missed your old picture.
@JasperLoy what do you mean?
@Kirill Balarka makes good jokes.
@JasperLoy oh, that's good!
@Kirill In that case, yes. The degree of a factor $(x-\lambda)$ is the size of the largest Jordan block with eigenvalue $\lambda$
11:47
@SteamyRoot glad to hear that, thanks. It's all about the exam I had.
@Kirill oh the exam already happened? How'd it go?
@Daminark I think it was great, but I am aware of too positive feedback.
@Daminark I've still mulled the transformation matrix in the Jordan basis, but ok
the only thing I am really interested in: "is that true, that for $A,B \in \mathbb{C}^{n \times n}: (A-\lambda I_n)^n=0 \Rightarrow \lambda=1$ is the only existing eigenvalue"?
1
Q: Suppose $X$ and $Y$ are two smooth manifolds, with $\dim(X) = m < \dim(Y) = n$ is the inclusion map an immersion?

PerturbativeSuppose $X \subseteq \mathbb{R}^k$ and $Y \subseteq \mathbb{R}^l$ are two smooth manifolds, with $\dim(X) = m < \dim(Y) = n$ is the inclusion map an immersion (where $X$ is a submanifold of $Y$)? My Attempted Proof: The inclusion map $i : X \to Y$ defined by $i(x) = x$, has derivative at a poin...

The only problem I have with my proof above is the comment I made here in the first answer
@Kirill No, of course that does not imply that $\lambda = 1$ is the only eigenvalue. What if the matrix is diagonal?
Also, what does $B$ have to do there?
How can I show the derivative has the form I claimed rigorously? The answer hinted at codeminsion, but couldn't it be done in a much simpler way?
Also I don't want to use the theorem that every embedding is an immersion as Balarka mentioned earlier, because I sort of wanted to prove this 'by hand' (if that makes sense)
11:59
@TobiasKildetoft I couldn't find any counter-example...
@Kirill Take a scalar matrix with $2$'s on the diagonal
(and $\lambda = 2$)

« first day (2569 days earlier)      last day (2748 days later) »