« first day (2842 days earlier)      last day (2474 days later) » 
00:00 - 17:0017:00 - 00:00

00:00
most likely yes --- technically i have to pass my quals first... but assuming things go well then yes
in imperial?
no in the US
mind disclosing where?
just curious
would you recommend any book / material to me?
on?
algebraic geometry
although I do have a number of interests other than algebraic geometry
algebraic topology and logic and commutative algebra, I suppose
ok, the latter is just a tool in algebraic geometry
00:04
oh. I don't really know anything other than the standard ones e.g. vakil, hartshorne
if you want some more classical things first for more intuition then eg shafarevich
I see
i should mention that imperial has a lot of really good algebraic geometers so you should talk to them if possible e.g. by doing a UROP
indeed
well some people like algebra for their own sake .. so i wouldn't say they're just a 'tool' in algebraic geometry
which one is Hilbert's basis theorem? that R[X] is noetherian or that R[X1...Xn] is noetherian?
I mean, can I say that the latter is also the theorem?
00:07
sure? they're equivalent anyway
alright
do you have any advice for me in regards to finding a place to live for year 2?
you might know this already - but kind of the whole significance of nullstellenstatz (i guess for what i'm about to say - technically just weak nullstellenstatz) is that instead of thinking about points (a_1,..,a_n) in k^n, you can instead think of all the functions vanishing at a_1,...,a_n, which is given by the ideal (x_1-a_1,...,x_n-a_n), which is a maximal ideal in k[x_1,...,x_n]. so you can kind of forget this whole thing about k^n and just work with the maximal ideals of your ring.

then when you learn affine schemes you just happen to also include the prime ideals. (then schemes are
@LeakyNun uhh find friends
and then?
I'm planning to live with 3 other people
oh
then it's just a matter of finding a place to live usually through some agency (e.g. RR / Foxton? I don't rmb what they're called etc.)
@loch so you're basically saying that the classical affine space $\Bbb A^n_k = k^n$ is the closed points of the modern affine space $\Bbb A^n_k = \operatorname{Spec}(k[X_1,\cdots,X_n])$?
also, do you find issue with imperial only teaching the 1950s algebraic geometry?
00:12
yes when $k4$ is algebraically closed
oh right, the modern treatment doesn't need algebraic closure
oh you can also see if you can attend these "TCC" lectures
what is TCC?
they usually have grad level stuff - i personally never went to them but i know people who did
too advanced for me...
00:14
otoh you can also see if you can sneak into lectures given under LSGNT.
oh well you asked about non 1950s algebraic geometry - so im guessing you meant schemes and i think at some point there was a scheme theory class under tcc
@loch but not in the standard course
yeah
do you think that undergrads should not learn schemes, but instead just live in the 1950s?
imperial has an obession of making everything (in y3) accessible to anyone coming from y2
which is ridiculous
imo
eh... is that ridiculous?
00:18
i personally think it is :p but maybe im biased
and now that i think of it also dependent on lecturer
I mean, the way you stated it seems a normal thing to do
hmm you're right
so maybe let me rephrase that as the depth covered in y2/y1 isn't quite enough to do fun things
indeed, I agree with that
I mean, I read a book on group theory before I came, and then it's basically the third year course
the group theory courses are way too slow
2
Q: Prove that the origin is Liapunov Stable for the given system

ALannisterConsider the system $$\dot{x} = y \\ \dot{y} = -4x $$ ($\dot{x}$ means $\displaystyle \frac{dx}{dt}$ and $\dot{y}$ means $\displaystyle \frac{dy}{dt})$ I need to prove that the fixed point $\mathbf{x^{*} = 0}$ is Liapunov stable. For reference, according to my textbook (Strogatz), a fixed po...

Cayley-Hamilton and det(AB)=det(A)det(B) isn't proved until year 2
00:19
@LeakyNun it's easy to fall into the trap of being obsessed over learning this abstract new toy called 'schemes', but i don't think its necessary to be an expert on classical ag in order to start learning schemes
What are schemes?
former = you have no idea what's happening geometrically
latter = takes a lot of time.. (and a lot of things show up more naturally once you learn schemes)
Don't live with people. People suck.
@ALannister if you want to know the definitino you can probably look that up on wikipedia - but vaguely it's a generalisation of varieties in classical algebraic geometry where you look at zero sets of polynomials
@loch a functor from the category of open sets in a topological space with morphisms being inclusion to an abelian category :)
00:23
i think that's a sheaf
@Daminark hi
*presheaf
right, and then you need 100 conditions to make it a scheme
5 upvotes
Nice to see there are like-minded souls here
@LeakyNun well once you have a sheaf (presheaf + gluing conditions) you get a locally ringed space, and you just want this locally ringed space to look locally like affine schemes (similar to how manifolds look locally like euclidean space)
00:27
@loch I see
so on this note its also a good idea to know some things from differential geometry if you want to learn algebraic geometry
@LeakyNun ALRIGHT
I'll discord you some good stuff
00:54
what mess did I just read
a click-bait title (one-line undergraduate proof) which is hardly one-line
"Clearly" "it is manifest" "evident"
but it does have its merits
when I was reading the proof in my text I didn't realize that it is proving that Q is not a finitely generated Z algebra
01:14
@LeakyNun hello
 
1 hour later…
02:19
@ALannister this is probably is a sufficiently different line of thought so as to not be too helpful, but: the trajectories in the (x,y) plane are ellipses, since the quantity $4x^2+y^2$ is conserved by that system
They definitely are @Semiclassical I already know that.
I need help doing the $\epsilon-\delta$ proof
well, here's my line of thinking there
suppose you've got an ellipse $4x^2+y^2=\epsilon^2$; the max distance this achieves from the origin occurs when $x=0$, $y=\pm \epsilon$
Does this help me bound $\sqrt{\left( x(t)\right)^{2}+\left( y(t) \right)^{2}}$?
I think so? if I want to pick an orbit that stays within $\epsilon$ of the origin, then its initial distance had better be at most $\delta=\epsilon/2$
I see what you mean. That
That's in line with what the solution manual says, but I wanted to show it with algebra.
02:27
that's geometric in thinking, and presumably you want to get it down to algebra
yeah
not sure how to do that, which is why I'm not sure how helpful that is
But, usually geometry can help us with that
It at least makes it obvious why $\delta =\epsilon/2$ is a smart choice
Right.
Problem is I'm dealing with sines and cosines, neither of which "cancel out" using any kind of nice trig identity.
yeah, that representation you're using isn't a convenient one
an easier one might be $x(t)=\cos(2t-\phi)$, $y(t)=2\sin(2t-\phi)$
or better yet $\phi=2\tau$, with the idea being that then $(x(\tau),y(\tau)) = (1,0)$
Using the triangle inequality, I have that $\sqrt{(x(t))^{2} + (y(t))^{2}} \leq \sqrt{x_{0}^{2}\cos^{2}(2t)-4x_{0}^{2}\sin^{2}(2t)} + \sqrt{\frac{y_{0}^{2}}{4}\sin^{2}(2t)+y_{0}^{2}\cos^{2}(2t)}$
@Semiclassical murp. I'm not loving the idea of parametrization. I think that might make it harder.
02:31
Well, it'll probably be simpler to bound $x(t)^2+y(t)^2$ directly
otherwise that square root is an arse, as you've seen
Then, I can pull factor out the $x_{0}$ and $y_{0}$ from each.
for instance, one line of thinking: You can express the ellipse as $4x(t)^2+y(t)^2=4x_0^2+y_0^2$
So, that becomes $= x_{0}\sqrt{cos^{2}(2t) - 4\sin^{2}(2t)} + y_{0}\sqrt{\frac{\sin^{2}(2t)}{4} + \cos^{2}(2t)}$
and then $x(t)^2+y(t)^2=\frac14[4x(t)^2+4y(t)^2] = \frac14[x(t)^2+4x_0^2+y_0^2]\geq \frac14(4x_0^2+y_0^2)$
You can't express the ellipse here in that case.
I mean you can't express the ellipse like that here. $x_{0}$ and $y_{0}$ are constants
02:35
Sure? The point is that if $4x(t)^2+y(t)^2$ is constant, then it should be the same as its initial value
so $4x(t)^2+y(t)^2=4x_0^2+y_0^2$ is a perfectly valid representation of the ellipse
It's snot constant though. It's bounded, but not constant.
uh, $4x(t)^2+y(t)^2$ definitely is constant in the above motion
that's why it's an ellipse
$x(t)^2+y(t)^2$ isn't, of course.
So, how does this help me with my bound to get $\epsilon/2?$
yeah, there's the question :/
i mean, you can further say that $4x_0^2\geq x_0^2$
and therefore that last expression becomes $x(t)^2+y(t)^2\geq \frac14(x_0^2+y_0^2)$
Great, but it loois like your inequality is going in the opposite direction of what I want.
02:39
yeah...
well, returning to an earlier POV
If I use the parametrization i suggested earlier $x(t)^2+y(t)^2=\cos(2t-2\tau)^2+4\sin(2t-2\tau)^2$
If nothing else, that's easier to differentiate
one can go a bit further and use $\cos^2\theta = \frac{1+\cos\theta}{2}$, $\sin^2\theta= \frac{1-\cos\theta}{2}$
and therefore the above becomes $(1+\cos(t-\tau))+2(1-\cos(t-\tau))=3-\cos(t-\tau)$
bleh, i was being lazy earlier. I need an overall factor of $a$ on each of them, since I don't know which ellipse I'm on
so $x(t)^2+y(t)^2=a^2(3-\cos(t-\tau))$
Sorry, I had to leave fora while.
which is bounded above by $4a^2$, so $x(t)^2+y(t)^2\leq (2a)^2$ when $4x(t)^2+y(t)^2=a^2$
Can I say that $\sqrt{\cos^{2}(2t) - 4\sin^{2}(2t)} \leq \sqrt{\cos^{2}(2t) - 4}$?
Interesting what you say there. I'm going to mull.
02:47
well, $\sin^2(2t)\leq 1$. so $-\sin^2(2t)\geq$, and thus i'd say the inequalty is backwards
Right.
but i'm not sure even that's true, since when $t=0$ the right-hand quantity isn't real
Silly of me
What is $a$? The radius of the given ellipse?
otoh $\cos^2(2t)\leq 4\cos^2 (2t)$
It is!
02:49
no, it'd be the semiminor axis
How bou dat?
since when $x=0$ then $y=a$, while when $y=0$ then $x=2a$
so it'd have semimajor axis $2a$ and semiminor axis $a$
i was being lazy, though. what i had in mind was that I should really have written $(x(t),y(t))=(a\cos(2t-2\tau),2a\sin(2t-2\tau))$
but, ugh, I'm seeing a silly error in an earlier statement of mine. so I'd just ignore my rambling for the moment
anyways. $\cos^2(2t)-4\sin^2(2t)\leq 4\cos^2(2t)-4\sin^2(2t)=4\cos(4t)\leq 4$
Yas, children!
Which is true but I think sorta useless, since the first inequality is only saturated when $\cos(2t)=0$ and the second when $\cos(4t)=1$
Then, perhapses we can do something similar with the other doo-dad
02:55
and since $\cos(4t)=2\sin(2t)\cos(2t)$, you can't have both conditions at once
so I'm just confused
actually, why $\cos^2(2t)-4\sin^2(2t)$ not plus?
that'll be negative when $\cos(2t)=0$
Because of what the solution is
hmm
geometrically, i see how this all works
if $4x(t)^2+y(t)^2=4a^2$, then $a^2\leq x(t)^2+y(t)^2\leq (2a)^2$
that's the correct version of what I was saying incorrectly earlier
Isn't $\frac{1}{4}\sin^{2}(2t)\leq \sin^{2}(2t)$?
sure, with equality at $t=0$
a quarter of a nonnegative quantity can't be bigger than that quantity
Okay, so the second square root then $\leq y_{0} \sqrt{\sin^{2}(2t)+\cos^{2}(2t)} = y_{0}\cdot 1 = y_{0}$
03:01
one easy way to do the inequality I just said
So, overall, we have $\leq 4x_{0} + y_{0}$?
$x(t)^2+y(t)^2\leq 4x(t)^2+y(t)^2$, and $x(t)^2+y(t)^2\geq x(t)^2+y(t)^2/4=\frac 14(4x(t)^2+y(t)^2)$
so $\frac14[4x(t)^2+y(t)^2]\leq x(t)^2+y(t)^2\leq 4x(t)^2+y(t)^2$
If you let $x(t)^2 = x_{0}$?
hi
03:04
Nevermind. I'm confused.
How does this all relate to epsilon, though?
I think the delta-epsilon proof should amount to showing: If $x_0^2+y_0^2<\delta^2$ with $\delta=\epsilon/2$, then $x(t)^2+y(t)^2< \epsilon^2$
Yeah, I'm working on the algebra. Hold on.
Yeah, this works out great.
neat.
ahah, yeah: $$x(t)^2+y(t)^2 \leq 4x(t)^2+y(t)^2=4x(0)^2+y(0)^2\leq 4x(0)^2+4y(0)^2<4\delta^2$$
So if $\delta=\epsilon/2$ then $x(t)^2+y(t)^2<\epsilon^2$
03:13
You end up with $\sqrt{4x_{0}^{2}(\cos^{2}2t + \sin^{2}2t) + y_{0}^{2}(\sin^{2}(2t) + \cos^{2}(2t))}$
$= \sqrt{4x_{0}^{2} + y^{2}_{0}}$
$\leq \sqrt{4x_{0}^{2} + 4y_{0}^{2}}$, yup.
Hey, we make a pretty good team @Semiclassical
I"m going to print this convo out because my glasses keep falling off of my face, and unless I hold my computer screen right up to my face, I can't see anything.
Hence all the typos.
all the scotch probably didn't help either...
but that was hours ago, so.
You know what they say though, dontcha?
Ye olde mathe joke ---> DON'T DRINK AND DERIVE ;P
ba dum tiss.
for me right now it's more like my brain is tapped out
i'm smart enough to do geometry still, but not algebra :P
I think it's just a different part of your brain
yeah
geometry is more directly intuitive for me, i suppose
03:29
"Another useful tool for computing mass are Bartnik's harmonic coordinates. "
How do I make this sentence grammatically correct
are is
harmonic coordinates are plural
Ok, Another Other
tools
Last night dream shows a very strange maths thing (which in the dream it is a solution of a problem whose nature has drifted from my memory)
Basically, there's a function consists of off diagonal terms, and they are self similar in some way
And as the solution goes, we reach to higher and higher terms so that the previous terms become relatively insignificant in an exponential or hyperbolic manner
In addition, for every jump the function take, the oscillation became more damped, eventually after some number of jumps, the amplitude of the oscillation get damped so much that it stablised into a sinusodial thing
The solution is thus given by the total area occupied by each of those off diagonal terms (which forms a pair of black rectangles in a 2x2 rectangle formation)
As for the possible inspiration. I am suspecting:
10 hours ago, by Mary Star
user image
is the base material
and Ted's highly unexpected reply
10 hours ago, by Ted Shifrin
@MaryStar: I don't understand enough to say anything.
Is what trigger it to go into the dream possibly because it triggers Mechanism 2 (Shocking event have a higher chance to become a dream element)
This presumably mixed with step functions, voting patterns in elections where oscillations eventually stablised, functional analysis and matrix algebra to give the weird curve seen in the dream
 
2 hours later…
Zee
Zee
05:17
Dead room?
 
1 hour later…
06:45
262 pages of LaTeX in just a few minutes :)
@TobiasKildetoft hi
I just learnt Nullstellensatz
I excited
@LeakyNun Cool
so if $\alpha_i$ are >not< indeterminates, can I breakdown $k[\alpha_1, \cdots, \alpha_n]$ into $k \subset k[\alpha_1] \subset k[\alpha1, \alpha_2] \subset \cdots \subset k[\alpha_1, \cdots, \alpha_n]$?
if all of them are fields, do I have tower law?
if the last one if a field, are all of them fields?
because I'm thinking what if $\alpha_2 = 1/\alpha_1$
Hello, $|2x+3y|$ is not a distance on $\mathbb{R}$ because the first condition is not satisfied right?
first condition?
06:56
$d(x,y)=0$ iff $x=y$
right, this is not satisfied
if i suppose that $|2x+3y|=0$ then $x=-\frac{3}{2} y$
and for $d(x,y)=|arctan(x)-actan(y)|$ it is a distance
$|arctan(x)-arctan(y)|=0$ it is equivalent or just implies that tan(arctan(x))=tan(arctan(y))
@LeakyNun
right
we have equivalence directly
d(x,y)=0 iff arctan(x)=arctan(y) iff x=y
right
tan is surjective
arctan is right inverse
arctan is injective
07:12
how arctan is a right inverse ?
tan(arctan(x)) = x for all x in R
you write arctan on the right of tan
but actan(tan(x)) is not x ?
Consider the points $A=(5,7) , B=(8,2) $ and $C=(0,0) in $\mathbb{R^2}$ . How many parabolas will pass through A,B and C.
@PolineSandra so it's not left inverse
anyone please.
07:28
have you plotted the points?
@LeakyNun $|x^4+y^4|$ is not a distance right?
@PolineSandra I don't know
right, it isn't
$|x^4+y^4|=0 $ then $x^4=-y^4$ it is impossible sine $y^4, x^4$ are positive
right
@PrithiviRaj it's a good idea to plot the points because if they lie on a straight-line you'll know the answer right away.
07:38
if i consider $|ch(x)+ch(y)|$ it is also not a distance because if $x=y$ then $|ch(x)+ch(y)|= 2ch(x)$
@LeakyNun
@skull they are not co-linear , it means infinite ??
parabolas
Nope
Look for an axis of symmetry.
@PolineSandra right
07:41
these three points form a triangle
so any median can work as symmetry axis right?
why would you say that
sorry its not an equilateral triangle , let me think one more time
The symmetrical points will have the same y-coordinates.
the last one $|sinh(x)-sinh(y)|$ is a distance and for the first property $|sinh(x)-sinh(y)|=0$ iff $sinh(x)=sinh(y)$ iff $arcsinh(sinh(x))=arcsinh(sinh(y))$ iff $x=y$ @LeakyNun
right, sinh is a bijection
07:52
A=(5,7) so A'=(a',7). B=(8,2) so B'=(b',2). C=(0,0) so C'=(c',0) @PrithiviRaj
@LeakyNun please if i have that $f$ is non decreasing and $x>0$ then $f(x)\geq f(0)$ or $f(x)>f(0)$
$f(x) \ge f(0)$
Can you sketch a parabola that fits those points?
@PrithiviRaj
I found the equation of a symmetric axis as $13y=9x$ .
43 mins ago, by PrithiviRaj
Consider the points $A=(5,7) , B=(8,2) $ and $C=(0,0) in $\mathbb{R^2}$ . How many parabolas will pass through A,B and C.
can we bash this by Bezout's theorem after embedding our affine plane into the projective plane?
08:03
I haven't read that theorem , I'm an undergraduate student.
High school?
sorry, my apologies.
I was using a high school approach
the sketch is a good check :-)
I'm working on that
@skull yeah
tell me the next step after finding symm axis
the question only asks for "how many parabolas"
08:15
oh got it ! it means only 1 or 2 .
yes
so if they are two , then I have to find one more symm axis , right ?
no
They face up or down, right?
provided we are talking about functions of the form y=f(x)
34
A: Ring of polynomials over a field has infinitely many primes

