« first day (2951 days earlier)      last day (2366 days later) » 
00:00 - 15:0015:00 - 00:00

15:00
$\xi$: (Unassigned)
$\omicron$: (Unassigned)
$\pi$: Pi (durr)
$\rho$: (Unassigned)
$\sigma$: (Unassigned)
$\tau, \upsilon$: (Unassigned)
$\phi$: Morphism
$\chi,\psi$: (Unassigned)
$\omega$: Initial ordinal or roots of unity
$\Theta$: Strongly inaccessible cardinal
(Other capitals are unassigned)
$0$: Zero
$1$: One
Metropolis Algebra Complex: There exists an $M$ such that for all possible algebraic structures $A$, $A \subsetneq M$
The Metropolis unifies abstract algebra by collecting and linking them all into one single structure, such that different algebraic structures becomes portions of it
15:20
@Rudi lol hab erst grad jetzt rausgefunden dass man "weil ... hat machen lassen" statt "weil ... machen gelassen hat" sagt
ahaha
@Secret is there anyone else following this stuff you're posting?
Hey guys, I'm studiyng functional analysis and want to ask if an element of linear span of some infinite set, is always a finite linear combination elements in the set.
whoever that is, is not online anymore atm
Like @TobiasKildetoft said a while back, if not, perhaps you should take it to a private room where you can record your findings or thoughts. Right now, people's questions are getting crowded out.
can you correct my answer, if any mistake is there.
0
A: If $x,y$ is a 2-edge cut of a graph $G$; every cycle of G that contains $x$ must also contain $y$

N. ManeeshLet $x=uv, u\in S$, $v\in \overline S$ and $y=wz, w\in S$, $z\in \overline S$. Removal of $x,y$ make the graph disconnected. Suppose there exists a cycle $\mathscr C$ consists of $x$ without $y$. So, there exists a $u-v$ path other than edge $x$. Let it be $u e'_1u_1 u_2e'_2 ...u_k e'_k v$. Ther...

15:26
I dislike the way Marystar asks her questions, everytime following a ping when it is obvious that Leaky is following her
She does that all the time, and it is remind of help vampire behaviour which is very annoying
Combined with weeks of frustration that the research is going nowhere because of stupid things like programming input wars, I cannot think of anything but drowning everything out of existence
> whenever a bunch of regular help vampires are on chat, drown them out so that nobody can see and feed them. The "ignore" button does absolutely nothing in helping to mitigate this regard
hai secret, can you check my answer.
Let $L$ be the space of Lie formal series, i.e. $E\oplus [E,E] \oplus [E,[E,E]]\oplus ....$. Is this Lie algebra necessary finite dimensional, if $E$ is finite dimensional linear space?
@N.Maneesh I have not got that far into graph theory yet thus it will be best for me to not judge. Besides, this research frustration is occupying my brain right now that I cannot think other than want to drown everything out of existence
15:42
in which area you are doing research
@secret
Computational chemistry
But all the errors in the past 3 weeks are stupid programming technical errors that has no relation with chemistry
okay.best wishes.
Come on, I am doing a research on chemistry, not STUPID COMPUTER INFRASTRUCTURE PROGRAMMING NONSENSE!
1
Q: Which vector spaces have a perfect Lie algebra structure?

