« first day (5166 days earlier)      last day (151 days later) » 
00:00 - 22:0022:00 - 00:00

00:02
Okay I will give that a try.
Well that worked but the answers are differen.
degrees vs. radians?
Used degree setting for both sides input
@leslietownes would you like the question in full>
Is $\mathrm{FinSet}_*$ isomorphic to $\mathrm{FinSet}_*^\mathrm{op}$?
Apparently about half of people like to define Segal's category as the skeleton of the former (notably this is the case in HA) and half as the skeleton of the latter, and then both sides claim that Segal's category can be described as having finite sets as objects and partial functions as morphisms.
If this is true, then the two versions of Segal's category are isomorphic, hence $\mathrm{FinSet}_*$ and its opposite category must be equivalent (which I should have asked about in place of "isomorphic").
This seems... unlikely to me, because if it were true then why bother with $\mathrm{FinSet}_*^\mathrm{op}$ to begin with?
"...he yells into the void" :^)
00:50
@BenSteffan there is no initial object in $\text{FinSet}_*$ right
Ah no sorry.
any one-point set is a zero object
@BenSteffan I think this would be true because a finite-dimensional vector space is isomorphic to its dual.
01:15
while I have no idea what I am reading, I've found this for example math.stackexchange.com/questions/3772422/…
14
Q: Where does Segal's category come from?

Qiaochu YuanSegal's category $\Gamma$ is the skeleton of the category $\text{FinSet}_{\ast}$ of pointed finite sets. It is used to write down $\Gamma$-spaces, which are functors $\Gamma \to \text{Top}$ satisfying some conditions, and which model infinite loop spaces. I would like to be able to tell myself a ...

convention?
 
1 hour later…
02:24
@BenSteffan no, right? smash product distributes over wedge, but not the other way round
02:45
What does bounded mean again, for sequences?
I know convergence implies boundedness. I think it means that it's a closed or open interval with a finite number on each end.
this seems impossible
maybe if $(b_n)$ was divergent.
@Obliv A sequence $(a_n)$ of real, complex numbers, vectors in a normed space, is called bounded if there is a natural number $M$ with $|a_n|\leq M$ for all $n$
@Obliv it is impossible
How would I justify it? Are the bounds of $(a_n-b_n)$ simply the bounds of $(a_n)$ minus the bounds of $(b_n)$?
I guess more generally, a set $A\subseteq X$ of a metric space is called bounded if there is $x\in X$ and $r > 0$ such that $A\subseteq B(x, r)$ i.e. $A$ is contained in a ball
@Obliv For each natural number $M$ you can find $n$ so that $|a_n|\geq M$. But $b_n$ being convergent, there exists $M'$ with $|b_n|\leq M'$ for all $n$. So $|a_n-b_n|\geq |a_n|-|b_n| \geq |a_n|-M'$ can get as large as you want
Strange how $\frac{1}{n}$ goes to $0$ yet the harmonic series doesn't converge. Too bad we won't go over series in this class.
@Jakobian ah, makes sense. Thanks.
I suppose boundedness can be also defined in any uniform space. If a uniform space is given by a family of pseudometrics $\mathcal{D}$ then $A\subseteq X$ is bounded if for every $d\in\mathcal{D}$, the $d$-diameter of $A$ is finite.
Or in another direction, given a topological vector space $X$, $A\subseteq X$ is bounded when for every open neighbourhood of $0$, $U$, there exists $a > 0$ with $A\subseteq a\cdot U$.
And, I think, the two approaches are equivalent for locally convex topological vector spaces (I suspect this is the only instance when a topological vector space can be given a uniformity)
 
2 hours later…
05:22
@SineoftheTime Length of a curve, what could i talk about?
 
3 hours later…
08:36
@Pizza definition and how to compute it
 
1 hour later…
09:43
In my abstract algebra exam, I proved something about $Q/Z$ by writing an isomorphim from it to $[0,z) \cap Q$ with modular addition, but I forgot to write $[0,1) \cap Q$ and instead wrote $[0,1)$.... feeling the absolute peak of cringe right now
09:59
@nickbros123 tell the examiner that you don't acknowledge the existence of irrationals :P
10:13
can someone link me the post where all the common comments are stored? like welcome to the site, here is a tour etc
@SoumikMukherjee This? math.stackexchange.com/tour math.stackexchange.com/help There are links at the top of every page on the main site. See the ? icon
@PM2Ring No, iirc there was a meta post
163
Q: List of comment templates

user2468Inspired by this question on meta.cstheory.SE. The post at meta.Tex.SE is quite impressive. We often leave generic comments to OP and answer posters such as "if this is a homework, please add a tag," and such. Can we make this post a community wiki and add a big list of standard comments? Let's ...

