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?
Segal'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 ...
@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$
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
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)
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
Inspired 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 ...
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?
@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.
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?
@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.
@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 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.
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
@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
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
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
@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 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
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.
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.
@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. $$
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.$$
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 :)
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
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)$
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))
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
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
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
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.
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
@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.
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.
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.
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
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
> 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.
@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
@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)
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
@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.
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.
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.
@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.
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
@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
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 ?
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