« first day (4338 days earlier)      last day (980 days later) » 

00:30
what are the benefits of a pdf on compact support vs. a pdf on semi compact support or on the entire real line
00:44
there aren't many well known pdfs whose inverse is itself. why is this?
01:08
Is there a real valued function f from R to R such that 1) f is differentiable but has no power series, 2) f’=f, 3) f(0)=1
?
If f has power series then, f(x)= e^x.
you don't need to assume that f is real analytic to deduce that f(x) = e^x. you might need to assume that f is real analytic to use a "series method" to solve the equation.
for example, let g(x) = f(x)/e^x and use the chain rule to see that g'(x) = 0 identically. and g(0) = 1
Was just gonna say that
If $f$ is differentiable and $f'=f$, then you can prove $fe^{-x}$ is constant
(by showing it, too, is differentiable and has zero derivative)
There are also more general existence-and-uniqueness theorems for differential equations
more generally, often, solutions to [nice enough] differential equations are going to be real analytic, so assuming that for purposes of guessing at a potential solution is not a a loss of generality, just a convenient assumption that helps you find solutions
e.g. you could do it here, recognize e^x from its series, and then use the argument above (which does draw upon having the idea of e^x as something to compare f to) to finish the job
sometimes you can also learn stuff if e.g. you assume there's a series and then solve a recurrence or get partial info about it, and it turns out its coefficients grow too fast to give a series that converges everywhere. might be a sign that something interesting is going on about solutions to the equation
01:37
@Koro +1, but I think you can directly show u(x) > u(0) without splitting into cases. If at any point u(x) ≤ u(0), by continuity of u, there is y in [0,x] such that 0 < u(y) ≤ u(0), hence u(y)^2 ≤ u(0)^2, which is a contradiction
Hi @CalvinKhor et @Leslie.
@CalvinKhor Thanks for the review :). How do you know though that u(y) is not negative?
@Koro f'=f implies that f is C^\infty and has a taylor series which coincides with the exponential. You can show its real analytic (def: equal to the taylor series, hence equal to exp) by checking the gevrey type estimates but that's a lot more work than what they said
@Koro u(0) > 0 and continuity
that was given right? let me check...
u(0)>0 + continuity is given, yes.
right, so either u(x)>0, then take y=x, or by ivt, u takes all values between u(0) and u(x)≤0
@leslietownes please consider pegging lesliecoin to rep
01:47
@CalvinKhor yes, while writing the answer I thought of eliminating the need of mentioning that u(y) could be negative too (after assuming suppose on the contrary) by introducing max().
@leslietownes @Koro A similar thing: suppose we want to show that the only solutions to $f''=-f$ are $A\cos x+B\sin x$
You can show directly that $f\cos x-f'\sin x$ has zero derivative and that $f\sin x+f'\cos x$ has zero derivative
@Koro yeah, but i think ivt is cleaner :) anyway +1
so we can call those $A$ and $B$
and then we directly see that $A\cos x+B\sin x=f(\cos^2x+sin^2x)=f$
akiva: that's too cute by half but i love it
these are the kinds of fun things you always seem to have in your bag of puzzles and games
Similarly: just from knowing $\sin'=\cos$ and $\cos'=-\sin$, you can see $\cos^2+\sin^2$ is constant
and in general if $f''=-f$ then $f^2+f'^2$ is constant
01:54
this reminds me that i haven't seen a full derivation of all of sin and cos' properties (...that's an apostrophe) from the ode/taylor series but i know it exists somewhere
@CalvinKhor Well what I just said tells you that $\cos^2+\sin^2=1$ from Taylor
because the derivative properties are clear from the Taylor series
yup
hm how do you get periodic
@AkivaWeinberger :-) I studied an another way to show that.
for any linear homogeneous ode with constant coefficients.
@CalvinKhor Show $\cos1>0$ and $\cos2<0$ because they're alternating series so you can do that directly with enough (not many) terms
IVT says there's a zero
Call the first zero $\pi/4$
oh nice
01:59
then from angle addition properties (also doable) you can work your way up to $\sin(x+2\pi)=\sin x$, $\cos(x+2\pi)=\cos x$
that sounds like a fun exercise
might work out the details when im done staring at the abyss for today
the first zero should be pi/2 = 1.57... but wtv
@CalvinKhor That's to see if you're paying attention
(joking)
(that was an actual mistake, sorry)
@CalvinKhor For the addition properties, it's probably easier to deal with the properties of exponentials: if $f'=cf$ and $f(0)=1$, then $f(x+y)/f(x)$ is constant in $x$
Plug it $x=0$, conclude $f(x+y)=f(x)f(y)$
Finally, note that if $f=\cos x+i\sin x$, then $f'=if$
All the addition formulas fall out from that
right ok. translation of f also solves the ode
02:06
Or find $\frac d{dx}\frac{f(x+y)}{f(x)}$ directly if you want
ah right
Actually, even better, if you want to do this from the Taylor series:
and i do
if $f=\sum(cx)^n/n!$, then $f(x+y)=f(x)f(y)$ actually follows from the binomial theorem directly
(This also counts as a proof of the binomial theorem)
02:09
and then find zero via IVT and proceed as before, and bam, periodicity
Really, all the pure trig properties are just sparkling exponential properties
p sweet. feels like i should have known all this a while ago
@CalvinKhor Here's a neat thing
Suppose we have the indefinite integral $\int f(x)\sin xdx$
Wait I'm wrong
still on f''=-f? or exp?
No just any ol' (infinitely differentiable) function
I claim that this equals $-f(x)\cos x+f'(x)\sin x+f''(x)\cos x-f^{(3)}(x)\sin x-\cdots+C$
Can you see why? (and/or can you check that I haven't messed up)
02:26
integration by parts
well in spirit, havent checked
ok it seems right
Arright
Now let $f(x)=x^n(\pi-x)^n$
niven?
I want to think about $\int_0^\pi f(x)\sin xdx$
Oh damn you know where I'm going with this!
Yeah I was gonna show $\pi$ is irrational
:D sorry hahaha its the only time i've seen pi in a poly
but i didnt recall the earlier bit
OK so $\int_0^\pi x^n(\pi-x)^n\sin xdx>0$ because the integrand is positive
02:29
yup
On the other hand, plugging in the thing from earlier, it's $f(0)-f''(0)+\cdots+(-1)^nf^{(2n}(0)+f(\pi)-f''(\pi)+\cdots+(-1)^nf^{(2n)}(\pi)$
Oh also $\int_0^\pi f(x)\sin x<\pi(\pi/2)^{2n}$
I'm trying to remember the next step
I think if $\pi=a/b$ then that's all a multiple of $n!/b^n$
Right, yeah. @CalvinKhor If $f(x)=x^n(\pi-x)^n$, then $f^{(k)}(0)$ is either $0$ (if $k<n$) or equal to $k!\binom n{k-n}\pi^{k-n}$ (if $k\ge n$), and these are both integer multiples of $n!/b^n$ if $\pi=a/b$
ok, bear with me, i dont work with integers often...
and since $f(x)=f(\pi-x)$, then $f^{(k)}(\pi)=(-1)^kf^{(k)}(0)$
yuuuuup
@CalvinKhor Let's write it out explicitly. $(\pi-x)^n=\pi^n-\binom n1\pi^{n-1}x+\binom n2\pi^{n-2}x^2-\dotsb+x^n$, so $x^n(\pi-x)^n=\pi^nx^n-\binom n1\pi^{n-1}x^{n+1}+\binom n2\pi^{n-2}x^{n+2}-\dotsb+x^{2n}$
Right yeah so anyway $\int_0^\pi x^n(\pi-x)^n\sin xdx$ is positive and an integer multiple of $n!/b^n$, so it must be greater than or equal to $n!/b^n$
but on the other hand $x^n(\pi-x)^n\sin x$ peaks at $x=\pi/2$, where it equals $(\pi/2)^{2n}$, so $\int_0^\pi x^n(\pi-x)^n\sin xdx$ must be less than or equal to $\pi(\pi/2)^{2n}$
Factorials grow larger than exponentials, so eventually $n!/b^n>\pi(\pi/2)^{2n}$
Contradiction, QED
02:45
right yeah
p nice
where does this x^n(pi - x)^n come from tho
apparently niven is slightly different
Oh yeah he did $x^n(a-bx)^n/n!$
That's mine times $b^n/n!$
He wanted the ending to be an integer
I just thought $x^n(\pi-x)^n$ looked nicer
Wait so I got an explicit thing
$\int_0^\pi x^n(\pi-x)^n\sin xdx=2\sum_{k=0}^n(n+k)!\binom nk\pi^k$
Wait, no
Only every other term
and some minus signs
03:04
Maybe it's $2\sum_{k=0}^{\lfloor n/2\rfloor}(n+2k)!\binom n{2k}(-\pi^k)$
Doesn't work numerically
Maybe $2\sum_{k=0}^{\lfloor n/2\rfloor}(2n-2k)!\binom n{2k}(-\pi^2)^k$
This seems correct
....im gonna trust you :D
Yeah I dunno lol
Thought it was gonna be nicer than it ended up being
theres a correct version, just leave it as an exercise
It also shows $\pi^2$ is irrational, as well, since it works out to only have even exponents of $\pi$
(basically because we're only doing even derivatives)
ooh ok sure
03:19
Is this the simplest polynomial $f(x)$ for which $\int_0^\pi f(x)\sin xdx$ is nice?
Well, "nice"
just some of the serious work that goes on in mathoverflow
03:35
That seal drawing is essential in the proof
wow, things have changed
Somewhat confused why write it in terms of a weight $d\omega(y)=dy/y^2$ rather than directly write $dy/y^2$ in the integral
Why write $\int_1^{\infty}\frac{d\omega(y)}{1+(y-1)^{\alpha}}$ rather than more simply $\int_1^{\infty}\frac{dy/y^2}{1+(y-1)^{\alpha}}$? — Akiva Weinberger 16 secs ago
 
1 hour later…
05:08
@JoeShmo .
akiva: all i can think is it's a special case of a more general/complicated result about more general weights
self-answered questions that seem to come outta nowhere often have the form "special case of something i noticed while doing something else that's a secret"
Assume $(a_k)_k \to 0$ as $k \to \infty$ and that $a_k>0$ for any $k \in \mathbb{N}$. Can I say that $\lim_{n \to \infty} \sum_{k=0}^n a_k>0$ because: I know that the limit of positive numbers is nonnegative, hence assuming by contradiction that it is $\lim_{n \to \infty} \sum_{k=0}^n a_k=0$, from $a_k>0$ it is $\sum_{k=0}^n a_k=a_0+\dots +a_n>a_0$ and hence limit $0=\lim_{n\to\infty} \sum_{k=0}^n a_k \ge a_0>0$ implies that $0 \ge a_0>0$, and this is a contradiction because it implies $0>0$.
if $\lim_{n\to\infty} \sum_{k=0}^n a_k$ exists, which is not implied by your assumptions, then yes @Gwyn
one side note, there's no reason under the given hypotheses that the limit exists. but that's the right idea. you might be able to simplify the proof.
it's not just a limit of positive numbers, but a limit of positive numbers $\geq a_0$, for example.
so it's just "if c_n > k for all n, then lim c_n, if it exists, is >= k". no reason to give special attention to the result with k = 0. unless for some reason you don't have it.
one generalization with the same proof is that under those hypotheses, liminf [that sequence of sums], which does exist, is positive (in fact \geq a_0)
05:43
@CalvinKhor thank you for your help, the limit should be implied from the hypothesis $a_k>0$ for any $k\in\mathbb{N}$ and so $\sum_{k=0}^{n+1} a_k -\sum_{k=0}^n a_k =a_{n+1}>0$ implies that $\sum_{k=0}^n a_k$ is increasing, or am I wrong?
the sequence is strictly increasing, but usually people avoid writing the limit when it might not be finite. the usual definition of the limit assumes finiteness. if you're working in the 'extended reals' and the reader understands that the limit might be infinity, this is not an issue.
although it still might help to put somewhere, under these hypotheses there is no reason for the sequence to tend to a finite limit, but in those cases it will tend to +infty.
if you are in the middle of a book of some other form of exposition there might even be a canned theorem somewhere, saying that a monotone sequence of real numbers has a limit (in the extended real number system) and maybe even includes an inequality of the form "if a_n >= k for all n then lim a_n >= k". which still makes sense there.
what wouldn't make sense is appealing to "if a_n >= k for all n then lim a_n >= k" for a more general sequence might not be guaranteed to converge even in the extended real number system. (e.g. a_n = (-1)^n and k = -1, which does not arise in this problem)
@Gwyn leslie backed by lesliecoin speaks the truth
khor: SE should consider pegging rep to lesliecoin.
06:00
Do we have
$(F\times F')_{}(T_pM\times T_p'M')= F_{}T_pM \times F_{*}T_pM'$?
$f(x)=\sum_{n=1}^\infty \frac 1{1+n^2x}$.
1) On what intervals does the above converge absolutely?
On R+ and on R-. I think that this is so because if $x>0$ then the series can be bounded by $\frac a{n^2}$, where a is a constant.
@Koro on (-\infty , 0) there are points where some summands = \infty
Here is how a comes: if 0<x<1, then multiplying it by $10^k$ where k is large enough makes $10^k x>1$. Setting a:=$10^kx, \frac 1{1+n^2x}=\frac a{a+n^2 (ax)}\le \frac a{a+n^2}$
@CalvinKhor Oh, the points of the form 1/k^2.
hmm, and at those points the series won't even be series anymore.
yes and please consult a physicist for what i mean by = \infty
Thanks. For now, I'll interpret \infty as not defined.
So the series should converge absolutely on R+ and on $(-\infty, 0)\setminus \{-1/k^2:k\in \mathbb N\}$
i.e., on $R-(\{0\}\cup \{-1/k^2: k\in \mathbb N\})$
06:12
brackets
sounds right
2) on what intervals does the series converge uniformly?
On any interval properly contained in R+, and on (-\infty, -1).
what about the other intervals that don't touch 0 or -1/k^2?
like (-1+0.001,-1/2-0.001)
06:27
yeah, I think that will work too. :)
intervals of the form $(-\frac 1{k^2}, -\frac 1{(k+1)^2})$
:) probably easier to just say intervals properly contained in the set you identified earlier (R minus 0 and the -1/k^2s)
haha, yes.
 