this?
Yes this
thanks
Ah, ok.
 
1 hour later…
11:41
On page 25 in Folland, he gives an example of a measure $\mu(E)=\sum_{x\in E} f(x)$, where $f:X\to[0,\infty]$ and $E\in\mathcal{P}(X)$. Then he claims (the other direction also holds) $$\mu \text{ is } \sigma\text{-finite}\implies \mu \text{ semifinite and }\{x:f(x) > 0\} \text{ is countable }$$
Attempt: We prove the contrapositive. If $\mu$ is not semifinite, it can not be $\sigma$-finite. Suppose now $\mu$ is semifinite and $\{x:f(x) > 0\}$ is uncountable. Here's my attempt. Since $$\{x:f(x) > 0\}=\bigcup_{1}^\infty\left\{x:f(x) > \frac{1}{n}\right\},$$ there is $n$ such that $\left\{x:f(x) > \frac{1}{n}\right\}$ is uncountable.
Let $E= \left\{x:f(x) > \frac{1}{n}\right\}$. We must have $\mu(E)=\infty$ and by semifiniteness, there are $B\subset E$ such that $0<\mu(B)<\infty$. Here I'd like to conclude that $B$ has finite cardinality. So $E$, which is uncountable, is not the countable union of subsets of finite measure, i.e. subsets that have finite cardinality. So $\mu$ is not $\sigma$-finite.
Question: I'm pretty sure that $\mu(E)=\infty$ is a correct claim, but I'm doubtful about the claim that $B$ has finite cardinality. Is this true?
@SoumikMukherjee that would be far more worrying lol 😂
11:58
@psie I think the claim is correct, though comments to the proof are welcome.
Suppose $B$ did not have finite cardinality and yet $0<\mu(B)<\infty$. Then $$\frac{\operatorname{card}(F)}{n}<\sum_{x\in F}f(x)\leq \sum_{x\in B}f(x),$$ for any finite $F\subset B$. Since there would be no upper bound to $\operatorname{card}(F)$, $B$ would have infinite measure, contradiction.
 
1 hour later…
13:15
Let $f:M\to\Bbb R$ be a smooth function on a Riemannian manifold. If the gradient flow of $f$ on $M$ has a global attracting fixed point, then it means $f$ has a minimum on that point?
 
