« first day (3734 days earlier)      last day (1297 days later) » 
02:00 - 21:0021:00 - 00:00

2:16 AM
@TedShifrin I have some amaizing news that makes me love MSE!
 
3:13 AM
@Alexandru: I assume someone helped you? That's not so unusual :P
 
@TedShifrin yes I have a great start, the leading term for my asymptotic expansions
 
3:30 AM
@Faust I got some news
 
 
3 hours later…
6:52 AM
Today's thought:
Analysis - The study of math
Geometry - The study of shape
Algebra - The study of properties
Topology - The study of combination
Logic - The study of questions
Category Theory - The study of studies
 
7:10 AM
@porridgemathematics yeah sure
 
 
1 hour later…
8:37 AM
hi chat
 
salut !
 
 
2 hours later…
123
10:23 AM
Hi
I have a question about basic vector multiplication. Pls help me to figure out this mystery.
 
A question can never be answered if it isn't asked. (Note: I might not answer, I'm off doing other stuff. But someone else might swing around and see the question)
 
123
$\vec{A}\vec{B} = <|\vec{A}|\cos\theta , |\vec{A}|\sin\theta><|\vec{B}|\cos\theta , |\vec{B}|\sin\theta>$
How we come up the using this or any other method for vectors multiplication as dot product and cross product.
 
11:04 AM
@Rithaniel wise words
 
11:17 AM
Hey! I have a question: if $M=U \times V^{\text{t}}$ and $M^2=M$, why is it clear that $M$ is a projection matrix on $\text{span}(U)$?
Of course, $\forall x \in \text{span}(U), Mx=x$
But isn't there something else to check?
 
@Michelle That's not true
if $V=0$, you get $MU = 0 \ne U$ if $U\ne0$
What's your definition of a projection matrix ?
 
Also, in my problem we have $U = (1 ... 1)^T$ and $V = (l_1 ... l_n)$ with l_1 + ... + l_n = 1
sorry $V = (l_1 ... l_n)^T$
 
Ok, that's pretty essential for the "Of course" claim you made
Back to my question, what's your definition of a projection matrix ?
 
@Astyx thanks for your answer, I forgot to add some informations sorry about that... My definition of a projection matrix is the matrix of a projection on a certain basis
 
@LeakyNun thanks
 
11:27 AM
Here's a (huge) hint: look at $x = x - Mx + Mx$
 
@LeakyNun btw, in problem sheet 2, 4b. of algebra 3, do you think there is a typo? is it supposed to say compute $gcd(2+4i,13+ii)$ in $\mathbb{Z}[i]$ ? Since $13+i$ isn't in $\mathbb{Z}[\frac{-1 + \sqrt(-3)}{2}]$ as far as I can tell
whoops, * $gcd(2+4i,13+i)$
 
@Astyx I know that $E = Ker(p) + Im(p)$ so I should just show that $Im(p)=span(U)$ right?
 
Thats not necessary
It's true that span U is the image of $M$, but that's irrelevant to the fact that $M$ is a projection
 
@Astyx I don't think so :/
We already know that $M$ is a projection
I just want to prove that it's the projection over $\span(U)$
 
Oh my bad I misread you
Just showing Im M = span U works yes
 
11:33 AM
ok, thanks :D
 
123
If time permit pls answer my question.
the systematic way to approach vector multiplication.
 
What is $<|\vec{A}|\cos\theta , |\vec{A}|\sin\theta>$ ? @123
 
123
Components of vector $\vec{A}$ in 2D in polar form.
 
@porridgemathematics maybe they mean in the ring $\Bbb Z[i]$
 
yeah I think that's the most likely interpretation too
ok, ill just assume that for now then, thanks !
 
11:38 AM
I don't understand your notation @123
 
123
$|\vec{A}|$ = Length of Vector $\vec{A}$
 
<.,.> = ?
 
123
@Astyx Yes
 
@LeakyNun Anything can sound wise if you use the correct phrasing
 
 
1 hour later…
1:09 PM
I wonder why 'splitting field of separable polynomial is a separable field'
 
