« first day (2248 days earlier)      last day (2784 days later) » 

12:01 AM
Am I being thick in this comment? math.stackexchange.com/a/1945774/137524
 
@usukidoll
24
Q: How to deal with "discomforting" downvotes?

Jack D'AurizioI have noticed that recently the downvoting spree on MSE has increased by a lot. It often occurs (also here and here) to me that, driven by my will to help people, I provide a solid proof/hint and suddenly It gets downvoted because it is "too advanced"; It gets downvoted because the OP did not ...

 
still not gonna risk it
 
Do not worry about downvoting, they do not matter ;)
 
post it on your account :)
 
well, they matter a little
but its worth it
 
12:03 AM
not gonna get messed up nope
 
not my question
 
no! So I'm just on b and c now.. yay
not on my account
nope
points matter
 
@usukidoll How does nature grow if it does not learn from mistakes?
Look at me
the experience is worth it, always
 
you take the risk. Besides it's mark wi so if there's too many mistakes I can always re-write it
re-writes are only allowed if the problem is marked wi for writing intensive
 
my hesitation for posting questions is less "am I going to get downvoted for this" and more "do i expect anyone else to be interested in this"
@usukidoll What is $S\leq R$ supposed to mean in this context? (this isn't a socratic question, i just genuinely don't know what's intended)
 
12:07 AM
semi could you give me a hint on 6b?
 
abstract algebra isn't my strong suit, so probably not.
 
well I was told that I just use the subring definition on 6a which is what I just did 2 add together 2 products identity additive inverse
which is what I did
I will mercio was back here but he's probably po'ed
 
@Semiclassical I post my questions regardless
@usukidoll Also know that your questions can attract new users looking for solutions to the same question
that is how this site grows
 
:/
 
Google search "why do we teach complex numbers" and see one of the top links is a question of mine for example
 
12:09 AM
for part c define a new subring from part a it turns out to be hte same subring as Z U R what the heck
 
@usukidoll Do you use math.SE for homework, or to learn?
 
first option but only if I attempt the problem first
 
6b does make sense in its conclusion, though. you take the subring generated by r, and take linear combinations whose coefficients are in Z
 
@usukidoll Then how will you learn to completely do it yourself?
Also, experience by answering other people's questions is quite good
 
dude. I do the problem first before asking -__-
 
12:12 AM
And very good for rep
Yeah, I understand, but asking it as a question will allow you to gain more from it
just saying
 
again, though, what do they mean when they write $S\leq R$? that's not a notation i'm immediately familiar with
 
Ah, memories... of when I first joined this site
 
@SimpleArt true
 
i could believe it just means "show that S is subring of R"
 
it was exhilarating in a very nerdy fashion
 
12:14 AM
yes S is a subring of R
 
mmkay
 
which means closure under addition, closure under multiplication, identity, additive inverse lalalallal
 
i think maybe it's simply enough to note that the subring S certainly contains $\mathbf{Z}\cup \{r\}$
and therefore also contains any element that could be generated by it.
 
how though? Isn't that subring or the element R
in set notation
 
Hey guys - can you suggest a good lin algs book that features LU factorization?
 
12:15 AM
@OneRaynyDay Hey and no sadly
 
@usukidoll i'm sorry, but I don't follow
 
isn't {r} just a single element
 
well, certainly
 
Not always?
I guess so
pft, ignore me XD
 
but it's also present in S.
 
12:17 AM
so this is what I'm thinking in set theory you either have a single element r or the subring Z
so how does this connect to Z[r]=S
Which is the subring r is equal to S which is that monster thing
 
use magic
 
pls
 
you're not making sense. $r$ is in $S$, and so is every member of $Z$
 
@TedShifrin So I think I've understood blowing up a linear subspace. Now, my remaining problem is that I'm unable to parse Huybrechts' explanation for the case of a general submanifold...
 
so therefore, every member of $Z\cup \{r\}$ is in $S$.
 
12:19 AM
so the single element r and the subring of Z is in S
 
right. that's easily checked (i.e. you can easily choose coefficients a_k to get those cases)
 
mmk. sorry I'm uber slow at proofs but I'm still trying and not giving up
so choosing the coefficients a_k we have the single element r and the subring of Z in S...hmmm
 
probably the logic then is that, since S contains $Z\cup \{r\}$, it also contains anything that these could possibly generate
 
@usukidoll Keep trying and only give up when the entire math.SE site can't help you
 
like you ^ jk
 
12:21 AM
Yup XD
 
which had S = $a_{0}+a_{1}r...$
 
what bothers me is that I feel like that only proves $\mathbf{Z}[r]\leq S$, not $S=\mathbf{Z}[r]$
 
we can just try and do that case anyway
 
though if one can prove that $S\leq \mathbf{Z}[r]$ as well, then one does have $S=\mathbf{Z}[r]$
don't know how to argue that, though.
 
so that would mean that the S which was that definition is equal to the subring of Z?
 
12:24 AM
test
 
right.
 
who is john
 
hey usuki
 
It's more subtle a question than I can really answer, though.
 
why doesn't Latex render in chat?
 
12:25 AM
you need the chatjax and mathjax bookmarkz
 
lol
 
usuki do you see Latex?
 
check out the Latex in chat link in the room description
 
top right
 
oh
 
12:26 AM
Say, I can't get the Latex to work
 
so if we had $S \leq Z[r]$ then that would mean that the definition of S is less than the subring of R
 
anyone got tutorial links or wanna explain?
 
@usukidoll yes, but I can't bookmark it
 
get out your bookmarks toolbar in firefox
 
12:28 AM
thanks
it works now ;)
 
