« first day (2818 days earlier)      last day (2198 days later) » 
00:00 - 11:0011:00 - 00:00

11:00 AM
well it's both a subspace and a quotient?
 
How can I find all the ring homomorphisms from $(\mathbb{Z}, +, \cdot)$ to $(\mathbb{Z}, +, \cdot)$ where $+$ and $\cdot$ are the usual addition and multiplication on the integers? So far I can only see that the idenity map on $\mathbb{Z}$ is a homomorphism
More specifically if I let $S$ be the set of all ring homomorphims from $(\mathbb{Z}, +, \cdot)$ to itself I need to write all the elements of $S$ down and then prove that the list of elements if complete
 
hmm okay :D The exact sequence looked nice, but then the second map is not well-defined because continuity is not guaranteed.
I'm not sure in which other way we could express this by an exact sequence.
@Perturbative If $\varphi:\mathbb{Z}\to\mathbb{Z}$ is a ring homomorphism, what is $\varphi(1)$? What is $\varphi(-1)$? What is $\varphi(2)$?^^
You can compute this (and any other value) using some basic properties of ring homomorphisms.
 
$\varphi(1) = 1$, $\varphi(-1) = -\varphi(1) = -1$ and $\varphi(2) = \varphi(1+1) = \varphi(1) + \varphi(1) = 1 + 1 = 2$
Hmmm, so there is only one ring homomorphism?
 
Correct! So in general, what is $\varphi(z)$?
Yes.
 
It seems that $\varphi(z) = z$
So it must be the identity map on $\mathbb{Z}$
 
11:13 AM
Yes, because you always can write $z$ as the sum of $z$ ones, possibly multiplied by $-1$.
 
Wow that's quite an indirect way of showing that the idenity map is the only homomorphism :p
 
Right.
I couldn't think of anything more direct :D
 
Thanks! @lattice
 
No problem :)
 
11:28 AM
It holds that $C(\mathbb{R})$ is a Banach space, or not? Then $f_n(x)\in X\subseteq C(\mathbb{R})$. So a Cauchy sequence $\{f_n\}$ of $C(\mathbb{R})$ converges to $f\in C(\mathbb{R})$.

It is left to show that if $f_n$ is $T$-periodic then $f$ is $T$-periodic.

Suppose that $f$ is not $T$-periodic, then $f(t)\neq f(t+T)$ for $t\in \mathbb{R}$.

Since $f_n$ is $T$ periodic, we have that $f_n(t)=f_n(t+T)$. We take the limit $n\rightarrow\infty$ and get $f(t)=f(t+T)$, a contradiction.

That means that a Cauchy sequence $\{f_n\}$ of $X$ converges to $X$, and so $X$ is complete.
 
Yes, to my knowledge this is correct.
I think $C(\mathbb{R})$ is one of the most prominent Banach spaces.
 
Ah ok! How could we prove that $C(\mathbb{R})$ is a Banach space? @lattice
 
What complex numbers might be eigenvalues of a linear operator $T$ such that $T^2-5T+6I=0$?
 
11:44 AM
@Mary Star I think this is something you do in any calculus class, showing that Cauchy sequences of continuous functions converge uniformly to a continuous function.
 
$C(\mathbb{R})$ meaning continuous functions? Keep in mind that you'll need to restrict to bounded ones
Otherwise the sup norm may not be finite
 
Yo @Daminark and @AlessandroCodenotti
 
But with that taken into account yeah it's just the standard business from calc that uniform limits of continuous functions are continuous
Hey @Perturbative!
@Alessandro do I sense a nerd?
 
@Dami @Alessandro I have a question for you guys, when you guys are studying for some (specifically) pure maths test, do you guys memorize any ideas for long proofs before hand? Or do you guys just rederive the proofs on your own?
 
Ah right @Daminark! Then it does help to consider $X$ as a subspace of $C([0,T])$ :D
 
11:50 AM
Like yesterday in my algebra test, we were asked to prove that if $R$ is a unital commutative ring, then $R/I$ is a field if and only if $I$ is a maximal proper ideal of $R$, and the proof took me 6 pages to write out and there were some tricks that were used in the proof that I would'nt be able just to derive on my own in say an hour or so
But then again my lecturer's just walk up to the board and are like "Okay dokey I'm just gonna rederive the whole proof by hand" without missing a trick just off the top of their heads
 
For that I example I know that the main idea is the corresponence between ideals in R containing I and ideals downstairs
The details can be improvised
 
