« first day (2780 days earlier)      last day (2538 days later) » 
00:00 - 18:0018:00 - 00:00

18:00
so in the case where the constant term is zero, the above statement doesn't follow and you have to consider this case separately.
So: What happens when -n-11 = 0?
@Semiclassical n=-11
Right. In which case the equation is?
$x^2 +4x = 0 $
$x=-4$
Right. And that's definitely got rational roots, so $b=-11$ works.
so modular difference is 3
18:06
right.
Hi! Could you help me on these 3 lines?
@LeylaAlkan imgur is blocked on my computer
You may need to use vpn
no, I blocked it on computer for the next several days, I cannot undo that using any technique
oh, okay :)
18:10
lmaooo the stars on Ted's line
I never knew folks on here could be such good trolls
Any thought @Abcd :) ?
@LeylaAlkan High School student , no idea about all this high level stuff :P ...
hahah, I wish I knew this site when I was in highschool too @Abcd
Yeah, its a big help in Physics, Chem, Maths!
Welcome @Lucas I have a problem again :D
18:22
Helo chat
I wish I had the internet when I was in high school :/
@TheTestosteroneFanatic Lol, how old are you?
@TheTestosteroneFanatic did you use to have another name on mse?
What notation $\hat{f}(n)e^{int}$ means ?
@Abcd 23
@AlessandroCodenotti yes, it's SoumyoB
18:25
@LeylaAlkan What's your pb on these lines ?
Aha, you're the probability guy!
In the first line, they just rewrite the statement, there is no proof :) @Lucas
@AlessandroCodenotti yes, that's right
I'm taking the measure theoretic probability course this semester, I've finally seen an example of two distinct random variables with the same moments today, that stuff is weird
18:39
@AlessandroCodenotti yeah, I remember that moments being equal doesn't imply distributions being equal
but just keep forgetting the exact example
@Tuki $\sum_{n\neq 0}\hat f(n)e^{int}=\sum_{n=1}\hat f(n)e^{int}+\hat f(-n)e^{-int} $
ok
19:01
I got the first line @Lucas, what about the second line?
@TobiasKildetoft why exactly do we have to be careful with decomposable algebras? If $A=B \times C$ and $b_1, \dots, b_n \in B$ is a positive basis of $B$ that includes $1$ and $c_1, \dots, c_m$ is a positive basis of $C$ that includes $1$, then $b_1 \oplus c_1, \dots, b_n \oplus c_m$ will be a positive basis for $B \times C$, or am I missing something? At least this direction seems to work. (But $B \times C$ may have a positive basis even when $B$ and $C$ don't)
So assuming that the quiver stuff works for basic commutative algebras in general, that should give us by induction with the stuff we have done before that there is always a positive basis in the commutative case
@Lucas It says directly "If $f$ is odd, then $f(s)\cos(ns)$ is odd, so $A_n = 0.$" It only examines $A_n$, how it reduced the examination from "$A_n \cos (nt) + B_n \sin(nt)$ should be odd" to only "$A_n$ should be odd "I hope what I said is clear :)
@MatheinBoulomenos I am not sure which ones you are adding there. We need $n+m$ elements to form a basis, and you seem to have $nm$
Oh
yeah that was nonsense
sorry
Oh okay I got that too :) @Lucas
19:15
as long as no products in one of them contain $1$ with non-zero multiplicity, then it works when we take the union of the bases but replace the first one by the sum $b_1+c_1$ (assuming it is $B$ that has this property, otherwise we replace the one corresponding to $c_1$ by it)
But without this property, it becomes a bit tricky to see how one might do a nice change to include $b_1 + c_1$
since whenever such a product exists, we need to subtract something
It might be illustrative to see what the change looks like for $\mathbb{C}^3$ when we regard it as $\mathbb{C}[\mathbb{Z}_2]\times \mathbb{C}$ and change to the basis corresponding to having it be $\mathbb{C}[\mathbb{Z}_3]$
But the union of $b_1 + c_1$ together with $b_i + 0$ and $0 + c_j$ will be a generating system, right? If I have a vector space $V$, a linearly independent subset $X$ and a generating system $Y$ such that $X \subset Y$, then there is a subset of $Y$ that includes $X$ and is a basis? Can't we apply that with $X=\{b_1 + c_1\}$?
@MatheinBoulomenos Sure, we can do the replacement to get a basis always
but in general, this basis will not be positive
ohh, you mean take any basis contained in the set of all of those sums?
19:20
Yes, that will work if all the multiplicities really are positive
But wait, what the multiplicities are depends on which basis we choose inside it (they are not well-defined until we pick a basis)
So the idea is: each product can be written (though not uniquely) as a non-negative linear combination of elements from the set
The issue is that once we remove elements, we might remove some of those needed to write the product like this (even though we pick a basis)
We don't even need to work with sums of the form $b_i + c_j$ in general. We can even get a basis that is contained in the union of $1=b_1+c_1$ and the union of the bases from $B$ and $C$
(Since that's a generating system, too)
but yeah, the issue still stands
Right, but it seems hard to control the multiplicities once we start removing elements
Just take $\mathbb{C}\times\mathbb{C}$ as an example
But any basis contained in $\{(1,1),(1,0),(0,1)\}$ is positive, right?
Oh, it does work there
guys, is the next template always okay to use? "For any ___ there exists a ___" . What if I substitute "the" instead of "a" for example? or remove "a" completely, would it be a mistake?
19:26
(we just need to include the original elements as you already mentioned)
@famesyasd "the" would not be correct. Depending on what comes next, it may be ok to remove the "a"
@MatheinBoulomenos So what happens with the $\mathbb{C}^3$ example?
using which basis on $\Bbb C^2$?
@MatheinBoulomenos Let's say the one coming from the standard basis on it as a group algebra (since that is the sort that causes problems)
If we picked the KL basis we would already have the nice property
Hmm, but the basis for the single copy of $\mathbb{C}$ does have that, so we need to go up to $\mathbb{C}^4$ as two copies of the group algebra with the usual bases.
That basis is $\{(1,1), (1,-1)\}$, right? So we want a basis contained in $\{(1,1,1,1),(1,1,0,0),(1,-1,0,0),(0,0,1,1),(0,0,1,-1)\}$ that includes $1$. If we choose $\{(1,1,1,1),(1,1,0,0),(1,-1,0,0),(0,0,1,-1)\}$, then $(0,0,1,-1)^2=(1,1,1,1)-(1,1,0,0)$
okay, so this doesn't work in general
Right. Now what does the standard basis here look like (as a group algebra for either choice)?
19:36
I can see that its: $\dbinom{n+19}{4}\times4!$
@Abcd 4! = 24
@KumarAyush So?
Thats not the question.
Whats the question?
4 mins ago, by Abcd
user image
This^
Hmm, I think it's $(1,1,1,1),(1,1,1,-1),(1,-1,1,1),(1,-1,1,-1)$ when we take $\Bbb Z/2 \times \Bbb Z/2$
19:41
24 is not correct?
@KumarAyush It is correct
4 mins ago, by Abcd
I can see that its: $\dbinom{n+19}{4}\times4!$
Is my interpretation correct?
How do I take it from here?
Product of n consecutive numbers is divisible by n!
@MatheinBoulomenos That looks right (assuming those really are independent)
@KumarAyush I don't get your point.
No, there's something wrong
that's not a basis
19:44
@MatheinBoulomenos Basically, we should pick $\pm 1$ in suitable configurations to make them independent
there are probably a couple of choices
@KumarAyush I am unable to relate.
take n+ 16 = t, the equation becomes t*(t+1)*(t+2)*(t+3) thats a product of 4 consecutive numbers right?
Can we do it using my method?
'
(Do you have mathjax enabled in chat?)
No, how to do that?
i mean how to enable?
19:48
@KumarAyush See this: tinyurl.com/cfqcvpc
0
Q: Error in Problem Statement of Prob. 2 Chap. 2 in Rudin's RCA?

user193319 Let $f$ be an arbitrary complex function on $\Bbb{R}$, and define $\varphi(x,\delta) = \sup \{|f(s)-f(t)| : s,t \in (x-\delta, x+ \delta) \}$ and $\varphi (x) = \inf \{\varphi(x,\delta) : \delta > 0 \}$. Prove that $\varphi$ is upper semicontinuous, that $f$ is continuous at a point if and onl...

18 mins ago, by Abcd
4 mins ago, by Abcd
user image
17 mins ago, by Abcd
4 mins ago, by Abcd
I can see that its: $\dbinom{n+19}{4}\times4!$
Can someone tell me how to take my idea ahead?
I can say that its divisible by $4!$
But I can't say that the largest integer that divides it is $4!$
@Abcd Right, because it will always be divisible by a larger integer than that
(a given one independent of $n$)
@TobiasKildetoft But here its dependent.
How do I prove that others (like $2$) will not interfere at all?
@Abcd No, it asks for one that does not depend on $n$
once you have the correct one, just take a few small values of $n$ to see that no larger ones can work
20:03
@TobiasKildetoft that's hit and trial :/
Sure, but you really don't need to check many
there must be a more rigorous way
well, you could also just see what happens if you change $n$ to $n+1$
But your use of the word "rigorous" seems misguided here
@TobiasKildetoft then I get $\dbinom {n +20}{4} \times 4!$
@Abcd I mean compare the values for those two values of $n$
20:06
how?...
Alternatively, let $p$ be a large enough prime and show that there is a choice of $n$ for which $p$ does not divide that product
@TobiasKildetoft is there a natural choice for an isomorphism $\Bbb C[\Bbb Z/2\times \Bbb Z/2] \cong \Bbb C^4$? There seem to be a lot of idempotents and each complete orthogonal set gives an isomorphism
@MatheinBoulomenos Not any particularly nice choices, no (basically, any such choice will be the same as choosing a bijection bwteeen the elements of the group and its irreducible representations).
Okay, that's easier in the cyclic case
20:12
Does the quiver stuff give you that commutative algebras have the stronger property that $1$ doesn't appear in products other than $1^2$?
There is a "nice" way to make the choice of such a bijection, but it is still somewhat arbitrary
@TobiasKildetoft Any non brute force method?
@Abcd The last suggestion is not brute force
@MatheinBoulomenos hmm
I mean the indecomposable ones
Not in a way that is immediately clear to me
So that property was preserved when we took direct product, right?
20:17
yeah
@MatheinBoulomenos So applying this successively, we get the basis $(1,1,...,1), (1,1,...,1,0), ..., (1,0,...,0)$ for $\mathbb{C}^n$ where each is an idempotent that acts as the identity on all the ones that comes later
Anyway, I need to go now, but this was quite an enlightening discussion.
20:59
Is there any distinction between (0,0,0) and 0?
Yeah
but sometimes people will write "0" to refer to the former
21:16
is $(-\infty,a)$ open for some $a\in\Bbb R$
0
Q: Sup. and Lim. Sup. are Measurable Functions

user193319 For a sequence $\{f_n\}$ of measurable functions with common domain $E$, show that the following functions are measurable: $\inf \{f_n\}$, $\sup \{f_n\}$, $\lim \inf \{f_n\}$, and $\lim \sup \{f_n\}$ Here is my proof: It suffices to show that $\sup \{f_n\}$ and $\lim \sup \{f_n\}$ are ...

@quallenjäger It's open for every $a\in\Bbb R$
How can I see that
As union of open balls
It's the union of $(x-1,x)$ for all $x<a$
It's the union of $(x,y)$ for all $x<y<a$
You can write it as $(a-2,a)\cup(a-3,a-1)\cup(a-4,a-2)\cup\dotsb$ (draw it)
It's the union of $(x,a)$ for all $x<a$, which is probably the simplest
Note that $(x,a)=B_{(a-x)/2}\big((a+x)/2\big)$
The pain from a Platypus sting cannot be relieved with the use of morphine.
21:54
In the book, it says $\frac {x}{\sin x}\geq 1$ for $x$ in the interval $[-\frac {\pi} 2,\frac {\pi} 2]$. Can you say how?
It's actually true for the interval $[-\pi,\pi]$
@LeylaAlkan If $x$ is between $0$ and $\pi$, $~\sin x$ is positive. So we can multiply both sides by $\sin x$ without flipping the inequality
We get $x\ge\sin x$, which is true for all positive $x$.
If $x$ is between $-\pi$ and $0$, then $\sin x$ is negative, and multiplying by it flips the sign
We get $x\le\sin x$, which is true for all negative $x$
22:17
@AkivaWeinberger Are you multiplying sides of this $0\lt x\lt \pi$ by $\sin x$? since when I do that I get $0\lt x\sin x\lt \pi\sin x $ :D
I was multiplying both sides of $\frac x{\sin x}<1$ by $\sin x$
to get an equivalent inequality
Alternatively, I could have started with $x\ge\sin x$ (which we know is true) and divided by $\sin x$
Oh, okay hahah
23:08
The Cult of Infinity]
0. Begin by specifying an alphabet $\mathcal{A}$. This give us the symbols to be used
1. Next, define a formal grammar $\mathcal{G}$ which provide the rules in producing new strings and how they are concatenated, truncated etc.
2. Together, these form the formal language $\mathcal{L}$ where all the details of the foundation $\mathfrak{F}$ is writtened and expressed
3. Next specify a logic $L$ with its inference rules to provide the syntax of reasoning in $\mathfrak{F}$
But before we begin, we need to define a couple of primitive notions:
3d. Predicate P(S): An expression whose truth value depends on the arguements S. By itself it usually has no truth value unless it has the same truth value for all members S.
How does it hold?
Are you sure this is how it is written and not just the upper Riemann sum?
@LeylaAlkan That's not true (though it's a good approximation for large $N$)
23:18
This is a screenshot of the book that I sent you. If there is a mistake, thats not mine for sure :)
If that equality is the upper Riemann sum, then it holds, otherwise, as Akiva said, it is only true for large N
23:32
I posted the whole question on the site
it's not true because it doesn't work for lower values of N
the formula is right when N tends to infinity.
23:55
Well, the difference tends to a constant.
00:00 - 18:0018:00 - 00:00

« first day (2780 days earlier)      last day (2538 days later) »