« first day (2504 days earlier)      last day (2813 days later) » 

18:00
for sine
y=1 at 90 degrees
and y = -1 at 270 degrees
right?
and for x, x = 1 at 0 degrees, and x = -1 at 180 degrees
Right. So they have the same ranges, but the max/min occur at different angles
okay that makes sense.
One thing to note from that: x has a max/min only when y is zero
$a_{0}(0,0+1) = a_{0}(0,1) = a_{0}(0,0)^+=1^+=0^{++}$

oops $1^+\neq 1$
need to fix
Same if they're swapped
18:02
Oh right
that makes sense
that's much more intuitive
Now, for the 2x part
Right.
so the equation was $y=3sin(2x+\pi)-1$
and the question was "what does each parameter do"
and it says that $2x+\pi$ means that the graph is shifted $\frac{\pi}{2}$ to the left.
It does. But eh, I don't like that approach
sorry typo
What they're noticing is that $2x+\pi=2(x+\pi/2).$
18:05
@arctictern I was wondering have you read Eisenbudd commutative algebra ?
\begin{align}
0 & =\emptyset\\
a_{0}(0,0) & = 1 = \{0\}=0^+\\
a_{0}(0,1) & = 1\\
n > 0: a_{0}(0,n+1) & = a_{0}(0,n)^+ &\\
m > 0: a_{m}(0,n+1) & = a_{m}(0,n)^+ &
\end{align}
oh, that makes sense.
much better
but then shouldn't it be horizontally compressed by a factor of $1/2$
it works, certainly.
Yep!
18:06
@Adeek nope
oh I see.
btw, is the successor operation allowed to be multivalued?
So there's two effects
So what's a better way of seeing that.
how would you do it?
oh ok @arctictern I am just solving AM, so I was wondering I want another text in commutative algebra which is maybe more dense and covers more stuff. So, I was thinking of Eisenbudd.
18:07
The better imo is to note that $\sin(A+\pi)=-\sin A$.
@Secret of course not.
So you can think of it as flipping the sine function
So it starts at zero but is decreasing not increasing
so then it starts at y = -1
Right. The offset isn't affected by any of this, to be clear.
right.
so that would make our equation $-sin(2x)$
18:10
right.
You'll still have a horizontal compression
of 1/2
and then how do you infer the shift?
Well, in this case there is no shift.
is it because each "rotation" is $\frac{\pi}{2}$
so by flipping it
18:12
We've gotten rid of it at the price of that minus sign
so then our equation is
$-3sin(2x)-1$
I see.
because the -3 makes it reflected in the x-axis.
alright, I think I'm pretty prepared.
Keep in mind: the flip is at the level of the oscillation.
Now I'm just worried about having enough space to write answers
18:14
It will still bounce back and forth around -1.
It's just that it will initially move down from -1 rather than up.
To connect the two approaches, it's enough to note that flipping your sine oscillation is the same as sliding the graph left by half an oscillation
The answers are the same.
so if the graph of a curve starts on the y axis, then it is a cosine
\begin{align}
0 & =\emptyset\\
a_{0}(0,0) & = 1 = \{0\}=0^+\\
a_{0}(0,1) & = 1\\
S & =\{1,a_{0}(0,3),a_{0}(0,5)\}\\
n > 0: a_{0}(0,n+1) & = a_{0}(a_{0}(0,n),S) \\
a_{m+1}(0,n+1) & = a_m(a_{m+1}(0,n),S) \\
a_{0}(0,\omega) & = \sup(a_{0}(0,n)|n\in \Bbb{N})\\
a_{m}(\omega,\omega) & = \sup(a_{m}(\omega,n)|n\in \Bbb{N})\\
a_{1}(\omega,0) & = a_{0}(0,\omega)\\
a_{m}(\omega,1) & = a_{0}(0,\omega)\\
a_{m+1}(\omega,2) & = a_{m}(\omega,\omega)\\
a_{1}(a_{m}(\omega,n),0) & = a_{m}(\omega,n)\\
m>q>1: a_{q}(a_{m}(\omega,n),1) & = a_{m}(\omega,n)\\
right?
well I guess it could be either, but that'd be easiest
like if I had to determine a function that models the height of a chair
whose lowest point is 0.5 and highest point is 22.5
and takes 60 seconds to make a full rotation
then $11cos(\frac{\pi}{30}x)+11.5$
18:17
Well, angle zero means that you're st the point (1,0) on the unit circle. So that's y=0 not x=0
right.
O wait, I cannot define $S$ before it is defined
That'll work. Just keep in mind: with that function, where does it start and what does it do immediately after?
\begin{align}
0 & =\emptyset\\
a_{0}(0,0) & = 1 = \{0\}=0^+\\
a_{0}(0,1) & = 1\\
S & =\{0,\{\{0\}\}\}\\
n > 0: a_{0}(0,n+1) & = a_{0}(a_{0}(0,n),S) \\
a_{m+1}(0,n+1) & = a_m(a_{m+1}(0,n),S) \\
a_{0}(0,\omega) & = \sup(a_{0}(0,n)|n\in \Bbb{N})\\
a_{m}(\omega,\omega) & = \sup(a_{m}(\omega,n)|n\in \Bbb{N})\\
a_{1}(\omega,0) & = a_{0}(0,\omega)\\
a_{m}(\omega,1) & = a_{0}(0,\omega)\\
a_{m+1}(\omega,2) & = a_{m}(\omega,\omega)\\
a_{1}(a_{m}(\omega,n),0) & = a_{m}(\omega,n)\\
m>q>1: a_{q}(a_{m}(\omega,n),1) & = a_{m}(\omega,n)\\
decreases
starts at 22.5
18:19
ok this should work, since putting sets into another set is always well defined
(0,22.5)
@Secret Just what are you doing with those poor sets?
So this wouldn't work if you wanted it to start at the bottom
@Secret Just what is the domain of the function $a$?
like, $S$ isn't even an ordinal.
18:20
right
Nor if you wanted it to start halfway in between and be rising/falling
okay, that makes sense.
it asks me what the endpoint would be after 135 seconds.
but my calculator is giving me like 20
and it says the suggested answer is 17
Hi. Kolmogorov extension theorem (KET) says that finite-dimensional distributions (fdd's) determine the distribution of the process.. now what I'd like to do is to specify conditional (on a discrete random element) fdd's and to say something about existence of the corresponding process. I suppose that the problem itself makes sense and the KET is not directly applicable, right?
right, I'm getting 22.166
18:23
$a_{b}(c,d)$, $b \in \textrm{On}$, $c \in K$ where $K$ is anything constructed by this procedure (thus it can take the function a as argument), and $d\in \Bbb{N} \cup \omega \cup S$

$S's$ existence is so that I can step up the right argument d without defining another function. Think of it like -1 in programming
my calculator is in degrees
should it be in radians?
nah
My guess is it's a sine versus cosine thing
Actually, though
:/
A bit of a problem: given vectors $\mathbf v_1,\mathbf v_2,\dots,\mathbf v_n,\mathbf w\in\Bbb Z^6$, I'm trying to generate $c_1,c_2,\dots,c_n\in\Bbb Z$ with $c_1\mathbf v_1+\dots+c_n\mathbf v_n=\mathbf w$ such that any satisfying combination of the $c_i$ has non-zero probability of being selected. Any ideas on how I'd do this?
Ah, yes. You have pi/30
18:25
right
So my object should be a proper class that is well ordered, and adjoined with $S$
So you've written it in terms of radian measure
So yeah, better use radians. Or, alternatively, write it as 180/30 = 6
If you do the latter then degrees are fine
but if I change to radians it only gives me 11.5
no matter what input I put in
oh nvm
@Secret So how would $a_0(0,2)$ be evaluated?
Fixed it?
18:29
$a_0(0,1)=1$

$a_0(0,2)=a_0(a_0(0,1),S)$
no, now I'm getting 11.5 m at 135 seconds
and the suggested answer is 17
@Secret Okay, so $a_0(1,S)$? Where would you go from there?
but now if I put 60 into the equation, I get 22.5
which is what I should be getting
Yeah, and so am I :/
hi/rehi chat
18:29
so do you think they have it wrong?
I guess I am as prepared as I will be, I am leaving in 15 minutes to drive to the test location.
What I notice: if 60 secs per revolution the 135 is 4.5 rotations
right
so it should be halfway?
ok, that's... currently undefined. So hard to count all possibilities with 4 arguments
or
22.5 + 0.5 / 2
It should have moved through half a rotation.
18:31
so 11.5
O wait a sec...
then they have it wrong.
$a_0(1,S)=a_0(a_0(0,1),S)=a_0(0,2)$
Thanks again semi
I
Only thing I can think of is that the chair doesn't start at 22.5 at t=0
18:32
forgot that 1 is expressed in terms of $a$
will let you know how it goes.
Good luck !
and that reminds me...
it says "start the chair at the highest point"
$c \in K - S$
18:32
You are the best tutor in the world, Semi.
@Secret ...but that's then a circular definition
$a_0(0,2)=a_0(a_0(0,1),S)=a_0(1,S)=a_0(a_0(0,1),S)=a_0(0,2)$
Oh, wait. That's 2 and a quarter rotations
if h = 17, then 11cos[pi/30(x)] = 5.5
So a quarter of a rotation. That seems more plausible.
18:34
hm.
A quarter rotation yields cosine =1/\sqrt(2)
@Secret And don't you mean $d\in\Bbb N\cup\{\omega,S\}$?
@LegionMammal978 ok in that case that does not work, need to think...
...yeah, hell with it, I dunno
oh
interesting
if I put in 130
then the answer is 17.
18:36
Huh.
Well. I dunno
oh
@Secret Or if you're defining $\Bbb N$ as an infinite successor set, it would be equivalent to $d\in\omega^+\cup\{S\}$
right
because
half of a full roation
would be equal to the absolute min
or 0.5
a quarter roation would be equal to the min+max/2
Which gives 11.5 :/
exactly
so the suggested answer is incorrect.
18:38
Seems so.
Alright, cya semi.
Is the following circular if I define another function $f$ with domain $K$? (I am also getting rid of $S$ now)
$n > 0: a_{0}(0,n+1) = f(a_{0}(0,n))$
@Secret One sec, still processing things on my end
@Semi, do you have time? I have this one thing on the slides that is not treated in Hecht:l
18:48
(I am really terrible at noticing circular definition I just realised today)
But yeah, is that your definition of $\Bbb N$?
@LegionMammal978 that I am not sure, because I might end up with $K$ being a proper class and $\Bbb{N}$ is just a set
@Secret Because $\omega$ is just a set and $\Bbb N=\omega$ in many definitions
I've got time but I'm on phone instead of laptop now, so I probably can't say a ton
@LegionMammal978 It does seemed it generates countable number of elements, so I am not sure...
18:51
@Secret what are the other parts of the definition?
yea I think I figured it out @Semi
but thanks
\begin{align}
0 & =\emptyset\\
a_{0}(0,0) & = 1 = \{0\}=0^+\\
a_{0}(0,1) & = 1\\
n > 0: a_{0}(0,n+1) & = f(a_{0}(0,n)) \\
a_{m+1}(0,n+1) & = f(a_{m+1}(0,n)) \\
a_{0}(0,\omega) & = \sup(a_{0}(0,n)|n\in \Bbb{N})\\
a_{m}(\omega,\omega) & = \sup(a_{m}(\omega,n)|n\in \Bbb{N})\\
a_{1}(\omega,0) & = a_{0}(0,\omega)\\
a_{m}(\omega,1) & = a_{0}(0,\omega)\\
a_{m+1}(\omega,2) & = a_{m}(\omega,\omega)\\
a_{1}(a_{m}(\omega,n),0) & = a_{m}(\omega,n)\\
m>q>1: a_{q}(a_{m}(\omega,n),1) & = a_{m}(\omega,n)\\
\textrm{Ordering}\\
@Secret what is $f$?
@AlessandroCodenotti here comes the ordinal master
@Secret But yeah, $0=\emptyset,1=0^+,2=1^+$, etc. implies your $\Bbb N=\omega$
18:54
@LeakyNun a function that maps $a_m(b,c)$ to $a_m(b,c+1)$ so $a_m(b,c+1)$ is the image of $f$ on $a_m(b,c)$, is this circular?
@Secret Still need your answer on $\Bbb N$
oh crap
I thought I had it
@Semi
@LegionMammal978 did he say that he's trying to define $\Bbb N$?
Lol
Go for it
I'll try anyways, and if it turns out you have to talk a lot, I'll just leave it
18:56
@LeakyNun Just trying to figure out which definitions he's using
@Secret so $f(a_m(b,c))$ is defined to be $a_m(b,c+1)$?
right, so in the first slide, we have this expression $E(x',y')$
Oh hey, Fourier transform
yea, unfortunately
@LeakyNun yup and $a_m(b,c)$ exists by iterating from the base case
18:56
now they give us the expression for $k_x$ and $k_y$ (which I understand)
however
I don't understand how we suddenly end up with $E(k_x,k_y)$
first, I thought it was a substitution
but that doesn't really make sense, I think
so I'm just kind of curious how they got from $(x',y')$ to $(k_x,k_y)$
@Secret and according to your wall of text, $a_m(b,c+1)$ is defined to be $f(a_m(b,c))$?
that is, at least, for $b=0$.
Actually, "by definition" is roughly how I'd read it too
not that circular crap again...
is there really no way to increment the right argument
how does the veblen does that. Ugh need to check again
sorry but what should be "by definition" here? the expression where the primed variables are the input, or the $k_x,k_y$ variables?
I don't see them doing anything but saying "hey, this is of the form of a Fourier transform"
19:00
Sure, but first they write: $E(x',y')$, and then without any warning, they write $E(k_x,k_y)$
@LegionMammal978 Let's say I am actually defining some kind of well ordering to $\Bbb{N}$, so theoretically I can get a bijective mapping to map the smallest element (by set membership) to 0, then next smallest to 1 and so on, hence will be an order preserving bijection
how can you suddenly change your input variables?
@Secret ??? I'm just wondering what its elements are
Is 6 pages and a third all right for a report limited to six pages ?
@Astyx I don't think anyone here can answer that question.
19:01
As in, if you were to review that report, would the last third of page bug you ?
should I think of it as a substitution? So we substituted $x'$ by $k_xz/k$?
Eh, note that the kx,ky the define are functions of the primed variables
@Astyx I think only you can answer this question.
yes I've seen that
I think it's intended merely as notation, though
19:02
so it's a substitution?
oh
@LeakyNun I know some here do correct homework and I'd like to have their point of view on this matter
REALLY?
well okay
fine with me
Yeah. Not great notation, but notation
@Astyx alright.
I suspect that their point is that, while there's a prefactor that depends on the primed variables
19:04
And actually make that third more of a quarter
@Astyx Once I just changed the font size from 12pt to 11.5pt :p
@LegionMammal978 It's already 10pt :(
I want $a_0(0,n)$ to be bijected to $n$ where $n \in \Bbb{N}$

So theoretically I can do that by $a_0(0,n+1)=a_0(0,n)^+$ from the base case, where $^+$ is defined to be the successor operation. however I cannot generalise that to a_m for any $m$ as the base case will mean I will have one elemen with multiple successors, which is forbidden by the definition of successors
The effect of the aperture is entirely wrapped up in that integral, which is a function of kx,ky
@Secret That's not what I'm asking; you say $n\in\Bbb N$, but what is $\Bbb N$ in this instance?
19:06
And that's what they want to emphasize
right hm okay, still slightly confusing, but I'll just accept it
I mean, if it's just notation, it's okay
I have to continue anyways
thanks!
@LegionMammal978 it should be the set $K$ that is, all elements generated by the operations
19:08
A more careful presentation of the diffraction integral may be less confusing
So don't be hesitant to look around
@Secret Isn't it the first argument that comes from $K$?
yeah
\begin{align}
0 & =\emptyset\\
a_{0}(0,0) & = 1 = \{0\}=0^+\\
a_{0}(0,1) & = 1\\
n > 0: a_{0}(0,n+1) & = a_{0}(0,n^+) \\
a_{m+1}(0,n+1) & = a_{m+1}(0,n^+) \\
a_{0}(0,\omega) & = \sup(a_{0}(0,n)|n\in \Bbb{N})\\
a_{m}(\omega,\omega) & = \sup(a_{m}(\omega,n)|n\in \Bbb{N})\\
a_{1}(\omega,0) & = a_{0}(0,\omega)\\
a_{m}(\omega,1) & = a_{0}(0,\omega)\\
a_{m+1}(\omega,2) & = a_{m}(\omega,\omega)\\
a_{1}(a_{m}(\omega,n),0) & = a_{m}(\omega,n)\\
m>q>1: a_{q}(a_{m}(\omega,n),1) & = a_{m}(\omega,n)\\
\textrm{Ordering}\\
@Secret I hope your fourth and fifth lines are typos
$n+1$ is always the successor of $n$ and $n \in \Bbb{N}$ thus it should not be anything circular going on?
@Secret Would this be compatible with your current definitions?
19:12
@Secret the fourth and fifth lines are tautologies that do not add anything to the definition of $a$...
^, which is why I give the list above with $\Bbb N=\omega$ and $x+1=x^+$
@LegionMammal978 It looks good, but I am not sure if Leaky lun will say line 4-5 is circular because of the function $f$
@LeakyNun I don't know much about them, surely not as much as I wish I did. Also I have a PDE exam in 2 days, no time for set theory now :P
but it looks fine to me and looks exactly what I wanted
(I cheated a bit and used set notation, but you should get the point)
Wait, no, $\mathrm K_0$ would have to be $\{0,\omega\}$
19:27
@Secret bye, please ping me when you have anything.
@Secret Iterative Test #00, we'll just keep modifying the definition until it works
We can set $a_0(\omega,0)=a_1(\omega,0)$ and that should not be a problem I guess?
btw, the $\alpha^+$ in the 5th line after the class definitioon is my typo, it should be $\alpha$
19:42
@Secret The first or second $\alpha^+$ in $a_{\alpha^+}(0,c^+)&=f(a_{\alpha^+}(0,c))$?
both
otherwise it will probably act weird to step up two numbers to their successors
19:54
It's late now, I am heading to sleep, ping me if you need anything
We saw in class that giving initial conditions to a PDE on a characteristic surface can have disastrous consequences (both uniqueness and existence of a solution can fail), but it should be safe to give them on a surface intersecting a characteristic one, right? (maybe intersecting without ever being tangent or being equal on an open set)
@Semiclassical maybe you can help with the question above?
@Secret Iterative Test #01, now with rule numbering
Hey everyone!
20:09
hi @dami
how are you?
Everything's alright, how about you?
(Finally found the song that plays during Illuminati videos, called Mind Heist)
I really don't get why people say equalities with divergent series have a "nonstandard use of the equals sign" - the equals sign means the same as it always does, it's the sum that's being given a definition different from the usual one (limit of partial sums)
@AlessandroCodenotti eh, afraid not. I don't remember method of characteristics stuff
shrugs
20:22
Huh, there exist polyhedra that are the same as their mirror images but don't contain any planes or points of reflection.
TIL that a reflection across the xy-plane combined with a rotation across the z-axis is called an "improper reflection"
rotations are around, not across :P
but yeah, they are orientation-reversing but not proper reflections
(or a "rotoreflection", "rotoinversion", or "rotary reflection")
what does it mean for a polyhedron to contain a plane exactly?
@Semiclassical I see, thanks anyway!
not familiar with any of those terms, although I have seen "rotor" in geometric algebra
20:25
@arctictern I just mean that there'd exist a plane such that reflection across it doesn't change the polyhedron
ah
I can't visualize that being possible
Presumably its convex hull also works
Achiral, without planes or points of reflection
nice
that makes sense
@AkivaWeinberger lol, for a second, I was doubting that that was an actual polyhedron
It's not that impossible triangle :D
20:29
@AkivaWeinberger Nah, for that, take the Klein bottle route of constructing a 4D polytope
I'm sure that totally would work
@LegionMammal978 …Say again?
@AkivaWeinberger As in, a Klein bottle works only in 4 dimensions, so why not an impossible triangle? (/s btw)
For real, though, I think you could do it in elliptic geometry. Which embeds into 4D Euclidean geometry, so I guess this actually works
AK_
AK_
21:03
Hello guys
could someone please help me with a calculus question?
at least give me a hint?
I have an assignment, I'm having difficulties with. Ive tried searching, and asking elsewhere to no avail.

Your help would be much appreciated.

Let the function $f(x)$ be continuous in the interval $[0,1]$. Define $f_n(x) = f(x^n)$ for every natural $n \in \mathbb N$ and real $x \in [0,1]$.

Prove that for every choice of $\alpha \in (0, 1)$, the sequence of functions $f_n$ converges uniformly to the function $f(0)$ after restriction to $[0, \alpha]$.

Thank you!
21:42
@AK_ do you know that the function $x^n$ converges uniformly to the constant zero function on $[0,\alpha]$?
well you dont need that
the only thing ou need is continuity of $f$ at zero
AK_
AK_
21:55
@s.harp sorry i dont see how it helps me...
let $x\in[0,\alpha]$, since taking powers is monotone you have $0≤x^n≤\alpha^n$, which converges to zero
this means that for any $\delta>0$ you have an $N$ so that $x^n<\delta$ whenever $x\in[0,\alpha]$ and $n>N$
Now $f$ is continuous at $0$, so for any $\epsilon$ you have a $\delta$ so that whenever $|x|<\delta$ you have $|f(x)-f(0)|<\epsilon$
can you see how to connect these?
Let $\Bbb{R}_K$ denote the reals endowed with the $K$-topology; i.e., the topology whose basis is composed of open intervals $(a,b)$ and $(a,b) - K$, where $K = \{\frac{1}{n} ~|~ n \in \Bbb{N}\}$. My question is, does $\Bbb{R}_K$ have the intermediate value property? It seems that it would, since if $f: X \to \Bbb{R}_K$ is continuous, where $X$ is a connected topological space, then $f$ must also be continuous considered as a function from $X$ to $\Bbb{R}$ (reals with standard topology)...
since the $K$-topology is strictly finer than the standard topology. Does this seem right?
AK_
AK_
@s.harp thanks man
i got it!
22:45
Does anyone know the answer to the question posed above?
@user193319 Which question? Lotsa questions flit through this room....
(Oh, nvm. You probably mean your question.)
The one given 3 posts above yours.
Ima repost an earlier question of mine in case anyone here now is better equipped to answer it:
4 hours ago, by LegionMammal978
A bit of a problem: given vectors $\mathbf v_1,\mathbf v_2,\dots,\mathbf v_n,\mathbf w\in\Bbb Z^6$, I'm trying to generate $c_1,c_2,\dots,c_n\in\Bbb Z$ with $c_1\mathbf v_1+\dots+c_n\mathbf v_n=\mathbf w$ such that any satisfying combination of the $c_i$ has non-zero probability of being selected. Any ideas on how I'd do this?
23:18
How would you approach this problem? It's asking for the value of X
Two pararell lines which equation is 4x+40 and one cross line which equation is 2x+20
@user193319 the identity map from your $\Bbb R_k$ to $\Bbb R$ is continuous
so if you have any map $X\to \Bvb R_k$, composing with idenitty will give you a map $X\to\Bbb R$ and mean value theorem is given
@LegionMammal978 that depends on what the $v_1,...,v_n$ are. It may be that there are no solutions to your equation $c_1v_1+...+c_n v_n =w$. However if there are any solutions there are at most countably many. If you can characterise the space of your solutions there are many probability measures on a countable set so that every point has non-zero propability, for example $p(n)=2^{-n}$ on $\Bbb N$.
23:37
@Semiclassical I think I did alright
I forgot how to do trig identitiea
But
Well
I think I lost at most 7 marks
Out of 100
Or maybe at least 7 marks
At most 20
So I'll get an 80-93%
Hi Nate
Hey meow mix
chess?
@Dodsy Nice.
@MeowMix sure
Yeah I didn't practice trig identities enough...
but due to our recent conversation, I nailed the sine curve
and everything else I'm really confident about.
23:48
cool
How long will it take to get results back?
eh a while
I need to start studying calculus now :P
@MeowMix I CHALLENGE YOU, FINAP.
They really didn't give me enough space though....
oh and one equation was weird.

« first day (2504 days earlier)      last day (2813 days later) »