« first day (3277 days earlier)      last day (2040 days later) » 

17:00
@ÍgjøgnumMeg what about geometric group theory?
@Mathphile what would the answer to that be?
give me a finite number
you could take that. I heard from people who took it before and apparently it's quite self-contained
@Mathein it clashes with ANT
it also doesn't seem to clash with anything
oh nevermind
Montag 11-13
17:01
@towc yes so we take $a_n=1$ for all $n$
lol
I could possibly take Finite Elements as an Anwendung
@Mathphile the point is that the sum depends on whether n is even or odd, just like in the tetration case
since I took PDEs in undergrad and learnt about finite difference schemes and stuff
I just.. don't want to cuz it's boring af hahaha
and $\sum_{k=1}^{\infty}(-1)^k(1)$ oscillates between 0 and -1 just as my statement says
@towc
@Mathphile yup, no single value
17:03
yes
5 mins ago, by Mathphile
also if i understand correct, if $a_{\infty}$ converges to some finite value, then $\sum_k^{\infty} (-1)^k.a_n$ will always oscillate between two values right?
"oscillate between two values"
@Mathein Adic spaces would be the only interesting thing that doesn't clash and I would get absolutely destroyed by it rofl
but $a_\infty$ doesn't converge to a single value
@ÍgjøgnumMeg lol
@towc it does
and I don't want to get destroyed in a lecture from Venjakob since he's doing work in the thing I'm interested in hahaha
17:04
you can just sit in the lecture and see how it goes
in the tetration case
you're not obliged to do an exam or anything
hold on, I think I misunderstood the first time actually
@Mathein fair, it seems a lot less rigid than here (excuse the p u n)
@towc it does in the range $0 \lt x \lt 1$
17:05
ok, I guess the statement is correct (except for the 0 series)
@ÍgjøgnumMeg that's the right spirit for Germany
I was thinking about it in context of the tetration series and got mixed up
@towc yes it seems to work for any series except 0 series (where it will converge to 0)
what about something like $a_n=(-1)^n\frac{1}{n}$? then $\sum_{k=1}^\infty (-1)^n a_k$ just diverges
@Alessandro lolol, hey btw
17:07
oh, also, you probably meant $a_k$ instead of $a_n$
oops yes
Spending the next couple of months trying to refresh my complex analysis so that should be enough to feel ready (although my rapidly deteriorating mental health has hamstrung me into total unproductiveness)
@MatheinBoulomenos huh
If we look at the series $\sum_{k=1}^\infty {}^k n$ for $n \in \Bbb Z$ in the p-adics, then it's clear that it converges pretty rapidly whenever $p$ divides $n$. I wonder if one can say anything about the limit
17:15
@MatheinBoulomenos you seem right about this
For a filtration $F = \{F_n\}$ ($n \in \mathbb{Z}$) on a $R$-module $A$ to be convergent we need their intersection to be zero, but we don't necessary need $F_i \cap F_j = 0$ for $i \neq j$ do we?
@Perturbative yes
Yes meaning that we don't need $F_i \cap F_j = 0$, correct?
right
consider $F_n=p^n\Bbb Z$ on $\Bbb Z$
Okay thanks!
I'll take a look at that example just now
17:17
@MatheinBoulomenos can you find an example where $a_{\infty}$ converges to some value not equal to 0?
@MatheinBoulomenos hi
@Mathphile what about $a_n=1+(-1)^n\frac{1}{n}$
@LeakyNun hi
@MatheinBoulomenos lol
knew you were going to write something like that
@MatheinBoulomenos btw what do you mean by p-adics?
that's a different number system
you mean like changing the base?
17:23
no, we have a different metric
Fix a prime $p$. Then define $|p^na|_p=p^{-n}$ for $a \in \Bbb Z$ coprime to $p$
and $|0|_p=0$
We can extend that to $\Bbb Q$ via setting $|\frac{a}{b}|_p=\frac{|a|_p}{|b|_p}$
Then we get a metric on $\Bbb Q$ via $d(a,b)=|a-b|_p$
and one can compute with this metric to get $\Bbb{Q}_p$
For example, in the 2-adic metric, we have that $\sum_{n=0}^\infty 2^n$ converges to $-1$
@MatheinBoulomenos what do you mean by metric?
a metric on a set $X$ is roughly a function that gives you a notion of distance between two points
so it's a function $d:X \times X \to \Bbb R$ that satisfies some axioms which formalize our intuition of how "distance" should behave
im not able to understand much of this
although that must be because of my inadequate math knowledge
don't worry, you'll learn it when you take intro real analysis
@MatheinBoulomenos well then that means never lol (unless i learn it myself)
17:31
I first learned about metrics via an introductory topology course
im about to start my undergrad in computer science
maybe you'll learn about it in computer graphics or smth
Almost any kind of math is going to help you in computer science
Like, algebra at the very least helps you out with binary numbers via $F_2$
so the idea is: if you have some set $X$, then what should an abstract notion of "distance" on $X$ satisfy?
The conditions we put on a function $d:X \times X \to \Bbb R$ (this means that we take two inputs from $X$ and get a real number) are really intuitive:
- for all $x,y \in X$, $d(x,y) \geq 0$, because distance is always positive
- for all $x,y \in X$, $d(x,y)=0$, because the only point having distance zero from $x$ should be $x$ itself
- for all $x,y \in X$, $d(x,y)=d(y,x)$, because distance from $x$ to $y$ should be the same as the distance from $y$ to $x$
@Rithaniel well i'm learning number theory on my own even though it doesn't have many applications in CS (except cryptography)
17:35
rip
Oh, number theory is helpful in just about any subject where counting is involved, I feel.
number theory is just interesting enough on its own
it doesn't need any applications
number theory has the advantage that learning it means you are chad af
You can potentially teach a computer to use the Chinese Remainder Theorem to find a value efficiently.
@MatheinBoulomenos yes i find it fascinating
17:37
p-adics show up when you pretty deep into some parts of number theory
I still don't fully grasp the p-adics.
@MatheinBoulomenos i guess you have completed your undergrad in mathematics?
@Mathphile I'm still in the process
writing my undergrad thesis on number theory at the moment
:frigten:
@MatheinBoulomenos nice
@MatheinBoulomenos so do you get to choose the branch of mathematics you write your thesis on?
17:41
@Mathphile yes, basically. But you have to find a professor who is willing to supervise you
so if you choose some super-esoteric topic then it will be hard to find a prof who supervises you
but number theory is pretty popular here
@MatheinBoulomenos im not suprised
Hey hot cats.
cats as in categories?
@anakhro waddup
17:43
@ÍgjøgnumMeg nm, home dog. How have you been?
i was think about double majoring in CS and mathematics due to number theory
but i think it would be too much work
@anakhro living the dream(!)
Dreams are worth living!
@Mathphile number theory is nice for non-experts, because there are plenty of elementary things that are fascinating to explore. But if you want to go "deeper", then you need other parts of math as well, such as algebra or analysis
@anakhro nah I'm just bored and the final two months waiting period before my master starts are going really slowly lol
17:45
I know that feeling. Similar here for my Ph.D.
I am waiting for my defense, also.
Dream factorial?
@ÍgjøgnumMeg have you actually done some complex analysis?
@Mathein yeah I had a first course, up to residue theorem
complex integration and stuff
okay great, that's all you need
17:47
@MatheinBoulomenos maybe you can help in some of my conjectures (if interested)
51
Q: Is $29$ the only prime of the form $p^p+2$?

