« first day (3234 days earlier)      last day (1806 days later) » 

4:00 PM
that's what you actually use most of the time
 
inequalities? what are they?
i only do topos theory thank you
 
something like that
 
There's a great pair of quotes I saw juxtaposed once and haven't been able to find them since
1) "Every nontrivial equality is the result of two inequalities."
2) "To deduce an equality from two inequalities is to learn nothing."
(paraphrased)
I'm not doing them justice tho
I want to say one of them was by Noether?
 
@user170039 if $J(R(G))=0$, then your argument might actually work, I think, since then the map $R(G) \to \prod_{\text{$S$ simple $R(G)$-module}}S$ is injective. simple $R(G)$-modules are of the form $S=R(G)/M$ for $M$ a maximal left ideal. As $M$ is a maximal subgroup by your subgroup/ideal correspondence, $R(G)/M$ is a simple abelian group
 
@RyanUnger Exercise 3.32 in Brezis
 
4:04 PM
@RyanUnger my eyes
 
It says that in a uniformly convex Banach space projections onto a closed convex set exist and are unique
 
If you stand on some train tracks and stare head on at them, then step left and keep staring at the train tracks, is the image you see then the action of a transformation in the isometry group of projective space $\mathbb{R} \mathbb{P}^3$
 
(finding the source of those quotes bugs me every time I remember them, and I never manage it)
 
I'm not sure but I think reflexive Banach space might be enough, is the first proof of 5.2 (also in Brezis) using more properties of Hilbert spaces or just reflexivity?
 
In algebra, when one says a = b, it is a tautology and so uninteresting; while in analysis, when one says a = b, it is two deep inequalities. —attributed to S. Bochner

If one only proves a = b by showing a ≤ b and b ≤ a, one has not understood the true reason why a=b.
—attributed to E. Noether
 
4:08 PM
@user170039 nevermind, $R(G)$ is always a radical ring
 
@bolbteppa Uh. I mean, I guess you can say that.
 
I always liked the contrast between those two views
 
Cool
 
Isometries of $\Bbb{RP}^n$ aren't complicated, they all come from isometries of the universal cover $S^n$. Indeed, it's $SO(n+1)/\{\pm I\}$
 
Right but relating that to DaVinci paintings is the hard part ;)
 