2 hours later…
08:15
@robjohn Yes, I got it using usual substitution.
 
2 hours later…
10:14
@leslietownes thanks for the answer. Yes, in my textbook when it is said "the limit exists" it means that it is finite or infinite, instead it uses "the limit doesn't exist" only for sequences like $(-1)^n$ or functions like $\cos x$ when $x \to \infty$. Thanks for the example on the possible mistakes of taking limit in inequalities when the limit could not exist, it was useful)
 
1 hour later…
11:40
@Silent the usual substitution?
 
1 hour later…
13:07
Good day,
quetion about Complexification of a real vector space.
we defined the Tensorproduct of two Vector spaces $V,W$ of the field $F$ as a new vector space $V \otimes W$ Over the field $F$
Furthermore it was stated, that for if the Vectorspaces have the basis vectors: $\{v_i\} \; \{w_j\}$ then new resulting vector space has the basis $\{v_i\otimes w_j \}$

We then Define the complixifacation of a real vector space $V$ to be $V_c := \mathbb{C} \otimes V$
"So, according to the definition, $\mathbb{C} $ is to be considered a real vector space in this sense, thus having the dimension two,
13:23
It might also be worth mentioning, that it is said, that this the basis of the complex vector space $V_C$ with scalarmultipliation over the field of the complex defined as $ \lambda (\mu\otimes v) = \lambda * \mu \otimes v $
Alright i belive now i understand... So if we consider $V_C$ as a real vector space, the basis would be what i wrote at the start, however if we consider $V_C$ as complex vectorspace, thus all the basis with $i$ can be produced with multiplication of a scalar $i$ with the other vectors.

