« first day (1689 days earlier)      last day (3628 days later) » 

00:04
Hi guys
00:14
Hi @KarimMansour
I am taking general topology next year I want to ace it :D I will read munkrees during the summer
00:35
@KarimMansour Me too, we can read together
cool we can discuss some stuff during that time
I will usually be here in chat so we can discuss
@KarimMansour I'm kind of slow, though
its np it is good to discuss ideas with people
00:58
Anyone else noticed in the profile that where it once(up until two days ago I believe) said activities, it now says 'all actions'
01:08
brb I will go take a nap
01:27
Hi @Committingtoachallenge
Hi @ᴇʏᴇs @
(Does that ping you btw?)
@Committingtoachallenge No
@Committingtoachallenge Yes
Oh, you are the only one who appears when I type just the @
So to ping you I just type @ and click you
@Committingtoachallenge That's just because I'm reading the chat most of the day lol
Hey guys. I just learned about rings in Abstract Algebra II this morning and am working on a homework problem. My goal is to find a subring $S$ of $\mathbb{C}$ that meets a specific criteria. Now, the question: I know $S$ has to be closed under addition, but does it have to be closed under multiplication?
For example, would $\left( \mathbb{Z}+\frac{1}{2}, +, \cdot \right)$ be a ring?
01:32
if it's not closed, it's not a ring, and a subring has to be able to stand on its own as a ring
What do you mean by $\Bbb Z + \frac12$?
The integers plus 0.5. Actually, that wouldn't be a group under addition.
The integers plus 0.5 and zero?
Wait, there's a better one.
that would generate a group under addition, but it isn't one with just those elements
$\frac{1}{2}\mathbb{Z}$
@Semiclassical A group under addition with $((\Bbb Z + \frac12)\cup\Bbb Z)$
01:35
right. @Committingtoachallenge
@Committingtoachallenge I think that's the same as $\frac{1}{2}\mathbb{Z}$?
Yep I just typed it differently
that'll work for the addition operation, but not for multiplication
Multiplication just needs to be a monoid
So associative
But yes, closure breaks down
01:38
Yeah, the definition of a ring my professor gave didn't require that the set/group be closed under the second operation, multiplication in this case.
So would $\left( \frac{1}{2}\mathbb{Z}, +, \cdot \right)$ be a valid ring?
Well a monoid maps $S\times S \to S$ so it is closed by definition
What's a monoid
A monoid is an associative binary operation with identity
No inverse?
01:44
if everything had an inverse, it'd be a group
Inverse makes it a group
Binary operation + Associativity + Identity -> Monoid and Monoid + inverse -> Group and Group + commutativity -> Abelian group
@Committingtoachallenge So, because I can do $\frac{1}{2} \cdot \frac{1}{2} = \frac{1}{4} \not\in \frac{1}{2}\mathbb{Z}$, my example above would not be a ring. Correct?
@SemiC Can you confirm my answer to the above question being that yes, above isn't a ring
Hi @JasperLoy
right. $\frac12\mathbb{Z}\times \frac12\mathbb{Z}\to \frac14\mathbb{Z}$
01:46
@ᴇʏᴇs Hi, I feel much less anxious after taking the meds for two days.
so yeah, it's not a monoid since it's not a mapping from $S\times S$ to $S$
Good @JasperLoy
@JasperLoy That's great to hear. Sounds like things are looking good
@JasperLoy I reached 100 helpful flags today and 1000 profile views :) and 1100 rep
Helpful flags + profile views = rep :)
@Semiclassical Okay, thanks. That's all I needed to know. :)
glad to help
01:50
@Committingtoachallenge Now you are becoming nuts.
@JasperLoy ::::::::)
I must go now to do more work, bye!
@ᴇʏᴇs Did I tell you, that day when I sent out the email about my new email I sent it to the hospital as well by mistake. Luckily I did not say anything sensitive, lol. I was shocked when the hospital replied, and I told them it was a mistake, lol.
@JasperLoy What did they say
@ᴇʏᴇs They wanted to update my email anyway, lol. I told them it was a mistake but had them update my email anyway, lol.
@ᴇʏᴇs I have now removed the hospital from my contact list to avoid this in future.
02:17
Hello Math SErs
@Clarinetist So did you get the new job?
Not yet. Waiting on an interview. :)
Next Wednesday
02:38
Hi @robjohn I feel better after taking the meds.
02:56
@ᴇʏᴇs Have you decided what courses to take?
03:10
Wow, this chat is so quiet.
04:01
Hello @KajHansen how is progress with the gym girl?
Hello @DavidWheeler!! Are you familiar with arc length??
Haven't seen her in a while @JasperLoy, but that's alright
@KajHansen OK, there are many trees in the forest, lol.
I'm feeling better recently due to a good topology test score, spring break, and getting accepted to an REU.
Good for you.
04:06
@Committingtoachallenge, @Chris'ssis, I agree with you two. I know tons of people who take that shit, and I consider it cheating. I don't understand why people find it so difficult to sit down for 4 hours at a time or however long it takes to get their work done. Really makes me angry because, short term, I suffer for doing things the right way.
04:32
@Kaj I guess you think Erdos is a cheater and his existence makes you angry... I think that attitude towards drugs is strange, math isn't a sport or competition. Plus you imply that you have no difficulty sitting down and focusing for hours to get work done (not everyone has that ability even if that is what they want to do), so maybe you don't even have a "need" for such drugs (or your body produces such drugs at a higher rate or quantity than other people).
05:01
Erdos, drugs, huh?
I think I can solve all my mental problems. I am 99 per cent confident now.
@PaulPlummer, I actually do not think Erdos is a cheater. I agree with you that math is not a competition -- the opposite, really. There is competition, however, amongst high schoolers and undergraduates. Take the latter for example. I depend on funding to attend UGA. The availability of funding is determined by my GPA. The GPA cutoff is determined by average and median GPAs of people attending colleges and universities around Georgia over, say, the past decade.
@DavidWheeler here
I sincerely believe that drug use is so rampant on campus that it makes a significant difference -- perhaps up to 0.5 GPA points -- in these statistics. So people who don't want to poison themselves with amphetamines are put at an unfair disadvantage.
Furthermore, possession of amphetamines is illegal. If you are, e.g., a member of a fraternity or sorority, where people have a ridiculous degree of immunity when it comes to being punished for breaking the law, then you are obviously at an advantage if you choose to take amphetamines (among the purposes these organizations serve, IMO, is as a front for distributing drugs to their members, distributing tests to their members before they take them, and so forth).