4:10 PM
So if you have a pair of lines in $\Bbb{RP}^n$, under some isometry they get mapped into some other pair of lines. This is the same as the situation with two great circles in $S^n$ (indeed, there's a "commutative diagram" of these four configurations)
 
actually there's an algebraic way to prove inequalities for integers: prove divisibility relations, there are some deep and difficult proofs in NT (namely CFT) that prove a=b by proving that a divides b and b divides a
if you use the analytic proofs for the first and second inequalities in CFT you get actual inequalities and if you use the algebraic proofs you get divisibility relations
 
The isometries of Euclidean space are translations, rotations, reflections and combinations of them - can you think of the isometries of $\mathbb{R} \mathbb{P}^n$ somewhat similarly?
 
Isometries of $S^n$ are generated by rotations about codimension $2$ planes and reflections. These project to isometries of $\Bbb{RP}^n$.
 
@MatheinBoulomenos yeah, and I'd count that as still being in the spirit of those quotes. just a different partial ordering than usual
 
You shouldn't think of $\Bbb{RP}^n$ as the stratified $\Bbb R^n \cup \Bbb{RP}^{n-1}$ when talking about isometries; that's not the right picture. The top stratum $\Bbb R^n$ there is not Euclidean.
 
4:13 PM
@Semiclassical I was referring to the "in algebra" and "in analysis" part of the first quote
 
ahhh
@RyanUnger reason I was wondering was because of an old statistics paper (1937) where they set up the notion of a vector space with inner product (not quite the L^2 case I gave, but closely related) but don't talk about finite second moment. But it's a rather informal paper, so I suspect that omission isn't to be taken seriously
(or "it's obvious that you exclude random variables with infinite variance, since this ensures that the inner product is well-defined in the first place")
 
[hmm](https://en.wikipedia.org/wiki/Projective_orthogonal_group#Odd_and_even_dimensions)
"In odd dimension, $SO ( 2 k + 1 ) ≅ P S O ( 2 k + 1 ) = P O ( 2 k + 1 ) , {\displaystyle SO(2k+1)\cong PSO(2k+1)=PO(2k+1),} SO(2k+1)\cong PSO(2k+1)=PO(2k+1)$, so the group of projective isometries can be identified with the group of rotational isometries.

In even dimension, $SO(2k) → PSO(2k)$ and $O(2k) → PO(2k)$ are both 2-to-1 covers, and $PSO(2k) < PO(2k)$ is an index 2 subgroup. " seems you need to be more careful interpreting the isometries in projective space
 
@BalarkaSen @bolbteppa me being an algebraist, I'd want to emphasize that the reason every isometry of $S^n$ projects nicely onto $\Bbb R \Bbb P^n$ is that $\Bbb{RP}^n$ is the quotient of a central element in the isometry group of $S^n$, namely $-I$. If you quotient by a non-central subgroup of the isometry group (e.g. in a lens space), then only elements in the centralizer of that subgroup project to isometries on the quotient
 
(The slightly annoying thing for purposes of describing the paper is that it's not quite "L^2 w/r/t probability measure" in the way I just said. Instead they take the equivalence relation to be "equality a.e. up to a real constant" and the inner product to be E[XY]-E[X]E[Y]. Still a Hilbert space but a quotient of L^2.)
 
@MatheinBoulomenos $\Bbb Z_2$-equivariant isometries of $S^n$ as the same as the isometries of $S^n$, sure.
 
4:23 PM
yeah, that was my point, I know it's trivial, but only a posteriori if you know that isometries are linear
 
Not sure how to notate that, come to think of it. $L^2(\text{probability space})/\mathbb{R}$?
 
@bolbteppa projection gives a surjective group homomorphism $SO(n) \to PSO(n)$, so you have to compute the kernel. If $A$ is an isometry of $S^n$ that acts trivially on $\Bbb R \Bbb P^n$, this means that $Av=\pm v$ for all $v \in S^n$, by continuity, the sign is constant, so $A=\pm I$, but if $n$ is odd, then $-I \notin SO(n)$
 
Hmm, right
 
of course, you have to specify if you care for orientation or not
 
In another matter: I've heard the name Kullback before, namely with reference to the Kullback-Liebler divergence. (not that I know what that is, but I've heard that phrase before)
what I hadn't connected until recently was that he was also an important WW2 cryptanalyst
I knew Turing was (ofc) but there's other important names in math which passed through there
 
4:34 PM
Can anyone tell me why is it obvious that the result of integration does not depend on a cell we are choosing? I think I can rpove this but it would require several lemma's and this is far from being obvious.
 
test: $\supp{f}$
nuts
note that $\operatorname{supp}f\subset I^k$. Then $\int_{I^k} f =\int_{\operatorname{supp}f} f+\int_{I^k\setminus \operatorname{supp}f}=\int_{\operatorname{supp}f}$
is there anything wrong with that? feels like I may be making things too easy
 
yeah I don't have that property
about additivty
 
the only thing I have is a definition of an integral on a cell and that it does not depend on the order of integration. That's it and the page that I've linked
I thought of taking two cells, and making out of them a third one like this:
 
Occasionally in algebra you show $a=b$ by showing $a\mid b$ and $b\mid a$
 
4:46 PM
Yeah, that's the mental image I was coming up with as well
 
Well, $a=b$ up to a unit
 
but you would also need to prove that you can integrate on little cells and they that add to a big one after that you take that "---" ones and show that integral vanishes on them
 
still seems like you'd need to be able to invoke $\int_{I^k+J^k}f=\int_{I^k} f+\int_{J^k}f$
 
yeah
 
that seems like it should be easier to show than what I wrote, though, since supp(f) isn't appealed to explicitly
 
4:48 PM
you do need additivity of the integral over the domain
I mean it's not hard, if you have two cells $I, J$ containing the support of $f$, you can refine to $I \cap J$. Then break $I \cup J$ into little cells such that $I \cap J$ is one of em
Integral of $f$ over $I$ = integral of $f$ over little cubes = integral of $f$ over $I \cap J$ (because integral over the other cubes is zero, as $f$ is zero there)
Similar for over $J$
That says $\int_I f = \int_J f$, like you wanted
 
hello someone have have an idea
>Let $E$ a compact metric space and a function $f:E\to E$ such that $$ \forall x,y \in E, d(f(x),f(y))\geq d(x,y)$$
Let $a\in E$ and a sequence $(f^n(a))$ , prove that $a$ in an adherent value of $(f^n(a))$.
 
What's an adherent value
Oh, an element of the closure?
 
a limit of a subsequence
 
I think I have an idea
Let $\epsilon=\inf_nd(a,f^n(a))$
We want to prove $\epsilon=0$
Now, for all $m$ and $n$, we have that $d(f^m(a),f^n(a))\ge\epsilon$,
because (wlog $m<n$) we have $d(f^m(a),f^n(a))\ge d(a,f^{n-m}(a))\ge\epsilon$
 
5:04 PM
this I don't understand it
how you found this
@AkivaWeinberger how we prove $d(f^m(a),f^n(a))\ge d(a,f^{n-m}(a))\ge\epsilon$
 
@AlessandroCodenotti huh, that needs uniformly convex banach
also I remember we've talked about Brezis before
 
We know $d(f(x),f(y))\ge d(x,y)$, right?
If we substitute $x\mapsto f(x)$ and $y\mapsto f(y)$, we get $d\big(f(f(x)),f(f(y))\big)\ge d(f(x),f(y))$
Combining the two we get $d\big(f(f(x)),f(f(y))\big)\ge d(x,y)$
Yeah?
 
@AlessandroCodenotti It seems like he''s just using reflexivity for existence (which is what I want)
 
So $d(f^2(x),f^2(y))\ge d(x,y)$
You can use the same argument and induction to show $d(f^m(x),f^m(y))\ge d(x,y)$
Now let $x=a$ and $y=f^{n-m}(a)$
 
5:23 PM
I understand it
@AkivaWeinberger
but what is the contradiction
 
Every element of $\{f^n(a)\}$ is a distance of at least $\epsilon$ from every other element
 
hello everyone!
 
I'm pretty sure it's impossible to have infinitely many points in a compact space, each of which is a distance${}\ge\epsilon$ from every other (for some $\epsilon$)
I don't remember how to prove this
Hey Subhasis
 
@AkivaWeinberger then you’d have infinitely many disjoint epsilon balls
So the space can’t have finite diameter
 
$\epsilon/2$ balls
 
5:30 PM
Same difference
 
This isn't a subset of $\Bbb R^n$, so that's still possible for a space with finite diameter
 
@RyanUnger yes, that was my impression too
 
Consider the metric $d(x,y)=1$ for $x\ne y$ on an infinite set
 
But it seems like just Banach is too weak
 
The discrete metric
But note that, despite being complete and bounded, it's not compact
 
5:32 PM
intuitively, given those balls, you would extend the radii enough to make it a covering without being able to cover by any proper subset
but I can't quite make it work properly
 
@RyanUnger yup, we talked about a few books (I still look at DiBenedetto's real analysis for basically every analysis doubt I get)
 
The discrete metric might mess things up yeah
 
It's Poline's question, anyway, they can finish it
I'm gonna take a ridiculously early bus tomorrow morning to Tel Aviv
 
@AkivaWeinberger how early is that?
 
5:45
I'm gonna drop my suitcases off at a friends house, then I'm gonna go up to Haifa where I'm gonna stay 'till Sunday morning
 
5:34 PM
so a bit earlier than the train I take most days, which is at 6.15 :)
 
Then I'm gonna take a bus back down to Tel Aviv, say hi to family, explore the city, and sleep at the house where all my suitcases are
Same the day after
Monday night I need to be at the airport
and then right after midnight, so technically Tuesday but barely, the plane leaves
and then some hours later I land in New York
and thus concludes my year in Israel
 
sounds like quite a trip
 
Most of this (tomorrow through Sunday morning) is just me hanging out in Haifa
Two summers ago I was in Argentina for five weeks
(so it was winter there)
A family there hosted me at their house
Two parents and a tiny two-year-old daughter
This year I learned they moved to Israel
(to escape the awful economic situation in Argentina)
I've been to their house twice this year
I wanted to say hi to them one last time
so that's this weekend
 
5:51 PM
I have a question regarding a proof of Uncountability of perfect sets in $\mathbb{R}^k$.

In the proof given in the picture (from Rudin), he takes $(i), \ (ii), \ (iii)$ almost for granted (that's what it felt like. Either I am missing something really elementary, or it was left as an exercise, sort of).

So, here's how I try to justify the claims made:

$P$ being a perfect set, and $V_n$ having a nonempty intersection with $P$, we can write $V_n \cap P = \{x_{r_1}, x_{r_2}, ..., x_{r_n}, ...\}$.
@AlessandroCodenotti , @AkivaWeinberger , could you please check this out?
it's been bugging me
 
I think what you said works
Yeah I guess he didn't go through the details
I say "draw a picture" a lot
but I'm a hypocrite because usually I just imagine a picture of the situation and that's enough
 
hello @TedShifrin :)
 
hi @SubhasisBiswas
 
When I was going through Rudin I really did need to get out a piece of paper and actually draw this stuff
 
and hi @Tobias, DogAteMy, et al.
 
5:59 PM
Heya
 
Hard to draw pictures of perfect sets, though, in general. :P
 
Hi @TedShifrin
 
@TedShifrin IN GENERAL
i can draw a line though
 
I mean, an interval is a perfect set.
 

« first day (3234 days earlier)      last day (1806 days later) »