Is there some Linear algebra intution, or rigor, to why the number of Basis of vectors, shrink when changing fields?
It seems to me , i am answering my own questions, i have found a good answer to the last question here
https://math.stackexchange.com/questions/2129994/what-happens-when-vector-spaces-and-its-field-are-different

Thank you for reading.
13:41
Is it true that if I want to send the line $\gamma=\{1+\lambda i:\lambda\in \Bbb{R}\}$ to the unit circle with a möbius transformation that I then can use $f(z)=\frac{-4z+2}{4z-6}$
14:00
@Koro Lemma: $\int_{-\infty}^x f$ monotonically increasing $\implies f$ monotonically increasing. Now $uu'$ increases monotonically and $\int uu' = \frac{u^2}{2}$, so $u^2$ increases monotonically ($x \mapsto \frac{x}{2}$ is of course monotonically increasing). This means $u$ increases monotonically on $\{u \ge 0\} =: S$ (why)? Note that $S$ is not empty since $0 \in S$, and looks like that's all we need to show.
actually my first lemma is false, but it is true that $u^2$ increases monotonically
yes, I guess you can just show directly that $u^2$ increases
14:20
@JoeShmo I showed $u^2$ is increasing in my post.
ya
so now $u^2 \nearrow \implies u \nearrow$ on $\{u \ge 0\}$
the latter contains $0$
more is true, in fact. I claim $u \ge 0$ (or $S = \Bbb R$)
@AkivaWeinberger I think I understand why the matrix is $M - tM^{T}$
@JoeShmo not immediately.
@JoeShmo the claim is true as I showed in my post.
what not immediately?
Because u non negative is not known before hand.
14:33
I'm not following
@BalarkaSen Oh?
u is a function from [0,\infty) to R.
u is not given to be having only non negative values.
Incidentally, I managed to squeeze Niven's proof into 259 characters for Twitter
> Proof that pi is irrational in a tweet

