« first day (4372 days earlier)      last day (944 days later) » 
00:00 - 22:0022:00 - 23:00

00:22
Good morning, Dr. Shifrin
 
1 hour later…
01:45
@user4539917 Note that $1/(1+2+3+4+5)=2/5-2/6$. Now find $1/1+1/(1+2)+1/(1+2+3)+\cdots$
i refuse to note any of these things
good day sir
Are you being your usual cantankerous self, @leslie? Munchkin implant?
Why so? Sir. And that^
@leslie refuses to take orders from Akiva ... But the orders were not to him, so ignore him.
I'll join the refusal rebellion for the sake of the herd mentality sweeping the globe.
01:52
i'm cranky because we skipped snack today.
user: akiva thinks he knows what you should and shouldn't note. like some kind of elite who just wants to run your life.
You skipped snack, but it's past your dinnertime, so hush.
Please have your lawyer talk to my lawyer Akiva Weinberger.
my wife came back from a week away and my daughter was really happy until she realized that my wife wants to do things like enforce "rules" and monitor her "bad behavior."
i was running camp dowhatchawanna.
the running theme in my life is people not recognizing how cool i am.
I think both you and Munchkin will need to face charges and be incarcerated.
You're too much like Bannon.
we got an incident report from day care the other day. she and her bff were playing at being dinosaurs and my daughter scratched him with her fingernails, like, for real.
01:57
Yeah, that's NOT cool.
well, sorry if she was too realistic in her portrayal of a dinosaur. i guess we should all live lies.
Dinosaurs were very peaceful animals.
i tore up the incident report in front of her while explaining that obama wasn't going to tell us how to live.
What's your wife's opinion.
she was not a fan of the scratching situation. there's a ton of stuff that happens at day care that embarrasses her because she takes it personally.
i mean, i don't like it either, but i don't read too much into the details. our daughter has been punched and kicked before, and yeah it sounds crazy until you realize, these are three year olds, they don't really appreciate what they're doing.
so the idea of documented their stated reasons for doing what they did strikes me all as a little silly and i don't see it as reflecting negatively on me as a parent.
she just got too into impersonating a dinosaur. her bff is still her bff. i know this because we have to go to his stupid birthday party.
02:04
Yeah, documents are not necessarily at this age.
Sounds like daddy is the spoiled brat here, not Munchkin.
Tearing it up in front of her was an interesting move.
i was lying about that. the other stuff is true.
there's no way i'm tearing up an incident report, it's too funny of a record of how she behaved. i'm photoing it and showing it to everybody at her high school graduation.
02:10
I wonder what the warden will say in the meantime.
Perhaps, she'll use it in her valedictorian speech.
02:33
a lot of the kids in her class are getting into stuff now with fighting and guns, and she'll come home with annoying stuff about that.
which puts the dino stuff in perspective. pretty sure they don't file an incident report when someone talks about shooting up a neighborhood.
No blood. No foul.
the report, despite giving the names of three witnesses to the dino incident, does not specify what the 'scratching' actually involved. could have been just unwanted touch, or something that drew blood, or something in between.
like i said, silly to report this stuff. there may be some legal requirement that they do so.
Wow, three witnesses? Sounds like they want to take this to federal court.
i appreciated it. one of the teachers clearly doesn't like my daughter, and if they hadn't listed witnesses i would have assumed it was just that one.
@leslietownes Yes, I believe so. When my mom would get into skirmishes in the nursing home, they had to write it up and report to the caregivers of all involved.
02:48
Does your daughter cut her own nails yet.
Is there something good about properly embedded submanifold? I want to know some importance of proper embedding.
user: she uses a file but doesn't really do a good job. we have to do it for real.
Now's a good time to teach her how to do it properly..
@onepotatotwopotato if the inclusion map is proper, embedding is guaranteed. Topology can’t mess up.
there's weird stuff where the image of the embedding isn't closed. weird spirally stuff. i see a lot of those hypotheses as just confirming 'this is what you'd imagine if you weren't having nightmares.'
02:52
@TedShifrin Oh I see. Thanks
But then it’s not an actual embedding, leslie. Misnomer.
ok. what do i know, i never paid too much attention to this stuff. i did not see those hypotheses as adding more than "this is what you need to be able to draw pictures and not be lying about it" or "this is what you need so it isn't 'point-set topology'"
Embedding means homeomorphism onto its image ... so the subspace topology is nice.
03:15
Find all continuous functions $f$ satisfying $$F(x) = \int_0^x f = (f(x))^2 + C \quad\text{for } C \neq 0,$$ assuming $f$ has at most one zero.