So what I do to prep for a test is basically try and derive the simpler proofs on my own by hand and for the longer proofs I try and make notes of the general ideas and then rely on myself to fill out the nitty-gritty details in the test
 
It kinda depends. Fundamentally, some proofs have a central idea, and if you're experienced enough in the subject, you sorta associate the theorem with that idea in your mind. What you mention above is sorta like that
I'd you're familiar with algebra and work in it, the fact that intermediate ideals correspond to ones in the quotient is second nature, it's almost the first thing that comes to mind when thinking about the quotient
You may hear a professor say something to the effect of "We do the only thing it even makes sense to try"
That's the business at play. Once you have certain associations that you're really used to in your mind, you make them immediately, and then bam the pieces have exactly one way that could hope to work. But earlier on it's much trickier
But yeah as for other proofs, some just aren't at all of that sort
 
Thanks for the advice! @Dami
 
Sard's theorem is one of those things that people have to either memorize the proof of, not care, or do but with a reference close at hand. And yeah you're welcome
I think I'll take a nap at this point, have a good morning everyone!
 
12:05 PM
Nobody ever looks at the proof of Sard
 
Not even joking, I've gone through that section in Milnor's book like twice, and haven't even bothered to look at it
 
12:51 PM
@Perturbative 6 pages to prove that R/I is a field iff I is maximal?
 
Yeah, my lecturer wanted us to basically prove every statement we made
 
still...
well your lecturer doesn't want you to prove everything from the axioms does s/he
 
In order to proof that $C^0_c$ is dense in $L^p$, I cannot use convolution cant I?
 
Not really but like we had to show stuff like $0_R + I \neq 1_R + I$ within the proof
 
Assume R/I is a field. Let J be an ideal between I and R. If it contains an element not in I, say x, then x+I is not zero in R/I, so it has an inverse, i.e. y+I such that xy+I=1+I, i.e. xy-1 in I. xy-1 is in J and x is in J, so 1 is in J, so J=R.
Let I be a maximal ideal. For any non-zero x+I in R/I, (x)+I is an ideal properly containing I, so (x)+I=R, so xy+i=1 for some i in I and y in R, so xy+I=1+I, i.e. x+I is invertible. Therefore, R/I is a field.
Lemmas used:
1. x+I is zero in R/I iff x in I.
2. 1 in J iff J=R.
3. (x)+I is an ideal.
I don't think I need 6 pages to prove those lemmas...
@Perturbative did I miss anything?
 
12:58 PM
Hmm I don't think so
That's actually really slick
Part of the reason why it took 6 pages long was because we have to motivate every thing we did
Like if x is in I, then for us to say -x is in I we'd have to say something like, "since I is an ideal and thus also a subgroup it follows that -x is in I"
 
@quallenjäger you can use convolution to show that $C^\infty_c$ is dense, which is better
 
@0celo7 For that to work, I need to show $C_c$ is dense
because I need to use the strong continuity of the translation of $f$
 
@Perturbative heh
 
@quallenjäger what, that $\| f(\cdot -y)-f\|_{L^p}\to 0$?
 
Now imagine doing that at every logical step in the proof
 
1:06 PM
why do you need that?
 
Yes
Exactly that, and in this step I need to show the strong continuity
And the way I proof the strong continuity involves the denseness of $C_c$
 
so it's possible to prove that using the proof that $C_c$ is dense :)
You need Lusin
ah, you do need continuity of translation
 
So my question is, can I proof somehow the strong continuity without using $C_c$ is dense
and then proof $C_c$ is dense by convolution.
 
doesn't seem so
 
So no point to spend time to think about this?
 
1:15 PM
to prove continuity of translation you need to prove that your function is "almost continuous" using Lusin's theorem
but that's the same idea as showing $C_c$ is dense
@quallenjäger yeah, probably not
 
@LeakyNun, please help with this:
2 hours ago, by Silent
What complex numbers might be eigenvalues of a linear operator $T$ such that $T^2-5T+6I=0$?
 
I thought first about Lusin too. But what you said makes sense
thanks
 
Sanity check: if I have a ring $R$ and an ideal $I$ then $\dim R/I\leq\dim R$ is obvious, where $\dim$ is the Krull dimension, right?
 
@AlessandroCodenotti primes in R/I are also primes in R
contraction retains primes
 
@quallenjäger I thought I knew a proof without Lusin but it uses continuity of translation implicitly
 
1:18 PM
Yeah that's what I thought
 
@Silent let $Tv=\lambda v$. What can you say about $(T^2-5T+6I)v$?
 