MathphileI searched for primes of the form $p^p+2$, where $p$ is prime for a range of $p \le 10^5$ on PARI/GP and found that 29 is the only prime of this form in this range. Questions: $(1)$ Is $29$ the only prime of the form $p^p+2$, where $p$ is prime? $(2)$ If not, then are there a finite nu...

11
Q: Conjecture: "For every prime $k$ there will be at least one prime of the form $n! \pm k$" true?

MathphileUsing PARI/GP, I searched for primes of the form $n!\pm k$ where $k \ne 2$ is prime and $n\in \Bbb{N}$. With the help of user Peter, we covered a range of $k \le 10^7$ and couldn't find a prime $k$ for which $n!\pm k$ has no primes. Observations: $(1)$ When $n \ge k$, $n! \pm k$ cannot be p...

@Mathein I've actually done more complex analysis than real analysis lol
@anakhro ooo what's your PhD in?
@Ryan real analysis at my uni was REALLY bad
i think the $p^p+2$ conjecture may be solvable with current methods
ok but for a European school that might mean you only got 2/3 of the way through everything Rudin ever wrote
17:52
although I don't have much hope for the $n!\pm k$ conjecture to be proven/disproven
@Ryan rofl, nah this is an English university that focusses mostly on statistics and applied mathematics, so they didn't care much for rigor. Most of the courses I took were just plug and chug calculus courses
@MatheinBoulomenos what do you think?
o right England isnt in Europe any more
I'm just slowly going through Rudin and Abbott, along with some complex analysis notes from Mathein's uni, in prep
@Ryan exactly
@Mathphile conjectures of that type can be really hard
17:54
@ÍgjøgnumMeg I don't have a topic or supervisor yet.
Oh I see, what are you interested in doing tho?
@MatheinBoulomenos you referring to the $p^p+2$ one?
I like geometry stuff.
But I am relatively open to anything.
cool :) what kind of geometry?
oh man I am dying for a cigarette but am stuck in a train
guess I'll have to give my lungs a break
stupid health
both you and Balarka smoke
wtf
17:58
lol
I do some middle distance cycling as well
which is counter intuitive
Symplectic/contact or low-dimensional stuff.
And yeah, you should quit cigs.
Balarka should, too.
But he knows my feelings. >:(
The thing is, it makes you look cool
/s
Do you have any reason for doing it, or is it just a habit now?
@Mathphile yes
okay
i assume the $n!\pm k$ conjecture is unsolvable with current methods too?
18:02
I'd guess so
@anakhro I like the taste, and it's a habit I guess, I'll probably stop once I reach Germany but atm I'm such a mess that I have no willpower to stop anything hahaha
Well good luck on stopping.
Cheeeerz!
do you believe they are both true though?
no idea
the $p^p+2$ one seems very probable
18:10
@MatheinBoulomenos okay
thanks for looking into my questions :)
3
Q: Tracial States, Strictly Positive Elements, and Commutators

