« first day (3409 days earlier)      last day (1604 days later) » 
00:00 - 18:0018:00 - 00:00

12:00 AM
@Ultradark $$\zeta(3) =\frac12\int_0^\infty \frac{t^2}{e^t-1}\,\mathrm dt$$
 
I think so, Ted.
Maybe I need to take a break when I resort to asking about elementary things.
 
Okay cool
I found another one
$$ \int_0^1 \frac{\ln(x)\ln(1-x)}{x}~dx=\zeta(3) $$
 
yeah I didn't look at that post
 
12:09 AM
Did you just feel that this integral is Zeta(3)? :D
 
No, he smelled the zeta on it.
 
each integral has a specific odor
 
fwiw, that zeta integral (involving 1/(e^t-1)) shows up noticeably in statistical mechanics
namely, when doing certain computations re: photons
 
$$\int_0^1 \frac{\ln^3(x)\ln(1-x)}{x}~dx=6\zeta(5)$$
 
that one, by contrast, I've never seen in physics :P
 
12:22 AM
$$\int_0^1 \frac{\ln^5(x)\ln(1-x)}{x}~dx=120\zeta(7)$$
Exercise 2.65 show that the floor of this integral $$\int_0^1 \frac{\ln^7(x)\ln(1-x)}{x}~dx$$ equals the sum of the first $100$ natural numbers
I'm starting to notice a pattern
 
1:22 AM
$\begin{array}{rcl} \displaystyle \int_0^1 \frac{ \ln^n(x) \ln(1-x) } x \ \mathrm dx &=& \displaystyle \int_{-\infty}^0 u^n \ln(1-e^u) \ \mathrm du \\ &=& \displaystyle \int_0^\infty -t^n \ln(1-e^{-t}) \\ &=& \displaystyle \sum_{k=1}^\infty \frac1k \int_0^\infty t^n e^{-kt} \\ &=& \displaystyle \sum_{k=1}^\infty \frac1{k^{n+2}} \Gamma(n+1) \\ &=& n! \zeta(n+2) \end{array}$
 
0
Q: Do North Koreans use Latin letters in their equations?

Akiva WeinbergerDo North Koreans use Latin (and Greek) letters in their equations? On the one hand, being such an isolationist country, I wouldn't be surprised if they used the Korean alphabet (조선글) in their equations. On the other hand, the similarly isolationist Soviet Union used Latin letters in its equation...

What are the odds of an answer
 
> Nearby China uses Latin as well (imagine using characters (漢字) as variables! …Actually that would be so cool. But never mind)
@AkivaWeinberger we actually do use characters as variables
The ten Heavenly Stems or Celestial Stems (Chinese: 天干; pinyin: tiāngān) are a Chinese system of ordinals that first appear during the Shang dynasty, ca. 1250 BC, as the names of the ten days of the week. They were also used in Shang-period ritual as names for dead family members, who were offered sacrifices on the corresponding day of the Shang week. The Heavenly Stems were used in combination with the Earthly Branches, a similar cycle of twelve days, to produce a compound cycle of sixty days. Subsequently, the Heavenly Stems lost their original function as names for days of the week and dead...
we use 甲乙丙丁戊己庚辛壬癸
 
So 2甲+乙=6? That sort of thing? @LeakyNun
 
I think so
this was so long ago lol
 
1:44 AM
I can speak nonsense
 
Is there anyway one can "pack together" stuff when dealing with equivalence classes? I will explain what I mean by this:
In the construction of ring of fractions, completions of modules/rings/groups it is kind of annoying to verify the operations on them are "well defined" since they are defined through equivalence classes.
Is there like a general categorical theorem that includes all the cases?
This is kinda of a useless question since one can always go through these process but just curious...
 
2:04 AM
In differential equations, the homogeneous and particular solution are both independently solutions, and I have a problem where I have three constants to solve for but only two initial conditions
It seems to be doable, as WolframAlpha solved it, but I'm wondering if I can use the solutions separately to solve for the constants instead of using just the general solution
as with the general solution alone, I'd only have two equations (one for x(0) and one for x'(0)), which is not enough to solve for 3 unknowns
The equation and initial conditions I have are x'' + 30.61x' = e^(-.2t); x'(0) = 0; x(0) = 0
 
