« first day (5028 days earlier)   
00:00 - 16:0016:00 - 23:00

12:10 AM
@DanielDonnelly Bingo!
 
1:01 AM
Ya I still don't quite see what the issue is Thorgott, but likely my error. I've called the sets we're quantifying over card $A$ and card $B$, but they're just sets we're quantifying over too?
 
I don't understand how my question was viewed $154,000$ times
 
@SillyGoose In complex land, analytic and smooth are the same.
This is not true in real land.
 
I guess tons o people shared it on various internet blogs
Under what conditions can we have a diagonal metric on $\Bbb R^3$ in which the induced metric on $S \subset \Bbb R^3$ is diagonal as well?
What changes if we require $S$ to have positive constant Gaussian curvature? Assumptions: $S$ is regular, smooth and a surface of revolution
What changes if we relax the positive definiteness of the metric all else equal?
 
1:21 AM
@EE18 your two instances of card mean different things
you say for all A there is card A and then within that quantification say for all B there is a card B
 
ya, those are different
at least htat's what i meant
That's wrong?
Maybe I should use $M_A$ and $M_B$ instead
The claim is just that there are sets obeying that sentence in ZFC, but maybe that doesn't capture what Enderton means
 
it's an abuse of notation, which is generally something completely fair and reasonable to do, but if you're going out of your way to do propositional logic, it's not
in any case, even if you fix this syntactical error, it won't fix the semantic error
cause there is only supposed to be one fixed choice of card A for every set A
 
Maybe I should say the statement that (it is true that) $$\forall A [\exists C [(A \approx n \in \omega \implies C = n) \land (\forall B [\exists D[A \approx B \iff C = D]])]]$$
 
to come up with card' B for every set B depending on a chosen card A for every set A is pretty meaningless
cause you can just choose card' B = card A if B is in bijection with A and a different set otherwise
and that gives you that property
the substance of what Enderton is saying is that there is first a way of defining card A for every set A at once and then it obeys these properties
 
I'm a bit miffed that I can't figure out how to formalize this in terms of propositional logic
but if it's very involved then that last sentence of yours I think is enough for me at this point
 
1:28 AM
@EE18 I think that part of the problem is that Enderton very specifically did not try to give you a statement which is meant to be formalized in this way. The "Promise" he gives is informal, and is meant to give you some intuition to hang your hat on until he can get to the formal definition.
 
I'm not sure if the statement can be expressed in first-order logic
however, that would be a question for a logician, which I have no interest in
 
OK, thank you Xander and Thorgott. I think I've got enough of what I need at this point so I won't belabor the point
I did recently buy Enderton's logic book ;) but I won't touch that till the end of the year
 
1:56 AM
@SineoftheTime yeah, but I was hoping for Fabi to win
 
2:51 AM
here we have a covering space $Y$.
 
3:07 AM
An “ordered extension field”…does that basically mean an ordered field for which there is an embedding of the first ordered field into the “bigger one”. My book speaks about subsets but want to clarify
 
EE18: probably ['extension field' is certainly usually code for 'field in which your field is embedded']? more context might help
 
Am on mobile right now so lord forgive me for my sins, here goes:
We have seen that the equation x2 = a for positive a is, in general, not solvable in Q. Since x2 is the area of a square with side x, this means, for example, that there is no square of area 2 — so long as we stay within the field of rational numbers. As is known from high school, in order to remedy this unsatisfactory situation, we must allow squares with sides whose lengths are ‘irrational numbers’.
This means that our field Q is too small, and we need a larger field which contains Q as a subfield, and in which the equation x2 = a for a > 0 always has a solution. In other words, we seek an ordered extension field of Q in which the equation x2 = a is solvable for each a > 0.
Sorry that is copy pasted from my phone
The book is very imprecise, this is the first place “ordered extension field” is used
I’ve only given the definition above because of what I’ve seen in enderton
 
yeah, they mean an embedding of Q in an ordered field (if they haven't defined this, maybe they will later; it's not a field with a notion of > that interacts with the field operations in expected ways)
 
Sorry what do you mean by the sentence after the ; Leslie? Ordered field has been defined certainly
I always thought of ordered field as interacting well with <
 
3:34 AM
typo
remove "not"
 
3:57 AM
OK merci as always Leslie :)
What are the general perceptions of asking for proof verification in this chat. Better to just make a question on main?
More in the "is there a faster way to do this sense" than "is this right"
 
yeah, probably better here than on main.
 
oh i would ahve guessed other way around lol seeing as there's a "proof verification" tag there lol
but ok, will send in a bit then once tidied up
 
