« first day (2427 days earlier)      last day (2890 days later) » 

09:09
?
you mean, how to compute determinant?
There are a lot of resources available online, for example you can start by reading en.wikipedia.org/wiki/Determinant
there's a parametrization of the rational solutions of $y^2=x^3-2x$
now works
need to calculate
det(A - x I).
is there any shortcut
since there is only tje last column full
and the sub-diagonal
?
09:30
is anybody on?
got a question about equivalance classes
i have n-1 1 s
do not get it
tnx
for a set to be symmetric, does it mean for every pair, (x,y), there MUST be (y,x)?
If R is a symmetric relation, R(x,y) if and only if R(y,x)
sets aren't symmetric, unless you're thinking of a relation as a set of pairs
09:38
@WillNjundong
@Algebra Expand the left column. Try a small matrix first
small =?
or use geometry by thinking of the determinant as the volume of a parallelopiped. The base is a hypercube and the height is a_0
like n=4 or something
need to calculate
det(A - x I).
on the maon diagonal I get -x
09:44
oh my bad
on the below diagonal 1s
on the right column
- an s
and now?
ok maybe expand along the top row
maybe or are u sure ?
tnx
you get -x times the det of the same matrix but one dimension smaller + -a_0
@Plinytheill i used to wrong word there ;p
09:49
-x ^(n-1) -1 ^(n-1) ??
how to include the last column ?
and then how to get
det(A - x I).
removing the last column and first row gives an upper triangular matrix with 1s on diag
Determine whether given relation is an equivalence relation on the set of all people
[(x,y) | x and y are the same height]
but anyway, the expression for the det is still complicated, so maybe thats not the way to go
on the sub-diagonal
u mean
thats an equivalence relation, right?
09:51
@sophie
??
or @ anybody else?
wait why not expand along the last column?
how?
there are no 0 s
the first term is a_0 times det of an upper triangular matrix with ones on diagonal
@WillNjundong yes it is
the rest are a_i times set of an upper triangular matrix with x on diag
def of*
det of* (sorry auto correct)
you know det of an upper triangular matrix is just the product of the diagonal entries?
09:55
uppe...u mean lower triangular
yes
yes, lower
deleting the first row
lower after a_0
and the first colun u get
1
so det = -a0 * 1
??
you mean last column?
09:56
yes
yes, right
puting A-x*I
well thats the first term
then you have to do a_1
09:57
1s on the sub diagona
and x on th emain diagonal
solving det (A-x*I)
means develop accordint to the first line?=
and final solution is
-ao ??
+
X^(n-1)
???
there should be a_i's in there. anyway, good luck
10:26
are there any equivalence classes here?
[(1, 1), (2, 2), (3, 3), (4, 4)]
Guys a PDE question
In the matrix A
why in the first row there are two non zero lements
but in all the next rows there are 3 non zero elements
the matrix is in the end of page2
10:40
Hi @BalarkaSen
I have a question about what we talked about yesterday.