1:20 PM
@love_sodam how do you define separable field [extension]?
 
A finite extension E/F is separable if there is a field homomoprhism \sigma:F\to K that has exactly [E:F] extensions of \sigma
I didn't learn Galois theory so explanation using Galois theory won't help
 
1:34 PM
"extension" as in "factoring through F->E"?
 
@love_sodam you need these lemmas:
1. if K/E is separable and E/F is separable then K/F is separable
2. construction of splitting field
3. if E/F and p in F[x] separable then p in E[x] separable
4. factor of separable polynomial is separable
 
@Agi what's a random loss
 
@Thorgott I mean the extension of \sigma: F->K as \tau: E->K
@LeakyNun I know them all. How could I combine them?
 
Using Leaky's facts 1,2,4, you can reduce to the case that K(a)/K is separable when a is the zero of a separable polynomial
This can be accomplished in your definition by looking at extensions of the inclusion K->K(a) to K-automorphisms of K(a)
 
@love_sodam If f is a separable polynomial over F, let a be a root of f, and E = F(a). Then any embedding F -> barF has deg(f) = [F(a) : F] many extensions E -> barF (adjoin any other root of f, you get an isomorphic field E, embed via that).
Keep adjoining roots, use multiplicativity of degree and "number of embeddings E -> barF sitting over a fixed embedding F -> barF" to conclude
Well, I guess you're not fixing a universal field on the codomain in your definition of separability. Anyway, these are all equivalent: for any finite extension E/F, |Emb_i(E, barF)| <= [E : F] where i : F -> barF is a fixed embedding and Emb_i(E, barF) is all embeddings sitting above i, with equality iff E/F is separable.
 
1:56 PM
@Agi it's not really clear what your question is, assuming a random loss is just some random variable
 
i randomly lost an arm in an elevator accident
 
@Tho
 
@BalarkaSen that's what I learned as the definition of separabilty
 
its my favorite definition
one has to be a little backwards and construct the separable closure before starting any basic field theory when one does this but thats ok
 
you mean algebraic closure
 
2:01 PM
@BalarkaSen Holy shit this was the first thing I saw and I was like wtf are you doing here? Math makes you that high??
 
@Thorgott yeah
 
hii
 
the definition i wrote works with just the separable closure though
@Sayan it was a bad "random loss" joke
 
@BalarkaSen I was perplexed too tbh
 
@Thorgott If f\in F[x] is a separable polynomial and f = f_1\cdots f_n be a factorization then, if we let f_i(a_i) = 0 where a_i is an element of splitting field of f_i then the splitting field of f would be E = F(a_1,...,a_n) and once we prove F(a)/F case then F(a_1,...,a_n)/F(a_1,...,a_{n-1}) inductively?
@BalarkaSen I didn't learn algebraic closure
 
2:04 PM
yes
 
doesn't matter, you have the proof
 
@Rithaniel you just described the set of objects for the category of fields of study
 
Ye boi
 
@Thorgott Why F(a_1,...,a_n) is a splitting field of f over F? Does it follow from the fact that f is separable?
 
existence of algebraic closures is a very easy result if you accept Zorn
@love_sodam that's the definition of splitting field
 
2:11 PM
only mutants deny zorn
@Thorgott @LeakyNun I have a Galois theory question for you
 
I mean, yeah, but what I mean is that you usually assume choice and getting Zorn from choice is actually a non-trivial effort
 
@BalarkaSen go ahead
 
a lot more effort than getting alg closures from Zorn
 
@Thorgott How do we know f splits in F(a_1,...,a_n)? Only know there are roots of f_i's
 
@LukasHeger!
 
2:18 PM
hi @Balarka
 
Hiya @Lukas
 
hey @Edward
 
Ironman saved the world
 
