« first day (1722 days earlier)      last day (3302 days later) » 

12:15 AM
@Disc So the commutator subgroup is the group of elements $ABA^{-1}B^{-1}$ where both $A$ and $B$ are in the group?
Or where $A$ and $B$ are in the commutator subgroup? Or where one is in the commutator subgroup and the other is in the group?
 
@Algebra No, it is the group generated by those though.
@Algebra $ABA^{-1}B^{-1}CDC^{-1}D^{-1}$ doesn't have to be a commutator, so you consider the group generated by all commutators
 
I don't get it sorry
$ABA^{-1}B^{-1}$ is generated into the commutator subgroup
But where do $A$ and $B$ live?
(Iteratively speaking^)
$A$ and $B$ live in $G$ it seems
and we take every possible $ABA^{-1}B^{-1}$ and put all of these into the commutator subgroup
 
You have a group $G$ and a set $C=\{aba^{-1} b^{-1} \mid a,b \in G \}$, then the commutator subgroup is the group generated by the commutator elements, so it is equal to $\langle C \rangle $ and $a,b$ just live in $G$, they do not have to be in the commuator subgroup
@Algebra Did you get the 3UTC thing to work? (I am sure it does, just curious)
 
Yep, I have tested it twice with success
 
Did what I write clear things up?
 
12:32 AM
Yep, thank you!
 
12:43 AM
Now I am trying to show that for elementary matrices that:

$E_{i,j}^{ab} = [E_{i,k}^a , E_{k,j}^b]$
Where these are the elementary matrices, e.g. the identity matrix with ( for $E_{i,j}^a$) the entry $a$ at $i,j$
Where $i\ne j$
 
@DiscipleofBarney I also know that serial voting is reversed at 3 UTC.
 
Hey JL
 
12:58 AM
@Algebra Have we talked before?
 