Lol, ok
@usukidoll will chrome work?
 
so what about for c? prnt.sc/cnkpqo it's almost as if it's a all over again with some new letters
I think so
 
it's the set theory version of an obvious technique---$A\leq B$ and $B\leq A$ implies $A=B$
I really don't get what c is asking. In particular, I don't see what $r$ is supposed to satisfy.
 
let's guess on c
xD
 
lol
 
12:29 AM
$S \leq Z[r]$ means S is a subset of Z[r] ?
 
subring, is my guess
 
the hint I got for c is to define a new subring and then part a is the same subring as Z U R
 
instead of using the $ \subseteq$ notation they use $ \le $
 
Now what do I do?
 
My guess is that they meant $c_0+c_1r+\cdots c_{d-1} r^{d-1}+r^d=0$.
 
12:31 AM
Woo! Did it!
thanks
 
oh so if I could find the technique from the set theory I could apply it to b.
like for example if $S \leq Z[R]$, and $ Z[R]\leq S$ then $ S=Z[R]$
yeah they needed to add a 0
I'm sorry this worksheet is laced with typos... (not by me)
 
You probably want to check that with your lecturer. It's a real arse of a typo.
 
another professor I talked to said it needs the = 0 or it doesn't make sense
 
yeah.
 
isn't that a polynomial?
 
12:33 AM
sure. i think it's better to think in terms of linear algebra here, though
 
What is an example of a ring which has Z as a subring ?
I was thinking the real numbers.
 
@john Z isn't intended as integers here.
 
oh
 
it's just a name for some subring of a given ring R
 
Confusion is real over here
 
12:34 AM
hmm, Z is usually reserved for integers
thanks for clarifying
 
Sh, this is linear algebra apparently.
 
44 mins ago, by usukidoll
finishing this http://prntscr.com/cnkpqo
 
point being, $r^d$ is evidently a linear combination of $1,r,r^2,...r^{d-1}$
 
robjohn said: "Since $0=0^2$, $0$ is also a square. Does this mean that a circle can be a square?"
:)
 
12:36 AM
so $1,r,r^2,...r^d$ are linearly dependent (with coefficients in Z)
 