user193319From my limited understanding, strictly positive elements in a $C^*$-algebra $\mathcal{A}$ can be defined in one of two (equivalent) ways: (1) $x \in \mathcal{A}_+$ is strictly positive provided $\overline{x \mathcal{A}x} = \mathcal{A}$ (2) $x^\ast = x$ is strictly positive provided $\ph...

18:45
@MatheinBoulomenos does there exist some kind of radius of convergence for which $\sum_{k=1}^{\infty} (-1)^k(^kn)$ oscillates around only two values?
@Mathphile I don't know
@MatheinBoulomenos you were able to understand my question though right?
@MatheinBoulomenos according to my testing in PARI the radius of convergence is $e^{-e} \lt n \le e^{1/e}$
@MatheinBoulomenos is there anyway we can verify/prove this?
Suppose you have a sequence, such as $n^4\text{ mod }(4n^3-4n^2+n-1), n\in\Bbb N$. Are there methods to analyse the sequence and measure how "random" the values are?
19:01
@Mathphile do you mean for ${}^k n$ to converge? I think that's possible to prove and should not be that hard, but I'm busy right now
no i mean that $\lim_{n \to \infty} \sum_{k=1}^{n} (-1)^k(^kx)$ oscillates between two different values depending on whether $n$ is odd and even only for $e^{-e} \lt x \le e^{1/e}$
no idea. But those are exactly the numbers for which $\lim_{k \to \infty} {}^kx$ exists
sorry for all the edits
@MatheinBoulomenos yes
i hope my statement was clear?
according to my testing, $\lim_{n \to \infty} \sum_{k=1}^{n} (-1)^k(^kx)$ does not converge for neither odd or even $n$ when $x \gt e^{1/e}$
i really wish i could graph $\lim_{n \to \infty} \sum_{k=1}^{n} (-1)^k(^kx)$ for $e^{-e} \lt x \le e^{1/e}$
of either odd or even $n$
 