@WillHunting I am AC - CTAC (on an alternative account because I am at uni
 
@Algebra Oh AC.
@Algebra Haha, I only use one account at one time, you are so secretive.
 
Hi @WillHunting
 
@ᴇʏᴇs Hi BP.
 
What is AC
 
1:00 AM
His initials.
@Algebra Have you finished your exams and assignments?
I think he is still working on his final assignment...
We will talk later!
 
1:15 AM
@ᴇʏᴇs Aneurisma cerebral.
 
lol
 
1:38 AM
@WillHunting Final assignment due in a few hours
 
1:57 AM
hey guys
@Algebra mine too I have assignment due on thursday and a project
then I am done for this semester
 
How do you find the integral of x/2 ?
 
@Rememberme sorry I wasn't here
what was your question again ?
@Algebra we'll survive !!!!
 
2:29 AM
$\DeclareMathOperator{\im}{im}$
I am pretty sure this works. Let $f:F_g \to F_h$ and $a_g,a_h$ are the abelinization homomorphisms, and $f^{ab}: F^{ab}_g \to F^{ab}_h$ is the obvious homomorphism, and we will assume it is injective. So $a_hf = f^{ab}a_g$, and note that if we restrict the codomain of $f$ to the image of $f$ we get the same commutative diagram and $a_h|\im f$. Note that$$\ker a_h |\im f=\ker a_g = \ker f^{ab}a_g$$ they all have isomorphic images, but that means that $\im [a_h |\im f] \cong F_g^{ab}$, since $\im f$ is free that means that $\im f \cong F_g$. Note that (f.g.) fr
@MikeMiller You might be able to use the same idea for surface groups, (I don't know much about surface groups) but surface groups are also Hopfian (they are residually finite) so that might be able to be exploited.
( f.g. residually finite implies hopfian)
 
2:52 AM
Actually, without thinking about it too much, pretty sure essentially the same proof goes through without any changes for surface groups since they are Hopfian, I might give it some more thought later...
 
3:28 AM
@DiscipleofBarney: I haven't looked at this yet, but it looks exciting. Thanks for sending this to me.
 
Best image
 
@ᴇʏᴇs Just testing to see iff pdfs could be uploaded
 
Can a trefoil knot be untied in dimensions higher than 3?
Is it chiral in dimensions higher than 3?
 
3:46 AM
What is the simplest non-trivial knot in four dimensions?
 
@user1667423 There are none (there might be a higher dimentional "knot theory", but I am not discussing that)
 
@user1667423 Every smooth embedding $S^n \hookrightarrow S^m$ is isotopic to the standard embedding if $n<m-2$; e.g., $S^1 \hookrightarrow S^4$. Indeed, we also have that every smooth embedding $S^{n-1} \hookrightarrow S^n$ is isotopic to the standard one. The only interesting knot theory in higher dimensions is codimension 2: $S^{n-2} \hookrightarrow S^n$.
If you want to find a nontrivial such knot, pick a knotted arc in the half-space $H^3$ whose endpoints lie on the boundary, and spin this around in a circle to get a knotted sphere $S^2$ in $\Bbb R^4$. This is known as Artin spinning. You can show that the complement of this sphere has a different fundamental group than the complement of the standard emedding.
An identical idea lets you construct knotted emeddings $S^{n-2} \hookrightarrow S^n$ for all $n \geq 3$.
 
4:07 AM
@DiscipleofBarney: It was essential in a few places that the groups be free, because otherwise we wouldn't be able to show that the image of $f$ was free and there's no way to show that the image of $f$ is isomorphic to $\pi_1(\Sigma_g)$ or anything. But for free groups your argument works great. I can modify your thing a bit to get it to do what I want for surfaces. Thanks so much.
 
@MikeMiller Subgroups of free groups are free, so the image of $f$ will be free regardless. There are probably some problem with looking at $\pi_1( \sigma_g)$, I will look at it in a bit
($\Sigma_g$)
 
Capital sigma
Right, I was saying that the codomain being free was essential. Actually, I can get that to work anyway - we know the image has to be $F_{2g}$; quotient out by the evident relation to get a map to itself
 
So if it is true then the only surface groups that have this property are free
 
which there are none of
 
Ah, okay
Glad to help @MikeMiller
 
4:18 AM
Hello, Sorry for interrupting, I recently posted a question:
2
Q: Are there general guidelines to make "assumptions" when proving limits?

Jane SmithI am studying the definition of the limit using Paul's Online Notes When proving the following limit (Example 3) $\lim\limits_{x \to 2} x^2+x-11 = 9$ At one point he assumes: $|x+5| < K$ He also asumes: $|x-4| < 1$ Because one is a nice number to work with. I have read multiple explanatio...

And I cant still understand why I have to replace |x+5| by some constant K Can I get some help here?
 
@JaneSmith The short answer is that in these sort of arguments you only care about local things, so you can assume you are in any small neighbourhood around a point (it doesn't matter how small). The long answer is that you more carefully go through the existing answer. (JMorivitz basically said the same thing I did, with more examples and discussion of the details.)
 
Yes I know, and completely understand the answer
But I still dont get why
|x+5| needs to be replaced with K. Why not |x-4|?
I currently have a formulaic view of the issue.
 
Did you read the comments?
 
4:35 AM
yes and multiple times, not only that I have been studying that issue for three days in a row so far. I'm just stuck, its frustating
 
Oh dear...
 
Im thinking in just skipping this whole delta epsilon madness and jump directly into derivatives, Im wasting to much time
 
That might be a good idea for the time being...
@JaneSmith In short, you are not replacing |x+5| by K, but rather restricting the size of |x+5| to some degree.
 
@WillHunting Is |x+5| also an interval?
 
@JaneSmith |x+5| is not an interval. It is a number.
@JaneSmith By saying that |x+5|<K, of course, you are restricting x to lie in some interval.
 
4:46 AM
@WillHunting So I'm guessing the number right?
 
@JaneSmith In the notes, he just wants to show that |x+5|<K holds for some K. Then the proof works.
 
This is what I understand so far:
|x-4| works because is in the range of delta
 
It then turns out that K=10 does work.
I think that Paul's notes are very detailed.
 
So thats way I have to replace |x+5| with a number in order to continue with the proof
@WillHunting and very easy
 
You want to make |x+5||x-4| small, so you try to make each one small.
That's the idea.
@JaneSmith Your effort is commendable. It is not your fault.
 
4:54 AM
Paul also uses the min function to decide between the assumptions. Why?
 
When a number is smaller than the min of two, it is smaller than each of them. That's why.
You want to make the number small enough for things to work. That's what limits are all about.
In showing limits, you want to make something small enough so that something else is small enough.
And you try different ways to do that, there is no single method to do all questions.
Maybe put it aside first and come back to it later. This is hard for a beginner.
 
so because he restricted |x+5| you also need to restrict delta, to avoid epsiolon from taking values outside the range
@WillHunting Im trying to seld study all this by myself
 
@JaneSmith Delta is what you need to find, given epsilon.
And to find delta, he tries to restrict |x+5|.
@JaneSmith To take AP test?
 
no epsilon then, you avoid delta from taking values outside the range
@WillHunting to learn Partial Differential Equations :)
crazy isnt?
 
@JaneSmith Have you already taken a calculus course in college?
 
5:02 AM
nope
 
@JaneSmith Then why are you trying to learn PDE?
@JaneSmith Yes, crazy, like me.
 
because I like them, I would like to implement the wave equation in 2D some day
 
@DiscipleofBarney You seem very knowledgeable in knot theory. =)
@JaneSmith I see. If you like PDE, you should study analysis properly first and understand epsilons and deltas.
 
that's why I don't want to skip it, they look "important"
again: no epsilon then, you avoid delta from taking values outside the range
 
@JaneSmith What do you mean by implement some day?
@JaneSmith The idea is that you fix a positive epsilon from the start and you try to find a positive delta corresponding to this epsilon.
 
5:06 AM
10
Q: How to Self-Study Mathematical Methods?

Jane SmithEdit: Ok, user Chinny84 made comment that truly helps narrow the focus of my question. Basically, I'm asking for a self-study course of Mathematical Methods. Thanks to his recommendation I identified a book that is very close to the answer: Mathematical Methods in the Physical Sciences by Mary...

 
@JaneSmith Is it possible for you to go back to college to do math?
@JaneSmith To go into PDE, you will need to know a lot of math, one after another topic...
 
I had to drop for personal reason, Im currently 21 I could start again
 
@JaneSmith No problem, even if you are 91.
@JaneSmith You have to ask yourself what your intention is first.
 
@WillHunting I choose Paul for self studying everything is well organized
 
@JaneSmith Your intention cannot be just to implement that thing, it has to be part of something bigger right?
Ask yourself what that bigger thing is, and then decide what you need to do.
 
5:12 AM
No, just for fun. Computer Graphics more exactly
 
Just for fun. Hmm...
Well, fun sometimes requires lots of effort...
 
Calculus 1 2 3 and Linear Algebra, so yes a lot of effort
 
And to do hardcore PDE, much much more...
So it is impossible to know exactly what you need to learn if it is just for fun.
 
well in order to learn PDE I have to start with the basics
 
And depending on what you learn, you may not be able to implement what you want, whatever that means.
I do not know anything about simulations to tell you exactly what you need to learn.
You should not even assume that PDE is what you need to implement that thing.
 
5:18 AM
wave equation is not PDE?
 
It is. But PDE is such a huge topic, and there are other topics.
So I don't know exactly what you need if it is just for fun to implement one small thing.
But I can tell you that epsilon and delta is not easy to understand for most people on earth.
Anyway, why I am talking so much is because I am rather free right now. =)
 