2 hours later…
15:32
@SineoftheTime ah ok :)
15:59
@Pizza what did you study regarding curves?
16:21
@psie this measure always is semifinite
Ah no sorry. You allow $f(x) = \infty$
@psie yes. If $B$ were infinite then $\mu(B)\geq\sum_{x\in B} 1/n$
@psie while its true that $B$ is finite this proof is still wrong
You claim that subsets of finite measure have finite cardinality - why?
How about this argument instead, if $\mu(A)<\infty$ then $A\cap\{f>0\}$ is countable.
This follows essentially by considering $A\cap \{f>1/n\}$ like in your proof, they must be finite so above set is countable
Then if $\mu$ is $\sigma$-finite, it follows directly that $\{f>0\}$ is a countable union of countable sets, so countable
That $\mu$ is semi-finite is irrelevant here
17:07
@Jakobian Of course Frechet spaces which aren't locally convex exist like $\ell^p$ for $0 < p < 1$, so I'm wrong here, the remark in the brackets
17:35
@Jakobian I found that as well
@Thorgott hm, that's a good point
Hi
Why $y+2k\pi=0 \to y=-2k\pi=2k\pi $
If $k\in Z$
no
that's false :)
surely you don't want to sell us that $-2k\pi = 2k\pi$
If $k\in Z$ i think yes
if $k\in \Bbb Z$, also $-k\in \Bbb Z$
@Gian'sPizzeria uh, no
for a start unless $k = 0$ one side is $> 0$ and the other $< 0$
if your intent is to calculate "mod $2\pi$", as for trigonometric functions, you cannot write it with an equals sign like you did
17:47
you can say that since $k $ is a dummy variable, you can call $k$ as $-k$
Even if someone may say it's an abuse of notation
@SineoftheTime you can, but not in the same equation, and you have to explicitly say it
in any case, the remark is tangential to the actual problem
instead of saying $2k\pi=-2k\pi$, you can say $\{2k\pi : k\in \Bbb Z\}=\{-2k\pi : k\in \Bbb Z\}$
"Taking the Principle of the Excluded Middle from the mathematician... is the same as... prohibiting the boxer the use of his fists." - Hilbert
17:54
so can we remove the minus sign from $y=-2k\pi$?
@Gian'sPizzeria how are we supposed to know? :)
what you wrote doesn't make sense, and you didn't give us any context
If you're treating $y$ as an input to a $2\pi$-periodic function then yes, you can remove the minus
or replace it with any other integer
call for example $k_1=-k$, then $y=2k_1 \pi$
@Jakobian so it is not true that subsets of finite measure (with respect to the measure I specified, i.e. $\mu(E)=\sum_{x\in E} f(x)$) have finite cardinality, yet it is true that a set with finite measure has finite cardinality?
@Jakobian hmm, I don't understand what you've written after and including this message. We need to show if $\mu$ is $\sigma$-finite, then $X$ is a countable union of sets of finite measure and $\mu$ is semi-finite.
Actually, it is a fact that every $\sigma$-finite measure is semifinite, so I don't see why Folland wrote what he wrote, i.e. claiming that $$\mu \text{ is } \sigma\text{-finite}\iff \mu \text{ semifinite and }\{x:f(x) > 0\} \text{ is countable }.$$
Again, this claim is with respect to $\mu(E)=\sum_{x\in E} f(x)$ where $f:X\to[0,\infty]$ and $E\in\mathcal{P}(X)$.
@Jakobian I probably understand you know, but correct me if I'm wrong. If $\mu$ is $\sigma$-finite, then $X=\bigcup_1^\infty A_n$ where $\mu(A_n)<\infty$. So we form $A_n\cap \{f>1/n\}$, a countable set. Then we have that $\bigcup_1^\infty A_n\cap \{f>1/n\}=\{f>0\}$ countable as a countable union of countable sets.
@psie I think I understand Folland now too. We need semifiniteness for $\impliedby$ direction.
18:25
@psie you said the same thing twice here, first you said its true and then you said its not true. What do you mean
In any case, if $\mu(E) < \infty$ that doesn't imply $E$ has to be finite, or even countable. For example, if $X = \mathbb{R}$ and $f(x) = 1/x^2$ if $x$ is positive natural, and $0$ otherwise, then $\mu(X) < \infty$
@Jakobian well I was confused because you said that $B$ in my proof is finite, which is a subset of set of finite measure. I guess it is just an exception.
@psie that $\mu$ is semi-finite follows from it being $\sigma$-finite. But to show $\{f > 0\}$ is countable you don't need this, its irrelevant
ok 👍
This is something that holds for every measure
indeed
18:30
@psie well its obvious in the forward implication but might become relevant when going back to $\sigma$-finiteness
@psie My point is that, going through $\{f > 1/n\}$ you don't have to repeat the same argument over and over
There is only one fact relevant here that needs $1/n$: that if $\mu(A) < \infty$ then $A\cap \{f > 0\}$ is countable
you don't need to mention $\{ f > 1/n\}$ ever again
It also is more natural to not consider it after
the proof flows better that way, its easier to understand
hi
I simply don't understand why $A$ would be countable
@psie as I said, $A$ doesn't have to be countable
this say, lemma, is just the fact that if an infinite sum of positive numbers is finite, then that sum is countable
@Sahaj yes, hi
@Jakobian are you applying that lemma when you are claiming that $A\cap \{f > 0\}$ countable?
No, I am saying it is that lemma
in almost literal sense
18:38
@psie you cannot sum an infinite number of nonzero terms by definition. So if you can sum a sequence it has to have a finite number of non zero terms, thus countable.
@Faust no, thats not true
If you do you get stupid shit like $ 1+2+3+4+5+....= -1/12$
@Jakobian can you give me an example, i am sure there are some special cases, but if you cant show a sequence is 0 for an infinite number of terms you shouldnt generally be summing it
not just zero, but all 0's after a finite number of terms
@Faust $1+\frac{1}{2^2}+\frac{1}{3^2}+...$ is a finite sum of countable amount of positive terms
the infinite geometric sum is also an example
that was the only example i could think of was the geometric ones
18:44
@psie if $\mu(A) < \infty$ then $A\cap \{ f > 1/n\}$ must be finite, so $A\cap \{f > 0\}$ is countable
and this is the only place you ever need to go through $\{f > 1/n\}$ in this proof, to show this lemma
after this, if $\mu$ is $\sigma$-finite, then $X = \bigcup_n A_n$ where $\mu(A_n) < \infty$ so that $\{f > 0\} = \bigcup_n (A_n\cap \{f > 0\})$ is countable
and that's it. Now the other direction
@Jakobian ok, I'll have to digest this. I have a proof of the other direction, if you're curious.
If $\mu$ is semi-finite and $\{f > 0\}$ is countable, then $\mu(\{x\}) = f(x) < \infty$ for each $x$ so $X\setminus \{f > 0\}$ and $\{x\}$ for $x\in \{f > 0\}$ is a decomposition into a countable amount of finite-measure sets
@psie I mean sure, I am here to help you check and write proofs
so if you want
@Jakobian i didnt realize you were talking about measure theory. ^^
Suppose $\mu$ is semifinite and $\{x:f(x) > 0\}$ is countable. It is a fact that, for the measure we are considering (and it is stated in Folland's text also), we have that $\mu$ is semifinite iff $f(x)<\infty$ for every $x\in X$. So we conclude $f(x) < \infty$ for every $x\in X$. Let $S=\{x:f(x) > 0\}$.
Given any set $E \in \mathcal{P}(X)$, we have $\mu(E\setminus S)=0$ and $E \cap S$ is countable. Moreover, for all $x\in E \cap S$, $\mu(\{x\})<\infty$. Since $$E=(E\setminus S) \cup \bigcup_{x\in E\cap S} \{x\},$$ $E$ is a countable union of sets of finite measure. Thus $\mu$ is $\sigma$-finite.
$\mu(E\setminus S)=0$ because a sum of zeros is just zero.
I don't understand why you're introducing some set $E$ here
You want to write $X$ specifically as a countable union of finite-measure sets
that every measurable subset $A\subseteq X$ of a $\sigma$-finite measure space can be written that way is a property of $\sigma$-finite measure spaces and doesn't need to be proven
18:56
@Jakobian yeah, that's maybe a bit odd, but we can speak of $\mu$ being sigma finite and meaning $X=\bigcup_1^\infty E_j$ with $\mu(E_j)<\infty$, but we can also speak of a set $E$ being $\sigma$-finite for $\mu$.
@psie but we aren't
ok, I'll have to look at your proof then in detail
19:11
@psie the only difference is that you introduced some set $E$ and then talked about $\mu(E\setminus S) = 0$ and $E\cap S$ is countable. Why introduce unnecessary details into your proof? Especially that they don't contribute anything
@SineoftheTime i can write something about length of a curve in general
yeah, I agree
suppose $a_n,b_n>0$ and consider $\sum (-1)^n a_n$ and $\sum b_n$. Suppose $a_n \sim b_n$, can we say $\sum (-1)^n a_n$ converges iff $\sum (-1)^n b_n $ converges?
Let $\varphi = \varphi(t)$, with $t \in [a,b]$, be a continuous curve.
@Pizza how did you define the length of a curve? Approximating it with segments?
19:15
We define the length of the curve as the "limit" of the lengths of the inscribed polygonal lines in $\varphi$.
ok, the sup
For each partition $P_n = \{a = t_0 < t_1 < t_2 < \dots < t_m = b \}$ of $[a,b]$, we consider the corresponding points on the curve $\varphi(a), \varphi(t_1), \varphi(t_2), \dots, \varphi(b)$, and the length of the polygonal line $P_n$ having these points as vertices.
@SineoftheTime $a_n = 1/n, b_n = 1/n + (-1)^n1/(2n\ln(n))$
this is a bit sloppy, since the "curve" is usually defined as the function. So corresponding points "on the curve" is a bit imprecise
The length of such a polygonal line is:$$
L(P_n) = \sum_{i=1}^{m} \text{dist}(\varphi(t_{i-1}), \varphi(t_i)) = \sum_{i=1}^{m} \|\varphi(t_i) - \varphi(t_{i-1})\|
$$$$
= \sum_{i=1}^{m} \sqrt{(x(t_i) - x(t_{i-1}))^2 + (y(t_i) - y(t_{i-1}))^2}
$$
$$L(\varphi) = \sup \{ L(P_n) \ | \ n \in \mathbb{N} \}.
$$
This ?
19:25
@Jakobian nice 👌 ty
@Pizza yes
then you can prove that $L(\varphi)=\int_a^b \|\varphi'(t) \|dt $
I read this : Let $\varphi$ be continuous and rectifiable in $[a,b]$. Then, $$
L(\varphi) = \lim_{m \to +\infty} L(P_n)
$$ for each polygonal line $P_n$ inscribed in $\varphi$, obtained by subdividing $[a
,b]$ into $n$ equal parts.
Ah maybe you mean by the length of regular curves
@Pizza the sup of a monotonic increasing sequence is the lim
@SineoftheTime So you mean the rectifiability theorem?
what is it?
@SineoftheTime Let $\varphi : [a,b] \to \mathbb{R}^2$ be a regular curve. Then $\varphi$ is rectifiable, and we have $$L(\varphi) = \int_{a}^{b} \|\varphi'(t)\| dt = \int_{a}^{b} \sqrt{(x'(t))^2 + (y'(t))^2} \, dt. $$
19:38
yes, this works for a regular curve
@Pizza if $L< \infty$ the curve is rectifiable and $L$ is its length
The proof should be this: Let $P_n$ be a polygonal line with vertices $\varphi(a), \varphi(t_1), \varphi(t_2), \dots, \varphi(t_m)$. The length of $P_n$ is: $$L(P_n) = \sum_{i=1}^{m} \sqrt{(x(t_i) - x(t_{i-1}))^2 + (y(t_i) - y(t_{i-1}))^2}.$$Since $\varphi$ is regular, $x(t), y(t)$ are differentiable on $[a,b]$.
By applying the Mean Value Theorem to $x(t)$ and $y(t)$, there exist $\xi_i, \eta_i \in [t_{i-1}, t_i]$ such that:$$x(t_i) - x(t_{i-1}) = x'(\xi_i)(t_i - t_{i-1}),$$$$y(t_i) - y(t_{i-1}) = y'(\eta_i)(t_i - t_{i-1}).$$Therefore, the length $L(P_n)$ becomes:$$L(P_n) = \sum_{i=1}^{m} \sqrt{(x'(\xi_i)(t_i - t_{i-1}))^2 + (y'(\eta_i)(t_i - t_{i-1}))^2}$$$$= \sum_{i=1}^{m} (t_i - t_{i-1}) \sqrt{(x'(\xi_i))^2 + (y'(\eta_i))^2}.$$
As $n \to \infty$, the width of the intervals $[t_{i-1}, t_i]$ tends to zero, and both $\xi_i$ and $\eta_i$ approach $t$. Consequently, the limit of $L(P_n)$ coincides with the limit of the Cauchy-Riemann sums of the function $\sqrt{(x'(t))^2 + (y'(t))^2}$, which is continuous and hence Riemann integrable.Thus, we obtain:$$L(\varphi) = \int_{a}^{b} \sqrt{(x'(t))^2 + (y'(t))^2} \, dt.$$
first time I hear the term "Cauchy-Riemann sum"
@SineoftheTime What do you recommend I learn better than these things? It seems to me that there are many things to write
it's better to focus on the exercises, but you have to know the definitions
Oh yes I was always referring to in case this came up as a topic to talk about
20:21
Let $(a_n)$ be a sequence where $a_n \to a$. Does $\forall a_n, a_n \in (0,1)^c \implies a \in (0,1)^c$ seem true?
obliv: if ^c denotes set complement in an implicit world of the set of all real numbers, and a_n is a sequence of real numbers, and the usual notion of convergence is at hand, it not only "seems" true, it is true :)
should be $\forall n \in \mathbb{N}$
if that read [0,1]^c instead of open interval notation, it wouldn't be true though right? @leslie
like $(a_n)$ could converge to 0,1 which is in the interval [0,1] but not in the complement
yes, if you changed the set in your original problem from (0,1) to [0,1], the answer would change
Thanks.
The appropriate notion under which $a_n\in A$ and $a_n\to a$ implies $a\in A$ is a notion of closed set. Complement of $(0, 1)$ is closed, while complement of $[0, 1]$ isn't closed.
If $U$ is a union of open intervals, then its complement is closed, and if $A$ is closed then its complement is union of open intervals, so called open set
20:30
Dang, I think I answered the first part incorrectly then. "If every $a_n$ is an upper bound for a set $B$, then $a$ is also an upper bound for $B$." I thought that was true but it could be the case that $a$ is the infimum of the sequence $(a_n)$ and $B$ includes the infimum.
@Jakobian I thought complement of (0,1) was $(-\infty,0]\cup [1,\infty)$
which doesn't seem closed
it is lol
write down the defintion of a closed set =p
@Obliv why not
obliv might be working through something that does not yet have, but is getting to, a definition of 'closed set'
because the complement doesn't have upper/lower bounds why would we consider an unbounded set closed?
@ob
@obliv\
fking chat
what element is not in that interval?
20:34
Yeah maybe it's because we haven't gotten to a point where it's meaningful to have distinction of closed/open for unbounded sets
obliv if you do get around to defining 'closed' for subsets of R that aren't "finite intervals" it will become apparent from whatever that definition is that that set is closed (as are, e.g., half infinite intervals with endpoints included like [1, +oo))
@leslietownes which is the exact reason why i asked him to write down the defintion of a closed set =p
a closed set according to wiki is a set whose complement is open lol so yeah by definition then $(0,1)^c$ is closed
but as you approach such a definition, it's best not to base too much intuition about what "seems closed" from the case of finite intervals
noted.
20:38
there's all kinds of sets out there which, in many informal senses, are pretty far from being intervals, and yet still somehow end up being closed
I thought convergence implying boundedness meant the convergent value (for example $a_n \to a$) was in this bounded interval.
there's maybe some part of my own intuition that still isn't convinced that the usual cantor ternary set is closed
But if the interval is open, $a\notin (a_n)$ could be true?
alot of times they try and avoid defining a closed set directly as its a bit of a pain
its "closedness" is just a pill that sheeple swallow as a condition of entering polite mathematical society, as a demonstration of their willingness to be led by false idols
2
20:43
I guess the closest i could get is, that every convergent sequence in a closed set, converges to a value inside of that set
without some epsilons or deltas i dont think i can get any closer to a proper defintion though
@leslietownes how is that set constructed?
@Obliv I don't know why you think a closed set needs to be bounded
ah I found it on wiki, I think.
obliv: wikipedia is the absolute worst place for digesting this kind of info, but en.wikipedia.org/wiki/Cantor_set
the point your missing obliv is that if the sequence converge to infinity or diverges then it doesnt need to be in that set
20:45
yes, you found it :)
While it being in that set is an important point its indicitive of something else ^^
@leslietownes what's unintuitive about this set being closed?
nothing, if you think about it, it was a joke
open sets are interval-like, being unions of intervals. Closed sets aren't
Leslie was alluding to, as I understand it, the intuition of closed sets being interval-like being wrong
yeah [really loudly so the authorities don't suppress the actual truth of my "joke"] i was mostly just picking a closed set that doesn't contain any intervals
20:51
wdym? How does it not have intervals
Oh.....
that's messed up
Its nowhere dense, which means that it contains no interval
this is where wikipedia being your first exposure to the set maybe isn't helping
I didn't realize what that set was.
i would ignore that set for awhile
That's messed up.
20:52
usually you dont encounter it until a topology class
It's not $\varnothing$?
no
but yeah, the "steps" depicted in the illustration of the "process," either don't visually convey the cantor set, or visually convey it only with a lot of thought about stuff that in my own mind i don't think of as very visual
skull emoji
Cantor set I feel like you usually encounter in an analysis class
for the first time that is
20:53
Yeah probably after some build up maybe.
cantor set has an uncountably infinite number of points, but its nowhere dense
I encountered it in an analysis class when my professor was explaining Lebesgue measure
Oh that's right, we keep the end points.
But I wouldn't be surprised if it was introduced in introduction to set theory class
@SineoftheTime well thats usualy a graduate level class, where topology is ungrad class at all univeristies
20:55
since one way of showing that $|\mathbb{R}| = 2^{\aleph_0}$ is by injecting the Cantor set $\cong \{0, 1\}^\mathbb{N}$ into $\mathbb{R}$
@Faust I studied Lebesgue measure at the second year
what is $\aleph_0$
@SineoftheTime O.o 5th year analysis class for me
it was not a full course on measure theory tho
@Obliv first infinite cardinal number
20:56
it was the multivariable calculus course
are you an engineer?
@Faust bro joins chat and start to insult us :(
no btw
the only other time i can think of measure theory at the undergrad level would be stats lol
in the multivariable calc, we did Lebesgue integral
Anyone who doesn't study some kind of mathematics probably doesn't study measure theory either
20:58
@Jakobian its very usual in stats
which is no way mathematics =p
I see. Well, either way, my education was mathematics and statistics, and there was a lot of rigorous probability theory and measure theory
I'm talking about undergrad of course
There are mathematics degree which focus more on probability and statistics, thats fine
probability theory i got no idea, i tend to avoid anything with stats or thats too applied ^^
Does convergence of a sequence $(a_n)$ imply $a_n$ belongs to a bounded closed/open set for all $n \in \mathbb{N}$
I think it should be open
I don't really see a difference between analysis and probability theory in terms of applications
but then $a_n$ defined by $\frac{n}{n}$ converges to $[1,1]$ which is a closed set so idk.
21:04
and statistics of course isn't the same as probability theory
@Obliv If you live in a bounded open set, you live in the closer of that set, which is also bounded.
that explains why i hate analysis so much =\
If you live in a bounded closed set, you live in an open set that is only epsilon bigger.
the key point is "a bounded closed/ open set"
not all closed/open sets, but at least one then yes
though it depends on how you define convergent
If $a_n$ converges, then the set $\{a_n : n\in \mathbb{N}\}$ is bounded. That set will not be open in the usual topology, and may not be closed in general.
21:09
we arent talking about that set though, we are talking about if that set lay iunside of an open or closed set
the sequence need not be an open or closed set, but it certainly is a subset of one.
Not wanting to study something because it might be applied to something outside of math is to say the least, strange. Why would you be picking your interests based on something as arbitrary as that? If you try to learn something and you actually like it then study it, if not then don't. And even the subjects you don't think would have any actual applications outside of math, probably very much do have those applications
Yes, I already answer that question.
It doesn't matter if something has applications or not. Its if anything a way to pat yourself on the back
If it is bounded, it lives in a closed ball, and that closed ball lives in a slightly larger open ball, and that open ball lives in its own closure.
@Jakobian the choice was not made because i wanted to avoid anything applied, it was a result of my not enjoying the things that i learned that were particularly applicable outside of mathematics
to employ a logical reasoning of selecting things that i more likely to find enjoyable to learn is in no way a means to pat myself on the back. Its just common sense.
21:15
@leslietownes Not sure how to understand this.
@Faust correlation doesn't imply causation
"
probability theory i got no idea, i ***tend*** to avoid anything with stats or thats too applied ^^"
I've managed to just regurgitate definitions but not make any progress in proving this.
@Faust click on your message and copy the permalink and paste it into chat :) (for next time maybe)
Namely, $a_n \to a$ implies all $a_n$ belong to some bounded set(s?) and $a$ too but can be the inf/sup which don't necessary have to be in the interval.
21:17
@Jakobian so my making a rational choice based on past experiences is because i think less of applied mathematics and thus chose to enjoy them less?
why does $\forall n \in \mathbb{N}, a_n \in (-\infty,0]\cup[1,\infty)$ imply $a$ has to be in this interval too? because it's closed?
i'd pay a tiny bit more attention to word use. that set isn't an interval
You didn't like them not because they were close to applications but simply for other, whatever they are, reasons
I find it amazing that you can claim to have more knowledge about someone you just met than a person who has known them for the duration of that persons life.
its just cognitive bias
21:19
obliv: it sounds like you might not have much to work with beyond the definition of the limit. in those terms, the idea is that if a_n is in that set and a_n converges to a, then either a <= 0 or a >= 1. notice that the words "open" "closed" etc do not appear here, just inequalities
and inequalities are what you give to and get from the definition of the limit
thats your opinion based on no available information, hence the very definition of cognitive bias is what you are hypocritically applying.
obliv: if you rearrange that slightly: if the sequence a_n is in that set and a_n converges to a, can you deduce a contradiction from the additional assumption that a is in (0,1)
this gets that "either or" business out of consideration and is very close to an application of the definition of the limit
just cause you are not capable of looking past your inate failings to be objective, please do not subject me to those same standards.
@leslietownes thats how I set it up, but so you think I should just say $a_n \to a$ by definition means $a \leq 0$ or $a\geq 1$
which contradicts the assumption $a\in (0,1)$
> Let $X$ be an infinite set and $\mathcal{M}=\mathcal{P}(X)$. Define $\mu(E)=0$ if $E$ is finite, $\mu(E)=\infty$ if $E$ is infinite. Then $\mu$ is a finitely additive measure, but not a measure.
I see how this measure is not countably additive. Let $\{A_n\}\subset \mathcal{M}$ be a disjoint collection of finite (nonempty) sets. Then their union would be infinite, so have measure $\infty$, but the sum of the $\mu(A_n)$'s would be $0$. But why is it finitely additive? I guess it is finitely additive because then $\bigcup_1^n A_n$ is either infinite or finite. If it's infinite, then one of the $A_n$'s is, and the measure of the union and the sum of the measures agree.
The finite case is obvious.
I probably didn't show much, but it is quite clear I think. Sorry.
21:25
@Obliv well, careful. does it say that by definition? in context, the definition of "a_n converges to a" doesn't require that a satisfy any inequalities, just that it be a real number. the inequalities come out of unraveling the definition of the limit using what you know about a_n
oh ok so just use the $|a_n - a|< \epsilon$ definition?
@Faust I don't think so
@Obliv it will fall out of fiddling with that, yes. (and given the tools you seem to have access to, or not have access to yet, it sort of has to fall out of that and not something simpler or something else)
If I were encountering pigeons everywhere, one might naturally come to a conclusion that pigeons are stalking me
obliv to get a sense of why it isn't quite at the level of "well duh," recall that there is no general reason for an arbitrary sequence a_n in that set to satisfy one of the conditions (1) a_n <= 0 for all n, or (2) a_n >= 1 for all n. even a convergent sequence may take values in both "sides" of that set, and fail to satisfy both of those conditions. but the limit a, when it exists, does have to satisfy either a <=0 or a >= 1
21:31
but I don't think that would be a very reasonable conclusion
swap out pigeons for vultures, then maybe :P
@Jakobian My undergrad degree was in physics and biochemistry, i also took classes in psychology, philosophy and statistics. Oddly the only ones i didnt like where classes in statistics, analysis and well PDE's cause who the hell likes pdes.
@Obliv I forgot that some Americans think that pigeons are drones who are spying on the citizens
i genuinely tried everything and eventually chose to change what i wanted to do based on what i enjoyed doing the most, but yes clearly a cognitive bias i didnt know i had.
Yes, funded by the government.
21:34
I associate X with Y and I don't like Y, so I don't like X too
sounds like that type of situation, happened to me with statistics
The friendliness of this chat has seriously deteriorated
@leslietownes Yes, so I could break it up into cases. Either $a \geq 1$ or $a\leq 0$. Then, it simply belongs to $(0,1)^c$
obliv: well, the "break it up into cases" isn't complete until you've done the exercise which is to explain why it can't happen that a is in (0,1)
and now I'm at the start again lol.
I'm not friendly to anyone. And criticism is for everyone. You might agree, you might disagree
21:37
obliv: as we mentioned earlier the problem gets a different result if (0,1) is replaced with [0,1], or [0,1), or (0,1], and this high level "oh, do cases" stuff isn't sensitive to how you get one answer for (0,1) and a different answer for the others
e.g. "either a < 0 or a > 1" is another partial breaking into cases, but in the [0,1] case, there's nothing preventing a from landing in [0,1], where there is something preventing the limit from landing in (0,1), in the present case
Personally, I am unchanged emotionally from how I was an hour or two ago. And I don't know why anyone has to feel any strong emotions about what I said, because I don't
@Jakobian There is a difference between being "not friendly", and being actively "unfriendly". You are getting close to that line. I would suggest that you step back from it.
@XanderHenderson no I'm not
@obliv if the set is bounded, just take the closure of the interval of the upper and lower bound, that is a closed set which contains every element of $a_n$ including a.
@Jakobian This really isn't an argument that you want to have. I would strongly encourage you to consider that people in this chat are finding your behavior to be unfriendly, and that if you want to continue to participate, you need to modulate your tone.
21:42
I wrote: Suppose every $a_n\in (0,1)^c$, meaning $\forall n \in \mathbb{N}, a_n \in (-\infty,0]\cup[1,\infty)$. $(a_n)$ is a convergent sequence, so it must be bounded. Since $a_n \notin (0,1)$ for all $n \in \mathbb{N}$, this bounded set has either $1$ as an infimum, or a lower bound, and $0$ as a supremum, or upper bound. For the sake of contradiction, let $a \in (0,1)$. Then $a>\sup(a_n)$ or $a<\inf(a_n)$ which both violate ... something
ducks
Enough.
Find another topic.
:66351188 that's set-theory, no ?
uh i think its technically analysis, but they all blur together for me
@Obliv yeah, this dichotomy doesn't work at the level of sequence values. the set of sequence values {a_n: n = 1, 2, ...} doesn't have to have 1 as an infimum or 0 as a supremum
thats not a bounded sequence though
21:51
analysis makes me tweak out a bit. continuums are too mysterious. Probably won't change if I take topology/diff. geometry
obliv: note e.g. a_1 = 9723856729876 a_2 = -827452856863 and three hundred zillion more terms like that and then a_n = 1 for all remaining n would converge to 1 despite having some wild sup and some wild inf. the convergence of the sequence doesn't give you any control over what the sup and inf actually are (only that they exist as real numbers)
@Faust fair point - the word "invertability" comes to mind but its been 30 years since i did any of that, so the memory suffers from bit-rot. Reversibility perhaps ?
@leslietownes true.. forgot about that.
@Criggie i mean i am trying to avoid the problem entirely and not do any work at all though
Well, I'm on SE chat while at work. It looks like work, but isn't.
21:53
if U is the upper bound and L is lower bound then $ a, a_n \in [L,U] $ for all n.
obliv: i'll give an example of something that maybe won't send you down a rabbit hole. try prove that the limit a can't be 1/2. what happens if the limit is assumed to be 1/2 and you put a small epsilon (say 1/3 or 1/10 or any smallish number) into the definition of the limit. you get an N such that, something something. there's a contradiction in there
@leslietownes I guess it boils down to what is the significance of ][ vs )(
Ok I'll try that.
yes but perhaps more helpfully it boils down to the definition of the limit :)
since you know the sequence is bounded, why bother doing any work?
why bother doing any work, even if you don't know that any sequence is bounded
if anyone needs me i'll be asleep on the lawn
21:56
watch out for lawn mowers
00:00 - 22:0022:00 - 00:00

« first day (5166 days earlier)      last day (151 days later) »