some folks on main are particularly sensitive about the use of that tag, and there is sometimes a close question as to whether 'is there a way of doing this better' is even a question about math within the scope of the site.
i don't think people have any deep seated objection to proof verification as a concept (which is why the tag exists), but, use of that tag often correlates with very low effort questions. some users feel that you can drape the tag and "is this right?" over almost anything and make it compliant with the site, and... no.
 
I am looking at the quesiton a bit more closely and it seems clear that it will be an example of "depends what foundations you're working with" and so maybe i won't waste folks time here. will save the goodwill for the numerous other things i ask about...
 
for me personally, the thing is not so much "is it a proof verification or not," but "has the asker actually thought about the question" and "is the question answerable without digesting a mountain of background"
 
4:06 AM
I fear my question will violate the last bit :/
 
maybe with some thought it will get shorter. :) it is sometimes possible to wrap details in little packages. if you can turn parts of the argument into lemmas that you are willing to take for granted, maybe the details don't matter.
 
I thought I had a clever way of tidying this up, but i guess not...
am trying to prove the question here: math.stackexchange.com/questions/1947700/…
But the solution is hideous, and there must be a better way
 
4:23 AM
i played my first ever game of pickleball today!
proof verification is no fun, i am sure it is very helpful for the OP, but any help is very case specific so there is little leverage. it is more like one on one consultation.
 
4:46 AM
Is a smooth manifold an algebraic variety?
 
no
@onepotatotwopotato Actually that is probably correct. Smooth in the real sense, yes -every smooth manifold is a nonsingular algebraic variety. There are complex manifolds which are not algebraic however
 
 
2 hours later…
6:39 AM
@JohnZimmerman why every smooth real manifold is a nonsingular algebraic variety?
I actually don't know what algebraic variety is. I'm just curious because I've heard someone saying before that "...smooth manifolds, more generally algebraic variety..."
 
 
3 hours later…
9:13 AM
@SoumikMukherjee probably it was his last chance to win the WC
 
 
1 hour later…
10:17 AM
@EE18 to use the proof verification tag you need to specify which point of the proof you are confused about
Otherwise its off-topic and should be closed
 
10:30 AM
Please read the tag wiki for this particular tag for how to use it
 
@leslietownes I very much dislike that tag. :/
(For what it is worth.)
But my personal opinion matters very little. ;)
 
I have a question
How's everybody doing?
 
Bad
How about you
 
I'm a little good and a little bad
mostly good i suppose
I'm working on understanding a group structure specifically the class of $G$
*class number of $G$
which is the number of distinct nonequivalent conjugacy classes of $G$
 
10:50 AM
@JohnZimmerman what makes two conjugacy classes equivalent
 
@Jakobian nevermind that question is too hard for me right now. I have a very dumb question
can a group have elements that are different dimensions?
 
@JohnZimmerman What is the "dimension of a group element"?
 
11:09 AM
Consider a group $G$, (picture below). We have $8$ vertices. We have $96$ white strands. Consider the following group actions a) rigid rotations (on vertices) and b) modular rotations (on white strands) and c) rubiks cube rotations (rotating along the "rubber band curves") Rigid rotations form the octahedral group. Modular rotations are defined as rotations of the white strands stabilized by exactly one vertex. We can compose these $3$ transformations together.
maybe I am misunderstanding but it seems to me that the elements are of different dimension
 
@JohnZimmerman a picture doesn't represent a group
 
You didn't answer my question.
 
Its a geometric object
 
@Jakobian well kinda
 
I'm not doing math per "kinda"
 
11:14 AM
no i mean that every group can be seen as a geometric object with group actions
 
That's too vague for me to consider
Even if I assume that every group can be seen like that, there are further questions
Even if I disregard the vagueness of what it means to be a geometric object in this case
In particular uniqueness of being represented in this way
And how its being represented
Or that the original question can be answered up to equivalence of such representations
 
@JohnZimmerman You still haven't answered my question. What is the dimension of a group element?
 
@XanderHenderson one sec I'm typing
 
11:29 AM
@Jakobian This is, I think, the more salient point. The example that is more solid in my mind is that any group can be realized as the fundamental group of some topological space (by cleverly gluing together $n$-cells), but any particular group may be the fundamental group of many different non-homeomorphic spaces.
 
exactly, this is just a rep
 