Its not just for fun, I would also learn other topics like derivatives, integrals and series, they will be helpful for other things
 
Then I really suggest you do a whole degree in college.
 
@WillHunting I see you are in Europe right?
 
@JaneSmith I am not. And how do you see that?
There is no way you can see that, LOL.
 
5:24 AM
Its 1:24 AM
 
Well, you don't know anything about me. =) It could be anytime here.
Basically, I could be anywhere in the world.
@JaneSmith So what you should do is ask yourself what you really want to do.
@JaneSmith Mathematical Methods can refer to many many things and can be very very advanced.
 
OK, thanks for your help, very grateful for the advises and taking your time to discuss this delta epsilon madness. Bye Bye :)
See you
 
Hello @KajHansen!
 
5:44 AM
Huhh?! Will Hunting talking about math, what is the world coming too?
@WillHunting I use to know two things about knots, and the thing I stated is the only thing I know.
 
5:58 AM
Hey @WillHunting. Just relaxing with some video games right now
 
We've been doing sequences in my intro to analysis class for a while now and we usually denote a sequence as $\{a_n\}$, for example. What's a normal way to notate an example sequence? I might write $1,1,1,\ldots$, but would it be correct to write $\{a_n\}=\{1,1,1,\ldots\}$?
 
How'd you do on the Putnam @GBeau ? If you don't mind my asking ofc.
 