On the other hand, Erdos was neither an undergraduate when he was taking amphetamines, nor were amphetamines illegal for much of
Is this an amphetamine discussion?
@kaj Are you for and against them?
05:07
Against, obviously. But only insofar as people making their way through undergrad. @JasperLoy
OK. I don't know anything about them. I am not sure whether they are legal in my country, but I think not.
As far as what people do in their own time with their own money, I don't care. People should be free to act as they wish so long as they aren't hurting anyone.
amphetamines always made me think in circles
not very effective for math n stuff-wound up solving the same problem repeatedly
@JasperLoy I'm glad you're seeing a doctor and getting meds. I hope you feel much better.
I just answered a low hanging fruit, please upvote.
05:35
@robjohn I will keep my current SE account for life, I promise.
@Jasper How did you let your other account die, forget to feed it?
@DanielFischer Thanks, I'll take a look
@PaulPlummer I just choose to delete accounts now and then. I think I have deleted about 30k of rep by now.
@Jasper Why?
@PaulPlummer I am weird.
05:43
@JasperLoy That will be nice :-)
@Jasper Do you like to make furniture/attire out of you previous account?
@PaulPlummer What does furniture mean?
Like chairs, couches, tables, etc
Haha, I don't get your joke.
@Jasper Are you like a serial killer that likes to wear your accounts you have killed skin, and sit on them when bending the bodies into chairs?
05:49
@PaulPlummer No. Your joke is too sophisticated for a banana like me.
@Jasper I am not sure if I would go so far as sophisticated, its probably closer to to not funny
@PaulPlummer OK, I like stupid jokes, like saying that I am a banana.
@Jasper I is just you mentioned you didn't keep your account alive, personifying your account, and I am vaguley referencing movies like Silence of the Lambs and Texas Chainsaw Massacre where they killed people for the reason, in part, to do things like wear their victims skin. Just seeing if you have a similar reason for letting your accounts die.It
@PaulPlummer Ah, I think I watched those movies.
 