2 hours later…
21:06
@MatheinBoulomenos are you here?
If $A, B \subseteq \Bbb{R}$ be sets of measure $0$. Is it true that $A + B$ is also of measure $0$?
@LeakyNun yeah
@MatheinBoulomenos why are both directions so hard to prove -,-
both directions of what
yesterday, by MatheinBoulomenos
@Leaky exercise: X is a compact Hausdorff space, then C(X) is Jacobson iff X is totally disconnected
21:11
I'm sorry, I realized this is wrong
what's the correct statement?
but you can prove that if C(X) is Jacobson, then X is totally disconnected
I don't think I'm very familiar with the prime ideals in C(X)
hmm
21:12
I was hoping you could find a simpler proof than mine
so I should try to find a non-maximal prime in say $C([0,1])$
so a surjection to an integral domain
because the result shouldn't be that hard, I think
1 = 2+2-3
oh
00 = 00+00
01 = 02+22-100
02 = 02+00
10 = 20+20-100
11 = 02+02
12 = 22+20-100
20 = 20+00
21 = 22+22-100
22 = 22+00
@user193319 take $A=B=\mathcal C+\Bbb Z$
where $\mathcal C$ is the Cantor set
then $A+B=\Bbb R$
this should work
@MatheinBoulomenos do you have a non-maximal prime in $C[0,1]$?
nope
but they exist
so your proof isn't constructive...?
I only know that $\Bbb R[X]$ is dense
hey there's a non-maximal prime there
$(X^2+1)$
21:27
my proof is ridiculous
do you think $x^2+1 \in C[0,1]$ is prime?
isn't x^2+1 a unit?
what am I doing
(mental note: prime ideals don't interact well with completions)
do you want to see the proof?
no
but are you sure it's correct lol
21:30
I think so
do you know that exercise in A-M
about C(X)
yes
ok if C(X) is Jacobson then every prime is maximal so Spec(C(X))=mSpec(C(X))=X (Ex.1.26). Spec(C(X)) is Hausdorff so Spec(C(X)) is totally disconnected (Ex.3.11). So X is totally disconnected.
how do you prove that every prime is maximal?
the first sentence skipped a lot of steps
because I proved it in my head
there are clearly Jacobson rings of dimension >0
let p be a prime and V(p) be { x in X | f(x) = 0 for all f in p }
C(X) is Jacobson so p is the intersection of all the maximals that contain it
by Ex.1.26 the maximals are all in the form I({x}), so p = I(V(p))
but clearly for a closed subset S of X, I(S) is prime iff S is irreducible
but X is Hausdorff so irreducible means singleton
is my proof more complicated than yours yet?
so V(p) = {x}
so p = I({x}) is maximal
qed
is my proof correct?
yeah seems good
what's your proof then
21:40
I'm thinking why I(S) is prime iff S is irreducible
that needs Urysohn
<- is clear
suppose S=AUB, both closed
let x in A\B, y in B\A
let f and g with f(A)=0 and f(y)=1; g(x)=1 and g(B)=0
so fg(S)=0
so fg in I(S) but neither f nor g is in I(S)
okay yeah this works
lol I performed so many steps in my head I didn't even realize
do you have any more questions regarding my proof
no, it's fine
cool
what's your proof?
21:43
if C(X) is Jacobson, then Specm(C(X)) is very dense in Spec(C(X))
Specm(C(X))=X is Hausdorff, so it is sober
Spec(C(X)) is an affine scheme, so it is also sober
suppose that A is a topological space and B is a very dense subspace such that both A and B are sober, then I claim that A and B are homeomorphic
what is "very dense"
like really dense
go ahead
hi @loch
Hi @LeakyNun
Suppose X is a compact Hausdorff space. Show that if C(X) is Jacobson then X is totally disconnected.
21:47
no, it means that the intersection with every closed subset is dense in that closed subset
oh ok
J(R)=0 iff Specm(R) is dense in Spec(R)
so R is Jacobson iff Specm(R) is very dense in Spec(R)
ok clear
so to prove the claim about sober spaces, note that if X is a top. Space and Y is a very dense subspace, then the map Ouv(X)->Ouv(Y), U->U \cap Y is an isomorphism of locales (or of sites, if you want)
but for sober spaces, the embedding into locales X->Ouv(X) is fully faithful
"Ouv" est la categorie de sous-ensembles ouverts?
so that proves in our case since both Specm(C(X)) and Spec(C(X)) are sober, both are homeomorphic, so Spec(C(X)) is Hausdorff and thus totally disconnected and so is X=Specm(C(X))
lol, you got me
so which one of our proofs is more general?
@LeakyNun it's an isomorphism of sites, really. If Y is very dense in X, then you can recover each open subset from its intersection with X: this is clear for closed subsets, since by definition of being very dense $\overline{Y \cap A}=A$ for any closed subset. So by taking complements, this is also true for opens
is C[0,1] abs. flat?
21:56
no
if it was zero-dimensional, then [0,1] would be totally disconnected by our proof
which function f admits no g with f=gf^2?
hmm
g=1/f
so maybe f(x)=x
then $xC[0,1]$ should be prime?
i.e. $x$ should be prime in $C[0,1]$
but you can take a square root of x in $C[0,1]$!

« first day (3277 days earlier)      last day (2040 days later) »