and that seems to be a hard proof without using the density
 
It's an exercise so I wasn't sure whether it was straightforward or I was missing something
 
And lusin just gives me nearly almost every where isn't it?
But not almost everywhere
 
@quallenjäger yeah, continuous on a closed set of arbitrarily small comeasure
 
1:22 PM
@LeakyNun $λ^2-5λv+6v$
 
@Silent and on the other hand it is equal to what?
 
What would be the argument to extend it to almost everywhere?
 
I don't think it's true almost everywhere
 
for $C_c$ i need almost everywhere isn't it?
Yes, it is not true in general. I agree that.
 
The proof that C_c is dense is standard
what book are you using
 
1:26 PM
Stein
Stein Real analysis and Functional analysis
 
I don't have that one
 
To be honest, I didn't remember where I learned this. I just noticed that when I wrote the proof for something else.
 
I wonder, is this in Federer?
Has to be
 
Yes, might be.
I have also read this one.
Federer was a very hard book.
 
@LeakyNun $λ^2v-5λv+6v=0$, so assuming $v\ne 0$, since we are interested in eigenvectors, $λ^2-5λ+6=0$, so only possible eigenvalues are $2$ and $3$. How do we know that these are eigenvalues indeed?
 
1:29 PM
you read federer?
 
Geometric measure theory?
yes
 
@Silent we don't.
but the eigenvalues must be those.
 
I read first the Frank Morgan version
In order to understand the federer
 
@LeakyNun So all we can say is there is no eigenvalue other than 2 or 3? That's it?
 
right
 
1:31 PM
thank you!
 
I have to express doubt if you claim to understand it
I don't think this is in there, but it's in every other book on measure theory
You always need Lusin
 
I need a result from that book, namely approximate a Lipschitz-function by a $C^1$ function.
I only read until there.
 
How can I go about showing $F$ is continuous in the above example?
 
@Perturbative use a basic integral convergence theorem
 
What integral convergence theorem do you mean? It's a Riemann Integral in the above question
 
1:37 PM
Riemann integration is continuous wrt. uniform convergence
 
Okay so then I'd need to show that $k$ is uniformly convergent, $f$ is uniformly convergent and the product $kf$ is uniformly convergent
Then I'd get continuity of $F$?
 
2:04 PM
@Perturbative yes, that works
@Perturbative equivalently you can show it's bounded
 
x^2 + e always greater than x^2 +1 , therefore maximum value of $\ln(\frac{x^2+e}{x^2+1})$ should tend to infinity.
Why is my reasoning wrong?
Could you please tell me @LeakyNun ?
 
as x goes to where?
 
@LeakyNun x is real
Hi @Alisha bot
 
@Abcd How can I //help?
 
@Alisha i dont know if you can even help me, do you know maths
 
2:16 PM
@Abcd How can I //help?
 
@Alisha //help
 
@Abcd How can I //help?
 
//help
 
###################### Help ######################

==================== Commands
//about          | Let me tell you a little about myself...
//alive          | Used to check if the bot is working
//appul          | Apples.
//ban            | Bans a user from using the bot. Only usable by hardcoded bot admins
//ban-room       | Blacklists a room
//blame          | No description was supplied for this command
//declare        | Changes a commands status. Only commands available on the site can be edited
@Abcd How can I //help?
@Abcd How can I //help?
 
bye alisha ttyl
@LeakyNun Are you there?
 
2:18 PM
4 mins ago, by Abcd
x^2 + e always greater than x^2 +1 , therefore maximum value of $\ln(\frac{x^2+e}{x^2+1})$ should tend to infinity.
I don't understand the question
how can the "maximum", a fixed value, tend to anything
please just give me the original question as stated in your book
 
@LeakyNun Okay, how to find the range of $f(x)= \ln((x^2+e)/(x^2+1))$
 
aha
firstly $\ln$ is defined only when the argument is positive
(which it is, so no worries about this)
you might want to use partial fractions
 
yes
@LeakyNun why is my reasoning incorrect?
ln is increasing function
 
oh I deleted my original answer to your question
 
and our argument is increasing too
 
2:20 PM
I wanted to say "it does not follow" but I didn't type it
 
34 secs ago, by Abcd
@LeakyNun why is my reasoning incorrect?
 
how do you know your argument is increasing?
x^2+e is always greater than x^2+1, that is right
 
@LeakyNun yes
 
but this only means that (x^2+e)/(x^2+1) is always greater than 1
did i say partial fraction; I didn't mean partial fraction
I mean using polynomial division
 