YJ KimOne can give the cross product as a Lie bracket on $\mathbb{R}^3$ and the matrix commutator to $\mathbb{R}^{n^2}$ ($n \ge 2$). They both give a perfect Lie algebra structure. However, every Lie algebra of dimension $1$ is abelian, and for $2$-dim we can write any nontrivial Lie bracket as $[x, y...

0
Q: perfect Lie algebra but not semisimple

fff123123Lie algebra $\mathfrak{g}$ is perfect if and only if $\mathfrak{g}=[\mathfrak{g},\mathfrak{g}]$. And we know semisimple Lie algebra must satisfy the $\mathfrak{g}=[\mathfrak{g},\mathfrak{g}]$ then it's perfect. What is the example of perfect Lie algebra but not semisimple? And what's the suffi...

5
Q: lie algebra semisimple?

markIf L is a semisimple lie algebra then L=[L,L]. Is the opposite true?

i have given interview for computational biology phd program at iiser kolkatta
15:48
@LeakyNun Thank you. So if the semisimple algebra is perfect, I can determine its dimension by the dimension of the ideal?
I would think so
Thank you I will try this out.
stupid question
given a relation that is both symmetric and transitive why is not always reflexive?
aRb bRa implies aRa by transitivity i know its wrong but cant figure out why
@Faust the empty relation
2 mins ago, by Faust
aRb bRa implies aRa by transitivity i know its wrong but cant figure out why
this "proof" is a standard example of the error of missing quantifiers
snipped
15:55
well you don't have to delete your answer lol
mmm
8
Q: If a relation is symmetric and transitive, will it be reflexive?

Kraken Possible Duplicate: Why isn't reflexivity redundant in the definition of equivalence relation? We had a heated discussion in class today and i still cant be sure if the professor was any good with the solution. The question is: If a relation is symmetric and transitive, then it wil...

unsnipped
@Faust see if you can figure out what I mean
i got it
trivial case was not thinking of
3 mins ago, by Leaky Nun
this "proof" is a standard example of the error of missing quantifiers
by this
no, the counter-example is not the end of the story
you should also think about what is wrong with your proof
15:59
it has to be true for all a,b not just for one pair
exists/for all
right?
eh I don't really understand what you mean
16:39
Is there a nice way to relate $|v|$ and $|Av|$ when $A$ isn't square?
In particular, I know that $A^TA$ is a scalar matrix.
I'm pretty sure that $|Av|$ should be $|\sqrt{\lambda}v|$ if $\lambda$ is the scalar
oh, here it is: $|Av|=\sqrt{\langle Av,Av\rangle}=\sqrt{\langle A^TAv,v\rangle}=\sqrt{\lambda \langle v,v\rangle}=\sqrt{\lambda}|v|$
@Faust can you write down carefully what transitivity and reflexivity supposed to mean?
@Faust it seems that you misread what a symmetric relation supposed to mean
17:44
Problem: If $(x_n) \subseteq \Bbb{R}$ is a sequence converging to $0$, then $\frac{x_1 + ... + x_n}{n}$ converges to $0$.
I've been thinking about this problem for a while...I could use a hint.
Let's play with definitions
What does it mean to converge to 0?
For every $\epsilon > 0$, there exists a $N \in \Bbb{N}$ such that $|x_n| < \epsilon$ for every $n \ge N$.
Okay. So we want to show that $\frac{x_1 + \cdots + x_n}{n}$ is less than $\epsilon$ for all $n>N$, for some $N$.
I know that $|\frac{x_1 + ... +x_n}{n}| \le \frac{|x_1| + ... + |x_n|}{n}$, so by squeeze theorem I think it suffices to consider $x_n \ge 0$, right?
17:48
@LeakyNun Please tell me the mathjax code for 3rd order determinants. I requested it that day in chat and everyone ignored the message.
Okay, good.
Good catch - I was already about to assume that!
So we know that for $n > N'$, $x_n < \epsilon$, where $N'$ is the appropriate number for that sequence.
Agreed?
@Abcd $\det\begin{bmatrix}1&2&3\\4&5&6\\7&8&9\end{bmatrix}$ \det\begin{bmatrix}1&2&3\\4&5&6\\7&8&9\end{bmatrix}
@LeakyNun What if I want || instead of [] ?
17:49
$\left|\begin{matrix}1&2&3\\4&5&6\\7&8&9\end{matrix}\right|$ \left|\begin{matrix}1&2&3\\4&5&6\\7&8&9\end{matrix}\right|
Thank you!!
So here are some scattered thoughts.
Before you pass $N'$, you have some terms $x_1 + \cdots + x_{N'}$. These might be big; who knows. So what if we take $N$ so big that $(x_1 + \cdots + x_{N'})/N$ is less than, let's say $\epsilon/2$?
We then have to account for the remaining terms, $(x_{N'+1} + \cdots + x_N)/N$.
Express $\Delta = $$\left|\begin{matrix}{2bc-a^2}&{c^2}&{b^2}\\c^2&{2ac-b^2}&{a^2}\\{b^2}&{a^2}&{2ab‌​-c^2}\end{matrix}\right|$ as a square of two determinants.
Now try to use the assumption on what $N'$ means.
You might have to redefine $N'$ or fiddle a bit to get a precise bound of $\epsilon$ in the end
@LeakyNun For above question I tried, using the property that determinant of cofactors is equal to actual determinant^2 but couldn't get the answer that way. :( .
Do you know how to solve it?
17:55
@Abcd I don't know what "square of two determinants" means
@MikeMiller Okay, I think I see the general idea. I'll give it a try. Thanks!
@user193319 I like to call this the epsilon/2 trick
@LeakyNun two -> "a", determinants -> "determinant"
@LeakyNun Please ignore the two. I am sorry.
I still have no idea. sorry.
Does anyone here use MathType?
I see that you can purchase the software and it will be usable in programs like Word or Pages.
17:59
I don't see why you can't just alt+= in word
or maybe alt +, I forgot
You mean insert equation?
Yeah, Word's equation editor is good enough, but Pages currently has no visual equation editor.
It's 2 AM here now.
then just use Word
Yeah, maybe I will get a new laptop this week and then get Office 2019 next month when it is released.
I can use my current laptop but it is a bit slow because of the specs.
what is the identity function id_A? is this a function from A to A such that we have id_A(x) = x?
@famesyasd Yes
18:04
thank you
18:40
@LeakyNun Please tell how these formulas are obtained?
...Or anyone who knows how to obtain derivative of determinants...
my god
burn it
BURN IT
@mercio Why??
because it is written extremely badly
How are those formulas obtained mercio?
18:52
if $a,b,c,d$ are differentiable functions of $x$, do you know how to differentiate $a(x)d(x)-b(x)c(x)$
(with regards to $x$ )?
@mercio oh wow
@mercio yes ofcourse
then you don't need those pictures
@mercio look it might be easy to see it for 2nd order but hard for 3rd order determinants.
@LeakyNun what happened?
Anyway Ill accept that someone in some part of the world did the expansion and then made those formulas :P
I think you should check yourself that it is correct for a determinant of order 3
19:01
Hmm okay
19:18
If I have a p-torsion module M where p in A is irreducible then I can define a valuation on M sending x to the smallest natural number n such that p^n x = 0
this has many similarities with the p-adic valuation
@LeakyNun Do you have any recommendations of a good cheap laptop?
@JasperLoy old Surfaces are good for writing maths and are relatively cheap.
@user3342072 By old do you mean second-hand?
@JasperLoy well if you don't mind, I ment like second or third non Pro generation.
19:29
@user3342072 I see. Well, the cheap ones are still very small I think.
hi @MatheinBoulomenos
hi @LeakyNun
13 mins ago, by Leaky Nun
If I have a p-torsion module M where p in A is irreducible then I can define a valuation on M sending x to the smallest natural number n such that p^n x = 0
13 mins ago, by Leaky Nun
this has many similarities with the p-adic valuation
what's the definition of a valuation on a module? I know a valuation on a field
maybe this is related to the fact that the pontryagin dual of a p-torsion module is an abelian pro-p group (and hence canonically a $\Bbb Z_p$-module)
oh no wait this is for $A=\Bbb Z$
Aw man it's nerd'o'clock
3
19:38
@MatheinBoulomenos yeah it would be best if A = Z, and I don't know how far I can generalize it
the valuation sends x in M to the smallest n such that p^n x = 0
the stuff with duals can be generalized at least to PIDs: Let $A$ be a PID and $p \in A$ be irreducible and $\widehat{A}$ be the completion of $A$ at $(p)$. Let $Q=\mathrm{Frac}(A)/A$. Then I think if $M$ is a $p^\infty$-torsion module (so every element is annihilated by some power of $p$), then $\mathrm{Hom}_A(M,Q)$ is a $\widehat{A}$-module
and $\widehat{A}$ is a DVR
so this is related to valuations in some sense
what is Frac(A)/A?
oh
that's a very interesting module
like $\Bbb Q/\Bbb Z$
fun fact: $\mathrm{End}_A(Q) \cong \widehat{A}$ as rings
every hour is nerd o'clock
nice
hi @Daminark @MikeMiller
no wait that's not right
you need to define $Q$ differently
$Q=A[1/p]/A$, sorry
or $A_p/A$ if you prefer that notation
well as long as $M$ is $p^\infty$-torsion, we have $\mathrm{Hom}(M,A[1/p]/A)=\mathrm{Hom}(M,A[1/p]/A)$ anyway
19:43
I see
but you need it for the statement about the endomorphism ring
do we really need PID?
will UFD do?
oh maybe not
well maybe GCD will do
I think I need Bezout domain at least in the proof of $\mathrm{End}_A(Q) \cong \widehat{A}$
is there a UFD that is not noetherian?
$k[x_1, x_2, \dots]$
19:46
What's $\mathrm{End}_A(Q) \cong \widehat{A}$ in words?
the endomorphism ring of the $A$-module $A[\frac{1}{p}]/A$ is isomorphic to the completion of $A$ at $(p)$
In two boxes we have similar balls numbered from 1 to 5. We pick two balls from the first box and two from the second one. Is the probability that all the 4 balls are different the following?
$$\frac{5}{5}\cdot \frac{4}{4}\cdot \frac{4}{5}\cdot \frac{3}{4}=\frac{3}{5}$$ ?
@MatheinBoulomenos the thing is that as A-module, that A[1/p]/A thing is a direct limit of (1/p^n) right
@MatheinBoulomenos wie geht's dir?
19:50
gut, danke. Und selbst?
habe gerade Ferien noch. Bald geht es auf die Bachelorarbeit zu
In two boxes we have similar balls numbered from 1 to 5. We pick two balls from the first box and two from the second one. Is the probability that all the 4 balls are different the following?
$$\frac{5}{5}\cdot \frac{4}{4}\cdot \frac{3}{5}\cdot \frac{2}{4}=\frac{3}{10}$$

I thought so because:
At the beginning we can choose 5 from 5 balls at the first box
Then we have 4 balls left in the first box and we can choose one of these 4
From the second box we can choose 3 of the 5 because we have already picked 2 numbers
Alright I'll just make sure this is straight in my mind real quick. So, gonna prove tensor products commute with direct sums
just use the UMP's
it's an exercise in AM which I did
19:59
That's what I had in mind, yeah
it doesn't really "commute", it distributes
that's why tensor is (x) and direct sum is (+) :P
Hey @LeakyNun !! Do you have an idea about my question above?
$(\bigoplus_i M_i) \times (\bigoplus_i N_i) \to \bigoplus_i M_i \otimes N_i$, and you'll want to send $(\sum m_i, \sum n_i) \mapsto (\sum m_i \otimes n_i)$
Up to I should've used different indices ofc
And yeah that's bilinear
right
And so this gives a linear map $(\oplus_i M_i) \otimes (\oplus_j N_j) \to \oplus_{i,j} M_i \otimes N_j$, which does the obvious thing. Surjectivity is clear because to map to any generator you just manufacture the element
20:07
no, you don't check surjectivity
you build the inverse map using more UMP
and use even more UMP to prove that they are inverses of each other
Oh you mean directly show that that guy satisfies the universal property? That works too
I mean, build a map $\oplus_{i,j} M_i \otimes N_j \to (\oplus_i M_i) \otimes (\oplus_j N_j)$
using UMPs
I'm referring to the UMP of direct sum (i.e. coproduct)
Is that just gonna be this but backwards? Basically inject the components in and then universal property?
right
And then uniqueness should give you the rest
20:18
right, that's what I mean by "more UMP"
20:29
Hello Everyone. I really need help from someone. I have been trying to properly answer the following question that I posted:
https://math.stackexchange.com/questions/2902199/show-that-the-number-of-elements-of-a-finite-set-is-well-defined
But even after the help I got, I still was unable to solve it. I am getting really depressed. Help would be very much appreciated.
Any resources for understanding right continuity and left continuity?
Yes, check any calculus textbook.
Why should CDFs be right continuous but need not be left continous?
20:59
could I get some help on some stats homework? I took a course before this one a few years ago and Im a bit rusty.
I dont mind doing the work, this book just isnt very clear on which thing to do where, or rather, its too clear, too succinct.
its very simple, it is a 'based on the mean and variance of a set of samples' and given a population std dev, is a stated mean for the population acceptable within a=0.05
so i did the first part and got the sample statistics, but I dont remember which formula to use to compare them. and I know they are giving me part of the variables and expecting me to do it backward a bit to find the missing part
so, I have x-bar = 18472.9, and an s^2 of 41.724
then I have, mu = 18470, and sigma^2 = 40.
with an alpha of 0.05
Im not sure if this is a z-test or test one mean
also, I think the z-score formula looks a lot like the formula for a derivative in limit form with z being in respect to the derivative, and h = to the std dev
but thats just me
21:37
Hi there
What's the difference or relationship between proof and model theory? Any beginner resources?
The random variables $X_1, X_2, \ldots , X_{10}$ are independent and have the same distribution function and each of them gets exactly the values $\pm 2$ and with equal probability. We define the random variable $S=X_1+X_2+\ldots +X_{10}$. How can we calculate $\mathbb{E}(S^2)$ ?
mary, I cant read that, sry
 
1 hour later…
23:06
@MaryStar: You have S, the sum of 10 independently distributed random variables, uniform on {+2, -2}. In distribution, X_i = 4Y_i - 2 , where Y_i is uniform on {0, 1}, so in distribution S = 4 * T - 20, where T is Bin(10, 0.5). Thus E[S^2] = E[16T^2 - 80T + 400] = 400 - 80 E[T] + 16 E[T^2]. Note that E[T] = 5, and E[T^2] = 2.5. Plugging this in, we get E[S^2] = 40. (Here's another, easier way to do it: E[S^2] = 10 E[X^2] + 90 E[X_1X_2] = 40.)
23:16
Anyone familiar with the partition of unity argument in Rudin
23:35
This book is written by two Victor V. Prasalovs :]
First mathematician to successfully clone himself!
00:00 - 15:0015:00 - 00:00

« first day (2951 days earlier)      last day (2366 days later) »