lhfYou can copy Euclid's proof. Let $p_1, \dots, p_n$ be a finite collection of prime polynomials in $F[X]$. Consider $f=p_1 p_2 \cdots p_n +1$. Let $p$ be a prime factor of $f$. Then $p$ cannot be any of $p_1, \dots, p_n$ because otherwise $p$ would divide $1$. Hence, no finite collection of prime ...

still upholding the tradition not to check that the set of primes is non-empty :P
08:48
@AlessandroCodenotti hi
@AlessandroCodenotti any response to ^^^?
It's clear the set of primes is nonempty, I don't think there's any need to state it explicitely
09:06
lol
09:27
@AlessandroCodenotti X?
Depending on how much you assume known about the structure of $F[X]$ pick any nonzero element, it must have a prime factor
Or degree one polynomials, those are irreducible, hence also prime
@AlessandroCodenotti You need to start with a non-unit of course
@TobiasKildetoft oh, right, let's just stick to degree one polynomials to be sure then
proof that there is no prime in F[X] : I suppose there is no prime, and I consider the empty product plus 1 which is 2, and 2 has no prime, so there is no new prime, qed.
09:53
so can we generalize it to any euclidean domain that is not a field?
in praticular they must be infinite?
How can they have infinitely many primes if they are finite?
anyway any finite euclidean domain (any finite integral domain really) is a field so it doesn't have many primes
oh... right
@LeakyNun What do you think about UCL in terms of reputation, compared to Imperial ?
@GabrielRomon no idea
10:32
There is a thread where the comments had almost led the asker to believe that the problem had no solutions. Fortunately, there is a correct answer.
 