@LeakyNun @Thorgott Let $E/\Bbb C(z)$ be an algebraic extension obtained from adjoining a root of $w^n + f_{n-1}(z) w^{n-1} + \cdots + f_1(z) w + f_0(z) = 0$. For a generic choice of $z \in \Bbb C$, this polynomial in $w$ has $n$ solutions over $\Bbb C$. Assume whenever $z \in \Bbb C$ such that this polynomial has less than $n$ solutions, it has exactly one solution over $\Bbb C$.
 
@love_sodam oh, I misread your suggestion; you wanna adjoin all roots one after another
 
2:20 PM
Prove that $E/\Bbb C(z)$ is Galois.
Do it by pure algebra
(You can't)
 
wdym generic choice, it has $n$ roots for every choice
 
Not distinct roots.
With multiplicity
Take $w^n = z$. Consider the choice $z = 0$
 
counting roots without multiplicity is degenerate
 
But you understood the question now right?
 
hi @Lukas, long time no see
 
2:23 PM
hi @Alessandro
 
Hello @Ironman
 
now I don't know why your claim is true, actually
 
How are you?
 
By PURE TOPOLOGY
hahah
You'll get screwed trying to prove it algebraically
 
this looks like you can do AG magic, dunno
 
2:24 PM
algebraic GEOMETRY
do it by Galois theory
 
@Thorgott So what I should do is adjoin all roots of f one by one and every time I do that, F(a_1,...,a_n)/F(a_1,...,a_{n-1}) is a separable extension as each $f_i$ is separable right?
 
@BalarkaSen what if $f_0(z) = 1/z$ and like $z=0$
how many solutions does this have
 
yeah
 
$w^n = 1/z$, you mean? It has two branch points, at $z = 0$ and $z = \infty$, at both of which it has one solution.
 
cause polynomials remain separable when passing to a larger extension and factors of separable polynomials are separable
 
2:26 PM
Same as $w^n = z$
 
so you're left with proving that adjoining an element with separable minimal polynomials produces a separable extension
 
@BalarkaSen so we're going projective now?
 
Yeah
 
@Thorgott Thanks. Love this chat room
 
This is the algebraic translation of having a branched cover $X \to \Bbb{CP}^1$ of degree $n$ such that at each branch point the cover looks like $z \mapsto z^n$.
Then it's automatically regular
Pure topology proof: It suffices to prove $\pi_1(\Bbb{CP}^1 \setminus D)$ acts transitively on the fibers, where $D$ is the branching locus. It suffices to take a fiber very close to one of the branch points, so the situation is like the fiber over $1$ under $\Bbb C \to \Bbb C$, $z \mapsto z^n$. Then under monodromy around a loop in $\Bbb C^\times$ any point on the fiber is taken to any other point because it's a cyclic monodromy.
 
2:31 PM
Why this universe is simply complicated?
 
Please translate this to algebra, algebraist
The original question was just about polynomials. No topology.
 
What does "adjoining a root from a polynomial" mean ?
 
Just assume the polynomial I gave you is irreducible over $\Bbb C(z)$. Consider $E = \Bbb C(z)[w]/(w^n + f_{n-1}(z) w^{n-1} + \cdots + f_0(z))$
 
Doesn't that just follow from $\Bbb C(z)$ being perfect ?
 
Huh?
Plenty of non-Galois extensions over $\Bbb C(z)$. Who said it's going to be normal?
 
2:39 PM
Finite Galois extensions of a perfect field $k$ are exactly the field of roots of polynomials
 
I didn't adjoin all the roots. Just one root
Eg why can't it be like $\Bbb Q(2^{1/3})/\Bbb Q$
 
Oh ok mb
 
yeah, that's just saying normal extensions of a perfect field are automatically separable
but in characteristic $0$, everything is separable anyhow
 
DO IT ALGEBRAISTS
 
do i look like an algebraic geometer to you
 
2:44 PM
just galois theory
question about polynomials
 
"question about polynomials" sounds like the title of a bad post on main lol
3
 
lol
 
yeah i will post it on main
defame algebraists
does category theory but does not even understand polynomials
 
"non mom, I'm not doing algebraic geometry, it's just Galois theory over $\mathbb{C}(z)$, I swear"
 
just polynomials
nothing fancy
 
2:48 PM
the question not being fancy doesn't mean the answer won't be fancy
 
"I have a simple question for mathematicians, is the Collatz conjecture true ?"
"does maths but does not even understand sequences"
 
but the answer isn't fancy, only if you try to write it down in terms of algebra
its a proof that algebra is a suboptimal language for mathematics in the large
 
Fake news
 
the answer is just that whenever you pinch you have loopy sheets
so its galois
 
laughs in smooth topoi
 
2:52 PM
[leaves]
 
@MikeMiller I have broken these algebraists
 
lmao
he actually did it
 
ANSWER IT ALGEBRAIST
 
im no algebraist bro
i cant answer hard questions
 
its a simple question
about polynomials
lol
 
2:56 PM
@BalarkaSen In his defense he told me yesterday "whatever it's visually clear"
 
lmao
 
see, im basically a topologist at that rate
 
$\infty$-groupoidist
2
 
my brain already hurts from doing 2-categories atm
long way to go till $\infty$
 
DO IT ALGEBRAISTS
YOU CANT
 
3:18 PM
@LukasHeger will be able to do it
 
1
Q: Question about polynomial

user585306If the polynomial $x^3+3px+q$ has a factor of the form $(x-a)^2$, then prove that $q^2+4p^3=0$.

 
Consider the functor $\operatorname{Hom}_\Bbb Z(R, -) : R-\mathsf{Mod} \implies \mathsf{Set}$. Is it representable?
 
If $(\pi_g,V)$ and $(\pi_h,W)$ are representations of two Lie algebras $\mathfrak g$ and $\mathfrak h$ respectively, what is the representation $V\oplus W$ of? It can't be $\mathfrak g\oplus \mathfrak h$ since this is the representation on $V\otimes W$, is it just $\mathfrak g\times \mathfrak h$ or something?
 
123
@Astyx Hello, is there any answer to my question?
How to proves systematically dot and cross product???
 
Leaky's question reminds me, @Thorgott, I finally understood the upper shriek map
 
123
3:24 PM
$\vec{A}\vec{B} = <|\vec{A}|\cos\theta , |\vec{A}|\sin\theta><|\vec{B}|\cos\theta , |\vec{B}|\sin\theta>$
 
@BalarkaSen and why can't I translate your proof to AG?
 
123
Components of two vector in polar form.
 
@LeakyNun You probably can, I was just messing with y'all. My proof seems correct though, right?
 
idk geometry man
 
yeah me neither
 
123
3:28 PM
If guys you have time pls share your experience with me for vector multiplication.
 
@123 What does this mean? Are you not taking the inner product here of a scalar with another scalar?
 
123
@Charlie My question is that how we come up the result of dot/inner product and cross product in systematic way.
 
The dot product is the defining operation of the inner product space $\Bbb R^3$, the cross product is essentially the exterior product on $\Bbb R^3$
 
123
@Charlie Yes i know this. But did not find the systematic way using two vector multiplication for dot and cross product.
 
Those are rigorously definable operations, what do you mean "systematic"? The cross product can only be defined on $\Bbb R^3$ and $\Bbb R^7$
 
3:33 PM
@Leaky does it satisfy the solution set condition
 
no idea what that is
 
set-valued functors on a category admitting coproducts are representable iff they have a left adjoint
adjoint functor theorem says that on a complete category, a functor has a left adjoint iff it preserves small limits and satisfies the solution set condition
 
@123 How exactly the inner product is executed depends on the inner product space you are considering, the only requirement is that it satisfy the axioms of an inner product, other than that you can basically go crazy with it
 
123
what i shared in $R^{2}$ for two vectors multiplication. How can we come up to the result of dot product by $\vec{A}\vec{B}$
 
solution set condition is some nonsense
 
3:35 PM
yeah that's what i'm saying
I don't remember nonsense
 
@123 I don't understand what you're asking
 
like for all objects in the codomain, you can each find a set worth of objects in the domain such that all morphisms from that object in the codomain factor through the images of morphisms under those set many objects or sth
 
@123 The inner product by definition is a map $V\times V\rightarrow \Bbb F$, the inner product you're using above does not match the arguments
 
it's like a weakened version of admitting a reflection
 
123
$\vec{A}\vec{B} = <|\vec{A}|\cos\theta , |\vec{A}|\sin\theta><|\vec{B}|\cos\theta , |\vec{B}|\sin\theta>$
This is right by systematic way.
i multiply two vectors.
 
3:38 PM
I saw what you wrote, but what you've written in $\langle \cdot ,\cdot \rangle$ is not two vectors
$|\vec A|\cos\theta$ is not a vector, it is a scalar
 
123
@Charlie Yes but it is one component of vector.
It serves as a component of vector.
 
Is $\langle\cdot,\cdot\rangle$ as you've written above intended to be an inner product?
 
123
@Charlie Yes. My question is that how we come up to the conclusion of inner/dot product. Because it is vector multiplication.
 
It is defined to take two vectors in its arguments, that is a definition
"vector multiplication" doesn't make sense unless you define what you're talking about
 
123
@Charlie definition i known to me. i wanted to know how we come up to this definition. How this is right.
 
3:43 PM
As I said, exactly how one executes the inner product depends on the space you are considering, the only constraint is the axioms of the inner product. If you want to know why exactly mathematicians in the past decided on those particular axioms then I can't give you the answer, you'll have to ask a mathematical historian I guess.
 
123
Problem is that definition is floating in every area of mthematics and physics. But how and why this true. This is what i wanted to know.
 
A definition is true by definition of what a definition is. The choice to make such a definition is a historical question, to which I don't know the answer, try asking here.
 
try 3blue1brown
 
@Leaky $\operatorname{Hom}_{\mathbb{Z}}(R,-)\cong\operatorname{Hom}_R(\mathbb{Z}\otimes R,-)$, no?
 
what's the tensor over
 
3:49 PM
Z
 
then that's just R
 
123
@LeakyNun I have seen 3b1b . But he did not use systematic (component wise multiplication) for vectors mutiplication.
 
uhh, I'm writing nonsense
but your functor is definitely representable
just have to remind myself of how restriction/extension adjunction worked
ah, it should be $R\otimes_{\mathbb{Z}}R$
a group hom $f\colon R\rightarrow M$ gives the $R$-hom sending $r\otimes r^{\prime}$ to $r^{\prime}f(r)$ and an $R$-hom $\varphi\colon R\otimes_{\mathbb{Z}}R\rightarrow M$ gives a group hom $R\rightarrow M$ by post-composing with the map $R\rightarrow R\otimes_{\mathbb{Z}}R$
 
aha, interesting
 
4:36 PM
Let $X$ be path-connected. What conditions do I need to impose on the space $Y$ such that $f\colon X\rightarrow Y$ is continuous iff its graph is path-connected as a subsapce of $X\times Y$? (the forward direction always holds, of course)
 
Topology ^
 
yeah, it's to balance my karma
:P
 
OK I deleted my first comment because I thought I misread your question and instead of being evil it was just silly
I deleted my second comment because I realized I misread your question and instead of being silly it's evil
The first applies again
 
lol
 
4:52 PM
What an ugly question
 
If the invariant curves of two manifolds are transversal does this imply that the manifolds are transversal?
 
What's an example of a discontinuous function with path connected graph between remotely reasonable spaces
 
is it true for X=Y=$\Bbb R$?
 
I don't have a counter-example
Yes, $X=Y=\mathbb{R}$ is the classic case
 
I would guess that if $\Gamma(f)$ is path-connected all the "obvious paths" are continuous
So that $f$ is continuous from the perspective of the unit interval
Then you need to characterize for which spaces that's enough
First-countable Hausdorff and locally path-connected is probably enough
You're a real shithead for asking this pal
 
5:01 PM
Argument goes like this. Assume $x_n\rightarrow x$. This sequence lies in some interval $[a,b]$. Pick a path $\varphi\colon[0,1]\rightarrow\Gamma_f$ from $(a,f(a))$ to $(b,f(b))$. By IVT, there are $t_n\in[0,1]$ s.t. $\varphi(t_n)=(x_n,f(x_n))$. $[0,1]$ is compact, so pick a convergent subsequence $t_{n_k}\rightarrow t$, implying $f(x_{n_k})\rightarrow f(x)$ and that's actually enough to imply continuity.
This standard argument doesn't generalize at all, tho
 
can anyone give me a hint?
 
For $\Bbb R^2\to\Bbb R^2$ there are easy counterexamples unless I'm missing something? Cut $\Bbb R^2$ along half of the $x$ axis and move the two flaps up and down
3
 
Lol nice
This man has pictures on the brain
 
Pure topology
Alesandro is the king
 
wdym move up and down
 
5:05 PM
spot_the_algebraist.jpeg
 
The map is R^2 -> R
The graph looks like a dude laying on the floor with one leg in the air
f(x,y) = 0 for x<=0, = 0 for y <= 0, and = x for y>0
 
Ah yeah sorry, I was thinking about the graph in $\Bbb R^3$ and messed up the codomain in my previous message
 
ahh
it's like a half-torn paper
 
its like a branch cut
Riemann surfaces
pure topology
DO THE POLYNOMIALS PROBLEM
 
yeah, kinda
like, arg does the job as well
so let's rethink the question: for which path-connected spaces $X$ is a map $X\rightarrow\mathbb{R}$ continuous iff graph path-connected
 
5:10 PM
alessandro is always thinking about moving flaps up and down
nvm
 
ok, I believe this won't work well either
just discontinuously project R^2 down or sth
 
@BalarkaSen I wanted to be a plane pilot, I don't know how I ended up in a math program but now I'm in too deep to leave
 
That was exactly what Alessandro's counter was to bro
You could try doing it with domain R but I bet that doesn't work either now
 
oops
 
@AlessandroCodenotti nice
 
5:13 PM
if the invariant curves of two submanifolds are transversal does this imply that the tangent spaces are transversal?
 
actually, doesn't the argument I gave above always work for domain R
I think it does
 
@LeakyNun I think to make my argument algebraic you need something like this: If $E/\Bbb C(z)$ is a finite extension such that the corresponding Riemann surface has a branch point at $z=\alpha$, then complete the guy with respect to the valuation of order of functions vanishing at $\alpha$
Then you get a field extension $E_\alpha/\Bbb C(z)_\alpha$ which should keep track of the branching structure at $\alpha$
I don't know enough about valuations to know if that's how it works
 
hmm
 
the monodromy around that point should be the "local Galois group"
$\text{Gal}(E_\alpha/\Bbb C(z)_\alpha)$
enter algebraic number theory
 
algebraic number theory? i thought it's just a question about polynomials?
 
5:22 PM
Trollgott
 
gotteem
number theory over $\Bbb P^1$ = complex analysis = topology in 2D = polynomials
they're all the same
Riemann the visionary has said so
 
@Balarka don't use that name in vain
 
Rehman
Koshy Rehman (Cauchy Riemann)
 
I meant ANT idgaf about Reimann or whatever his name is
weyyy
 
lol
 
5:29 PM
If I had a function $h$ defined as:
$$ h(n,0) := n \\
h(n,m+1) := f(h(n,m)) $$
where $f:\mathbb{N} \rightarrow \mathbb{N}$ and $n,m$ are natural numbers. And suppose everything is well defined as well as function $h$. My question is:
Can I say that for some fixed $n$ , $h(n,n) = f(f(....f(n)...)$ (where number of $f$ calls is equal to $n$) without proving it with mathematical induction ?
 
you can say whatever you want
if the question is about when it's ok to make claims without proving them, that depends entirely on context
 
oh cmon
 
I'm genuinely not sure what you wanna hear
 
if it depends on context it's kinda hard to express myself in the right way then
I'm wondering if "unwrapping recursion in a finite number of steps" is a valid mathematical method
or does it require a proof
Can't do better than that sry
 
what does "require" mean? that's the problem we're having here
to communicate to other people? only if they don't get it
to do a homework problem? probably it's required. to write a rigorous proof with full details? required
we don't know who you are or in what context you're doing this, so it's hard to interpret the word "require" is all
 
5:38 PM
The argument that $h(n,n)=f^n(n)$ should be easy to rigorously back up at the very least
 
ok how about this
 
Though, as others are stating, how rigorous you need to be does depend on the context
Like, if this is a problem for a logic course, you probably want to be very rigorous
(Since the whole point of logic is often times demonstrating rigor)
 
Suppose I got this:
$$ h(x,z,0) = x \\
h(x,z,y+1) = H(h(x,z,y), z-y)$$
And this as well:
$$ F(x,0) = G(x) \\
F(x,z+1) = F(H(x,z),z))$$.
I want to prove that $F(x,y) = G(h(x,y,y))$ (if it's correct by all means) using mathematical induction for a fixed $x$. And somewhere in the process I've reached the point that if I use the "unwrap" method I can prove it. But using purely induction, I'm stuck.
Now if I'm trying to prove something that's wrong ,this gonna be pretty embarrassing.
But I'll live
Every variable is element of $\mathbb{N}\cup {0}$
 
6:02 PM
I don't really see a good way to induct here, but perhaps I'm missing something
 
Could there be alternative way of proving such a thing ? So, not using induction.
I figured induction is my best shot here, at least for my calibre
 
Actually, $F(x,1)=F(H(x,0),0)=F(H(h(x,0,0),0),0)=F(h(x,0,1),0)=G(h(x,0,1))$
Hmm, but you want $F(x,1)=G(h(x,1,1))$
dunno, this seems messy
 
6:42 PM
For the regression model $Y = \beta_o + \beta_1x_i + \epsilon_i$.
Why is the estimator line $\hat{Y} = b_o + b_1 x_i$ and not $\hat{Y} = b_o + b_1 x_i + \hat{\epsilon_i}$
 
Question: Is there a known free group representation of the Monster?
 
@Thorgott okay np, ty
 
7:20 PM
To a physicist the "generators" of a Lie algebra are just a basis for the vector space structure of the algebra, apparently this means something different to mathematicians, does anyone know what this is?
 
presumably one would say some collection g_1, ..., g_n are generators for the Lie algebra if the smallest subalgebra containing them is the lie algebra itself
aka, the lie algebra is the span of all of the g_i, together with all [g_i, g_j], together with all [g_i, [g_j, g_k]], etc
not sure this is a useful concept
 
7:39 PM
ok ty
 
8:24 PM
hi chat
 
How's it going ?
 
what's poppin
 
Quite well thanks, what about you?
 
A bit stressed about US politics, but apart from that I'm quite good as well
 
8:34 PM
@MikeMiller I think it's a useful concept, given a Lie algebra g and a Lie subalgebra h, you can ask what's the least n such that g = h + [h, h] + [h, [h, h]] + ... (n terms here)
That's the bracket-length, I think relevant in sub-Riemannian geometry
 
"sub-Riemannian"
wtf
 
g can be degenerate
 
(If g is indeed of the above form for some n, h is a nonintegrable subalgebra in g)
 
@Thorgott vs "supra-Riemannian" :P
 
wippidy wappidy doo
 
8:44 PM
rehi @Balarka
 
rehi @Alessandro
 
So do you have time for some amenable nonsense?
 
Not today I believe. Sorry.
It's almost time to sleep and I haven't gotten done with any of the things I waned to get done with
 
I believe you were able to take "yell at algebraists" off your to-do list, tho
 
We win one hour tonight though
 
8:57 PM
winning is good
 
@BalarkaSen a classic saturday
 
02:00 - 21:0021:00 - 00:00

« first day (3734 days earlier)      last day (1297 days later) »