@JohnZimmerman I thought you were answering my question?
I suppose that it is possible that every group can be seen as acting on some geometric space (I'm not quite sure what this means---it is, as @Jakobian says, quite vague), but I am not sure what we get from that.
 
@XanderHenderson the dimension of a group element in a group $G$ is defined to be an element which is an orbit stabilizer of a
I give up
impossible
However, I do know that a rubiks cube rotation of the top half is a stabilizer of the bottom half
I might show that any rubiks cube rotation stabilizes halves. Of course this can be made rigorous
I'm interested in the compositions of the 3 group actions
 
11:46 AM
If you are to make a paper about this then you should be able to answer such questions. So its good practice
 
yeah I am working on it
 
Its good that you have ideas, bad that you don't ask yourself questions like that but eh whatever
 
I like to get the idea of a proof before I tunnel in to the solution
 
At least you're trying
@JohnZimmerman that's not it. I'm talking about well-definedness of concepts
Its a place before you talk about proofs or solutions
 
Consider the $\sigma$-algebra of countable or co-countable sets, i.e. the collection of subsets of $X$ that are countable or whose complement is countable. Does the set $X$ have to be uncountable? This is from Folland's book.
 
11:54 AM
@psie no
 
ok
 
But you usually care about it when its uncountable. The assumption is unnecessary, sometimes authors put assumptions like that for the same reason
Just because its the case we care about the most
 
ok, that makes sense
 
Compare for co-finite topology
 
@psie If $X$ is finite, then the collection of countable or co-countable sets is just the powerset. So no, $X$ does not have to be finite, but, like, it is boring in that case.
Ditto for countable sets $X$.
 
11:58 AM
ah, makes sense
 
12:12 PM
@psie by the way general topology is very in a similar spirit of $\sigma$-algebras, but easier
Because you have a firmer grasp on what topology is and don't need to ask set-theoretic demons if your functions are measurable
 
@Jakobian Ph'nglui mglw'nafh Caratheodory R'lyeh wgah'nagl fhtagn.
 
interesting, they say (some authors at least, including Folland I would say) that the relationship between measure and topology is not a simple one
 
@psie It isn't.
 
@psie I wasn't commenting on the relationship between them
When you mix general topology and measure theory, that's very interesting in itself
But I was commenting on the fact that considering a set with a family of certain subsets is very similar in spirit
But with measure theory you are, from the very beginning (and this is what motivates the subject) invited to consider set theory and foundations and how problematic is it when trying to study analysis
This is also seen in definition of sigma-algebra
In general topology, the subject is much simpler in this regard
 
12:28 PM
yeah, a topology seems less of a hassle than a $\sigma$-algebra. Just the construction of the Borel $\sigma$-algebra is...nonconstructive.
 
It is much less of a hassle indeed
 
12:42 PM
just started 3 bounties!
there's no better feeling than placing a bounty
it's liberating
1 is on harmonic maps, 1 is on warping functions, and 1 is on complex quotient metrics
 
1:10 PM
@psie if you say "the $\sigma$-algebra generated by the open sets" I agree, but if you do the transfinite recursion construction to get the stratified hierarchy, then I'm not sure I agree with its unconstructiveness
 
ok :) good point
 
1:33 PM
Never mind that
The point is sigma-algebras are way more complicated
And part of it is because they can't be generated by few simple steps
To generate topology you need just two steps
To generate sigma-algebra you need omega_1 steps
 
2:34 PM
@XanderHenderson what's the name for a measure space with topology on it
 
@Jakobian I'm not sure that I know of a term off the top of my head. Generally, there is not much point in talking about such an object---either the topology is compatible with the measure (so, like, you have Borel measure on a topological space), or the topology is not compatible with the measure, and bad things happen.
 
the case here is a Borel measure, yeah
okay I guess that's a good phrasing
actually no that's still too long for the post I'm editing
 
2:50 PM
eh I'm done editing it. I guess its alright
I was pretty sure I've seen the concept of a topological space with a measure being named something before though
 
3:02 PM
@SineoftheTime I don't think he is that much old yet, but ofcourse this was a great opportunity for him.
 
I think it was "metric measure space"
but I suppose that's not entirely the same
 
@SoumikMukherjee not that much old but now there's the new generation also. And maybe Magnus will play in the candidates if Gukesh wins the WC
 
That will be awesome
 
3:20 PM
hi
Consider the vector space $M_2(\Bbb R)$ and consider the following subset:
$$V_n = \left\{ \begin{pmatrix} a & b \\ c & 0 \end{pmatrix} \in M_2(\mathbb{R}) : b = -na + c \right\}, \quad \text{with } n \in \mathbb{R}$$$(a)$ Verify that $V_n$ is a subspace of $M_2(\Bbb R)$ for every $n \in \Bbb R.$

I need to show that it satisfies the three properties that define a vector subspace:
1) $V_n$ contains the null vector.
2) $V_n$ is closed under vector sum.
3) $V_n$ is closed under multiplication by a scalar.
I have a doubt about what I did next, now I'm writing
If I wanted to determine the size $V_n, \forall n \in \Bbb R$
The dimension of a vector space is effectively the number of linearly independent vectors that generate it.
 