a 2
I think I could have gotten a 9 or 10 if I had written up my solution better to the one I solved
but otherwise I'm happy (I only wanted to not make 0)
particularly since I was taking my first-ever proof course when I took the putnam
 
No doubt, not bad at all!
 
I haven't seen anybody else solve the one I solved as I did
 
6:02 AM
That's pretty cool actually. I nailed the base-10 overexpansion problem and kind of floundered on the others.
 
 
Also, @GBeau, I'd write "Let $\{a_n\}$ be the constant sequence $1, 1, 1 \cdots$" or "Let $\{a_n\}$ be a sequence such that $a_n = 1$ for all $n \in \mathbb{N}$". Doesn't really matter.
 
it seems like putting it in the $\{\}$ directly might be incorrect, is why I asked
 
Oh very nice! I did B1 and should've had B2 as well, but I realized how to solve it much too late (I was focused on B4 for a long time)
@GBeau, I think the braces denote the sequence as a whole, whereas if we write $a_k = 1$, we are referring to the specific $k$th term. I could be wrong though.
 
With a little work (not particularly difficult, but a little cumbersome), you can match up an expansion of the taylor series to get a formula for the nth coefficient $n\geq 3$ to be $\frac{n-1}{n(n-2)!}$
and you can show the hypothesis directly for $n<3$
 
6:07 AM
@GBeau, it seems the Putnam graders were particularly harsh this year. Pretty much all of my friends got much lower scores than anticipated. You should be proud of your score, especially since you were just in an intro to proofs course.
 
if $n-1$ is prime, the hypothesis of numerator $1$ or prime holds regardless of whether or not it cancels, so you only need to consider when $n-1$ is not prime
$n-1$ not being prime means there exists a $k$ within $1<k<n-1$ such that $ak=n-1$
Choose $k$ to be the largest such $k$, and claim that $a$ is prime
prove $a$ is prime by contradiction: if $a$ was not prime, you can construct a larger $k$, contradicting $k$ maximal
 
@KajHansen What game
 
since $k<n-1$, it cancels with $(n-2)!$ on the bottom, now you have a prime in the numerator, and the hypothesis holds regardless of whether or not it cancels as well $\blacksquare$
 
Clever! @GBeau. I'll need to sit down in a sec to convince myself of some small details, but it looks good.
@DiscipleofBarney, Halo:CE on PC.
 
Awesome, I remember playing that on xbox for hours on end
 
6:15 AM
@DiscipleofBarney, I love it. The multiplayer servers are still active on PC, and the campaign is simply incredible.
 
@KajHansen I figured out the answer to B2 during the putnam, but I did not know how to prove it with any semblance of rigor
 
LOL, I know exactly what you're talking about @GBeau
Intuitively, one can describe why the answer will be a piecewise function with its two pieces both constant.
 
right
 
Just doing that would probably get you a point
 
maybe that's where I got one of my points (I wrote that), but I figured it more likely I got 2 points for A1
 
6:22 AM
You might be right. I know very little about their grading standards.
 
I saw statistics for the grading one of the years that suggested they only give a score of 1 or 2 or 9 or 10
and I don't know much beyond that
 