@LeakyNun x^2 +e is just going to increase till infinity whats the problem with that :/ ?
 
2:23 PM
@Abcd it is, but so does x^2+1
so how do you conclude that (x^2+e)/(x^2+1) also goes to infinity?
 
@LeakyNun because x^2 +e always greater than x^2 +1
 
2 mins ago, by Leaky Nun
but this only means that (x^2+e)/(x^2+1) is always greater than 1
 
Given $f(x)=\frac{ln(x)}{x^s}$, where both x,s are real numbers and $x>0$ and $s>1$. How do I determine the intervals of monotonicity of $f$? I found $f'(x)=x^{-s-1}(1-s\cdot ln(x))$ which means that $f'(x)=0\implies x=e^\frac{1}{s}$. I want to check when $f'(x)>0$ and $f'(x)<0$. Normally I would plug some number larger and some smaller number into the function to see if the function is decreasing or increasing. How can I do it with this function?
 
@LeakyNun Okay, thanks.
@LeakyNun You might want to answer his question.
 
@Sirmimer use second derivative test
 
2:30 PM
Thanks @Ocelo7
 
@LeakyNun Can I also use the second derivative test to conclude on what intervals the function is decreasing?
 
sure
 
why do you need the second derivative test for increasing/decreasing
 
well couldn't you plug in x=1
you know that 1 = e^0 < e^(1/s)
 
I'm just a bit confused on the task. I tried plugging in $e^{\frac{2}{s}}$ and $e^{\frac{0}{s}}$, to check if the intervals around the critical point $e^{\frac{1}{s}}$ is decreasing or increasing or neither. But I can't really make sense of the results and evaluate it properly.
@LeakyNun hmmm good idea. Let me give that a try
 
2:40 PM
@LeakyNun What about the minimum value?
 
@Abcd have you used polynomial division?
 
@LeakyNun no, I used y' and y''
I got the maximum value
 
just use my method will you
 
sure
@LeakyNun quotient is 1 and remainder e-1
 
and then express (x^2+e)/(x^2+1) using that result
 
2:44 PM
@LeakyNun it becomes x^2+e
 
that isn't what i mean
 
x^2+1 + e-1
 
and then split it
 
@LeakyNun into?
 
split the fraction
 
2:47 PM
@LeakyNun 1+ (e-1)/(x^2+1)
 
can you find its range now?
 
@LeakyNun Sure, what about my method though?
 
obviously slower than my method
 
I found the corrcet maxima using my method
 
doesn't mean it's faster
 
2:49 PM
@LeakyNun its okay, how to find minima using my method?
 
no idea
it isn't really a minimum
it can never be attained
 
@LeakyNun open interval...
 
right
 
1
Q: Upper Derivative and Increasing Function on a Compact Interval

user193319 Definition. For a real valued function $f$ and an interior point $x$ of its domain, the uppper derivative of $f$ at $x$ denoted by $\overline{D}f(x)$ is defined as follows: $$\overline{D}f(x)=\lim_{h\rightarrow0}\left[ \sup \left \{\frac{f(x+t)-f(x)}{t}: 0<|t|\leq h \right \} \right]$$ I am ...

2
Q: Vitali Covering Lemma Proof