We have shown that $2^{2^6}\equiv 1 \mod{p}$ and that there is no smaller integer $y$ such that $2^y \equiv 1 \mod{p}$. Then $2^6$ is the order of $2$ in $\mathbb{Z}_p^{\ast}$. We also know that $2^{p-1}\equiv 1 \mod{p}$ and so we deduce that $2^6 \mid p-1$. Is this right? We don't have to use lagrange, do we?
That is Lagrange, merely easier in cyclic groups.
How can we show that $\langle 2 \rangle$ is a subgroup of $\mathbb{Z}_p^{\ast}$ ? @BalarkaSen
Huh? By definition?
<2> is the subgroup of Z_p^* generated by 2.
But then it has to hold that $2^{2^5} \leq p-1$, right? @BalarkaSen
Sorry, what does that even mean?
10:48
If $x,y$ are rational and $y^2=x^3-2x$ then there are integers $a,b$ such that $t_1=(a^2+2b^2)^2$,$t_2=4ab|a^2-2b^2|$, $t=\frac{|t_1^2-2t_2^2|}{t_1t_2}$, $x=\frac{t\pm\sqrt{t^2+8}}2$
Inequality doesn't make sense in cyclic groups. Did you mean something else?
Ah it holds that each cyclic group generated by one element of $\mathbb{Z}_p^{\ast}$ is a subgroup of $\mathbb{Z}_p^{\ast}$, right? @BalarkaSen
Literally by definition...
If a, b, c, ... are elements of a group G then <a, b, c, ...> is in general a subgroup of G - definitionally so, because it's the "subgroup generated by a, b, c, ..."
I see. Thank you :) @BalarkaSen
Good morning
11:06
how do I "list" the members of this inequality relation?: {[1], [2], [3], [4]}
im not sure this is right: 1,1 2,2 3,3 4,4
11:42
can't read stuff :)
Hi @Alessandro
Did you make progress on the Hopf link?
Promotor: "I have time to talk about your research this whole week"
Did a miracle just happen or is the world about to end?
12:00
yup,the world may end at any time,we don't know,any time!
@BalarkaSen No, I forgot to think about it
Fair enough.
I liked the idea of flattening the knot, but the calculations needed to use SvK don't look too bad, I might do that after this complex analysis lecture
I like that idea too.
I'll tell you a different way to do it which I think is useful too, after you figure the flattening idea
@SteamyRoot you probably wrote that 1000 times before, but what field are you doing research in?
12:10
$\Bbb C$ @Alessandro
@AlessandroCodenotti Group Theory
In particular: $G$ a group, $\varphi$ an automorphism, then $x \sim y \iff \exists z: x = zy\varphi(z)^{-1}$ is an equivalence relation. How many equivalence classes are there?
It's connected to Lefschetz and Nielsen fixed point theory :)
@BalarkaSen I think I asked a silly question
What if it's an inner automorphism
$\phi(z)=hzh^{-1}$
Then $x\sim y$ iff $\exists z:x=hzh^{-1}yhz^{-1}h^{-1}$
Hm. That doesn't tell me very much. I was expecting it to end up being trivial or something
The $\varphi$ is only applied to the $z^{-1}$ on the right, not the $z$ on the left
Oh
$x=zyhz^{-1}h^{-1}$
12:19
Technically, you could do it with like, $\psi$ on the $z$ and $\varphi$ on the $z^{-1}$
But you can always reduce to counting the equivalence classes with only an automorphism on the right
Yeah, inner automorphisms don't make things trivial
(except on abelian groups, of course, since then you're just counting conjugacy classes)
So, what sort of results do you find
The groups I work on are almost-crystallographic groups $\Gamma$. Say, if $G$ is a connected, simply connected nilpotent Lie group, then define the affine group $\operatorname{Aff}(G) = G \rtimes \operatorname{Aut}(G)$. If $C$ is a maximal compact subgroup of the affine group, then $\Gamma$ is a cocompact discrete subgroup of $G \rtimes G$.
Reducible matrix
Well, for finite groups the problem is really boring
12:26
@SteamyRoot Why
It turns out many infinite groups have infinitely many equivalence classes for every automorphism
Boring in the sense of "it's combinatorics and combinatorics is boring," or...?
Because it can just be brute-force computed.
I guess, if you want an "interesting" result, there's this thing my promotor did. It was already known that every finitely generated abelian group had an automorphism with finitely many equivalence classes.
He proved that there exists uncountably many infinite countable abelian groups (non-finitely generated) which do not have such automorphism
12:29
Cool
And the link with topology, is something along the lines of "take a sufficiently nice space and a self-map. Count the number of equivalence classes of the induced automorphism of the fundamental group; then this number is a lower bound for the number of fixed points of the self-map"
Hey @SteamyRoot , is there any theorem or formula which relates to the number of maximal ideals in a given ring ?
in a quotient ring
The only thing I could think of is math.stackexchange.com/questions/54943/…
But that's probably not what you want, though :(
(maybe there is something useful in the "related questions")
actually the quotient ring is $\frac{\mathbb{Q}[x]}{x^{4} - 1}$
And I wanted to have it for a general
case
 
1 hour later…
14:02
Hi
Hi
I'm 14 now
@MeowMix congratulations
14:15
thx :]
time to understand hilbert's 14th problem then
the 3rd is cool
Or was it the 4th
The one with the Dehn invariants
google says 3rd
14:54
What is a pole withen the context of Complex Analysis
Let $p \in \mathbb{C}$ and $f$ a complex function. If there is some $U \ni p$ such that $f$ is holomorphic on $U\setminus \{p\}$ and there exists some holomorphic function $g$ on $U$ with $g(p) \neq 0$ such that $f(z) = g(z)/(z-p)^n$ on $U\setminus \{p\}$ for some positive integer $n$, then $f$ has a pole of order $n$ at $p$
@SteamyRoot there's a mistake in your latex your element of is backwards also $U$ is an open set correct ?
It's not a mistake.
You should read it as "$U$ containing $p$".
@SteamyRoot ahhh ok, my apologizes
Well, either an open set $U$; or any set $U$ containing an open set that contains $p$.
It depends how you define the "neighbourhood of a point"
15:07
@SteamyRoot all right, I just wanted to check because their can be different ways to define it also finally what did you mean by $U\setminus \{p\}$
$U$ with the point $p$ removed from it
You may also write it as $U - \{p\}$
@SteamyRoot ahh ok, I also assume that Poles will play a huge role in the Calculus of Residues
that was a hell of a night
but i like
Hi Alucard, how was your night "hell" were you hunting vampires
actually i tried to sleep at night
not a good idea
15:18
lol
@nbro what you are looking for might be here:www-old.math.gatech.edu/academic/courses/core/math2601/pdf/…
@nbro If I get time later today I'll have an accurate look at your question
15:37
The question should be: "Excuse me to interrupt the silence, can someone very special help me please?" or something along this
15:49
so I have Calculus on Manifolds and Algebra 2 classes from 1 pm to 3 pm, each class being an hour, and this is actually lunch time
I otherwise nap after comfortably having my lunch, but because of these classes, I have to hurriedly eat my lunch only to go to class and find myself too sleepy to focus
I might as well not attend these classes because I can't remember so many things the profs talk about in these classes
@Zophikel Ok, thanks! I will have a look at that paper ;)
16:10
yw @nbro answering your question may involve some slick stackexchange rep
I will see if I manage to answer by myself using that paper, in case it's really helpful
16:33
[to b expanded on]
Explore the space $\Bbb{Q} \times S^1$
Any reason why that space is supposedly interesting?
it's the cylinder according to n j wildberger
that's pretty interesting
He doesn't like real numbers?
(No relation!)
I'm guessing his $S^1$ is $S^1 \cap \mathbb{Q}^2$ then?
16:40
"He doesn't like real numbers?" ahah
he's a complex guy then
Well, as long as he doesn't start drowning because they find out irrational numbers exist, I don't care.
Hey chat
@BalarkaSen he accepts rational numbers?
he does
16:44
@SteamyRoot It's the rational points on the circle, yeah
Well, luckily for him that's still dense in $S^1$.
My math major friend told me that Statistics isn't really "math". Anyone else agrees?
he does all of algebraic topology with the rational circle in his lectures
Statistics is maths. The interpretation of statistic results is not.
5
Suppose we have a circle with radius r=5cm. We cannot have a chord with 16cm, can we?
16:46
Doesn't he run into troubles with $\Bbb Q^2$ being disconnected?
@SteamyRoot Both are fun though
@Alessandro he shrugs them off
of course it's all hot garbage
paths, circles or whatever he works with are all totally disconnected
Hello @SteamyRoot !! Have you seen my question?
Well, $\pi_1(\Bbb Q^2,q_0)=\pi_1(\Bbb R^2,q_0)$, checkmate non ultra-finitists!
finds Ted's eyes and rolls them
14
16:49
@MaryStar About the chord?
No chord can be longer than the diameter of a circle
So, it must be <=10, right?
yup
You could take circle with centre $(0,0)$ and radius $r$, and a point $P = (0,-r)$. Then any other point $Q$ is of the form $Q = (r \cos \theta, r \sin \theta)$.
Pythagoras then quickly gives the distance between $P$ and $Q$ to be $r \sqrt{2(1-\sin \theta)}$, I think
Hey everyone!
16:56
So the maximum distance is $2r$
Ohi
Hi @Daminark
How's everything going?
Good, you?
same here! had an easy final test on metric spaces today:) you?

« first day (2427 days earlier)      last day (2890 days later) »