I am 95% sure that that is correct @GBeau.
 
6:42 AM
All but one of the starred comments is either by @TedShifrin or @MikeMiller. Monopolists, I tell you!
 
7:02 AM
"I didn't ask for this"
That is indeed how the putnam is graded, and 2s are not very common
they happen, but it's usually 0-1, 9-10
 
7:36 AM
Hi @Mew
 
Mew
hi mate
 
hello everyone
 
hello
 
someone can explain me, why this question math.stackexchange.com/questions/1246172/… is in hold?
I think that is a useful question like this one: math.stackexchange.com/questions/505367/…
 
Mew
because u have low reputation
 
7:39 AM
that's question is not mine
I just curious
 
Mew
oh
well because whoever asked it has low reputation then
this is a very hierachial site and reputation is everything
when you have it, you can do whatever you want, and when you don't have it, you must conform to strict aribrary standards set by those who with high reputation
 
I see, I don't know.. anyway I like that question I love integrals
anyway..
 
Mew
so what
 
@user17629 math.stackexchange.com/questions/1231055/… look at this amazing integral
 
Mew
7:44 AM
have you gone through it all yet user17629
this is the best integral youtube.com/watch?v=dQw4w9WgXcQ i've seen
 
Hi guys, quick question: Does every Lie algebra have an irreducible representation?
 
@Mew nice try
 
Mew
lol
 
@user17629 looked at the integral i gave
 
,@Mew I like robjohn's answer
I gotta go, cya
 
7:51 AM
is the set of accumulation points for $\mathbb{R}\setminus\mathbb{Q}$ equal to $\mathbb{R}$?
it is clear that the set of accumulation points for $\mathbb{Q}$ is $\mathbb{R}$
 
8:04 AM
similarly, the set of isolated points for $\mathbb{R}\setminus\mathbb{Q}$ would be $\varnothing$ ?
 
8:16 AM
hey everyone
 
and again by similar logic I would guess the set of boundary points for $\mathbb{R}\setminus\mathbb{Q}$ would be $\mathbb{R}$, but I'm not really certain
I'm confident in all the other sets my book listed as far as these properties go, but I don't really know properties of $\mathbb{R}$ not relying $\mathbb{Q}$ so this example isn't clear
 
hey the identity matrix is the only matrix right which when whem multiplied by itself gives me the identity matrix back?
 
no
@Rememberme no
 
it dosent ?
 
nope
 
8:20 AM
then is there any matrix like that
 
$\begin{bmatrix}-1 & 0 \\0 & -1\end{bmatrix}$
 
identity matirx is the same except the negative ones
 
@Rememberme yes, the diagonal is full of 1 and everywhere else it's zero
$a_{ij} = 1$ if $i=j$ $a_{ij} = 0$ if $i
$if $i \neq j$
 
Ya so if i multipy it with itself wont i get it back @Nickolas
 
if $A^2=I$, $A$ is not necessarily $I$
it's also not true for $A^3=I$...
 
8:24 AM
$a_{ij} =1$ if $i = j$, $a_{ij} = 0$ if $i \neq j$
@Rememberme yes, try the multiplication to see
 
i jut saw it does ....thanks
 
8:46 AM
@Nick hey
 
hm, I think I resolved what I know most of it, it is only unclear now whether or not the set of accumulation points of $\mathbb{R}\setminus\mathbb{Q}$ is $\mathbb{R}$ or not
 
@GBeau topology?
 
yes
 
@GBeau I don't remember much but I'd go using the definition
 
that is the only thing I'm using
 
8:53 AM
@GBeau where are you stuck
 
@Nickolas: :D Hi dude who probably gets my pings. I've been getting your pings too. Hope it's not an inconvenience.
 
@Nick hahahaha
 
is it true for all $\varepsilon >0$ that the interval $(x-\varepsilon,x+\varepsilon)$ contains infinitely many irrational numbers
 
Hi @Incurrence, finished exams?
 
that would imply my guess
 