@AkivaWeinberger I don't think they wrote equations. In ancient Chinese math books, equations were usually written in complete sentences. Also, they used graphs and charts to represent equations. Check this book for example Jade Mirror of the Four Unknowns.
 
@YourongZang Who said anything about ancient? I'm talking about today
 
@AkivaWeinberger Oh I saw @LeakyNun's comment.
@AkivaWeinberger If you are talking about today, then I believe everyone uses Latin characters, even in the nation that is the most reluctant to Western culture (since you list the USSR and China so I guess you are thinking of this problem politically). And @LeakyNun's is talking about ancient Chinese math.
 
Wait @LeakyNun when you said "this was so long ago lol" did you mean your childhood or your ancestors
 
my childhood
 
2:16 AM
Yeah that's what I thought
 
20
 
@LeakyNun Wow that is unexpected lol. I thought using Chinese characters was like 50 years ago.
 
maybe I'm wrong
I really don't remember much
 
2:43 AM
@Rogue the homogeneous and particular solution are both solutions, but you can't add constant multiples of the particular solution. So I only see the two constants parametrizing the homogeneous solution.
 
I'm not sure if I follow on that last statement
Ohhh my god I see now
Bless you
 
2:58 AM
np
 
3:33 AM
If a finite field F has characteristic p (prime), doesn't that mean p=0_F?
 
I think if that implies $F = \Bbb{Z}/p$ then yes
 
@Hawk if you take p to mean 1 + 1 + ... + 1, p times, then yes. That's the definition.
 
yes, and I don't see what's wrong with that
 
Three answers! Spoiled
 
@LeakyNun why would you think there is something wrong with that.
 
3:38 AM
because he says "doesn't that mean"
 
and?
 
@anakhro, then consider the Frobenius endo where we take $a \to a^p$. This is supposed to be injective, but if $p = 0_F$ doesn't that mean $a \to 1_F$?
 
Exponents are not in the field.
Exponents are integers.
 
Isn't a^p = aaa....p times?
 
Exactly.
 
3:42 AM
So the issue is idenfiying $p=0_F$ in the exponent? Because such law does not exist in a general field?
 
@anakhro "doesn't" is a rhetorical question
implying that it cannot be true
 
Indeed. Exponents are all in integers.
 
*fields with characteristic 0
i mean we are assuming $p$ is prime in a finite field, that's an integer
 
No it is not. It's an element of the field.
It's 1+1+...+1, p times, where 1 is the identity element (and not necessarily "one" the integer).
 
let's just use $\uparrow p$ for the element of the field and $p$ for the integer
so $\uparrow p = \uparrow 0$
and $a \mapsto a^p$ is injective
 
So what do we mean when we say charF is prime then?
 
char F is an integer
it is a prime number
 
okay but that is the same number in the exponent
a^p
 
yes
 
The notation p = 1+1+...+1 is not the same p as is in "char F = p".
Former is an element of the field. Latter is an integer.
 
3:47 AM
$\uparrow p = \underbrace{1_F + 1_F + \cdots + 1_F}_{\text{$p$ times}} = 0_F$
$a^p = b^p \implies a = b$
$a^p = \underbrace{a \times a \times \cdots \times a}_{\text{$p$ times}}$
 
Weak Nullstellensatz still holds for $\Bbb C[\{x_i\}_{i \in I}]$, right? As in, the maximal ideals are of the form $(\{x_i - a_i\}_{i \in I})$.
'Cuz ideals in a direct limit of rings is direct limit of ideals, I think.
 
well if that's true then maybe that's true
oh no
10
Q: Maximal ideals of polynomial rings in infinitely many variables

Matemáticos ChibchasLet $k$ be an algebraically closed field. Nullstellensatz states that the maximal ideals of the polynomial ring $R=k[X_1,\dots,X_n]$ are precisely those of the form $\langle X_1-a_1,\dots,X_n-a_n\rangle$, with $(a_1,\dots,a_n)\in k^n$. What if we are working with infinitely many variables, sa...

 
Wow clever
 