1 hour later…
11:34
hi
If I have a manifold $M$ with a connection $\nabla$ and a metric $g$, how is $\nabla g$ to be understood?
because $\nabla$ usually takes two vectorfields and maps them to a third
11:48
nvm
 
3 hours later…
14:31
Let $P$, $Q$ be two points on the sphere of radius 1, centered at the origin. Let $L(t) = P + t(Q-P)$ with $t \leq 0 \leq 1$. If there exists a value of $t$ in $[0,1]$ such that $L(t) = 0$ show that $t= \dfrac{1}{2}$ and that $P=-Q$.
What should I do there? Shall I simply use subtitution? I don't understand how to "prove" it. I would simply subtitute the values they gave me.
Let $e_n \in \ell^p$ denote the vector with a $1$ in the $n$-th entry and zeros elsewhere. Is $\{e_n\}_{n \in \Bbb{N}}$ a basis for $\ell^p$?
I don't think it's going to be a basis, since, in general, an element is a infinite linear combination of the vectors in $\{e_n\}_{n \in \Bbb{N}}$. However, is it true that $\overline{\mbox{span} \{e_n\}} = \ell^p$?
14:51
Yep. Here's the proof: Given $x = (x_k) \in \ell^p$ and $\epsilon > 0$, there is an $N \in \Bbb{N}$ for which $$\epsilon^p > \sum_{k=N}^\infty|x_k|^p = \sum_{k=1}^\infty |x_k - b_k|^p = ||x-b||_p^p,$$ where $b = x_1 e_1 +...+x_N e_N \in \mbox{span}\{e_n\}$.
bar is conjugate?
@Secret completion
closure
span{e_n} is dense in the whole space
I see
15:36
Hi. I am trying to prove the root criterion for sequences. What I have so far is:
By the limit definition, if $\displaystyle \lim_{n \to \infty} \dfrac{a_{n+1}}{a_n} = L $ then $\left | \dfrac{a_{n+1}}{a_n}- L \right | < \epsilon$ for all $n \geq m$. Therefore, it is also true that