8:57 AM
@GBeau, you can get arbitrarily close to any rational number with a sequence if irrationals
 
@KajHansen That would resolve my questions :)
 
Suppose we want to get arbitrarily close to a rational $x$. Then rewrite $x$ into an infinite decimal expansion (if it terminates, just put 0's). So the decimal expansion for $x = 2/5$ would be $.400000000000...$
 
I couldn't find a theorem of such in covered material
 
Then form your sequence of irrationals converging to 2/5 like this:
.4 (then digits of pi)
.40 (then digits of pi)
.400 (then digits of pi)
.4000 (then digits of pi)
etc.
 
That's provided decimals have been covered, which is usually not the case today.
There are so many things in elementary math we don't justify in college courses, it's a shame.
 
9:01 AM
Yeah.... That requires you to have the fact that a number is rational whenever it has a decimal expansion that repeats after a certain point.
 
We need a whole treatment of construction of reals via decimals.
 
Ok, well try this:
@GBeau, take your rational $x$ and consider the sequence $\{a_n\} = x + \pi/10^n$. This is definitely a sequence of irrationals because $\text{rational} + \text{irrational} = \text{irrational}$. Avoids needing to know anything about decimal expansions.
 
I actually feel like ignoring someone in this chat.
Of course, we need to know that pi is irrational, which again is seldom proven today.
The more we know, the more we know we don't know.
But using the square root of two will do nicely.
 
That's easily fixable @WillHunting. You can sub out $\pi$ for any other irrational number.
 
nod
 
9:08 AM
It's very weird for me that someone cannot do matrix multiplication but wants to study topology immediately.
 
Nothing wrong with that that I can see @WillHunting, other than the possible lack of sufficient mathematical maturity that one builds up completing other courses first. I haven't encountered matrices once in my point-set course.
 
@KajHansen Exactly. You are right.
Mike and Ted get stars just for greeting each other. This chat is amazing.
@KajHansen It's a bit like someone who cannot yet walk but wants to run.
 
I just handed in a garbage assignment :\
 
@Incurrence Why do you say that?
 
Well I had Functional analysis due last friday, which took all week to do
Then I had a complex analysis exam yeterday
And then I had Algebra due today
 
9:19 AM
What questions did you do wrongly?
 
So I handed in pure gold on Friday
Did great yeterday
 
It's not your fault.
 
and handed in an assignment worth probably 30% today
SO sad
Worst of all
I didn't get to learn the content
 
It's not your fault.
 
I'll have to redo the assignment over the next few days, with the downside that it will depress me that I lost those grades
 
9:23 AM
@Incurrence hey
 
I'll brb dinner
Hey @Nicko
 
@Nickolas No hey for me?
 
That's very sad.
 
@Incurrence done your assignment ?
 
9:24 AM
Oh I see @Nickolas doesn't know that I changed my username.
@KarimMansour Yes, he handed in garbage.
 
@WillHunting which was your old username
 
@Nickolas Jasper.
 
I have also one question left in number theory I am doing it now then I am done for this semester !!
yaaay
 
@KarimMansour Will you say yay if it is the last day of your life and then you will be done?
 
9:26 AM
Sometimes, life is just full of shit.
 
@WillHunting oh hey then
 
Hi @Chris'ssis.
 
the accumulation points of $\{a+\frac{1}{b} : a,b\in\mathbb{N}\}$ would be $\mathbb{N}$, right? (set is of my own construction)
 
I think so @GBeau
 
9:41 AM
I missed an analysis class due to a required seminar and I'm going through a chapter making sure I understand it (I was trying to think of something with a finite amount of accumulation points, then I wondered about countably infinite)
(finite was easy, $\{\frac{1}{n}: n\in\mathbb{N}\}$ has the accumulation point $0$ only)
although now that I write it like that, I guess that makes the above more obvious
 
@Gato The standard argument is the maximum principle for harmonic functions, as used by mrf. There are of course other ways. Have you already met the Schwarz reflection principle?
 
9:59 AM
@DanielFischer I don't think so, can I understand it without any knowledge about harmonic functions ?
@DanielFischer I just read it, how can I use it ?
 
Any matrix of the form $A^2=A$ cannot be a subspace of $\mathbb{R^n}$ right ?
 
@Gato Yes, although not completely. Ultimately, the reflection principle concerns harmonic functions. But at the moment, all we would need the reflection principle for is to let the following appear less magical. Consider the function $$g(z) = \begin{cases} f(z) &, \lvert z-a\rvert \leqslant r\\ \overline{f(a+ r^2/\overline{z-a})} &, \lvert z-a\rvert > r. \end{cases}$$
You can verify easily that $g$ is continuous on the whole plane, and holomorphic except possibly on the circle $\lvert z-a\rvert = r$.
You can use Morera's theorem to deduce that $g$ is an entire function.
And since $$\lim_{z\to\infty} g(z) = \overline{f(a)},$$ $g$ is bounded. By Liouville's theorem, $g$ is constant.
Gotta go for a while now, will be back later.
 
10:34 AM
@DanielFischer Thanks, I will read it carefully after eating. :)
 
