« first day (2755 days earlier)      last day (2563 days later) » 

Sam
Sam
15:05
Hello
@Akiva u learning riemannian fam
Haven't actually started yet, had a small vacation
I continued a tiny bit into a measure theory thing I had though
Sam
Sam
Can someone explain this to me I think Im being a retard.
I have two vectors: a,b. I can rewrite ||a-b||^2 as (a-b) . (a-b) which is fine. But, on the example I'm looking at, they expand it out further:
a . a -* a . b - b . a +* b . b . I've put an astrix next to the minus and plus signs because I'm unsure why those operators are used. Should it be a . a + a . -b - b . a - b . -b Or am I being stupid?
Assume the period is dot product.
15:12
my knowledge of measure theory is infinitisimal
Hmm where did I put my glasses
@Sam the expression you wrote and in the example are equal
rearrange some minus signs
a . (-b) = - (a . b)
- (b . (-b)) = + (b . b) 'cuz (-1)*(-1) = 1
Found my glasses
@AkivaWeinberger Do you want to hear a story
Sure
^ That's the book, by the way. Real Analysis for Graduate Students
15:16
So once upon a time there was a manifold
The "affordability" bit means a) it's self-published and b) there is the occasional typo in the math
Oh yeah I've heard of Bass
you're in treble
Not like misspelled words, like a $\cap$ where there should be a $\cup$, stuff like that
Sam
Sam
Ok kinda get that. But not the 'cuz (-1)*(-1) part
@BalarkaSen Why?
15:17
just making dumbjokes.jpeg
Arright
It's pretty good so far, to be honest
Daminark and Eric knows that book I think
@Sam Well - (b . (-b)) = -(- (b . b)) = (-1)(-1)(b . b) = b . b
@Daminark @EricSilva I a book have
Oh speak of the devil @Daminark
Whoa hey whatup
Sam
Sam
15:19
Ah got you. Thanks a lot for clearing that up
Sup @Daminark
Okay so my story was this
$(M, g)$ be a Riemannian manifold
That is to say, for each $x \in M$, $g_x$ is an inner product on $T_x M$ and they vary smoothly (i.e., for any two smooth vector fields $X, Y$ on $M$, $f(x) = g_x(X, Y)$ is a smooth function on $M$)
Maybe I should have explained how to define smooth vector fields?
You can if you want
15:25
Here's an indirect definition like the smoothness of the metric. Let $X$ be a vector field on $M$. If for any smooth function $f : M \to \Bbb R$, the directional derivative $g(x) = D_{X(x)} f(x)$ defines a smooth function $g : M \to \Bbb R$ too, $X$ is said to be smooth
There are other ways to define it but hopefully that suffices
Are you corrupting @AkivaWeinberger
"Smooth" means $C^\infty$ here? @BalarkaSen
(I'm back)
oh bass is dec
15:37
Suppose that $n \in \Bbb{N}$ is such that $(n-1)$ divides $n$. I am having trouble showing that $n$ must be $2$. Clearly it cannot be $n=1$, for this would imply $1=0$, a contradiction. How do I rule out the $n \ge 3$ case?
$\gcd(n, n-1) = 1$
What numbers does $n-1$ divide?
I'm bored
@AkivaWeinberger Only multiples of $n-1$.
$0$, $n-1$, $2(n-1)$, $3(n-1)$, etc., right?
If $n>2$, then $2(n-1)>n$.
So none of the things on that list can equal $n$; the first two are too small, and the rest are too big.
That's one way to do it, anyway; @ÍgjøgnumMeg's thing is another way
15:41
Hey
To spell his thing out: If $n-1$ divides $n$, it also divides $n-(n-1)$
which means it divides $1$
The only thing that divides $1$ is $1$, so $n-1=1$, so $n=2$
That's a better way, actually
@Balarka, @Mathein, @Akiva strangely, I was asleep when you said hello
And yeah Bass is excellent
@AkivaWeinberger Ah! Yes! Very good. Thanks!
Arright @Daminark
You agree with me on the occasional typo, right?
I'm not very far in, I just finished the chapter in which he defines the Lebeg integral
15:43
It has happened, yeah
Hey, you know the exercise that says,
> Suppose $A$ is a Lebesgue measurable subset of $\Bbb R$ and$$B=\cup_{x\in A}[x-1,x+1].$$Prove that $B$ is Lebesgue measurable.
We don't need $A$ to be Lebesgue measurable, do we?
Are you sure? That union doesn't have to countable
uncountable unions are craaazy
Of constant length intervals, though?
upon reflection you do not need A to be measurable no your intuition was right
15:50
Wait I forget my reasoning though
$B \cap [n, n + 1]$ is fairly tame
and measurability of that suffices
Ah, yeah, that makes sense. It's either two intervals or the whole thing
Is it wrong if I write "Lemma 1 [bla] Proof: this is a routine verification [...] Lemma 3 [bla] Proof: the proof is similar to Lemma 1"
@XanderHenderson
see above
Like, $[n,\alpha)\cup(\beta,n+1]$, where the round parentheses might be square
15:53
i guess the question wanted you to make the easy argument only available when its measurable (decompose into 3 things that are obviously measurable)
Right, I see it now
Incidentally:
I'm pretty sure that $\mu^*(A_n)$ doesn't${}\uparrow\mu^*(A)$ in general
$\notuparrow$ looks disturbingly similar to a really tall stickman
or whatever the command was
\not\uparrow
$\not\uparrow$
maybe from a distance idk
\not{\uparrow}?
Consider the outer measure on $\Bbb Z$ with $\mu^*(\emptyset)=0$, $\mu^*(\Bbb Z)=2$, and $\mu^*($anything else$){}=1$. That's an outer measure, right?
15:56
$\not\not\uparrow$
For reference
And then if $A_n$ is any collection of sets that $\uparrow$s to $\Bbb Z$, then we have a counterexample
did he mean to prove it for measures
it's true there
But then the second part of the exercise wouldn't make sense
Right?
right yeah it wouldnt lol
Are there errata for this book somewhere
@EricSilva Actually, I'm looking at the "Version 3.1" pdf that's online, and it looks like he fixed it there
"You must restart your system before using Adobe Reader again"
God dammit I didn't ask for this update
Right, OK, I'm holding the "Second Edition"
16:06
right he has errata for that one on his page
damn bass is on top of it
Kinda annoying that I'm not holding the "right" version
I'mma have to climb back through all the errata once I'm done reading this
Or skim through the most current version online and see what's different
@0celo7 The simple solution is not to use Adobe Reader
@XanderHenderson what do I use
What OS are you using?
win10
16:19
This is a list of links to articles on software used to manage Portable Document Format (PDF) documents. The distinction between the various functions is not entirely clear-cut; for example, some viewers allow adding of annotations, signatures, etc. Some software allows redaction, removing content irreversibly for security. Extracting embedded text is a common feature, but other applications perform optical character recognition (OCR) to convert imaged text to machine-readable form, sometimes by using an external OCR module. == Multi-platform == === Converters === These allow users to convert PDF...
I don't know windows, but there are lots of free ones out there
adobe is free
free as in speech, not free as in beer
I've used the Linux version of Evince, and it seems fairly useful
@EricSilva If a set function sends every nonempty set to infinity, it's a measure, right?
And it sends the empty set to zero
very useful measure
16:24
No I'm trying to understand a change Bass made
@AkivaWeinberger Sure... just check the axioms: it is a set function, sends the empty set to zero, and is otherwise additve
what'd he change
some authors do require that there be at least one set of finite positive measure, however
He added "and $\mu(B)$ is finite for some non-empty $B\in\mathcal A$."
That didn't use to be there.
maybe it was just to throw out the trivial case
16:26
well, it is (wait for it, @0celo7) "trivial" in the other case
It's trivial, obvious, well-known, and routine to check.
(though I'm using trivial in both the vernacular and technical sense, here)
the zero measure and the infinite measure are both trivial measures that can be defined for any space! Yay!
Speaking of trivial things, do there exist topological spaces $X$ such that the only continuous maps $f:X\to X$ are the trivial ones (identity function and constant functions)?
With more than two elements.
would you take a set with THREE elements?
(even there, I think that the answer is "no") :\
With more than one element is what I meant
Hm, wait, Sierpinski?
Oh wow
Hm OK with more than two elements then
16:33
finite spaces are for nerds cough @Daminark cough
Or maybe I should just specify "Hausdorff"
What about Sierpinski?
Right, Sierpinsky would work, since swapping the two elements isn't continuous
that was the two element example I had in mind
but I'm not sure that I see how to generalize beyond two elements
but I'm kind of slow, so that doesn't mean anything :)
actually... what if you just nest the open sets? $\{ \emptyset, \{0\}, \{0, 1\}, \{0,1,2\} \}$? doesn't that work?
swapping any two elements is discontinuous, no?
Can't you map $2\mapsto1$ and keep the other two the same?
$f(2)=f(1)=1$, $f(0)=0$
16:39
oh, shit
yeah
I wasn't thinking of locally constant functions :\
THE POWERSET IS TOO BIG!
$f(2)=2$, $f(1)=f(0)=0$ would work as well
yeah, I was only thinking about permutations---I wasn't tracking the locally constant guys
Wait a moment
@Slereah was talking about something like this a while ago
except it was no nonidentity automorphism, rather than no nonidentity, nonconstant map
What's better than adobe, they are all horrible and blockey
@EricSilva 0_0
16:54
get rekt punk
Who needs infinitely many points in your $\rm\Bbb RP^2$ when you can have a perfectly good finite approximation with just 13
i guess youre right
i am now a finite topologist and renounce analysis
is @Daminark into combinatorial topology or what
Norman Wildberger approves of algebraic topology now
16:58
@bolbteppa I don't know for Windows; for Mac, the already-installed Preview works well, and I rather like Skim
@Daminark what an icon
@0celo7 I'm not really into anything at the moment, I've had a small taste of a bunch of things, but I did have a reading course which started off talking about how you can jump back and forth between finite spaces/posets, small categories, simplicial sets, etc
@Daminark He has a course on algebraic topology on YouTube
but a PDF VIEWER which requires a system reboot for an update is crap...

« first day (2755 days earlier)      last day (2563 days later) »