@Pizza I would encourage you not to use multi-line comments in chat. When they get long, they gain a scrollbar, and it is not possible to see the entire comment all at once. It is frustrating to read. I would suggest breaking things up. E.g. ask the question, then give your responses to each of the three parts in separate comments.
 
@XanderHenderson I sent it just to get an idea of ​​what I'll send now. You can also delete it afterwards
I'll send something short now
 
@Pizza I see no reason to delete it. I am just expressing the fact that what you a have posted doesn't fit, making it harder to read. Personally, this makes me less inclined to bother to read it.
 
I read it, all good here. ;)
 
okok
 
3:26 PM
It seems to me that you have concluded that $V_n$ is a vector subspace of $\mathbb{R}^2$ for any $n\in\mathbb{R}$. That was what the exercise asked you to show. So you are done, n'est-ce pas?
 
no its this
If I wanted to determine the size $V_n, \forall n \in \Bbb R$
The dimension of a vector space is effectively the number of linearly independent vectors that generate it.
If i sub my constraint for b, I would get a matrix
depending on $a$ and $c$.
And then i can split it into a linear combination of $a$ and $c$ and determine a basis.
 
Size is not the same as dimension...
 
@Jakobian those are a thing. They are used to abstract and formalize the "concentration of measure" phenomenon that happens on spheres
 
@XanderHenderson ok, in this case i mean dimension
i didnt know size was a different thing
 
@AlessandroCodenotti Among other things. Fractal analysis is all about metric measure spaces.
@Pizza "Size" is ambiguous. Usually, it means either cardinality, or something like diameter or measure.
 
3:29 PM
Fair enough, I just know about the concentration business as it comes up in topological dynamics
 
@XanderHenderson yes the translator translated it like this, I thought it was like this
 
@AlessandroCodenotti I apologize, I was not trying to argue with you. I was just adding another data point. The phrase "Let $(X,d,\mu)$ be a metric measure space" shows up a lot in my thesis.
@Pizza So you don't really care about any of the exercise you reproduced above, you are just asking about the dimension of that space, yes?
What have you done in that regard?
 
Oh no offence taken, I didn't think you were trying to argue! I was just giving more context for why I've heard about them
 
If i sub my constraint for b, I would get a matrix
depending on a and c.
And then i can split it into a linear combination of a
and c and determine a basis.
 
@AlessandroCodenotti Yay! We are all happy people!
:D
 
3:32 PM
so
$\left\{
\begin{pmatrix}
1 & -n \\
0 & 0
\end{pmatrix},
\begin{pmatrix}
0 & 1 \\
1 & 0
\end{pmatrix}
\right\}$
then using this : The dimension of a vector space is effectively the number of linearly independent vectors that generate it.
so its 2?
n is a constant
 
Okay. So you seem to have solved your problem. What is the question?
 
if instead of doing this
wait
\begin{pmatrix}
a & -na+c \\
c & 0
\end{pmatrix}
could i consider the free variables
so the dimension of $V_n$ is equal to to the number of free variables needed to define a matrix in $V_n$
?
 
That is not an unreasonable way of thinking about it, I suppose.
 
Maybe it's an "uglier" way?
 
@AlessandroCodenotti yes but I was looking for a word for topological spaces
but while I have you here
I remember there was a word for spaces $X$ such that $d(X) = |X|$ i.e. the density agrees with cardinality
do you remember how they were called?
or maybe I'm wrong about there being such word
what the person was asking is a particular case of, does there exists a topological space $X$ with $c(X) = \omega$ and $d(X) = |X| = \kappa$ for every cardinal $\kappa$
I believe this is false
Certainly its non-metrizable for $\kappa > \omega$ and if such space is Hausdorff then $|X|\leq 2^{\chi(X)}$ which means that the character of $X$ needs to be large if $\kappa$ is large
this would also means that the weight $\chi(X)\leq w(X)$ would have to be relatively large
 
3:52 PM
Having chosen a value $n \neq 0$ , determine a basis $B$ of $V_n$. Theoretically, the one I obtained before would already be fine as a basis for $V_n$, right? this:
$\left\{
\begin{pmatrix}
1 & -n \\
0 & 0
\end{pmatrix},
\begin{pmatrix}
0 & 1 \\
1 & 0
\end{pmatrix}
\right\}$
 
@Pizza Well, are those vectors linearly independent? and do they span the space?
 
$\text{basis means}$: spans entire space & linearly indepdnent.
so yes?
 
Okay, then.
 
i mean is not required to "assign" a value to $n$
 
00:00 - 16:0016:00 - 23:00

« first day (5028 days earlier)