hi
 
how do you change your profile picture
 
@Semiclassical would you like to discuss algebra problem
 
@Adeek here prnt.sc/cnkpqo
 
@john go into your profile
 
12:37 AM
im there
 
and hit the edits area
 
@usukidoll I think the upshot is that, if you can generate $r^d$ using $1,r,...,r^{d-1}$
 
@Semiclassical ?
 
@adeek no thx
 
@SimpleArt i dont see any option i.imgur.com/jIJyMwK.png
 
12:38 AM
@usukidoll in that case, you don't need to allow arbitrarily large exponents of $r$ in the definition of $S$
 
@john enter one of the sites you actually use
 
like a linear combination. damn it it's been a while since I've done linear algebra that way :S
 
like math.stackexchange.com
 
you only need to use 1,r,...,r^{d-1}
 
then profile -> edits
 
12:38 AM
ok
 
should be top thing pretty much
 
ok like using $1,r,r^2,...r^{d-1}$?
 
right.
another linear algebra POV
suppose I've got a vector like $e_1=(1,0,0)^T \in \Bbb{R}^3$ and I act on it repeatedly with a matrix $T$
 
test
 
to get the sequence of vectors $e_1,Te_1,T^2e_1,$ etc.
 
12:42 AM
Has anyone done stuff on primitive recursive before? This is my homework question and I dont know how to tackle the sqrt(2) part

http://i.stack.imgur.com/2dKlz.png
 
then I can use arguments about linear dependence to argue that I can build up anything past $T^2e_1$ using just the first three
 
what is definition of primitive recursive
I would start there
 
@usukidoll Does c make more sense now?
 
so it's linearly dependent is it also possible to get ... oh wait a sec we're going beyond $R^{3}$ if I do $T^3e_{1}$
 
@john Perhaps you saved the edits only for that site. There should be an option to save edits for all networks/communities
 
12:43 AM
right. but we could do $R^{10}$, say
 
@john Sorry its a pretty long definition, I'm just throwing that question out there in case anyone has done stuff with it
 
simple, ill try again
keith, no worries.
 
in principle, I'd need to get 10 vectors like that to get a set which spans the rest of them
 
not expecting any answers haha
 
wow
so C uses matrices... I kind of got confused since it looked like a polynomial
 
12:45 AM
Ugh, that's gonna be great
 
ehh
it's not that it uses matrices.
 
@SimpleArt i tried saving to all communities
 
it's that it's using the same idea of linear dependence as you could encounter in linear algebra
 
maybe it takes time to update
 
You don't need matrices for that.
 
12:45 AM
so I just need the idea of linearly dependent
 
@john Probably
 
I took linear algebra a whilllllllllle back
2
 
Fair enough.
The point is just: The definition of $S$ in (a) permits you to use as many coefficients as you want.
 
a set of vectors is said to be linearly dependent if one of the vectors in the set can be defined as a linear combination of the others
ack latex in matrices is hard but
if we have something like

a + b = a+b
0 0 0
is that a linear combination
 
sure.
What (c) says is that you can be more economical than the definition of (a).
 
12:48 AM
ah it's starting to come back
 
XD
economical?
 
sure.
you don't need arbitrarily many coefficients if just $d$ is enough.
 
@john Why are you here btw?
 
i was invited
 
Oh?
How so?
You do realise this is a math chat?
 
12:49 AM
umm let's see so
$c_{0} \cdot r = c_{0}r$
$c_{1} \cdot r^{2}=c_{1}r^2$
$c_{d-1} \cdot r^{d-1} =c_{d-1} r^{d-1} $ like that?
 
Yes.
 
oy wait a sec should be ()()
 
._. when you think 'sec' means secant
 
Here's maybe something that'll make this seem more practical.
 
T_T
Hm, if a function is $k$-times differentiable, what happens when we try to apply L'hospital's rule? Does it work?
 