1 hour later…
06:54
hi guys back and running
user61230
07:05
Anyone have a moment for a Fourier transform problem? My math prof, Wolfram, and by-hand calculation are giving me three different answers.
user61230
It's the FS of $\delta(t+7)$.
Fourier transform has different definitions, lol.
hi @JasperLoy
@SayanChattopadhyay Hi.
user61230
My teacher's notes say it's $e^{7iw}$, Wolfram says $\frac{e^{-7iw}}{\sqrt{2\pi}}$, and $\frac{1}{2\pi}\int_{-\infty}^{\infty}\delta(t+7)e^{-iwt}dt$ spits out $\frac{1}{2\pi}e^{-7iw}$.
07:08
how are you hows your health
@Emrakul Like I said, Fourier transform has different definitions. Look up Wiki first.
@SayanChattopadhyay Just started taking meds again. I hope I can sort out my thoughts soon.
@JasperLoy what happened to a beautiful mind
@SayanChattopadhyay Nothing.
and jasper the question which balarka gave me i got the answer for that@JasperLoy
@SayanChattopadhyay OK, you check with him then.
user61230
07:14
I... am confused. I'm not entirely sure where I'm going with this, but the prof. has written to use the table of transform properties, but the table disagrees with their result.
user61230
I'm honestly just not sure how to make sense of it.
user61230
...oh wait, I'm an idiot
07:48
@Emrakul No, you're not an idiot. Everyone errs but the only thing that matters is learning from it :D Keep on learning. Have a great life!
user61230
@Nick ...thanks! I actually needed that. :]
@Emrakul :D Everyone needs someone to say eveythings okay, buddy. Just pass on the kindness over to those who need it.
user61230
I'll, yeah. I'll remember it.
08:04
hi @robjohn
08:16
@robjohn By the way, which of my messages were flagged recently? I would like to know if possible.
@JasperLoy What do you recommend as a supplement for Rudin's Real and Complex Analysis?
@Fermésomme Why do you ask me?
@JasperLoy You know a lot about books, right?
@Fermésomme What topic do you want to learn?
@JasperLoy I was planning to learn Adult Rudin.
I wish I could find a book with more exercises.
08:26
@Fermésomme I mean what topic you want to learn so that I can recommend you alternatives, since Rudin deals with many topics.
@JasperLoy I'm starting with abstract measure theory (first few chapters of rudin).
@Fermésomme I recommend Folland's Real Analysis.
Does it contain a good number of exercises?
I think it does, but it has many typos.
@JasperLoy Okay, I will take a look at it. Thanks!
08:29
@Fermésomme Did you have another username?
@JasperLoy. Yes, many usernames.
@Fermésomme Can you tell me?
Last one was Oracle.
Oh I see.
@JasperLoy Are you feeling better?
08:32
@Fermésomme Only time will tell.
08:46
What's a (simple) statement in the language of Peano arithmetic, which can only be proven once we add the schema of induction?
09:06
@SayanChattopadhyay So, what's the answer?
$$(n-1)n$$ i think so
no
that's wrong.
well, tell me how you arrived at that result, i can point you out the flaw. it's definitely wrong though - the answer is a wee bit more complicated.
see if there are n letters that there always will be one way we can not put it into the envelope that is the ith envelope. now this will be the case for all n envelopes
09:10
Hi @Chris'ssis.
Greetings
@JasperLoy Hi
$$(n-1).........(n-1)$$ n times @BalarkaSen
@Chris'ssis I feel much better after taking the meds, at least for now.
@JasperLoy Great. :-)
@SayanChattopadhyay i don't understand your logic. you have to put n letters into n envelopes such that no i-th letter goes into the i-the envelope. how're you planning to do it?
and how do you even get (n-1)?
[i think you are on the right track, but i am not getting what you are trying to do. it'd be nice if you can explain your ideas more clearly :)]
09:13
see lets take there there is no idea of ith letter going into the ith envelope then there are n ways of putting it into envelopes.
@JasperLoy this one. It was because they assumed you were talking about the fake user's comment
now since we have the idea of the ith letter not going into the ith envelope there will one way in which we cannot put the letter into the envelope that is the ith letter not going into the ith envelope. this will similarly go for all n envelopes
ADG
ADG
hello
@SayanChattopadhyay not true. if there is no conditions imposed, then there are $n!$ ways to do it.
ADG
ADG
hello
09:16
@robjohn LOL
@robjohn My toes are laughing now.
ADG
ADG
anyone watching AUS vs PAK?
you see the flaw in your logic, then, @Sayan?
ADG
ADG
PAK may win
and then MAUKA MAUKA !! :D
therefore then there will be $$(n-1)!n!$$
09:17
not true either
@robjohn This is really too funny for me to even laugh.
ADG
ADG
let experts solve your problem @SayanChattopadhyay
(^_^)
You should read up chapter 3 of part I in Hammack carefully, then, @Sayan. You haven't done so, apparently.
Skimming through everything is very easy. Grasping the concepts is hard. That's why I said learning set theory may take a few years.
[Hint : To solve this problem, you need to apply inclusion-exclusion principle]
wait a second then.... $$n(n-1)(n-2)...............3*2$$ for the first envelope@BalarkaSen
what d'you mean "for the first envelope"?
09:27
the letter number 1 for the envelope number 1@BalarkaSen
and what are you doing with the letter number 1? you are counting the number of ways you can put letter #1 into an envelope, is that what you're doing?
then false. it's $n$.
with not counting the 1st envelope for letter 1
then it's $n-1$.
09:30
then isnt what i said right $$(n-1)n$$
no
figure out why ;)
hey what is the meaning of $\subset_{+}$ symbol?
there are $$(n-1)$$ ways for a letter to be put into envelope
@zed111 Context.
09:32
there are total n letters and n envelopes
A $\subset_{+}$ B where A and B are sets
correct
@JasperLoy $\subset_{+}$ B where A and B are sets
@JasperLoy: A $\subset_{+}$ B where A and B are sets
so if $$n-1$$ for one letter it will be for all the letters
gtg cming back in a minute
no : this is because $|A \cup B| \neq |A| + |B|$ for arbitrary sets $A, B$. ;)
and the corrected formula is precisely what we know to be the inclusion-exclusion principle.
@Sayan Here's a hint : why don't you start with counting the number of ways to put n letter into n envelopes such that the i-the letter does go inside the i-th envelope for at least one i?
then you can subtract this from n! to get the desired result (complementary sets). You can steadily use inclusion-exclusion if you do this.
10:05
@JasperLoy what? that people are confusing new and old?
@robjohn If they want to flag they can flag what ABM said. Why flag that line they flagged? LOL
Jasper you are too obsessed with flags.
I wonder who the flaggers are. Can you confess?
@JasperLoy why should they?
I don't flag, unless someone really gets offensive. And it's hard to offend me, since IDGAF.
10:12
@DavidWheeler Flagged for saying F.
Whatever.
@JasperLoy You can't say "Flagged" without saying 'F', so ...
I'm not sure where this is going....should I call roto-rooter?
I pledge my allegiance to the flag. (I'm not the flagger though)
I got 2 downvotes for a correct answer.
10:18
Ugh, I say the darnest things
@JasperLoy Sometimes they can't handle the truth.
-2
A: explain |a+b|≤|a|+|b| in simple terms please

Jasper Loy$a\le b$ means $a$ is less than or equal to $b$, so we have $3\le 3$ and $3\le 4$ for example, since $3$ is equal to $3$ and $3$ is less than $4$.

so @BalarkaSen think of something like this:
I think the downvoters think they are very smart when I actually have interpreted his question correctly. He doesn't understand the meaning of the symbol.
I think there are people who downvote the answers without reading the question carefully, lol.
if there are 3 letters and 3 envelopes then the total number of ways of putting the letters into the envelope such that the ith letter does not go into the ith envelope. therefore the total number of ways will be 6 ways acoording to the question. this does go with what i found that is $$(n-1)n$$ ways@BalarkaSen
If i am wrong can tell me where i am wrong
You miscounted. It's not 6. It's 2.
{1, 2, 3} --> {2, 3, 1} and {1, 2, 3} --> {3, 1, 2}.
These are the only ways to put 3 letters into 3 envelopes without letting any of the i-th letter to be inside the i-th envelope. If you disagree, show me another one.
10:28
why first letter can go to (3,2) envelope second letter to (1,3) envelope and third can go to (1,2)
what?
what do you mean by "(3, 2) envelope"? that doesn't make any sense.
@Nick Will you upvote my answer?
yes letter 1 can go to 3 envelope or 2 envelope
In fact, it is the only answer that answers the question, lol.
you just show me another way to do this other than the two ways i mentioned above without speaking gibberish :P
10:31
I think these days people answer just reading the title without reading the body, which is what I do to understand the real problem.
listen to me letter 1 can go to envelope 2 and 3 right @BalarkaSen
sure.
4 mins ago, by Balarka Sen
{1, 2, 3} --> {2, 3, 1} and {1, 2, 3} --> {3, 1, 2}.
i have already enlisted the two cases.
similarly letter 2 will go to envelope 1 and 3 ,letter 3 wil go to envelope 1 and 2 therefore the total way will be six
recommend you stop this stupid argument and show me the 6 cases.
(1,3) (2,3) (1,2)
thats the six cases
10:34
@JasperLoy Ok, I upvoted it, but the thing is your answer only offers an explanation to how it is true. It is good intuition which is as you say, correct. But if I were the OP, I'd be after the motivation and would be truly satisfied upon a decent proof common to textbooks.
@SayanChattopadhyay letter 1 can't go to two envelopes at once.
it'll go to either the 2nd envelope or to the 3rd envelope.
@Nick His confusion is about the symbol, not the proof.
you show me your six cases using my {...} --> {...} notation.
maybe i am just not getting your notation.
fine now i get the loophole in my proof
yes :P
10:37
@Nick The downvoters clearly think they know the proof and I don't.
@JasperLoy exactly but seeing how both the initial answers were downvoted at the same time, it is likely that the OP himself was a downvoter.
then if i take n envelopes
@SayanChattopadhyay now use the hint i gave above and try to work out this problem. it needs some set theory.
there are n ways of putting one with the ith letter going in the ith envelope
Hi, off topic. If $X$ is a set, is the Borel sigma algebra generated by the singletons in $X$ simply $\lbrace \emptyset, X\rbrace$?
10:40
no, there's just 1 way to put the i-th letter going in the i-th envelope.
@Nick Anyway I am not too concerned about rep, lol.
i mean for all the letters and the envelopews
@JasperLoy Anyhow, yeah you're right. What you said is no different than what @crash who has 2 upvotes said. So, the moral of this story is that presentation is often crucial in communicating to the layman.
@Nick The moral of the story is that voters cannot think, lol.
@SayanChattopadhyay still not correct. to put every i-th letter to the i-th envelope, there is only one such way. {1, 2, ..., n} --> {1, 2, ..., n}.
10:42
@JasperLoy Such is democracy and why I prefer to enter politics only as a dictator.
@Nick It's good not to think too much, or one will go mad.
then it will be $$n!-1$$
@JasperLoy A certain ten starred message convinces me that people don't think as much as they ought to.
is this right @BalarkaSen
10:44
@Nick I wonder who ABM is.
@SayanChattopadhyay would you like to try it, or should i reveal it for you?
no keep the anxiety
maybe you should revise a bit of inclusion-exclusion first if you're planning on doing it.
@BalarkaSen Actually giving him this exercise now is a bad idea, since this is more for a combinatorics course. Basic set theory will do, and this is not exactly that.
@JasperLoy I don't wonder. Seriously, a truly beautiful mind is the hero of its user.
10:46
@JasperLoy Hammack introduces basic combinatorics.
@BalarkaSen In fact I think he might be better off starting with Apostol, lol.
And I personally think this exercise is gives a solid understanding of inclusion-exclusion.
If he can't do this, he didn't really understand it.
@JasperLoy Apostol has a set theory book?
@BalarkaSen No, but one can start learning about proofs from a calculus book can't they?
@TheSubstitute no that set isnt even a sigma algebra
You guys always talk about good books but I have to ask you this,how do you manage to get through em?
10:48
(unless $X=\mathbb{R}$)
@JasperLoy i'd think better learn counting first before doing something as abstract as calculus.
anyway, he claims to know calculus.
the complement on the empty set isnt in there
@BalarkaSen Well counting can be very hard.
yes i know calculus
yes, but this is kind of basic.
10:49
@Nick The two people who downvoted me probably think that I am an idiot, lol.
not so hard, i.e. needs some thinking though.
anyway, you can give up if you want @Sayan.
i showed you the proof for the calculus question you asked
Never give up. Never give in.
@JasperLoy DGAF bout em. They're big nobodies who could't even think to read even for a split second.
@iwriteonbananas how isn't that a sigma algebra? It contains the empty set, it's closed under complements and arbitrary unions.
@TheSubstitute i was confsued because you wrote BOREL sigma algebra generated by...
it has nothing to do with the borel sigma algebra
but it is indeed a sigma algebra in $X$
10:53
@iwriteonbananas is it the sigma algebra generated by the collection of singletons in $X?
@TheSubstitute Let $\Bbb C$ be the set of all singleton subsets of $\Bbb R$. Then σ($\Bbb C$) is the set of all countable sets of real numbers and their complements. Any uncountable set with uncountable complement, for example $(0,1)$, will not be in σ($\Bbb C$), even though it is generated by union of elements of $\Bbb C$, because the union is uncountable.
no it is not in general
@TheSubstitute If the set can only be generated by uncountable operations, then it does have to be explicitly included, since the axioms of a σ-algebra won't get you to uncountable unions.
if $X=\{ x_0 \}$, then $\sigma( \{ X \} ) = \{ \emptyset, \{x_0\}, \{x_0\}^c, X\}$
@Nick ah that makes sense.
@iwriteonbananas I agree but that is the sigma algebra generated by a single element.
10:56
@Nick Never gonna give you up, never gonna let you down...
Going to take a nap.
I hope my miracle comes soon.
@TheSubstitute yeah, $X$ could have only one singleton
@JasperLoy Night ol sport :)
@Sayan note that you need just to compute the number of ways to put the letter in the envelopes such that at least one $i$-th letter goes inside the $i$-th envelope, not for all $i$.
@JasperLoy Want a miracle? BE THE MIRACLE
10:57
or do we know anything else about $X$? what is it?
@BalarkaSen is it $$n!-n$$
Never gonna run around and desert you...
Never gonna make you cry
nope :)
@Nick your piece on $\sqrt{3}$ is quite nice.
@SayanChattopadhyay Warmer. Permutations are involved.

« first day (1689 days earlier)      last day (3628 days later) »