« first day (2806 days earlier)      last day (2512 days later) » 

13:00
Hi all! I didn't understand how the yellow parts are derived
Yeah 'cause it's symmetric
Oh I thought you were about to ask about the blue underlined bits
It's Pythagoras. $ds^2=dx^2+dy^2$.
oh
what about this: ıf $\bar x$ is $0$ how can they calculate $l$?
I don't think you use $\bar x$ to find $l$
In that picture^, $dx$ is the width of that triangle, $dy$ is the height, and $ds$ is the solid pink line segment
'cause you're breaking up the curve into lots of little line segments and adding them
Okay, I got that. Thanks@AkivaWeinberger
Btw, I got a Chegg account yesterday. But I can't get answers right away as I can here.
MSE is a heaven on earth, lol
What's Chegg?
13:11
a q&a site iirc
Looks like a tutoring site
> The name Chegg is a portmanteau of the words chicken and egg, based on the founders' experience after graduating from college; they could not land a job without experience, but could not get experience without a job. - Wikipedia
It's also a Q&A site, but there is also numerous textbooks' solutions
Hahaha yes
@AkivaWeinberger Learn and understand Anosov maps and then prove that spheres do not admit Anosov diffeomorphisms for me
Add a comment here when you're done :D
13:14
Can someone help with the first few steps of isolating $\frac{x_1}{x_2}$ from the following equation $(\frac{a_1x_1}{a_2x_2})^{(p-1)}$
$(\frac{a_1x_1}{a_2x_2})^{(p-1)}=l$ *
I figured substituting the expression into $\frac{x_1}{x_2}=\apha$ and then isolating alpha. But I still couldn't quite figure it out from the new equation: $(\frac{a_1\alpha}{a_2})^{(p-1)}$
of course i ment: $(\frac{a_1\alpha}{a_2})^{(p-1)}=l$
Remember that $(xy)^n=x^ny^n$
In your case you have $(\frac{a_1}{a_2})^{p-1}(\frac{x_1}{x_2})^{p-1}=\ell^*$
Then $(\frac{x_1}{x_2})^{p-1}=\ell^*(\frac{a_2}{a_1})^{p-1}$
And finally take the $p-1$ root for
$\frac{x_1}{x_2}=\sqrt[p-1]{\ell^*}\frac{a_2}{a_1}$
@AkivaWeinberger why not just take the $(p-1)$th root straight away?
You could have also taken the $p-1$-th root as the first step
pew pew
When I'm sniped should I even bother writing the rest of the sentence
13:21
just to nitpick hahah
But yeah I kinda want to avoid roots as long as possible, you know? Kinda like avoiding fractions
Otherwise they might get annoying
Wouldn't have happened in this case but could happen in general
Yeah I'm paranoid about that too
Alright I got it. Took me a little bit with the second line (before root). Makes sense thx
Eg I also always make my logs into exponentials
Even in unnecessary contexts
it's cool
I type $3 - 4$ into a calculator
just in case it's not what I think it is
13:25
@BalarkaSen Yeah, otherwise you might have to simplify $\sqrt[\Large\log_xy]y$ or something
(It's $x$)
Lol I did the dot product of a vector with (1, 0, 0) using calculator once
In my defense it was an exam and I was nervous
@AkivaWeinberger Right, ugh
It's okay to identify the polynomial ring $R[X]$ with $\bigoplus_{i \in \Bbb N} R$, right?
Seems to me the latter doesn't have an obvious multiplicative structure
Besides, would $R(X)$ be $\bigoplus_{i\in\Bbb Z}R$?
As R-modules it's fine
I mean as $R$-modules of course
13:30
@AkivaWeinberger I think that would be R[X, 1/X]
Arright sure then
@BalarkaSen Oh, right
$\frac1{x+1}\notin R[X,1/X]$
Laurent polynomials
Well, $\frac{1}{x+1} \notin R(X)$ either
:P
No?
Oh. $X$
13:32
Lol
Sorry
Big X, little x, sideways +, same thing
$\frac{1}{\times + 1}$
Accurate
$f^{(99)}(z)$ where $f(z) = e^{iz}$? I thought it was $-ie^{iz}$
Looks correct.
$f^{(n)}(z) = i^n e^{iz}$.
Hmmm. Then the answer key says $\int \frac{100! e^{iz}}{(z+1)^{100}}dz $ along a circle of radius 1 at -1 is equal to $100\pi i e^{-i}$
Is that not $f^{(100)}$?
I don't agree with that $i$ in the answer. It should be $2\pi i Res(-1)$
Where $Res(z_0) = \lim_{z\rightarrow z_0} \frac{1}{m-1!} \frac{d^{m-1}}{dz^{m-1}}[(z-z_0)^{m}f(z)]$
Setting, $m = 100$, we get that we take the derivative of $e^{iz}$, 99 times.
@AkivaWeinberger, that's cauchy's integral formula. not residue theorem
Oh, I see, there's an $n+1$ in the denominator
@orbit-stabilizer Yeah but it applies here too
fair
So, it seems like Cauchy's formula gives me the right answer. But then, I must be messing up somewhere in the residue theorem
Seems like Wolfram Alpha agrees with you, in that the residue is $-100ie^{-i}$
13:46
and thus the integral should $200\pi e^{-i}$ I think
Yeah, that's what I get.
Wait, that's what I get for cauchy as well..
So.. they probably fked up?
gah
wish me luck, I go to fail my complex variables final
Luck
I wish it upon thee
Finals? Man... my quarter just started.
13:51
It'll happen before you know it ^_^
Do you also know about this @AkivaWeinberger?
$ds$ should equal $|dg|$
'cause $ds$ is the distance between $g(t)$ and $g(t+dt)$
$H^1(S_n,\Bbb Z)\cong\Bbb Z$
i'm high on group cohomology
I was very confused 'cause I thought that said $S^n$
you're high on topology
13:59
Why do we want to take the cohomology of groups
because it's dank
Thanks :)
So my vague understanding is that we turn $G$ into spaces and take the cohomologies of those spaces? And there's also a native group-theoretic way as well @LeakyNun
Equivalent approaches yes
@AkivaWeinberger do you know Tor and Ext?
14:02
Vaguely. Tor measures torsion and Ext measures magic
do you know group ring?
The name rings a bell
Wahey, "rings"
wow
so if $R$ is a ring and $G$ is a group, then $R[G]$ is a ring that is, as an $R$-module, the free product of $G$ copies of $R$
Hey guys quick question, A or B
the multiplication is given in a way that "g" multiplied by "h" gives "gh"
14:04
Group cohomology is an algebraic tool to capture all the information you can out of a group; just like if a map between CW complexes induces an iso on homotopy groups, it is an equivalence, you can check that a map of finite groups which induced an iso on group homology is an isomorphism of groups
@AkivaWeinberger A
You can use it to prove things about those groups, and it often has group-theoretic information hidden in it
Can I get a concrete example?
@AkivaWeinberger so, e.g. $\Bbb Z[C_3] = \{a_0 + a_1 g + a_2 g^2 \mid a_0, a_1, a_2 \in \Bbb Z\}$
where e.g. $(2g) \times (3g^2) = 6$
14:05
Rmhrm.
$(1+2g) \times (g) = g + 2g^2$
Eg, consider H^*(G;Z/p). This is a commutative ring (more or less). We can talk about its Krull dimension; in the simplest case where it's polynomial on n generators, the dimension is n.
As it turns out the dimension of this ring is equal to the rank of the largest (Z/p)^n in G.
now, giving an abelian group $M$ the structure of a $\Bbb Z[G]$ module is the same as giving it a linear $G$-action
i.e. other than $1x=x$ and $g(hx)=(gh)x$, you also require $g(x+y)=gx+gy$
so a $\Bbb Z[G]$-module is also called a $G$-module
@MikeMiller I see
14:07
The standard baby example is that $G$ has torsion implies $H_n(G; \Bbb Z)$ is nonzero in arbitrarily high dimensions.
The cohomology of BSO(3) with mod 2 coefficients is Z/2 [w_2, w_3] those guys living in deg 2 and 3, no further relations
Then, $\Bbb Z$ is a $G$-module where the action is trivial, i.e. $gn=n$ for every $g \in G$ and $n \in \Bbb Z$
SO(3) has a Klein 4-subgroup correspondingly: S(O(1) x O(1) x O(1))
Then, the cohomology group $H^n(G,M)$ where $M$ is a $G$-module, is $\operatorname{Ext}^n_{\Bbb Z[G]}(\Bbb Z,M)$
14:08
Ignore the B
I'm taking group cohomology now for compact Lie groups
And I was thinking of the classifying space approach
BG is the space corresponding to G that you take singular cohomology of to compute the group cohomology of G (so you can ignore it, like Mike said)
Right, and the Klein 4-subgroup is the symmetries of a rectangle
@BalarkaSen Ah, I see
SU(2) has cohomology Z/p [p_1] with p_1 living in degree 4
It therefore can only have a Z/p living inside it
Via the inclusion inside the circle subgroup
If a group acts freely on a sphere, then its group cohomology is "periodic" (H_* is jsomorphic to H_{*+n} for all *)
So we see from the above that SO(3) does not act freely on a sphere: the rank of cohomology above was increasing linearly with degree
@MikeMiller are our approaches different?
(the number of 2-variable monoids of degree n is n+1)
14:12
I gotta go for a bit
Same answer, yours is slightly harder to generalized to compact Lie groups, mine is slightly harder to generalize to nontrivial coefficients
interesting
The torsion fact has been useful in several different points in my life. Akiva once asked whether orientation double cover of a nonorientable (not necessarily closed) manifold can be contractible. The answer is no, because then the base has to be a K(Z/2, 1) which has cohomology in arbitrarily high dimensions
In particular can't be a manifold
Saved my ass that day because I was rambling garbage involving Mazur manifolds to PVAL prior to realizing this
@AkivaWeinberger after some calculations, $H^1(G,M)$ can be described as the free abelian group of "twisted homomorphisms" from $G$ to $M$, quotient by the functions that look like $g \mapsto gm-m$ for some $m$
now, $f:G \to M$ is a twisted homomorphism if it satisfies $f(gh) = gf(h)+f(g)$
14:18
Is it called "twisted" because there's a hidden connection to braid groups or is it called "twisted" 'cause it looks weird
well normally we would have $f(gh)=f(g)+f(h)$
so you kind of twist it a bit
I would call them projective representations (you're allowed to scale, and compositions are defined up yo scaling)
twist by the G-action
right
@MikeMiller Free means that the actions have no fixed points, right?
Like $x\mapsto gx$ with $g\ne e$
14:20
up yo scaling
free: $\forall g (\forall x (gx=x \to g=e))$
faithful: $\forall g(\forall x(gx=x)\to g=e)$
you literally move a single parenthesis
aqui viene frankenstein
aqui va frankenstein
10/10 will watch this movie
Turns out it was bad
I refuse to believe that
14:27
@MikeMiller so, uh, how do you, eh, go from, eh, cohomology group relative to some G-module, to, eh, "the" cohomology group of a group?
Diamonds aren't even the pretties gem, why put that on a ring when you can get a prettier one for cheap
why are people still falling for the diamond prank
@BalarkaSen do people use Tor and Ext?
14:54
It's in 30 minutes..eek
I used L'Hopital on $\lim_{z\rightarrow \frac{\pi}{2}} \frac{zcos(z)}{(2z-\pi)^2}$ to get a finite value. I definitely messed up somehow.
Graph theory terminology question: Is there a term for the set of vertices that are not part of any cycle?
That would be equal to $\lim_{z\rightarrow \frac{\pi}{2}} \frac{cos(z) - zsin(z)}{4(2z-\pi)}$
Which should be equal to: $\lim_{z\rightarrow \frac{\pi}{2}} \frac{-sin(z)-(sin(z) +zcos(z))}{8}$
@LeakyNun Use Z as the trivial G-module, or Z/p if you're interested in torsion information.
Which exists.
Don't use Q.
14:57
ok
Hi @LeakyNun ... ?
mental note: stay away from Q
what
@LeakyNun $f(a+b)= f(ab), f(-1/2)= -1/2$, find $f(1005)$, any hints?
a=1, b=-1/2
I know that
14:59
H^*(G;Q) = 0, not hard to show
then a=1/2, b=-1/2
and then a=1,b=b, induction
I know that too
@LeakyNun Oh, what?
what is f(0)?
f(0)= f(everything/ anything)
15:00
f(1)= f(0)
right
f(-1/2)= f(0 )
so ignore the part where i said a=1/2,b=-1/2
let's see how we can reach an integer
oh wait what
oh right
just substitute a=0, b=b lol
i'm stupid
done, why ask me
substitute a=0, b=b, what do you get?
Wait,
f(1005)= f(0)
f(1005)= -1/2
done
15:11
If I have $e^{6i\theta} = e^{i\pi}$, I get $6\theta = \pi$, but there are more solutions, are there not?
ah, $+ 2\pi n / 6$
15:40
$f(x).f(1/x)$ is satisfied by polynomial function $f(x)=\pm x^n +1$
How?
Is it true, that if $A$ is diagonalizable and $AB=BA$ then also $B$ is diagonalizable? If found only proofs which required $A$ having $n$ distinct eigenvalues. But my assumption allows for repeated eigenvalues. Is it still true?
(@LeakyNun any idea?)
I found a proof showing that $B$ is "block diagonal": https://math.stackexchange.com/questions/46544/why-does-a-diagonalization-of-a-matrix-b-with-the-basis-of-a-commuting-matrix-a?lq=1
This still doesn't say it's diagonalizable, right?
Alright, I found the solution. It's not true, see second example here: en.wikipedia.org/wiki/Commuting_matrices
16:01
@LeakyNun Sorry made a mistake. $f(x).f(1/x)= f(x)+ f(1/x)$ is satisfied by polynomial function $f(x)=\pm x^n +1$
16 mins ago, by Abcd
(@LeakyNun any idea?)
hmm ok?
@LeakyNun could you tell me how its derived?
no idea
16:43
Is there a standard term for components of a graph that look like these?
1
Q: Subsequence of Measurable Functions

user193319Given a sequence $\{f_n\}$ of measurable functions, why does there exist a subsequence $\{f_{n_k}\}$ such that $\lim_{k \to \infty} \int_E f_{n_k} = \liminf \int_E f_n$? I need to use this in a theorem I am proving, but I don't see how to justify it. Just for your information, I am trying to prov...

Need help proving a subsequence exists. See my comments on B. Mehta's answer.
Zee
Zee
17:22
/wave
//wave
@Zee Maybe you should consider looking up the manual
Consider these 2 infinite sets: 3, 3.3 , 3.33, 3.333 ... and 4 , 3.4 , 3.34 , 3.334. They tend to 10/3. Are they contiguous?
what is contiguous?
17:55
Let $f: \mathbb{R^+} \to \mathbb R $ be a function which satisfies $f(x).f(y)= f(xy)+2 (\frac 1x + \frac 1y + 1)$ $\forall x,y >0$, then find $f(x)$
Attempt:
$$f(1)= 2 \text{ or } -3 \\
f(x).f(1/x)= 1/x+x \\
(f(x))^2= f(x^2)+2(2/x +1 )$$
Step 2 if f(1)= -2
$f(x)f(1) = f(x) + 2(1/x + 2)$ is probably useful.
Correction* f(1) = -2 or 3
@BalarkaSen Oh right. Which value of $f(1)$ should I take, -2 or 3?
Oh its a quadratic
so f(x) should have two values
got it'
Yeah I don't think $f(1)$ is completely determined.
These functional equation questions kinda suck because most of the time they are vague.
18:11
0
Q: Lebesgue's Theorem for Riemann Integrability Overkill?

user193319 Let $f$ be a bounded function on $[a,b]$ whose set of discontinuities has measure zero. Show that $f$ is measurable. Then show that the same holds without the assumption of boundedness. This problem comes from the section where Lebesgue's theorem about Riemann integrable functions is presen...

@LeakyNun, here $z(H\int K)$ need not posses either $x$ or $y$, right?
@Abcd $f(x)\times f(1)=f(x) +2(1/x+2)$ so $f(x)=\dfrac{2+4x}{x(f(1)-1)}$
@BalarkaSen I kinda like them, just pushing around symbols until things work
$f(x) = 1/x + 2$ or $f(x) = \frac{-2}{3} \left(1/x + 2\right)$ I guess
@MikeMiller It's fun to work out, yeah. I guess I just don't like the parsing as much.
Sometimes you'll see the domain/range unspecified
18:26
@MikeMiller it's sorta closer to a modeling challenge, i.e. given constraints provide an appropriate function
That boils my blood a little
The trouble with that analogy, of course, is that a model usually has some motivation behind it
whereas a random question need not
can someone tell me what I have to google for, to find the formula that calculates the ID from the values of num1, num2, num3 ?
so 1,2,3 = 1
1,3,4 = 4
i guess there must exist one already :P
num3 > num2 > num1
sum[ID+1](num1, num2, num3) > sum[ID](num1, num2, num3)
18:29
@MA-Maddin look at ID's 6 and 7
then 1+4+5=10 for ID 6 but 2+3+4=9 for ID 7
so that's actually gone down
oh, you're right. Sry, so the last rule doesn't apply :P
similarly, note that ID 1 has 1+2+3=6 and ID 9 has 3+4+5=12. So if you were increasing by at least one with each ID, you'd need ID 9 to have at least 6+8=14
the real problem, though, is that all you have are a collection of numbers.
that are all sorted combinations of 3 numbers from a pool of 1-5.
you can devise a function that will give those numbers in response to the inputs, but absent some specific pattern there's no reason to think said function is very interesting
In particular, there's no way at all from this data to guess what ID 10 would give
Is it possible that $z(H\cap K)$ has neither $x$ nor $y$ here?
18:34
yea, the Input is always 3 numbers. The Output the ID.
ah, other way around then.
I see the pattern now, yeah
I guess there exist a function already, just don't know the name :P
I think I see another way of looking at this, actually.
GUYS
I just made another meme of mine
does anyone want to see it
you can encode the combination 135 using stars-and-bars as * | * | *
Zee
Zee
18:36
Hell yea
so there's stars in positions 1,3,5 and bars in positions 2,4
@Zee it's offensive and not suited for this chat, so I'll post it in another separate room
actually, never mind... There's no way for me to post it here -_-
@MA-Maddin I think you've missed an ID along the way: between 7 and 8 you should also have 2 3 5
oh, yes. good catch :D
in which case you have 10 IDs possible, which corresponds to there being 5-choose-3=10 ways to pick the 3 stars among the 5 spots
what I think you can say is that you're doing some sort of lexicographic ordering
123 , 124 , 125 , 134 , 135 , 145 , 234 , 235 , 245, 345
where you order just as you would if you were doing an alphabetical sort
18:43
thats right
@Dattier I know, then we'll have to substitute the two values of $f(1)$, and two answers are given ...
The wiki page on lexicographical ordering may be worth looking at, particularly the section on finite subsets: en.wikipedia.org/wiki/Lexicographical_order#Finite_subsets
@TheTestosteroneFanatic who the hell makes a makes a meme of themselves
isn't that memetic narcissism
@Abcd yes
Hi @Dattier
18:47
Hi
Hello!! Does someone of you have an idea how we could show that the Gamma function is continuous for $x>0$ using the mean value theorem of differential calculus?
@Semiclassical yeah, that looks nice. Thank you.
What I don't know is how one would do the following: Given a particular element (n1 n2 n3), determine where it appears land in the relevant lexicographic ordering
there may not be a nicer way than just "take all such elements, order them, and look where that one is"
@Lozansky how did the exams go?
But this is getting firmly into algorithms territory and I'm not an expert on that
@MA-Maddin oh, this looks even more useful: geeksforgeeks.org/lexicographic-rank-of-a-string
so "lexicographic rank" is the relevant search word
"The time complexity of the above solution is O(n^2). We can reduce the time complexity to O(n) by creating an auxiliary array of size 256."
ooook
18:54
@Dattier It went well, I did PDE before Fourier so I already knew like 60% of the material
@Semiclassical :D you helped me anway, thank you :)

« first day (2806 days earlier)      last day (2512 days later) »