12:52 AM
Suppose I have an element of $S$, such as $1+1r+0r^2+1r^3$ where $1$ is the additive identity.
that required four coefficients.
 
why wouldn't L'hopital's rule work?
 
suppose someone then told me that, in this particular ring, $r^3+r+r^2=0$.
 
does 1 work when the exponent is odd and then 0 when the exponent is even?
 
damn my last semester of comp sci is so stacked with math. non stop math. someone kill me xd
 
if its an exponential function, taking derivative doesn't reduce the power
 
12:54 AM
in that case, I can rewrite the above as $1+r+(-r-r^2)=1+0r+(-1)r^2$.
so i really only needed 3 coefficients, not 4.
 
@john it at the very least, can't work after $k$ iterations if the function is only $k$ times differentiable
@KeithYong Sorry, that's a question for education.stackexchange
 
the same would also hold if I had something like $1+r+r^{9999}$. at first glance, that requires 10000 coefficients (most of them 0).
 
because
1
r
(-r-r^2) are the three coefficients right
 
do you have a specific example in mind. its hard to speak about it generically
 
12:56 AM
@usukidoll no.
the coefficients are 1,0,-1
 
oh right right.....
because 1 +r-r-r^2
1+0r-r^2
1 0 -1
sorry spaced out
 
@john No, the question is in general
 
if I had r^4, i can write that as $r(r^3)=r(-r-r^2)=-r^2-r^3=-r^2-(-r-r^2)=r$
similarly for r^5, r^6, etc. I can write all of these just using some combination of 1, r, and r^2
 
geezus only now I figured out part b... gawd I hate that $ \leq, \geq $ notation
 
so therefore, I don't need all 100 coefficients to express something like $1+r+r^2+\cdots +r^{99}$. there must be coefficients such that $$1+r+r^2+\cdots +r^{99}=c_0+c_1 r+c_2 r^2$$
doesn't mean I know them off the top of my head, but I know they exist.
on the other hand, if I didn't know $r^3+r^2+r=0$, it could be that i really do need all those coefficients
 
1:01 AM
@SamuelYusim Sup
@Semiclassical Are you using polynomials of $r$?
 
@Simple Art
here is an example (e^x - e^(-x))/ (e^x + e^(-x))
 
yeah, though mentally I'm thinking of them just as vectors in a vector space. (probably i should be thinking modules not vectors spaces, but w/e)
 
@SimpleArt more like vector space
 