$L - \epsilon < \dfrac{a_{m+1}}{a_m} < L + \epsilon$

$L - \epsilon < \dfrac{a_{m+2}}{a_{m+1}} < L + \epsilon$

$L - \epsilon < \dfrac{a_{m+4}}{a_{m+3}} < L + \epsilon$

$\quad \vdots$

$L - \epsilon < \dfrac{a_{k}}{a_{k-1}} < L + \epsilon$

Multiplying all inequalities and simplyfing:

$(L - \epsilon)^{k-m} < \dfrac{a_{k}}{a_{m}} < (L + \epsilon)^{k-m}$
It is correct? What confuses me is the last step
@Topologicalife entonces que intentas probar?
que $\displaystyle \lim_{n \to \infty} \dfrac{a_{n+1}}{a_n} = L$ implica $\displaystyle \lim_{k \to \infty} {a_{k}}^{1/k} = L$?
the last step needs something like $0 < L- \epsilon$
Lo tengo probado si logro justificar el último paso, pero me confunde.
I've proved it if I can justify the last step.
puedo leer español
15:51
When I apply the limit $k\to \infty$ I am not sure what does it happen with $a_k$
Oh, ok.
also you are not saying how you come up with $\epsilon$ and $m$
Si aplico el límite $k\to \infty$ de $(L - \epsilon)^{1-m/k} < \dfrac{{a_{k}}^{1/k}}{{a_{m}}^{1/k}} < (L + \epsilon)^{1-m/k}$ no sé cómo se comporta ${a_{k}}^{1/k}$
$m$ is fixed, and $\epsilon > 0$.
maybe you should multiply by $a_m^{1/k}$ ?
maybe don't use the same epsilon?
use the epsilon/2 trick, I think
That is not the problem.
If I apply the limit I would get: $L - \epsilon <\displaystyle \lim_{k\to \infty}{a_{k}}^{1/k} < (L + \epsilon)$ instead of $L - \epsilon <{a_{k}}^{1/k} < (L + \epsilon)$
15:56
right
That is confusing me.
do you have that $L > 0$ in your assumptions somewhere ?
the intuition is that the limit is within $L-\varepsilon$ and $L+\varepsilon$ for each $\varepsilon > 0$
so the limit must be $L$
but then you need something more to justify it
Uhm I see.
I don't think we need something more. Since $\epsilon$ is random it would be justified, yeah.
ooh I have never seen anyone say "let there be a random $\epsilon$" in a proof before
16:02
What I mean is "for all $\epsilon > 0$"
16:21
Hi!
I would like to know if the problem below is solvable or it is incorrect:
Several timbers of the length 2 m were cut into small logs of 50 sm in 4.5 hours; how long wolud it has taken if they were cut in 40 sm?
the answer is 6 hours according to the book but
I can only get 5.5 hours
16:49
how long would it take to cut them in small logs of 200 sm ?
@mercio they are 200 sm themselves.
i meant 'timbers each of the length 2m', sorry
yeah but how long would that take ?
00:00 - 17:0017:00 - 00:00

« first day (2842 days earlier)      last day (2474 days later) »