hang on so in the Froben map, the pth power a^p, the p in the exponent is not charF but the prime number p?
 
Yes.
 
3:52 AM
wow that is confusing.
 
@BalarkaSen my example was wrong as I misunderstood
 
The catch is that char F is the prime number p.
 
instead you take $I = \Bbb C(X)$
and project the polynomial ring onto it
 
So I need to take $I$ to have smaller cardinality than $\Bbb C$
That's all
 
You are just confused over the notation "p" in the field, @Hawk
 
3:53 AM
apparently so
@AkivaWeinberger hi
 
Hey
You are not wrong. But USSR was never as isolationist as North Korea. — Moishe Kohan 1 hour ago
 
I am using Dummit and Foote and in prop 35 where he introduces the Frobenius Endo (548) he literally just calls everything p.
 
@Hawk yes the fact that he abuses notation and says p is in the field (if that is what he does), that could be very confusing.
However, you should note in particular how exponents are defined.
 
@LeakyNun Hey you know the theorem that says a finite field of characteristic $p$ must have cardinality a power of $p$
 
In particular, if a is in the field and k is a positive integer, we define a^k to be aaa...a, k times.
 
3:55 AM
sure
 
and the proof is: note that the field is a vector space over $\Bbb F_p$
 
yep
 
I was about to say that
 
What other places can that trick be used
 
in Galois theory
 
3:56 AM
where you want to show blah is a power of a prime, and it turns out blah counts a vector space
 
oh
in knot theory
 
@Hawk note that a^k wouldn't necessarily make sense if k were in the field.
 
@anakhro i mean as an example, if i have some field F where the elements are matrices and lets say charF = 2 (a prime) then 2I = 0_F. But charF = 2I right? it can't be charF = 2 as you say.
 
Ah right the number of n-colorings of a knot, yeah?
 
@AkivaWeinberger yes
 
3:57 AM
@AkivaWeinberger You use a similar trick to prove Wedderburn's little theorem
 
Wait n doesn't need to be a prime does it
@BalarkaSen Which one's that again?
 
well usually n is a prime
 
What if it's not, do we still get a power of n?
 
@Hawk Right about 2I = I + I = 0_F, but char F = 2, not 2I.
 
no idea
 
3:58 AM
@Akiva A finite division ring is a field
 
The characteristic of F is defined to be the number of times you must add the multiplicative identity in order to get 0.
So it will be an integer.
 
You view everything as a vector space over the center and use the class equation on the multiplicative groups
 
@anakhro so in the same example, if i have a matrix A, and i take the pth power (2 in this case), A^2 \neq A^charF
 
you use H^2
 
And then some number theory trick
 
3:59 AM
it's equivalent to H^2 of every finite field is trivial
 
@Hawk no.
 
Also true
 
Sorry, no, it's not true. They are the same.
 
But that's not how Wedderburn's original proof goes
 
this chat is distracting, I have an assignment due in an hour that I still haven't started, bye
 
4:00 AM
Char F, the characteristic, and the power in the Frobenius endomorphism are ALL integers.
 
I'm guessing if n is not prime then the number of n-colorings need not be a power of n but at least it's a product of powers of the prime factors of n
 
The thing which is NOT an integer, is p = 1 + 1 + ... + 1.
But that's merely an abuse of notation
 
what's the abuse of notation? 1_F + 1_F = 2(1_F)
 
The abuse of notation would be if you called that "1_F + 1_F" by "2".
As you wrote, it is more correctly, 2(1_F).
 
People sometimes will write $\bar p$ for the element of the finite field, and $p$ for the element of the integers
In any case, it's the image of of $p$ under the (noninjective) homomorphism $\Bbb Z\to{}$whatever you're working with
 
4:07 AM
But in every situation charF = p(1_F)= 0_F. right? But is there no division in the field to say p = 0_F?
in the context of beginning Galois theory
 
No.
In every situation (excepting those that abuse notation) char F is an integer and NOT an element of the field.
 
so you are saying my last statement is incorrect
the division part
the one that identifies the integer prime p with the 0_F
 