$ \lim_{x \to \infty} \frac{ e^x - e^{-x} }{ (e^x + e^{-x}}$
$\large \lim_{x \to \infty} \frac{ e^x - e^{-x} }{ e^x + e^{-x}}$
 
@john Um, you sure that's not infinitely differentiable?
 
1:04 AM
not sure why you'd need lhopital for that
 
Yeah, what he said ^^
 
you can apply Lhopitals repeatedly and get no closer
 
Uh...
True...
 
I'm starting to head over to b again with the $Z[r] =S$ stuff which is actually if $ S \subseteq Z[r]$ and $ Z[r] \subseteq S$ then $Z[r]=S$ which in set theory the elements are the same
 
But... that's not the question
 
1:05 AM
your condition is that it is only k times differentiable
 
@usukidoll I can't help there, I think.
 
hypothesis*
 
I'm considering functions that are only $k$-times differentiable, not infinitely differentiable.
Infinitely differentiable I already understand
 
@SimpleArt A concrete example would probably help.
 
Lemme think for a moment
 
1:07 AM
something in the direction of $|x|^3$, maybe
 
ax^k / bx^n, where n > k
 
Yeah, that's a good one
 
need it to be an odd exponent for the absolute value to make a difference
 
Z[r] is a subring is contained in S
S is contained in Z[r] which is a subring
so the elements are the same hmmm
 
1:08 AM
Consider: $\lim_{x\to0}\frac{|x|^3}{|x-4|^3+64}$
With L'Hospital's method
Hm, maybe should've used different powers, but oh well
 
@usukidoll I think the term module is relevant here
should that be $-64$?
 
Nah, $+64$ to make the denominator $0$ as $x\to0$.
 
ummmmm
 
|-4|^3+64 != 0
 
1:10 AM
Right
minus 64
Pft, confusing absolute values
 
right
 
>_>
 
hah
I don't think that example gives you what you want, though.
 
What was the statement again, I didn't catch it earlier.
 
after all, $|4-x|=4-x$ for $x$ near $0$
 
1:11 AM
yeah, probably right
 
Something about k differentiable functions.
 
I probably want some piece-wise functions
 
that limit is zero as x goes to zero
 
some limit @john not really interested
I'll make a better one, gimme a second
 
@john what he intended was $\frac{|x|^3}{|x-4|^3-64}$
 
1:13 AM
yes. The limit is zero
 
but the denominator of that one is analytic at $x=0$, so it's not a good example anyways.
 
$\lim_{x\to0}\frac{f(x)}{|x|^3}$ where $f(x):=\begin{cases}x^3 & ;x>0 \\ x^5 & ;x<0\end{cases}$
 
Sanity check: one can have an injective linear map $\Bbb R^n\to E$, $E$ some infinite-dim vec sp.
 
the limit from the right is 1, the limit from the left is zero.
 
XD
So L'Hospital's rule can't work?
How many times can i apply it?
 
1:14 AM
didn't say anything either way.
i'm just eyeballing it.
 
lol. also a bad example
whatever, i'll pioneer tomorrow
ciaou
 
a non analytic k differentiable smooth function
 
" k differentiable smooth function" does not make sense
 
@john yes, those
 
$f(x)=
\begin{cases}
e^{-1/x}& x> 0\\
0& x\le 0
\end{cases}$
 
1:15 AM
k-times smooth
 
^ not an actual term
 
$ f(x)= \begin{cases} e^{-1/x}& x> 0\\ 0& x\le 0 \end{cases}$
$1=\lim_{x\rightarrow 0^{+}}\frac{f(x)}{f(x)}=\lim_{x\rightarrow 0^{+}}\frac{f'(x)}{f'(x)}=\lim_{x\rightarrow 0^{+}}\frac{f''(x)}{f''(x)}\cdots =\frac{0}{0}=?$
 
@0celo7 sure, $(x,y,z)\mapsto (x,y,z,0,0,\cdots)$ being an obvious example.
kind've feel like i'm sticking my foot in my mouth there. not sure why.
 
When someone says "smooth divisor", does it mean a divisor of the form $D=[Y]$ where $Y$ is a smooth hypersurface?
 
math paranoia, i guess
 
1:20 AM
whats that semiclassical, an example of
what is that an example of
@Semiclassical
 
6 mins ago, by 0celo7
Sanity check: one can have an injective linear map $\Bbb R^n\to E$, $E$ some infinite-dim vec sp.
 
Hi @MikeMiller
 
well I'm just gonna finish 6c up and just eat lunch :P
at least I tried. would rather get partials than 0 but like I said the problems with WI are eligible for a re-write
so yeah
 
@Semiclassical Yes.
 
oh nice
my pfp updated
usuki why is your pfp so much bigger
 
1:30 AM
idk?
k this bs assignment is done
really hated #6
 
1:50 AM
@0celo7 I don't understand your question.
Hi @Danu
 
Which question?
@MikeMiller I do have a question, though. Kobayashi-Nomizu say that if a Lie group $G$ acts effectively on $M$, then the map $\mathfrak g\to\mathcal{X}(M)$ that sends $A$ to its fundamental vector field is an isomorphism. They prove that it's injective, but I fail to see how it's surjective.
$\mathcal{X}(M)$ is infinite-dimensional unless I'm messing something up.
Perhaps they just mean an isomorphism onto its image.
 

« first day (2248 days earlier)      last day (2784 days later) »