user193319 Why may we assume that each interval in $\mathcal{F}$ is contained in $\mathcal{O}$? What warrants this reduction? Why is statement (4) true? If $x \in E - \bigcup_{k=1}^n I_k$, then $x \in E$ and $x \notin I_k$ for every $k=1,...,n$. Given some $\epsilon > 0$, there exists $I \in \mathcal{...

2
Q: Corollary 5 in Royden-Fitzpatrick's Real Analysis: Convergence in Measure

user193319 Corollary 5: Let $\{f_n\}$ be a sequence of nonnegative integrable functions on $E$. Then $$\lim_{n \to \infty} \int_E f_n = 0 ~~~~~~(5)$$ if and only if $$f_n \to 0 \mbox{ in measure on } E \mbox{ and } \{f_n\} \mbox{ is uniformly integrable and tight over } E ~~~~~(6)$$ H...

 
3:13 PM
@LeakyNun evaluating $x=1$ gives $f'(1)=1$ so f is increasing in the interval $(0,e^\{1}{s})$. Now I simply need to figure a way to evaluate the other interval next to the critical point $e^\frac{1}{s}$ (like the idea you got with $1=e^0>e^\frac{1}{s}$. Is that correctly understood?
 
right
 
Alright, thanks
@LeakyNun I just noticed something. Wouldn't evaluating $x=1$ mean that $f$is increasing on the interval given that $(e^\frac{1}{s}),\infty$? As $1>e^\frac{1}{s}$?
I just noticed something. Wouldn't evaluating $x=1$ mean that $f$ is increasing on the interval $(e^\frac{1}{s},\infty)$? given that $1>e^\frac{1}{s}$?*
 
1 < e^(1/s).
 
Oh yeah.. My bad.
 
3:46 PM
Is 0 the only exact 0-form ?
 
@LeakyNun I tried to evaluate at $x=e^s$ as $e^s>e^\frac{1}{s}$.

So $f'(e^s)=\frac{1-s\cdot ln(e^s)}{e^{s^{-s-1}}}<0$. Because the denominator is >1 and if s=1 then $s\cdot ln(e^s)=0$, but as $s>1$ and log is always increasing for $ln(s), s>1$ then $s\cdot ln(e^s)>1\implies f'(e^s)<0$.
 
don't really want to check your calculations...
 
And therefore $f$ is decreasing on the interval (e^(1/s),∞).
No problem Leaky Nun. Maybe someone else will and if not it's fine. Thanks for your help
 
4:12 PM
or wolfram alpha will @Sirmimer
 
 
1 hour later…
5:29 PM
Hey guys, in joint probability P(x,y) is the same thing as P(y,x) right ? The ordering here doesn't matter because they both mean "the probability of x and y happening together at the same time", yes ?
 
 
1 hour later…
6:35 PM
what is the laplace transformation of log_10( f(t) )? What I found in google is just log_10(t) and not log_10(f(t))
I'm dealing with logarithmic system
log_10(y(t)) = a * log(x(t)) + b
and I need to find the transfer function, Y(s)/X(s)
 
6:54 PM
@0celo7, why are there no more eigenvalues other than $1$ and $-1$ here?
 
@Silent definition of symmetric and antisymmetric
and the transpose map satisfies $T^2=id$
 
hello
 
so that forces the eigenvalues to satisfy $\lambda^2=1$
 
@0celo7 Wow! that was very clear. Thank you!
 
7:16 PM
More generally, that should work for any involution (a map which squares to the identity)
 
7:35 PM
@Semiclassical you mean for involutions, even if not linear? Sorry, what do u mean by generally?
 
I mean that any map that squares to the identity should only have eigenvalues $\pm 1$
For instance, suppose you were talking about functions. Then the map $P$ such that $Pf(x)=f(-x)$ will have eigenvalues $\pm 1$ corresponding to even/odd functions of x.
 
@Silent he means a linear map
@Semiclassical don't use eigenvalues for nonlinear maps
 
ok
 
that's confusing terminology
 
Yeah, fair.
Not much point talking about $Af=\lambda f$ if $A$ isn't linear.
 
7:39 PM
at least not at Silent's level
PDEs like that are common though
 
Right.
 
nonlinear ones that is
Yamabe equation is $Lu=\lambda u^{(n+2)/(n-2)}$
need to solve for $u$ and $\lambda$
 
here $L$ is linear but the RHS isn't
there's probably an example of the reverse
 
yeah
you can also do stuff like spectra of pencils of operators
 
7:41 PM
pencils?
 
In linear algebra, if A 0 , A 1 , … , A l {\displaystyle A_{0},A_{1},\dots ,A_{l}} are n × n {\displaystyle n\times n} complex matrices for some nonnegative integer l {\displaystyle l} , and A ...
wrooong liiink
fixed
that's for matrices, of course, but the extension to operators is obvious enough
that's a topic I only know at the level of the definition, though
 
at least the previous link wasn't porn
 
I missed it
 
it was some alt-right site :P
 
7:46 PM
I'm shook
 
I'm probably being captain obvious, but you can look at the edit history :P
searching for matrix pencil stuff brings up some applications to the Schrodinger equation with a periodic potential, so I guess that's how I'm familiar with it
 
 
1 hour later…
9:25 PM
hello
is 1 a limit for (1/n) in topology endowed by $\{]a,b],a,b\in R\}$
i say as 1\n is small than 1 , 1 has a chance to be a limit
but i think that i can't find $n_0$ such that $1\n \in ]1-r,1]$
but how i can prove this
 
10:07 PM
@AlessandroCodenotti have you an idea please
 
 
2 hours later…
11:48 PM
"The original article was written as a partial human translation of the corresponding French article."
lol?
 
00:00 - 11:0011:00 - 00:00

« first day (2818 days earlier)      last day (2198 days later) »