You'd be abusing notation if you identified an integer with an element of the field.
(assuming the field is not built as a subset of the integers---it often isn't).
 
So basically when we talk about A^p (pth power) we are NOT talking about A^(p*1_F). Because $p(1_F) = 0_F.$ i think this is my confusion
 
@Hawk how would you even define A^k where k is an element of the field?
 
4:16 AM
i guess it isn't always defined
But is that my confusion?
or what you were trying to explain to me?
 
I think there are multiple points of confusion.
That's one of them.
 
p is just tellin' you how many times to do shit
waddup yo
 
sup
 
@anakhro what are the others u think i might have? i think i cleared them right? Because I think i recalled I initially asked if a^p = a^0, but we just dismissed it as this would be asking a^(p*1_F)
 
i don't understand how this has been going on for like an hour
 
4:20 AM
@ÍgjøgnumMeg some people need time to understand things.
@Hawk do you understand how writing "p=0_F" is an abuse of notation now?
 
yeah i think my explanation clears that up right?
 
It's worse than abuse of notation because a^(p*1_F) is nonsense - it doesn't make sense
So it should be clear from the outset that the exponent there is just an integer, and like Ig said, it's telling you how many times to multiply
 
I know because that's what i was trying to do
 
Plain and simple
 
i m writing a^(p*1_F) as a demonstrative artifice. I know this thing has no meaning under certain fields.
 
4:23 AM
OK
 
@BalarkaSen for being so plain and simple I think you missed what that comment was saying. :P
 
I am not reading hours of rambling about how an exponent is something from the field
 
I understand.
@BalarkaSen you recall that companion matrix commuting thing?
 
yes
 
Is there an elementary way of showing that only those maps which are polynomials in the matrix commute with it?
 
4:28 AM
Yeah, you can prove by hand that the space of matrices commuting with an $n \times n$ companion matrix has dimension $n$
And since powers of the companion matrices all commute with it, they have to span
 
Ah, that's not a bad idea at all!
I was thinking some mess with rational canonical form would be the easiest.
 
Yeah in general it's a good exercise to count the dimension of matrices commuting with a given matrix $A$ in terms of it's rational canonical form
It's some Frobenius's theorem. Had that as an assignment problem
Wait, what was the original problem again?
 
I don't remember.
 
Was it counting the dimension of $k[x]$-linear endomorphisms of $k[x]/(f^n)$ as a $k$-vector space?
$f$ being some irreducible polynomial
 
Yeah. Something like that.
I think it was just finding all the k[x] linear ones.
 
4:36 AM
Alright. There should be a direct way to argue that the vector space $\text{End}_{k[x]}(k[x]/(f^n))$ is $k\langle 1, x, x^2, \cdots, x^{n-1}\rangle$, where by $x^i$ I mean the multiplication by $x^i$ map.
Let's see
Lol, by $f^n$ I mean $f$ everywhere. Some degree $n$ polynomial $f$
 
OH
I think I am onto something
(i.e. if you get it don't spoil it just yet)
 
Alright
It's actually exactly similar to the matrix argument
 
anyone wanna see something with many colors
 
@BalarkaSen do you have it?
 
4:49 AM
Do you use an evaluation map to compare dimensions?
 
Hm. I am just proving that $\text{End}_{k[x]}(k[x]/(f))$ is isomorphic to $k[x]/(f)$ as $k$-vector spaces in a natural way.
Just send $x^i$ to $x^i$
Oh yeah, I see what you mean
Yes, send an endomorphism $\phi$ to $\phi(1)$
Exactly right
 
Great.
 
It's still fun to count the dimension of matrices commuting with $C(f)$ by hand :)
 
is sitting there picking glass out of his eyes.
looks DIRECTLY at Balarka Sen.
 
so anime of you
 
4:56 AM
No, that's what I'd rather do than watch anime.
 
cool colorful math art
 
$C(f) A = A C(f)$ will essentially tell you that the cyclic shift of $k$-th column of $A$ is equal to the $k$-th column of $A$ for all $1 \leq k \leq n-1$, so all entries of the columns through column $1$ to column $n-1$ are identical, contributing to $n-1$ dimensions
 
@BalarkaSen I'm back from my suffering
 
or something
 
what are you talking about?
 
5:01 AM
@LeakyNun Go back
 
@BalarkaSen :c
 
Just matrix theory
 
what's the question?
 
Count $\dim_k \text{End}_{k[x]} (k[x]/(f))$ where $f$ is some irreducible polynomial of degree $n$
 
hmm
 
5:06 AM
 
in general $\operatorname{Hom}_A(A/I, A/I) = \{ f \in \operatorname{Hom}_A(A, A/I) \mid f(I) = 0 \} = \{ x \in A/I \mid Ix = 0 \} = A/I$ @BalarkaSen
 
The worst part is Autocomplete was absolutely right, that's exactly what I wanted to Google
O.O
 
how aerodynamic is a cow HAHAHA
 
@AkivaWeinberger maybe you were reading about cows before
 
@LeakyNun True.
 
5:09 AM
@BalarkaSen play?
 
Now I'm no uh air scientist but I think from that video the answer is "not very"
 
why on earth would... nvm
 
5:10 AM
The ships hung in the air in much the same way that cows don't
Answer to #3 is nothing, and uh for #4 when a mommy cow and a daddy cow bull
 
do cows moo at night????
 
Depends on if they're awake or not?
I mean I dunno maybe the one awake one doesn't want to wake up the others
 
Go do something productive for Christ's sake
 
Balarka I'm trying to figure out the efficiency of launching cows this is a matter of importance
 
I just made an artwork
 
5:13 AM
Jesus Christ this discussion about cows is pissing the hell out of me
 
And if I do it at night they won't make a noise while I'm doing it, apparently
What is a cow scared of though
 
Currently reading: Why VR headsets on Russian cows are nothing to moo about
 
insert political joke here
@Ultradark baffled nonverbal response
> Cows are way less spooky than horses
I think they meant to write "spookable" or something (re: what are they scared of)
but I like the idea of spooky cows
 
Artin's proof of existence of algebraic closure is sneaky.
 
I mean only 11 months to Halloween right?
 
5:16 AM
@BalarkaSen and actually the first step is already algebraically closed
but it's a whole nother story
 
Interesting, how so?
 
Are you talking about fields
'cause those might have cows in it
 
JESUS
 
@BalarkaSen it's long and I don't know how much time you have
I hope I still remember the proof
 
I have all the time in the world lol
 
5:18 AM
so the claim is that if $L/K$ is a field extension such that every monic irreducible polynomial has a root in $L$ then every polynomial in $K$ splits in $L$
 
This picture exists
 
the first step is to eliminate separability issues by showing that the perfect closure of $K$ is contained in $L$
 
despite the previous conclusive evidence that cows are not aerodynamic
 
and I'll explain the two words if you don't know what they mean
 
Unrealistic
 
5:19 AM
@BalarkaSen maybe we should go elsewhere
 
Already there
 
No it's OK I'll leave
 
6:04 AM
Any tips for solving the functional equation $f(t)/f(at) = g(t)$ for $f$ in terms of $g$?
 
@BalarkaSen does invertible $k[x]$-linear homomorphisms add any meaningful conditions to pick a special subgroup of polynomials in the companion matrix?
Or is that a much harder distinction to make than the $k[x]$ linear part.
I think it might be the conjugacy class of the companion matrix, then?
 
@user76284 I would think about evolution, i.e. suppose $f$ is defined on $[a^n, a^{n+1}]$, then the functional equation lets you extend the domain to $[a^{n-1}, a^n]$, etc
 
@LeakyNun I'm asking for stats.stackexchange.com/questions/439063/…, just to give some context.
So $f$ and $g$ here are characteristic functions of probability distributions, where I want to express $f$ in terms of $g$.
 
6:46 AM
@anakhro Hm, I don't know, that seems like an interesting question. You want $k[x]$-linear automorphisms of $k[x]/(f)$? That corresponds to units of $k[x]/(f)$ I believe. That should depend on the polynomial $f$ heavily.
If you have like $k[x]/(x^n)$ everything outside of $(x)$ is a unit. If you have $k[x]/(x^n - 1)$, all the powers of $x$ are units.
In your case $f$ was some power of an irreducible polynomial, right? Then if $f = p^n$, the units of $k[x]/(p^n)$ are the ones outside the ideal $(p)$, which is the unique maximal ideal with quotient field $k[x]/(p)$.
It's what is known in literature as a local ring.
 
7:09 AM
and by CRT you can decompose $k[x]/(f)$ into product of local rings, and the units decompose similarly
 
 
1 hour later…
8:27 AM
I understand things in the wrong order and it's disgusting
 
8:52 AM
the only other choice you have is to not move on until you have fully understood what is being presented, but that can make learning a painfully slow process in my opinion
 
9:32 AM
Is there anyone here who knows why this \sum_{j=p}^{r-1}\frac{1}{2} is equal to \frac{r-p}{2} ?
 
Well, what is $\sum_{j=0}^{r-1}\frac{1}{2}$ equal to?
Or, maybe, what is $\sum_{j=0}^3\frac{1}{2}$? Or what is $\sum_{j=0}^7\frac{1}{10}$. Compute a few sums and see if you can tell what is happening when you sum a constant from 0 to r-1
(and then, when you have a good grasp on that, think about what happens if you start counting from p instead of 0)
 
10:34 AM
what is wrong with some of the people who denote $\mathbb{R}^n$ as $\mathbb{R}^m$
 
nothing, why?
provided we're talking about positive integers in both cases :P
 
Hehe: $\mathbb{R}^z$ where $z\in\mathbb{C}$
 
that's just $e^{z \log \Bbb R}$ of course
 
10:54 AM
@skullpatrol because $n$ represents 'n'atural numbers more than $m$ does. I suddenly lose all intuition when I see $\mathbb{R}^m$ before me.
 
so all of your $\Bbb R$-linear maps are endomorphisms then
 
11:05 AM
@famesyasd I agree "n" is a more natural first choice, but one could argue mnemonically that m comes before n alphabetically :-)
and then use "n" later in the content of the presentation
 
11:22 AM
Imagine if someone used lower case letters for sets and upper case letters for elements of the set
 
::eye twitches::
 
11:42 AM
@Rithaniel why would you even say that it's off topic and it's disgusting
 
perhaps, the teacher wanted the students to learn things in the wrong order :P
 
12:04 PM
It's on topic. We're talking about conventions in syntax
 
12:17 PM
@BalarkaSen I think you did the evil algebraist thing.
"...which is the unique maximal ideal with quotient field k[x]/(p)..." Surely you mean equipped with the standard surjection k[x] -> k[x]/(p)/?
Seems like you should be able to find different ideals which by fluke give isomorphic quotient fields.
 
Nothing and nobody escapes the algebraic police
 
12:35 PM
What is an example of a piecewise continuous function which converges pointwise to a non-piecewise continuous function?
 
@FuzzyPixelz this might be overkill but enumerate all the rationals in $[0,1]$ as $\{r_1,r_2,r_3, \cdots\}$ then define $f_n = 0$ on $\{r_1, r_2,\cdots , r_n\}$ and $f_n = 1$ everywhere else. Then this converges to the function which is $0$ on all rationals and $1$ on irrationals which is not piecewise and not continuous. I don't see what you mean by non piecewise continuous.
 
Wait, what is your definition of piecewise?
 
Continuous except at finitely many points
 
Ah, no worries. Thank you.
 
12:56 PM
That's the same thing
 
Yeah
I had a few questions on the operator topologies.
Why are there so many of them? How do you know when to use which one? Like the most natural seem to be norm and strong. The weak topology at a first glance doesn't seem that obvious.
In the case of unbounded operators, is the norm the only topology that you can give?
 
1:17 PM
The whole point of the weak (and weak*) topology is to have compactness of the unit ball
How would you define the norm for unbounded operators?
 
1:29 PM
Oh yeah you cannot just realised. That must really complicate matters. All operators which I am interested in like the Schrödinger operator are all unbounded
 
@SayanChattopadhyay There's a lot of theory about unbounded operators, I'm not very familiar with this part of functional analysis, but if you have specific questions I'll be happy to hear them
 
Sure @AlessandroCodenotti. I am attending a school on Operator theory and quantum groups. In a few days I will ping you with questions hopefully.
 
Ok, just as a warning I know some functional analysis but I know nothing about physics or quantum stuff
 
They call it quantum groups but there isn't a hint of quantum mechanics in it. I guess there's some motivation from quantum mechanics.
 
1:57 PM
Yeah it is more of a Lie theory thing.
And the etymology of quantum in this case is concerning a deformation of Hopf algebras.
 
2:39 PM
wait so if the derivative of a piecewise can be shown to be calculated on an infinite domain it isn't considered continuous? like suppose the number tiers has a defined expression for the $k^{th}$ tier or something of that nature surely that can still be shown to be continous
or continuous to the exclusion of the infinite number of points defined as I described
I mean a lot of sieves according to my present understanding work off such a principle, the accuracy of the sieve is increased as you compute a greater number of tiers for its expression, which is a piecewise of course
ones intended for curve fitting I mean of course
 
Anyone know how to calculate error/loss for very small values? I'm using MSE but since the values are all <1 the error comes out very small even though that means its incorrect
Would summing the errors instead of taking their mean still be a useful metric?
 
 
2 hours later…
4:38 PM
Can anyone let me know why this is not a lattice? I think it is because b join c = d and b meet c = a
 
what's wrong with "b join c = d and b meet c = a"?
 
What will be d join e here? Will it exist?
@LeakyNun what is wrong in that?
 
you said it is not a lattice because "b join c = d and b meet c = a"
I don't see how "b join c = d and b meet c = a" makes it not a lattice
 
@LeakyNun I know but my book says it's not a lattice because b meet c does not exist
@LeakyNun I think it is a lattice, isn't it?
 
it isn't a lattice because b join c doens't exist
(it would have to be d and also e)
 
4:46 PM
@LeakyNun what do you mean
 
suppose b join c exists
since b <= d and c <= d, we have b join c <= d
similarly b join c <= e
 
But isn't join the least upper bound?
 
and there's no least upper bound
 
So b join c should be d
@LeakyNun isn't the least upper bound = d
 
but then b <= e and c <= e, which would force d <= e, which is not true
e is also an upper bound
but d is not <= e
it's not the "least" because it is incomparable to another upper bound, namely e
least has to be <= than every other thing
 
4:49 PM
Oh so d can be larger or smaller than e we can't know about it right?
 
no, your diagram means that d and e are incomparable
this is not a total order
things can be incomparable
 
@LeakyNun I don't get it
 
"d <= e" is false
"e <= d" is also false
that's what your diagram means
 
How
@LeakyNun nvm, I think I got it, thanks.
@LeakyNun Suppose I have this lattice
Then will this be the sub lattice of the given lattice or not?
 
5:10 PM
Can someone help?
 
Good evening.
I have a question regarding notation.


Suppose we are calculating the following integral $\int \frac{1}{x^2+4}dx$ then for a substution we can assume that $g(x) = x^2 +4$ and then build $\frac{dg}{dx} = 2x$ Which is a notation that i am very comfrotable with.

However for lets say $\int (1-x^2)^{1/2} dx$ we can suppose that $Cos(t) = x$ and then derive $\frac{dx}{dt}=-Sin(t)$
With this notation i am not comfortable.
I want to express it in the sense of a function $t(x)$
I do not like deriving a variable like $x$ to $t$. i am much more used to deriving a function $f(x)$ to $t$
 
5:26 PM
I am thinking about it and it occurred to me that this $x$ could mean $f(x)=x=cos(t)$? (I read something about that in Wikipedia) I n that how could a function $f(x)$ become dependant on $cos(t)$? with $t$?! I am really confused here.
 
Have you learned integration by substitution as a rigorous theorem?
 
Sadly not. I am just forced to scrap the pan for couple of information to do physics.
 
00:00 - 18:0018:00 - 00:00

« first day (3409 days earlier)      last day (1604 days later) »