Happy earth day!
(What are the accumulation points of $A$, where $A$ is the set of all numbers $x$ in $(0,1)$ where the decimal expansion of $x$ consists of finitely many $1$s and at most two $0$s, like $.00111$ or $.1011101$? And what are the accumulation points of the accumulation points of $A$?)
@GBeau
EDIT: Um, I meant to say binary decimal expansion. Though I'm not sure how much it matters.
Or "binary fraction" for the pedantic.
 
in a binary fraction, $0.1111\ldots=x$, what is $x$? (to understand the notation)
 
$1=0.1111\dots$. I wanted it to be binary so you don't have to mess around with $1/9$.
This way, everything has a finite deci—binary expansion.
 
but it would seem the set of accumulation points is $A\cup\{0.1111\ldots\}$
 
How is $.001$ an accumulation point?
 
10:47 AM
removed it :P
 
It's still there, it's in $A$
 
oh, I see
 
You need a sequence with limit $.001$, but I don't think that exists.
 
so then is $0.111\ldots$ the only accumulation point?
 
Eh, what about the sequence $.001,.0011,.00111,\dots$, which has limit $.01$?
Or are accumulation points not allowed I be in $A$?
 
10:50 AM
oh, that was my intuition for picking $0.001$ originally
the logic was just faulty and I fumbled over the notation, but I would then agree that .01 and 1 are accumulation points
 
Besides for the $.11\dots=1$, I think all of the other accumulation points are in $A$
 
are there others?
 
There's also, say, .110011101,1100111011,11001110111,… with limit
.11001111
Cause that's $.11001110\overline1$
WAIT
TYPO
I can't edit it, cause I'm on my phone, but that first group of zeroes is only supposed to have one zero
So, .1101111
(Otherwise the sequence isn't in A)
(.11011101,110111011,1101110111,…)
 
so working hypothesis is accumulation points are $A\cup\{0.01,1\}$
 
Well, not $A\cup$, since not everything in $A$ is an accumulation point.
 
10:55 AM
it's not?
 
I don't think my accidental example of .11001111 is one.
(You see why my typo'd sequence didn't work?)
 
.11001111 is in $A$, but so is .110011111 and .1100111111, etc?
 
Yeah
(Which has limit .1101)
 
is there a point in $\mathbb{R}$ between .11001111 and .110011111 ?
errr, well I guess that's obvious
 
Yeah, .1100111101, but that's not in A
'Cause it has 3 zeroes
Everything in A only has two
 
10:58 AM
accumulation points are $1$ and all decimal expansions with one zero? (convincing myself)
 
Yep!
And the accumulation points of that
 
1?
 
are 1 and all decimal expansions with no zero!
.1,.11,etc
 
oh, the finite ones, yes
that makes sense
 
And the acc. point of that
is just 1
 
11:00 AM
right
 
And that has no acc points because it's a finite set
Gtg
 
bye, thanks for the example
 
11:50 AM
Greetings
 

« first day (1722 days earlier)      last day (3302 days later) »