It can be shown that the integral
∫_0^π x^n (π−x)^n sin(x) dx
- is positive and grows at most exponentially
- (if pi is rational and π=a/b) is an integer multiple of n!/b^n, which grows faster than exponentially

Contradiction
$u: \Bbb R \rightarrow \Bbb R$
Wanted to elaborate, but not enough space
14:35
right, but I claim that it is nonnegative
it requires proof, if that's what youre asking
yes.
@JoeShmo yes, that’s what I am saying.
well yes
(The second part is basically because if you do integration by parts, the integral is n! times an integer polynomial in pi whose highest term is π^n)
:-)
Proving that is what made my post ‘lengthy’, I think.
once you establish that $u↗$ on $\{u≥0\}$ (which is also easy), it's immediate
14:38
I want to ask: for appearing in an interview for admission to a college, is there a dress code?
where are you
in USA I doubt it
@BalarkaSen: your views on this please.
@JoeShmo India
I defer 🤷‍♂️
I wish someone could tell me this. If I dress too formal and the others don’t then that would be …
youre overthinking it
14:43
For recruitment by a company from my college (where I did my undergraduation from) campus few years back, there was a dress code and the interviewees dressed the same.
although I don't know the cultural norms in India
whatre you looking to do in grad school
math
@JoeShmo yes
no, haha, what kinda math
whats your poison
Oh, it’s for a masters program in maths. The coursework would include algebra, analysis, topology etc.
do you have any special interests?
14:46
@Koro Ask classmates
(also - wait, is Balarka still in undergrad? I lost track)
@Koro Nah, there's no dress code.
na Balarka is a Phd
A year into my grad school, yeah
Ah OK
How old are you? 23 or 24?
@BalarkaSen thanks a lot. :-)
14:48
22
Oh
OK so we are the same age, you're just ahead of me lol
Balarka: I asked you because I discussed about the course with you once before.
Wait, 1999 or 2000?
@Akiva: I would disagree.
2000
Ah OK so I'm older
14:49
@Koro: Which uni is this
where you did UG from.
Oh nice, @koro
I passed the written exam and I got shortlisted for interview. :)
Congrats!
@BalarkaSen but this year the course was not floated by B rather by K.
So I’ll go to K if I qualify.
14:52
What do you mean by the course wasn't floated by them?
Oh, right you applied for M Math
That's alternately B and K yeah
Yeah
K is honestly the better one for masters :P
Lots of great people
I hope to see them soon :-)
Best of luck for the interviews
I had purchased different coloured shirts as I wasn’t sure about the dress code. Haha
14:56
You absolutely do not need to worry about that stuff
@BalarkaSen Thanks a lot :-).
Are B and K names of universities?
@Koro Good luck!
Bangalore and Kolkata. These are two different centres/campuses (campi?) of the same institute basically
@BalarkaSen after talking to you, I’m not. Thanks.
@AkivaWeinberger Thanks a lot. :)
I hope soon I’ll be able to understand the stuff you talk about. :)
‘soon’ may be years also. :D
Is $\mathfrak{X}(\mathcal{M})$ the most common notation for the set of vector fields on a manifold $\mathcal{M}$?
15:04
The homology of the infinite cyclic cover of $S^3 \setminus K$ is, as discussed, a quotient of $\bigoplus_{\Bbb Z} H_1(S^3 \setminus \Sigma) = H_1(S^3 \setminus \Sigma)[t^{\pm}]$. The Seifert form $H_1(\Sigma) \otimes H_1(\Sigma) \to \Bbb Z$ is not unimodular, but the linking form $H_1(\Sigma) \otimes H_1(S^3 \setminus \Sigma) \to \Bbb Z$ is. Choose basis $\beta_1, \cdots, \beta_{2g}$ for $H_1(\Sigma)$ and dual basis $\alpha_1, \cdots, \alpha_{2g}$ for $H_1(S^3 \setminus \Sigma)$ with respect to the linking form.
$\ell(\beta_i^-, \beta_j) = \ell(\beta_i^+, \beta_j)$ (um, I hope, can't care about signs enough), so this says the matrix $M = (\ell(\beta_i^+, \beta_j))_{i, j}$ satisfies $(M - t M^T)\mathbf{\alpha}) = 0$ where $\mathbf{\alpha} = (\alpha_i)_{i}$ is the vector of generators of $H_1(S^3 \setminus \Sigma)$.
@AkivaWeinberger Thus, the Alexander module is $\Bbb Z[t^{\pm}, \alpha_1, \cdots, \alpha_{2g}]/((M - tM^T)\mathbf{\alpha})$.
@user76284 I think I saw it in do Carmo's book (Riemannian Geometry)? So, pretty popular
As a module over $\Bbb Z[t^{\pm}]$, its presentation matrix is $M - tM^T$. Determinant of this is the Alexander polynomial.
Wait hold on. $\alpha_j$ links once with $\beta_j$?
Right, $\ell(\alpha_i, \beta_j) = \delta_{ij}$
Oh, sorry, thought $\alpha_i=\beta_j^+$
15:10
Yeah that wouldn't work
but you're finding a dual basis so that's by definition
$\alpha_j$ is defined to be the loop in $\Sigma'$ that links exactly once with $\beta_j$ and no times with any of the other $\beta$s
Visually you can write down such a dual basis by isotoping the Seifert surface $\Sigma$ so that it looks like a disk with a bunch of twisted and possibly interlocking strips attached, then letting $\alpha_i$ be the curves which are the "core" of the strips, $\beta_i$ are the loops in $S^3 \setminus \Sigma$ which link about the whole strip once.
Wait, why can we do that? Do we know loops in $\Sigma'$ are determined exactly by their linking numbers with loops in $\Sigma$?
Yeah, that's what I meant by saying that the linking form is unimodular. Proof above
@BalarkaSen Ah OK
That's a good picture. Or we can *homotope $\Sigma$ to a bouquet of circles and then thread each circle
15:13
Yeah
Kinda like we take a "spanning tree" of $\Sigma$ and go around bits of the complement
to kinda use a graph theory analogy
Agreed
or find places to cut $\Sigma$ that don't disconnect it until there are none left, and go around each of those
OK, I think I'm done convincing myself
@BalarkaSen Wait, you're quotienting by a vector?
Or I guess you're quotienting by each element?
The ideal generated by the entries of the vector. Yes.
Ah arright sure
Nice!
15:19
Thanks for thinking this thing through with me
That's a lot of words beginning with t
th, even
Is it then like a general thing in module theory that $\det M$ is an invariant of $\Bbb Z[\alpha]/(M\alpha)$?
@BalarkaSen It can be understood through tough thorough thought, though
@AkivaWeinberger I guess. I don't really understand modules over the ring of Laurent polynomials.
It reminds me of the Smith normal form, and associated minors
It's only determined up to powers of $t$, actually, so I dunno
That fuzzyness comes becomes of the change of the Seifert surface I think
@BalarkaSen I don't know what that is
Wikipedia says it's something about turning an integer matrix into a diagonal one where each diagonal entry divides the next one?
15:24
If you have a module over any PID $R$, say, then write it as $R[\alpha]/(M\alpha)$ for some vector $\alpha$. $M$ here is a possibly non-square matrix. But it can be turned into a diagonal matrix (appended with zero columns) so that each diagonal entry is of the form you said
(or polynomial matrices, it says PID) EDIT: yeah
The diagonal entries are in fact gcd of determinants of $r \times r$ minors of $M$
If $M$ is square, the last guy is just determinant then
$\Bbb Z[t, t^{-1}]$ is not a PID, but I guess $\Bbb Q[t, t^{-1}]$ is.
And top left is gcd of entries
15:26
Yeah
There's a typo above, I meant $\ell(\beta_i^-, \beta_j) = \ell(\beta_j^+, \beta_i)$.
That's why you get $M^T$
This identity makes sense in relation to orientations, because first reflect along the Seifert surface and then switch the pair.
That ought to be the same linking numbers.
Also, I guess it's clear from the proof that $M - M^T$ has determinant $\pm 1$. Else, the first homology of the infinite cyclic cover (thought of as a $\Bbb Z[t^{\pm 1}]$-module, but then plugging in $t = 1$, you just get the $\Bbb Z$-module ie the raw abelian group) will have torsion.
15:41
@BalarkaSen I wonder if this is how Alexander thought of it
It seems to make enough sense in retrospect
Most likely
What does it mean to "finitely colour the set of natural numbers"? More generally, what does it mean to colour a set of numbers? I
Does it mean we're just partitioning the set into subsets and associating each subset with a colour?
Probably, yeah
A function from the set of natural numbers to the set of colors

« first day (4338 days earlier)      last day (980 days later) »