Since $f$ is continuous on $\mathbb{R}$, $F$ must be differentiable on $\mathbb{R}$ and $F'(x) = 2f'(x)f(x) = f(x)$. But $f$ isn't differentiable at $x$ where $f(x) = 0$, even though $F$ is. What's going on?
I guess I will make a post about it.
03:29
The square root isn’t diff at $0$, so what does your what’s going on mean?
But there’s a $C$ here?
@TedShifrin Spivak said that continuous means continuous on $\mathbb{R}$
$\sqrt{x}$ is not even defined on $\mathbb{R}$, much less continuous
So what?
So you know that what is true wherever $f\ne 0$?
So it's not a function $f$ which will satisfy it
I never said it was. I was trying to guess what your question meant. Solving for $f$ from $f^2$.
At any rate, moving on ….
I don't know if I follow
What is your example supposed to say?
03:40
It was not an example.
Forget what I said. Just answer the question I asked and try to make progress. You get yourself sidetracked a lot.
Why is $f$ differentiable where it is nonzero?
$f$ is differentiable when $f$ is nonzero because we are assuming $F(x) = (f(x))^2 + C$ and $F$ is differentiable, so $f(x)^2$ is as well which also has $f$ in its derivative
I set the integral $= F(x)$, and then since $f$ is continuous, I applied the fundamental theorem of calculus part I
Yes, I agree so far.
Part I of FTC tells us that $F'$ exists at points where $f$ is continuous, which is everywhere, so $F'$ exists everywhere
03:48
Yes, move on to $f$.
Then we assume that the integral, which is also equal to $F(x)$, is equal to $(f(x))^2 + C$ for some nonzero constant $C$. Since both sides are equal, we get to take the derivative to find that $F'(x) = 2f(x)f'(x) = f(x)$
No. Why can you use the chain rule?
Because $(f(x))^2 + C$ is differentiable by assumption?
And …
So both $f^2$ and $C$ are differentiable, by assumption
And we can differentiate $f^2$ using the chain rule
03:53
Oh yeah? Please say how.
$((f(x))^2)' = 2f(x)f'(x)$
Hypotheses?
To be honest I would have to look them up in the book, but if I recall correctly, then $f(g(x))$ is differentiable at $x$ if $g$ is differentiable at $x$ and $f$ is differentiable at $g(x)$
Sure … so?
We do NOT know $f$ is diff. That’s the whole point?
I see
So how do we get around this?
03:58
Where did your assertion about points where $f$ is nonzero come from?
That's what Spivak said
So you copying the solutions without thinking?
Anyway for the sake of argument we could suppose that $f$ is differentiable at $x$, then $f(x) = 2f(x)f'(x)$ or $f(x)(2f'(x) - 1) = 0$
Dr. Shifrin, I asked a question about the solution
Maybe now you should think about why I brought up $\sqrt x$?
Well, $\sqrt{x}$ isn't differentiable at $x = 0$ even though it is continuous on $[0,\infty)$
04:02
This is what I was talking about when you wanted to belabor trivial stuff in #1. Here actual thinking is required.
Right. So when can you deduce $f$ is diff?
$f$ is differentiable when $x \in (0,\infty)$
Okay, so in the other case, if $f(x)(2f'(x) - 1) = 0$, then either $f(x) = 0$ or $f'(x) = 1/2$
No, when $f(x)$ is … ?
Are you talking about $f(x) = \sqrt{x}$ or $f(x)$ from the problem?
So finally, wherever $f\ne 0$ you have $f’=1/2$. You still don’t get it. I never said $f$ was $\sqrt$. We’re trying to solve for $f$ knowing $f^2$.
No I know you didn't, I was just wondering if you wanted me to say something more where we pretended that it was
04:10
I want you to deduce $f$ is diff CORRECTLY.
Well, as we said, if $f^2$ were diff we either have $f(x) = 0$ or $f'(x) = 1/2$. So if $f(x) \neq 0$, $f'(x) = 1/2$.
So I suppose, for values of $x$ for which $f$ is nonzero, we are given that $f'(x) = 1/2$
And we aren't given anything else about $f'$
So we aren't allowed to assume that $f'$ exists for values of $x$ for which $f(x) = 0$
Since it could, or maybe it couldn't?
So far you’re not allowed to assume that $f’$ exists anywhere. I’m going to leave. You need to read and reread what I’ve said and think.
Okay thank you
I will do so
Hello
04:49
can someone give me an example of an endomorphism that is trigonalizable but not diagonalizible
IE the charachteristic polynolomial goes into linear factors but the multiplicites are not equal
[[0,1],[0,0]]
05:17
but how do you write it as an endomorphism
phi(x,y) = y?
it would be an endormorphism of F^2 where F is your field, or even a ring i guess, phi(x,y) = (y,0)
are you writing the matrix as coloumn vectors
the above matrix description of the endomorphism is a list of row vectors
Thought so, thanks!
an upper triangular 2x2 with a 1 in the upper right entry and zeros everywhere else
05:22
@TedShifrin Every type of calculus problem
06:07
The minimal polynomial of a jordan matrix has as power of (t- Eigenvalue)^k with k= the size of the biggest jordan block to the eigenvalue
Does this mean that the minimalpolynomial of a jordanblockmatrix J_d(Eigenvalue) has the same dimension of d like the charachtersitic polynomial
i did some calculations and it turns to check out
I am so stressed. I don't understand what else we can conclude.......
By assumption, $f^2$ is diff everywhere, so it's diff at $f(x)$, and we also require that $f$ be diff at $x$. If that is satisfied, then $f = 0$ or $f' = 1/2$
So when $f \neq 0$, we have $f' = 1/2$, which should mean $f'$ is differentiable at $x$ for which $f(x) \neq 0$
I don't know what else to say......
06:29
And we can't say $\sqrt{f^2}$ is differentiable everywhere except where $f = 0$ since $\sqrt{f^2} = |f| \neq f$
And we're trying to differentiate $f$ not $|f|$
07:22
Okay I've got it. Oh my god. I haven't been that frustrated in ages.
The trick is to notice that $|f| = \pm f$ still implies $f$ is differentiable when $f^2 \neq 0 \Rightarrow f \neq 0$
Since $f$ is zero at no more than one point, so $f$ will not change sign more than once, if at all.
Then even if $|f| = -f$ for $x < r$ but $|f| = f$ for $x > r$ where $f(r) = 0$, we would have that $f$ is differentiable since $-f$ being diff implies $f$ is diff
 
2 hours later…
09:22
Can $x$ be represented as a function of $y$ ?
$1 + x -a + xy + bx + ab = 0$
$1 + y - b + xy + ax + ab = 0$
I think it will be a quadratic
i am just worried about the denominator $1+y$ might come while solving..which might resmble a hyperbola?
as an asymptote
$x(1+y+b) = a-1-ab$ from the first equation
So, $x = \frac{a-1-ab}{1+y+b}$
Substituting this into the equation $1 + y - b+xy + ax + ab = 0$, we get
$1 + y - b + y(\frac{a-1-ab}{1+b+y}) + a (\frac{a-1-ab}{1+y+b}) + ab = 0$
This will be a quadratic equation in $y$ giving two values in terms of $a,b$
So I will have two points $(x,y)$ satisfies the two equations simulataneosuly
but can i get a relation between $x$ and $y$ whcih satisfy botht he equations
??
09:52
@politeproofs except at the point where $f(x)=0$
@BAYMAX consider the difference of the two equations
Or do you want to solve each separately?
In which case, I’d try factoring.
10:09
@BAYMAX: you want to solve the equations simultaneously, so go with the first suggestion, take the difference of the equations. That gets rid of the $xy$ term and leaves you with a linear relation between $x$ and $y$.
Solve that linear relation for $y$ and substitute back into one of the original equations. You will get a quadratic in $x$. After solving that, use the formula for $y$ in terms of $x$.
10:25
What's $$\sum_{n_1+...+n_k = n} \binom{n}{n_1, ..., n_k}^2?$$
For k = 2 this is 2n choose n
You can prove this by checking the coeffocient of (x+1)^(2n) at x^n
11:05
Her n=1 is not verified. Right?
This is the incorrectness. right?
11:53
Yes
 
1 hour later…
12:55
can we trigonalize every endomorphism
over C apparently yea
@Astyx, @copper.hat \o
o/
Take the local model of an elliptic Lefschetz fibration over $D^2$ with a single singularity at the origin, monodromy being a Dehn twist about the meridian $a$ of the fiber torus $T^2$. In some sense, the total space of this fibration is $T^2 \times D^2$ with $a \times \{1\}$ killed.
D^2 being the disk?
13:11
Yeah.
then yeah I agree
Well, assuming 1 is the origin too
$1$ is a boundary point of $D^2$. What I mean is that the total space is naively $T^2 \times D^2$ with a disk $D$ attached to $a \times \{1\}$, which would be the Lefschetz thimble.
I'm not sure I understand what you mean by "is" then
What happens to the singular fiber?
@MadSpaces trigonalizable <=> there exists a compelte flag preserved by the endomorphism <=> the characteristic polynomial splits in linear factors
yes thorr i am actually trying to prove the first statement you write
Also, why do we say for an upper triangular matrix we can write it in the form D(I +N) where as D is diagonal and N is nillpotent, i thought more that we can write D+N
57
A: Inverse of an invertible triangular matrix (either upper or lower) is triangular of the same kind

Robin ChapmanAnother method is as follows. An invertible upper triangular matrix has the form $A=D(I+N)$ where $D$ is diagonal (with the same diagonal entries as $A$) and $N$ is upper triangular with zero diagonal. Then $N^n=0$ where $A$ is $n$ by $n$. Both $D$ and $I+N$ have upper triangular inverses: $D^{-1...

here is the refrence to where he uses this
@Thorgott Also , do you have a good link for a proof of the first part (Flag = trig )
13:23
D+N = D(1+D^{-1}N)
But why would then D^-1 * N be nilpotent..
D^-1 is diagonal.
@Astyx This is part of what I am trying to visualize. Let me be clearer as to what I believe the total space is. $T^2 \times D^2 \cup_{a \times \{1\}} D$ is not a manifold, so to correct for that one has to attach a thickened disk (or what we call a 2-handle) $D \times D^2(\varepsilon)$, instead.
To describe this, it's easiest to draw some Kirby diagrams. Let me demonstrate.
@MadSpaces both of these are true
I think one is the additive Jordan-Chevalley decomposition and the other the multiplicative Jordan-Chevalley decomposition or sth
@Astyx: Here is some setup. Take an unknot $S^1 \subset S^3$, and let $D^2 \subset D^4$ be a disk bounded by this unknot $S^1 = \partial D^2$ inside the 4-ball bounding $S^3 = \partial D^2$. Then I claim $D^4 \setminus \nu(D^2) \cong S^1 \times D^3$, where $\nu(D^2)$ denotes an open neighborhood of $D^2$ in $D^4$.
Proof: Interior of $D^4 \setminus D^2$ is $\Bbb C^2 \setminus \Bbb C \cong (\Bbb C \times \Bbb C) \setminus (\Bbb C \times \{0\}) \cong \Bbb C \times (\Bbb C \setminus \{0\}) \cong \Bbb C \times \Bbb R \times S^1 \cong \Bbb R^3 \times S^1$
Check that these homeo(diffeo!)morphisms extend all the way to the boundary as well.
@Astyx: Yeah, sorry, typo.
We call this procedure "carving a disk".
13:35
Ok so far I think I follow
OK, so here is how to obtain $T^2 \times D^2$:
Take this link in $S^3$; I'll explain what the markings mean.
Carve two disks, each bounding the dotted circles $a$ and $b$ respectively, out of $D^4$ bounding $S^3$.
Then attach a $D^2 \times D^2$ to the undotted circle $C$ (the one marked by a $0$) by a homeomorphism $\partial D^2 \times D^2 \to \nu_{S^3}(C)$ where $\nu_{S^3}(C)$ is a closed toral neighborhood of $C$ inside $S^3$.
There are many homeomorphisms $S^1 \times D^2 \to S^1 \times D^2$, though. The marking $0$ specifies what this homeomorphism is. Any homeomorphism $S^1 \times D^2 \to S^1 \times D^2$ is isotopic to one which is $(\theta, z) \mapsto (\theta, e^{i k \theta} z)$. Here, $0$ means $k = 0$.
Let me know if the construction makes sense. I will then explain why it is $T^2 \times D^2$.
Hmm ok
To see why this is $T^2 \times D^2$: First, ignore the undotted circle $C$. What you have is a pair of dotted circles in $S^3 = \partial D^4$. Chop $D^4$ along a $D^3$ which separates $a$ and $b$, i.e., $a$ and $b$ are contained in the the two separate components of $D^4 \setminus D^3 \cong D^4 \sqcup D^4$.
jay
jay
can anyone explain this result, if $K$ is sequentially compact then isnt the first statement of (3.3.4) (the convergence of a sub-sequence) immediate??
im so confused
13:50
Carving along each of these then gives rise to $S^1 \times D^3 \sqcup S^1 \times D^3$ by this discussion. Glue back along the $D^3$'s. So the result is the so-called "boundary connect sum" $S^1 \times D^3 \sharp S^1 \times D^3$
Finally, the circle $C$ has the homotopy class of $aba^{-1} b^{-1}$ in the complement of the pair $a \sqcup b$ in $S^3$. This implies it has the same homotopy class in $S^1 \times D^3 \sharp S^1 \times D^3$ where $a$ and $b$ denotes the obvious generators of the fundamental group of this thing.
So now you see that it is just a thickened version of the torus $T^2$, which is $S^1 \vee S^1$ (of which $S^1 \times D^3 \sharp S^1 \times D^3$ is a thickening) with a 2-cell (of which a 2-handle $D^2 \times D^2$ is a thickening) glued along $aba^{-1} b^{-1}$.
Does that make some sense?
14:19
Sort of yeah
I'm not entirely sure what you want to get in the end
I claim this is the total space of the elliptic Lefschetz fibration from before
I don't get why you can move the killed cycle to the boundary
which I guess is what you're trying to describe?
Sorry I'm being very slow
14:35
I am slow as well, so don't worry about that. So, for one, note that the new link component with $+1$ on it is the vanishing cycle. It gets killed along the disk (the core of the 2-handle that is attached along that link component). The singular fiber is hidden somewhere; in fact the projection map itself is not clear
This is like the total space in abstract. But I think it is possible to draw the projection map.
The homotopy class of the vanishing cycle, at least, is correct. It is indeed the meridian of the torus $T^2 \times \{pt.\}$ in $T^2 \times D^2$
I have a thought on how I would draw the projection map, based off @AkivaWeinberger's pictures on a related question earlier.
by projection map you mean the map from the fibration to your description of the total space?
No I mean, the map from my description of the total space to $D^2$.
The Lefschetz fibration map, that is
Ah ok
Yeah that'd be interesting
@BalarkaSen Akiva, IIRC, was trying to understand the trivial fibration $T^2 \times D^2 \to D^2$ from this picture.
And I think this is what he did. Try to understand the "boundary fibration" $T^2 \times S^1 \to S^1$ instead.
As preparation, try to see what carving or adding a 2-handle does to the boundary $S^3$
In either case, the red circle or the parallel curve to the unknot becomes nullhomotopic and the blue or the meridian curve to the unknot survives. The effect on the boundary is the same: cut out a solid torus neighborhood $S^1 \times D^2$ of the unknot and paste a new solid torus back so that the parallel curve dies. ($D^2 \times S^1$)
(If $k \neq 0$ during handle attachment it gets more complicated, you'd end up doing a so-called surgery on $S^3$ along the unknot)
@BalarkaSen With this in mind, forget the $b$ circle here and arrange things symmetrically.
The complement of a solid torus nbhd of $b$ is a solid torus (because $S^3 \setminus S^1 \cong S^1 \times D^2$). $a \sqcup c$ is sitting inside this solid torus.
One can foliate the exterior of this link in the solid torus by torii which are as drawn above.
It's a little complicated to describe but I can say more, or you can see Akiva's cool pictures here, if interested
15:10
for a diagonalizable matrix A. exists S S^-1 such that S-1 A S = D
why is Rank A = Rank (s^-1 A s ) = Rank D?
I know that the rank of similiar matrices are equal, so the right equality is understandable
But the left one?
I guess the answer is because "A is similir to itself?"
15:32
if i have a matrix
$\begin{bmatrix} a&&b&&c\\a^2&&b^2&&c^2 \end{bmatrix}$
How can i simplify it by removing a b c?
Sorry for dumb questions i am not good in linear algebra
I know you can multiply scalar with the whole matrix.
my savior comes :3
@TedShifrin :3
Not now …
okay :(
15:50
@MadSpaces no, that's the left
 
3 hours later…
18:32
Can someone check if this is true:
Let $ P \in \mathbb{C}[X]_{\leq 2} \; \phi_1 : P \mapsto X * P' , \phi_2 :P \mapsto P'$

i wrote the Matrices representing them, using $ (1,0,0), (0,1,0), (0,0,1) $ as standard basis, i get then

$M(\phi_1)= \begin{bmatrix}0 &&0&&0\\0&&1&&0\\0&&0&&1 \end{bmatrix}$
And analog $M(\phi_2)= \begin{bmatrix}0 &&1&&0\\0&&0&&1\\0&&0&&0 \end{bmatrix}$
With $P'$ i mean derivative
and the vectors (1,0,0) and so on represent polynomials. so (1,0,0) = x^0, (0,1,0) = x^2
got exam tomorrow, panick :(
I have a Markov chain with values in $\mathbb{Z}^3$ which can move from point $x$ to $x+(\pm 1, \pm 1, \pm 1)$ (eight different possibilities) with equal probability
I am to decide if this Markov chain is recurrent or transient
The way the book does it, is that $$p_{xx}(2n) = \sum_{n_1+n_2+n_3+n_4 = n} \binom{2n}{n_1, n_1, n_2, n_2, n_3, n_3, n_4, n_4} \frac{1}{8^{2n}}$$
the probability of returning to x in 2n moves
but this is wrong, no?
Since $(1, 1, 1) = (1, 1, -1) + (1, -1, 1) + (-1, 1, 1)$
the probability can be more than what RHS provides
19:20
Letting $$q_{xx}(2n) = \sum_{n_1+n_2+n_3+n_4 = n} \binom{2n}{n_1, n_1, n_2, n_3, n_3, n_4, n_4}\frac{1}{8^n}$$ we have $$p_{xx}(2n) = q_{xx}(2n)+q_{xx}(2n-4)\frac{1}{8^4} + q_{xx}(2n-8)\frac{1}{8^8}+...$$
which isn't much of a closed form... but it's something I guess
wait no that's wrong
Letting $$q_{xx}(2n) = \sum_{n_1+n_2+n_3+n_4 = n} \binom{2n}{n_1, n_1, n_2, n_3, n_3, n_4, n_4}\frac{1}{8^n}$$ we have $$p_{xx}(2n) = q_{xx}(2n)+q_{xx}(2n-4)\frac{2}{8^4} + q_{xx}(2n-8)\frac{2}{8^8}+...$$
Now it's correct
19:42
There should be 8^(2n) in q_xx(2n) but I'm not editing it the third time...
19:54
@MadSpaces What is the derivative of $f(x)=x^2$?
How do we see that in your matrix?
i just thought care for the spanning vectors, not their linear factors.
Thanks for the tip
I have no idea what you just said.
Thanks for the tip. i will correct it :)
19:57
@Jakobian Isn't this just the triple product of the 1-dimensional random walks on $\Bbb Z$
what's a triple product
Howdy, a @Balarka.
All three components are independent simple random walks on $\Bbb Z$
Hi @Ted
so the second matrix should be $ \begin{bmatrix}0&&1&&0\\0&&0&&2\\0&&0&&0 \end{bmatrix} $
and the first is then $ \begin{bmatrix}0&&0&&0\\0&&1&&0\\0&&0&&2 \end{bmatrix} $
@BalarkaSen I don't think they are independent
But yeah, they are simple random walks
20:01
Why not independent?
You just toss three independent coins and decided if $\pm 1$'s for each component
That's uniform $1/8$ on all eight possibilities
@TedShifrin correct now?
Yup. Not rocket science.
thanks : )
Anyway I think it is just the product, so the return probability should just be $(\binom{2n}{n} 1/2^{2n})^3$
I think it can depend on the initial states, but the transition matrix should be the same either way
20:11
Aren't you starting at just a point say $\mathbf{x} = (x, y, z)$
Then its just $p^1_{xx} p^1_{yy} p^1_{zz}$ which is the same as above. $p^1$ denoting the return probability for the 1D SRW.
Well, not necessarily, but this still requires me to prove that such process is a Markov chain
It's just $(\mathbf{X}_n, \mathbf{Y}_n, \mathbf{Z}_n)$ where $\mathbf{X}_n, \mathbf{Y}_n, \mathbf{Z}_n$ are iid 1D SRW. Product of Markov chains is Markov
The transition matrix is the tensor product of the matrices
@BalarkaSen Why would that be?
No, nevermind. I see it, you just need to apply the definitions directly.
I just told you. Your process is given by $(\mathbf{X}_n, \mathbf{Y}_n, \mathbf{Z}_n) = (\mathbf{X}_{n-1}, \mathbf{Y}_{n-1}, \mathbf{Z}_{n-1}) + \mathbf{V}$ where $\mathbf{V} \sim \mathrm{Unif}(\pm 1, \pm 1, \pm 1)$. That's the same as in distribution as the vector $(\mathbf{E}_1, \mathbf{E}_2, \mathbf{E}_3)$ where $\mathbf{E}_1, \mathbf{E}_2, \mathbf{E}_3 \sim \mathrm{Unif}(1, -1)$, iid.
I meant, why would product of Markov chains be Markov
but I see it now
20:21
Ah OK. Yeah, that's just definitions.
I hate computations in probability. Maybe there is some way to count how many ways to return to a point in $2n$ steps in a bcc lattice. Who cares?
Just throw everything at it until you recognize the distribution
Only honest way to live
So we have $$2\sum_{k=0}^{n/2}\sum_{n_1+n_2+n_3+n_4 = 2k} \binom{2k}{n_1, n_2, n_3, n_4}^2 = \sum_{n_1+n_2+n_3+n_4 = n}\binom{n}{n_1, n_2, n_3, n_4}^2 + \binom{2n}{n}^2$$
right?
Shrug!
I will trust you on the computation
There should be a cube somewhere
Not so trusting, after all ... ?
$$2\sum_{k=0}^{n/2-1}\binom{4k}{2k}\sum_{n_1+n_2+n_3+n_4 = 2k} \binom{2k}{n_1, n_2, n_3, n_4}^2 + \binom{2n}{n} \sum_{n_1+n_2+n_3+n_4 = n}\binom{n}{n_1, n_2, n_3, n_4}^2 = \binom{2n}{n}^3$$
Now it should be true
@TedShifrin Dispassionately skeptical
20:32
This formula is awfully ugly, but at the same time it looks interesting
I've tried reducing 2n choose n from both sides, but there is 4k choose 2k in the first sum, not 2n choose n
That's why it was wrong
I also don't like the way that intro Markov chains courses just want you to keep counting and estimate sums of return probabilities to prove transience/recurrence
So if we let $a_n = \sum_{n_1+n_2+n_3+n_4 = n} \binom{n}{n_1, n_2, n_3, n_4}^2$ then this formula says that $$2\sum_{k=0}^{n/2-1} \binom{4k}{2k}a_{2k} + \binom{2n}{n}a_n = \binom{2n}{n}^3$$ which allows us to compute values of $a_n$ recursively for even $n$.
Or, $$a_n = \binom{2n}{n}^2 - 2\sum_{k=0}^{n/2-1} \binom{2n}{n}^{-1}\binom{4k}{2k}a_{2k}$$
Combinatorics goes out of the window if I give you the nearest neighbor lattice $\Bbb Z^3$ and chuck a sparse set of edges. No combinatorist can tell me if its recurrent or transient with a million years of computations
 
1 hour later…
21:40
@politeproofs This is still garbled. If $f^2$ is differentiable at $a$ and $f(a)>0$, then $\sqrt{f^2}$ is differentiable at $a$ by the chain rule. By continuity, $f=\sqrt{f^2}$ on an interval around $a$, so $f$ is differentiable at $a$. Similarly, if $f(a)<0$, then $-\sqrt{f^2}$ is differentiable at $a$. We know nothing whatsoever if $f(a)=0$.
Indeed, you should think about the example $$f(x) = \begin{cases} x, & x<0 \\ 0, & 0\le x\le 5 \\ x-5, & x>5 \end{cases}.$$ Note that $f^2$ is everywhere differentiable.
If $\epsilon_{\mu_1 \mu_2 ... \mu_m}$ is the levi-civita, what does $(\epsilon^{\mu_1 \mu_2 ... \mu_r})_{\nu_{r+1}...\nu_m}$ mean?
context is hodge star operator on forms
like here:
That is not a standard notation.
what would be the standard notation?
First, you put in parentheses that they did not.
i didnt know how to format it :p
21:50
Do you understand what the Hodge star is in simple cases? Like in $\Bbb R^3$ with the standard metric?
At any rate, they're writing it that way to make the Einstein summation convention work out with upper and lower indices appropriately positioned.
a map from r-forms to (n-r)-forms where n is the dimension of the manifold?
But specifically, what is $\star dx^1$, $\star dx^2$, etc. in $\Bbb R^3$?
$\star (dx^1\wedge dx^3)$, etc.
hmmm... i dont think so
Anyhow, what you wrote originally as "the levi-civita" isn't actually defined.
Well, you should start with concrete stuff.
The Levi-civita symbol applies when you have a permutation of $\{1,2,\dots,n\}$.
It's the sign of the permutation.
It does not make sense when you just have $k$ random numbers from $1$ to $n$.
then what is it? the text defines it as such, +1 for even, -1 for odd, 0 otherwise
21:56
The way you should understand the basic example is this: If you take the wedge product $\omega$ of $r$ orthonormal $1$-forms in $\Bbb R^n$, then $\star\omega$ satisfies $\omega\wedge\star\omega = dx^1\wedge\dots\wedge dx^n$.
Then what is what? What you wrote originally makes no sense.
What they wrote is what I said if you don't worry about upper and lower indices.
00:00 - 22:0022:00 - 23:00

« first day (4372 days earlier)      last day (944 days later) »