« first day (4555 days earlier)      last day (761 days later) » 
00:00 - 20:0020:00 - 00:00

00:00
@TedShifrin I'm the guy with the 3 hice, by the way.
@Obliv It's not an accident two of my books have the subtitle "A Geometric Approach" — for which I am regularly roundly ridiculed on here.
@ペガサスSeiya You need to stop saying that. You sold them all.
@TedShifrin well, I used to be the 3 hice guy. Now I'm the guy with crippling debt
00:16
How do people go about "creating" functions and transformations in the "adult world"? What I mean by this is in these courses I take and read up on we learn the properties of operators, transformations, functions, etc, but we don't actually create any. I could see how you might go about it when writing a textbook, but what about if you're modelling something?
Very nebulous question I know...
you can use set theory to create an arbitrary function. in set theory you learn to prove whether what you defined exists or not
@robjohn i see you are milking that one...
@shintuku I see.....well I haven't got to set theory yet. Topology and the likes is on the docket soon
an alternative interpretation of your question is how do you learn to model phenomena with functions
then, whatever you're modeling can probably be represented by some sort of differential equation, and you learn to find appropriate differential equations by learning more about differential equations and getting intuition about their behaviour
@D.C.theIII If you're modelling something physical, you generally start with dimensional analysis. physics.stackexchange.com/q/98241/123208 That will (usually) give you a useful starting point. Then you try to come up with relevant differential equations. If you're lucky, some aspects of your system will be linear, and crude functions will give you useful approximations that you can refine. You can do a lot of useful stuff with Fourier / Laplace transforms, spherical harmonics, etc.
00:31
@PM2Ring I see I have a bit of work left to do before I'm where I want to be.....
00:50
Suppose the matrix $A$ has echelon form $U$ achieved with no row interchange. Prove $ L$ in $LU$ decomposition is a lower triangular matrix with 1's in the diagonal.
feels like this proof requires a huge amount of case work
is there no way of avoiding the case work?
No. No cases because of the hypothesis. Work some examples and then do induction.
that's what i thought at first, but consider the fact that $E_1A$ can zero not only the first entry of all other rows, but also the rest of their entries, and that if this doesn't happen due to the first pivot row and $E_1$, it could happen due to the second or third and $E_2$ or $E_3$, e.g., the second row could zero all the following rows instead of just their second entry
furthermore what if a set of subsequent pivots rows don't have their pivots placed in a perfect diagonal, meaning that they will have to zero more than one entry in the following rows
a rigorous proof of the most general case seems like a ton of case work
If what you describe happens, wouldn’t you need row interchange to get to echelon form?
As I said, that hypothesis makes it case-free.
no ted i chose those cases starting from a matrix that will need no row interchange to reduce
The pivots don’t have to be in perfect diagonal form.
What you described is what makes you need a row interchange to move a zero row down to the end and another row up.
01:03
1 0 0 0
0 0 1 2
0 0 1 2
0 0 1 2
you can make many such matrices, choosing an arbitrary row after which the rows start repeating
That matrix has no problem unless you put another pivot on the bottom. $U$ has two rows of zeroes and $L$ is fine.
i guess those are the cases then. first, a non problematic case with diagonal pivots. second, a case where there is a point where rows start repeating. third, the case where the rows are not in perfect diagonal, and fourth, one with both of these last two problems
I don’t see why you need cases. The repetition means nothing.
to give a rigorous proof, no? i will rethink this
Where the pivots are affects $U$ and has no issue with $L$. No cases needed.
01:10
thanks for the comments i will be thinking about this
Remember that $L$ encodes the elementary row operations.
You must only see why every elementary matrix is lower triangular.
If you’re not used to thinking about products of elementary matrices, maybe my video on that topic will help.
01:31
i'm seeing that every elementary matrix will have to be lower triangular. what i'm having a difficult time, however, is giving a rigorous proof for the statement: "in a given row, all entries before the pivot will be zeroed by a combination of rows above"
that's the proposition that translates the fact that lower triangular elementary matrices will produce the desired effect
02:21
That’s the definition of pivot!
hm... right
while you take care of creepy edgar. Teach that rich, spoiled brat what a real duel's all about ?. .
02:45
what branch of math is the study of exponential functions and properties?
03:02
precalculus? it's too small a subject to be of much interest in its own right
03:28
What about knuth's up arrow notation or something in that vein?
Like "growth" functions? if that makes sense.
suppose $E_1A = U_1$, $U_1$ is the first step towards the echelon form $U$ of $A$, and producing $U$ will require no row exchange. more specifically, $U_1$ has the first pivot column of $A$ made explicit, i.e., the first pivot column of $U_1$ (which may not be its first column) consists of a leading entry, and then has zero for all following entries
how would i even begin to prove that $E_1$ must be lower triangular? it's obvious if you do the computation
03:50
I think they're called hyperoperators, idk what category this would be in but interesting.
@AkivaWeinberger (99,175) seems to be another
@robjohn I did not understand the last equality. How does that follow?
i.e., how do we get $\sum 1/k$?
$$\frac1{1-\frac1p}=1+\frac1p+\frac1{p^2}+\frac1{p^3}+\dots$$
correct?
yes
But the infinity product part?
Take the product over all primes and you will find the reciprocal of any integer exactly once.
04:00
hmm, it seems true intuitively as every number is product of primes.
so it will appear somewhere.
you can take finite products, and you will get all the integers up to at least the highest prime.
so as you take more terms in the product, you will get more terms in the harmonic series.
brb
we'll say that rearrangement is possible because of positivity of numbers and so...
1 will appear exactly once, 1/2 will appear after that, then 1/3, 1/4= (1/2)^2 and so on.
that's a cool method by the way :-).
Thanks a lot for sharing that.
Thank Euler.
Thank you Euler
@robjohn Here's a question
A while ago I was thinking a lot about the "threshold 3 infected squares" cellular automaton
in which a cell becomes 'infected' if three of its four edge-neighbors are infected, and you run it until it's stable
A 2x2 void would never get filled, nor would a cycle surrounded a disconnected region.
Thus, running that automaton on the coprime matrix would highlight voids and separated pieces
(by "coprime matrix" I mean the image from before - the set of pairs (x,y) with gcd(x,y)=1)
So, what do you get?
04:12
The following statement is plain wrong: Every nonzero integer can be written as a product of primes.
koro - are you angry about the sign thing, or the empty product thing, or both
For what it's worth, you need roughly 75% of the grid to have a chance of filling it all up; this is 6/pi^2=61% full, so we know there will be blanks left over. @robjohn
Why is that wrong @Koro
I guess I don't know how to get -2?
I'm literally about to write a program to do that very thing lol
04:14
1 is the counterexample.
Eh, empty product.
Same way empty sums are 0.
and 2^0=0!=1
We have the above theorem for non unit and non zero elements in UFD.
Why is the identity element of addition different from that of multiplication, anyone know?
So -2 is considered "prime" because we're working with the ring theory definition of prime?
Then -1 would be the real counterexample, I guess
yes
@Obliv suppose they are the same, then it is basically the zero ring.
04:17
For non zero, succession & addition identity element for natural numbers is 0 but for multiplication, exponentiation, tetration, etc it's 1.
Actually idk about the hyperoperators past exponentiation
Well, $a^1=a$ but $1^a\ne a$
@Obliv the identity element $e$ is defined $e \circ x = x$, so you can see why it is different for multiplication and addition
You can also ask why addition and multiplication are commutative and exponentiation is the first time it fails
@Obliv I guess if we suppose the identities were the same - call it $e$, so that $e+x=ex=x$ - then evaluating $(e+e)x$ in two ways gives us $x=x+x$ for all $x$
or $e+x=x+x$, so using the cancellation law $e=x$ and so everything equals everything else
@leslietownes Ahh, so that is the spirit behind the statement.
empty product
-1 still is hard
04:23
:(
$-1$ is a unit, so it is hard to include in a unique representation.
The unique representation only really applies to positive integers
$0$ has many factorizations
@Obliv suppose they are same- 0=1. Then for any x, x=1.x=0.x=0. So the whole ring is {0}. 0- the additive identity, 1- multiplicative identity of ring X. Is that what your question was?
@robjohn this is taken care of by saying that the representation is unique upto rearrangement and associates.
like: 6=2.3= (-2).(-3)=3.2=(-3).(-2)
for non unit and non zero elements.
I'll use the following definition: $p\in \mathbb Z$ is prime iff the ideal $(p)$ is a prime ideal.
this definition takes care of the $\pm 1$ issue.
04:42
@Koro $(3)=(-3)$?
04:55
@AkivaWeinberger not quite sure what you're asking. Did you want to run a cellular automaton on the result?
$(21,55),(99,175),(115,551),(369,575),(495,589)$ seem to be the ones with both numbers $\lt600$.
@robjohn yes, so 3 and -3 both are primes.
by this definition
05:36
Can someone help me understand this about this pdf paper ? It is basic question. They have a paper basically saying "A New Approach for Solving Second Order Ordinary Differential Equations" where given second order ode, they use standard tradsformation v=-y'/y to convert it to Riccati. OK. But then they say given this particular solution to the Riccati ode, they can now obtain one solution to the second order ode. OK. But how did they find...
.. the solution to the Riccati ode in first place? They do not say. What Am I missing here? this is all on one page, so you do not need to read much. They just give the solution to the Riccati ode like this. But There is no known method to find particular solution to Riccati. I have no idea what I am missing about this paper.
So they are basically saying they found a method to solve any second order linear ode by doing this. But to do that they have to be able to find particular solution to Riccati, which there is no such method. I do not get it.
i don't know if it's a standard move here, but it's not uncommon to look for constant solutions to differential equations. so here, you're checking if there's any value of c for which 0 = 1/x + (1+x)/x c + c^2 holds identically. that leads to c = -1 pretty quickly.
whether there's always going to be a constant solution, or whether this is just some miracle that happens here, i dunno. it may be specific to whatever type of equation this is.
It’s a miracle.
i managed to drop my new phone today. actually, it fell by itself.
upon urging of family members, i have ordered a case
a nice cab
not sure that's what they meant
don’t take that paper too seriously. Lots of stuff gets published. If you happen to be able to guess a solution of the Riccati equation, then their method works.
sounds good to me, copper.
05:51
@TedShifrin Yes ofcourse I know if one can find particular solution to Riccati, then this method works. But there is no known method to do that. And they do not even mention this fact. They claim this method can be used to solve second order ode without saying how to solve the Riccati itself.
this paper looks like it was written with micosoft word equations. Im calling BS
As I said, plenty of mediocre stuff gets published. Not remotely a high quality journal.
I bet one of the authors was an undergrad.
@robjohn What do you mean by "the result"? I mean on this:
yes, I just automated a check to look for the isolated points, and the ones I mentioned were what I found.
Sure, but running the automaton will reveal more than just isolated points.
06:00
@TedShifrin I thought Journal papers are peer reviewed. so someone should have cought this and asked about it. Here it is at Journal page
For example, it will reveal the {20,21}x{14,15} square.
My comments do not change. This is not a quality research journal.
if the only reference is a sophomore textbook, that tells you much.
(I'm a bit behind on the inside jokes in this group - but I wonder if Leslie hosts a journal…?)
That would be truly high quality.
maybe a symbol-pushing approach.
"Linear algebra: a typographic approach" = instead of veracity, equations are written using whatever symbols look nicest
Someone somewhere has probably written a lament on how no-one typesets mathematics anymore, we just let Donald Knuth typeset it for us
06:11
You’ve got to be kidding. Leslie can’t even be bothered to use ChatJax!
whoah, akiva? i thought we were friends!
@leslietownes Which message specifically is this a response to
As contrasted with us enemies?
You can't spell "friend" without "end". I mean, you could, quite easily, but not if you care about such things as correctness.
06:13
"i wonder if leslie hosts a journal" after a discussion of an article in a maybe not so great journal where peer review may have consisted of checking whether an electronic funds transfer went through
@TedShifrin yes, i expect it from you.
You give a lot more abuse than you get from me!
$600, apparently, unless the authors are from one of a list of countries
@leslietownes No one with money has ever been wrong!
Thus peer review is not needed
this actually did give me an idea, which is to start a math journal. i could issue lesliecoin based on how many downloads a paper gets, so you can earn on your submissions. there is of course a small submission processing fee, currently payable only in US dollars.
hosting of the article itself is also done in distributed fashion, namely, we do not lock you down to any one website, such as anything that we maintain. you get to host it wherever you like. our license allows for this. we do provide a QR code that can be stamped on the front of your paper so everyone knows it was published in leslie j. m.
The 21st century Annals of Math.
Is that meta-business?
Very à propos, DogAteMy.
I just imagine the relevant question for pricing isn't "how much does it cost us to host it" but "what is hosting worth to you"
@copper.hat I couldn't help but to churn out a response.
No cream of the crop for @robjohn.
07:02
I wouldn't steer you wromg
07:22
No, but you do get our goat.
08:18
@Koro Wikipedia has an ok page dedicated to this: en.wikipedia.org/wiki/…
08:41
Let $\omega$ be a $1$-form on $S^2$. Show that if $\omega$ is invariant under rotation, i.e., $\phi^*\omega = \omega$ for each $\phi\in SO(3)$, then $\omega =0$.
09:00
Oh it's almost immediate from hairy ball theorem
Let $T^2$ be the $2$-torus and let $\alpha,\beta,\gamma$ be closed $1$-forms on $T^2$. Show that there exists real numbers $a,b,c\in\Bbb R$ such that $a\alpha+b\beta+c\gamma$ is exact.
 
4 hours later…
12:35
Hi all, I've got a commutative algebra sanity check request again...
I've been trying to determine (for a field $k$) if $k[x,y]/(x^2,xy)$ is arithmetic or not (meaning its lattice of ideals is distributive, or equivalently all localizations at maximal ideals are rings with linearly ordered ideals.)
From what I've seen, the ideal generated by (the image of) $x$ is minimal, so all other ideals either contain it or intersect it trivially. If we're checking for the diamond lattice, then we can't have all three ideals contain $(x)$ because that'd be within the lattice of $R/(x)\cong k[y]$, which is indeed distributive.
The only alternative then is to put $(x)$ as one of the three ideals in the middle, but then it seems that the other two ideals will always meet at something nonzero, and will always meet $(x)$ at zero, so it's looking like the diamond lattice is impossible to achieve.
That'd mean $k[x,y])/(x^2,xy)$ is arithmetic... is that convincing or have I made some mistake?
 
2 hours later…
14:34
@onepotatotwopotato I hate that name
But it's also hilarious
how do I find range of sin x+x^2? I am a TA and this does not involve taylor series.
@Roby5 Well, you know that it is continuous and that it goes to infinity as $x$ gets large.
So it is sufficient to find the global minimum.
You also know that $x^2$ is eventually a lot larger than $\sin(x)$, so the minimum is going to be near zero.
@XanderHenderson The class I am TAing hasn't studied limits or continuity.
So... look for critical points near zero (perhaps in an interval like $[-\pi, \pi]$), and figure out which of those is the minimum.
@Roby5 What do they know?
You said no Taylor series, which implies that other calculus techniques should be known.
@XanderHenderson Just the definition of domain and range. Odd and even function.
And Periodic functions.
@XanderHenderson How can this problem be solved?
14:54
I guess $H^1(T^2)\simeq\Bbb R^2$ and each $[\alpha],[\beta],[\gamma]$ form a linearly dependent set of $\Bbb R^2$ so such real numbers $a,b,c$ exist.
@Roby5 Without calculus, it seems like a pretty difficult problem.
Even with calculus, it isn't a cakewalk: the derivative is $\cos(x) + 2x$, so you would need to solve $\cos(x) + 2x = 0$ to find critical point(s). But that is a non-trivial problem, itself.
@XanderHenderson I will ask the prof. I thought I was being stupid.
This isn't a problem that I would typically assign, since it seems that an answer is going to rely on numerical methods. In this case, maybe graph it on GeoGebra, and rely on that to find the minimum.
If it were $\cos(x) + x^2$, the problem would be more doable...
Speaking of numerical methods, we're gonna be learning PDEs soon... Yeah wish me luck
15:23
@XanderHenderson "the book you choose is important"
So would you advise against just picking some lecture notes or pdf online and instead get a well known book?
@ILikeMathematics In what context?
@XanderHenderson When you want to learn about some field. You could google "group theory pdf" and lots of lecture notes will come up, which could probably replace a book on group theory. Or would you advise against that and instead get a well known book on it?
@ILikeMathematics For self-learning, I think that it is important to work through lots of exercises. Typically, random notes on the internet are not going to have many exercises, and it is likely that those exercises are not going to be very well thought-out.
3
I mean, there are exceptions, but as a generality, you are likely to be better off with a text.
Actual books are typically proofread, and peer reviewed (to some extent or another), and the exercises have (hopefully) been thought through a bit more.
Of course, that's just my opinion. Others here might disagree.
15:37
@XanderHenderson do you feel like double-teaming Matthew again, or will you pass?
Good general advice. The original question seems misled though. There is a lot more that goes into choosing a reference than just its publication origins.
@ペガサスSeiya I'm sorry... WHAT?!
A space $X$ has the fixed point property if every homeomorphism $X\to X$ has a fixed point. Clearly if $X$ has the FPP, no action $\Bbb Z\curvearrowright X$ can be minimal (that is have all orbits dense) since there will always be a singleton orbit. What is an example of a (compact, connected, metric) space $X$ that doesn't have the FPP but still admits no minimal $\Bbb Z$ actions?
@XanderHenderson remember the time you and I solo'd Matthew when he tried to talk nonsense about radiometric dating? Well, he did it again, this time being hilariously wrong about accelerating $\alpha$-decay, what do say?
It was funny too in my opinion
@AlessandroCodenotti I don't know that I completely follow, but isn't the circle an example? Rotations are homeomorphisms, rotations by rational multiples of $\pi$ have finite orbits.
15:42
@TedShifrin This particular journal is listed as a predatory journal in beallslist.net
I guess I'll take that as a no
What does the following mean -Let $a_1,a_2,..., a_{\phi(n)}$ be a reduced residue system modulo $n$?
@ペガサスSeiya I have no interest.
@XanderHenderson but the circle also admits minimal actions, rotating by irrational angles
@AlessandroCodenotti Ah, sure. I mixed up some quantifiers.
15:44
@Nasser This is listed as a predatory journal beallslist.net and in general, you could look up mathscinet to guest whether a journal is of good quality.
what is a reduced residue system modulo n?
@XanderHenderson yeah I figured
@AlessandroCodenotti What about some kind of action on $\ell^p$ for some $p$?
I didn't think about those, I'm not very familiar with actions on Banach spaces, I usually focus on compact spaces (and I'd prefer a compact example)
@AlessandroCodenotti Yeah, I saw that. My intuition is that in order to have no actions with dense orbits, you are going to have at to have a bit space where things have a lot of space to move around.
15:47
@AlessandroCodenotti So you prefer Smith spaces to Banach spaces?
I feel like compactness will ruin this.
Am I right in saying that a reduced system modulo n is the same as the group $U_n$?
@Yai0Phah I don't know what those are. I'm an honest topologist, I like compact connected metric spaces
@AlessandroCodenotti Pfft.
i.e., the group of equivalence class of integers which are less than n and relatively prime to $n$?
15:52
For example, the space of Radon measures on a compact Hausdorff space, with compact-open topology.
@Koro what's up
hi @ペガサスSeiya!!
@XanderHenderson And self-learning from textbooks put up by their authors online should be fine, right? There is the website realnotcomplex.com for example that seems to be a collection of many of them.
@ILikeMathematics The fact that a book is a book (and not just a collection of notes) is an indication that it might be a better resource than a set of random notes. It is not a guarantee. So those books might be fine. They might not be. I have no idea.
Also, what I think is a great book might not work for you.
@Koro I hope the name change didn't confuse you
16:08
no the front part of the name looks the same to me.
@Koro its different though. It says "Pegasusu"
Ohh
can anyone please suggest me how to get to Wilson's theorem using Euler's theorem?
16:21
Thanks
I remember what Leslie said once- suppose $x= (p-1)!$. {1,2,...,p-1} modulo p forms a group under multiplication. So $x^2=1(p)$ (because every group element has an inverse). So either p|x-1 or p|x+1. Suppose p>2. Then the former is not possible, hence $x+1=0(p)$.
For p=2, Wilson's theorem is true. So the proof is complete. QED.
@Yai0Phah I guess you want probability measures? Doesn't look compact to me as written
To show that $(0,1] \subseteq \bigcup_{n\in\mathbb{N}} \left(\frac{1}{n},1\right]$ I reasoned as follow: let $x \in (0,1]$, hence $0<x\le 1$ and so, by Archimedean property, there exists $n_x \in \mathbb{N}$ such that $x>1/n_x$. So, $x \in \left(\frac{1}{n_x},1\right]$ and, by definition of union, $x \in \bigcup_{n\in\mathbb{N}}\left(\frac{1}{n},1\right]$.
But it does not use Euler's theorem.
This seems correct to me, but by $n$ depends on $x$. I think this isn't a problem, because I only need the existence of an $n$ to state that $x$ belongs to the union, and it doesn't matter if that $n$ changes as $x$ changes. Is this correct?
16:31
@Gwyn It is correct.
@Gwyn think of it as follows: $(\frac 1{n_x}, 1]\subset \bigcup_{n\in N}(\frac 1n,1]$. So $x\in \bigcup_{n\in N}(\frac 1n,1]$.
thank you Koro!
Dependency of n on x is taken care of by the last sentence in my last comment and in your comment as well.
@Gwyn You have to show that if $x \in (0,1]$, then there is some $n$ (which may depend on $x$) such that $x \in (1/n, 1]$. Which you have done. It looks fine to me.
So, yes, your choice of $n$ may change as $x$ changes, but that's fine.
For the record, I think that the appeal to the Archimedean property is overkill. You can give $n$ explicitly in terms of, for example, the greatest integer function.
16:53
@ペガサスSeiya 日本語を読めるか?
私が二三年日本語を習てたけどまだ下手だ
nice :)
I wish I knew this.
@AkivaWeinberger: can you write, read and understand Japanese?
To varying degrees
I'm still not at the level that I wanted to be at
17:14
@AkivaWeinberger 残念ながらまだ
I find Hiragana difficult
@AlessandroCodenotti It is not compact (it is a TVS), but somehow completely controlled by a compactum.
17:35
@AkivaWeinberger: 600x600
@AlessandroCodenotti haha, I prefer the more set theoretical side of general topology for some reason
continuum theory is really cool though
私は高校の時に日本語を習ったことがあるけど、今はほとんど忘れた
@robjohn Hey look
I figured out how to get that automaton to run on Desmos!
It's a little janky though
@AkivaWeinberger the isolated points are outlined in red.
I see. Nice!
Unfortunately Desmos can't handle larger than 100x100
17:48
I have a quick question.

If I throw n dices, the probability of having a max of 3 (<= 3) is equal to (3/6)^n - (2/6)^n
my reasoning is I want mix of {1,2,3} but no mix of {1,2}

If I throw n dices, the probability of having a min of 3 (>= 3) is equal to (4/6)^n - (3/6)^n
my reasoning is I want mix of {3,4,5,6} but no mix of {4,5,6}

If I throw n dices, the probability of having less than (< 3) is equal to (2/6)^n
my reasoning is I want mix of {1,2}

If I throw n dices, the probability of having greater than (> 3) is equal to (3/6)^n
@Node.JS "Dice" is plural. So, for example, one can throw $n$ dice (not $n$ dices). The singular is "die".
Also, your dice are, presumably, 6 sided and fair?
yes
I really need help with understanding this
Regarding your first computation, I don't buy it. A sequence of die rolls is "good" if it contains at least one $3$, and no numbers greater than $3$. So, imagine that you have $n$ slots in which to place die rolls. You have to choose one slot to contain a $3$, and the rest to contain any of $1$, $2$, or $3$. There are $\binom{n}{1} = n$ ways of picking the slot for the $3$, and $\binom{n}{n-1} = n$ ways of choosing the remaining slots.
Wouldn't you double count some rolls with multiple 3s this way?
@Astyx Oi... maybe.
Let me think...
18:04
I think @Node.JS’s computation looks good.
These can be computed elsewise, but I think their way works.
@Astyx Yes... you are correct. I'm an idiot.
@AkivaWeinberger I’ll have to see if I can run that on Mma
Okay... so there are $3^n$ sequences which have only $1$s, $2$s, and $3$s, and $2^n$ sequences which contain only $1$s and $2$s. So there are $3^n - 2^n$ sequences which contain results less than $4$, but which contain at least one $3$. Thus the probability should be $(3^n - 2^n)/6^n$.
Which is what @Node.JS suggested.
Yup. That's fine.
In other news, I think that I am going to pack up my stuff now and teach from home this afternoon. The snow is really coming down, and I am a little worried about road conditions...
@robjohn what is a better way to think about this in terms of a <= b is equal to a < b or a == b
I think your way is probably the simplest
18:15
@robjohn MMA?
@AkivaWeinberger Here I've highlighted the cells that stay uninfected.
I realize that was probably clear but I wanted to say it explicitly
@AkivaWeinberger Mathematica
@AkivaWeinberger unaffected under which rule?
@robjohn Hope your checkup with the doctor will be great!
🤞🏻Me too, thanks
Go to the hospital 8:30 tomorrow for a cystogram.
If that is good, then to the doctor to be unplugged
Ah, well, I hope all is great!
Thanks. There is a possibility that the catheter may need to stay in longer, so I’m cautiously hopeful.
18:23
@robjohn As in, they never get three infected neighbors, so they stay uninfected as the automaton progresses.
By the way, I think I said earlier (incorrectly) that a grid needs to be roughly 3/4 full in order for everything to get filled. I was wrong - it needs to be roughly 2/3 full
6/pi^2 < 2/3 still though so we still know there must be voids
@AkivaWeinberger ah, so the isolated points have a square of side 5 around them and that gives the square of side 3 around them 4 neighbors infected
@Yai0Phah Good grief! I'd never heard of predatory journals !!
@robjohn If a cell has 4 neighbors infected it's completely surrounded…?
I'm not counting diagonals
Sorry, I should have specified: if a cell has 3 or 4 out of its four edge-neighbors infected, it becomes infected; once it's infected it's infected forever.
18:43
Can maybe someone take a look at this probability question?
0
Q: Proof that the negative part of this martingale is bounded.

user123234 Let $(E_n)_n$ be a sequence of events $E_n\in F_n$ for all $n$. I define $$M_n=\sum_{k=1}^n \Bbb{1}_{E_k}-\sum_{k=1}^n \Bbb{P}(E_k|F_{k-1})$$ I define for $a>0$ the stopping time $$t_a=\inf\left\{n\geq 0: \sum_{k=1}^{n+1} \Bbb{P}(E_k|F_{k-1})>a\right\}$$I want to show that $M_{n\wedge t_a}^-\leq...

@AkivaWeinberger Ah, that is a different one than I have used. Okay.
19:06
@TedShifrin Predatory?
@robjohn My reaction, precisely. But @Yai0Phah gave a link in which it's delineated.
we'll all just notice that leslie m. j. is not on that list. cough akiva.
Well, we don't know what pseudonym you've used to set up that journal.
Incidentally, this leads to a natural question
0
Q: What is the most number of distinct gcds in a 3x3 grid?

Akiva WeinbergerConsider the following table: \begin{array}{r|cc} \gcd & 20 & 21 & 22 \\ \hline 54 & 2 & 3 & 2 \\ 55 & 5 & 1 & 11 \\ 56 & 4 & 7 & 2 \end{array} This is $\gcd(x,y)$ for $x\in\{20\mathbin{..}22\}$ and $y\in\{54\mathbin{..}56\}$. Note that there are seven different $\gcd$ values: $1$, $2$, $3$, $4$,...

19:36
@AkivaWeinberger Please edit your reprehensible English syntax? "most number" is not something you should be saying or writing.
I'm going through Milnor's proof that the Grassmannian is a manifold (I've seen the construction in Lee, but I want to go through the details in Milnor as well). He gives the Grassmannian $Gr_n(\mathbb R^{k+n})$ a topology by declairing the following map to be a quotient map: $q:V_n(\mathbb R^{n+k})\to Gr_n(\mathbb R^{n+k})$ where $V_n(\mathbb R^{n+k})\subset(\mathbb R^{n+k})^n$ consists of linearly independent vectors, and $q$ maps such a tuple to its span.
For $X_0\in Gr_n(\mathbb R^{n+k})$ we let $U$ be the open neighbourhood consisting of elements $V$ such that $V\cap X_0^\perp=0$. Then there is a natural bijection $T:\hom(X_0,X_0^\perp)\to U,\phi\mapsto\Gamma(\phi)$ where $\Gamma(\phi)$ is the graph of $\phi$. I want to understand why from Milnor's definition $T$ is a homeomorphism.
He fixes an orthonormal basis $x_i$ for $X_0$, and for each $Y\in U$ he lets $y_i$ be the unique basis such that $p(y_i)=x_i$, where $p:\mathbb R^{n+k}\to X_0$ is the projection map. He claims that this $n$-frame $(y_1,\dots,y_n)$ depends continuously on $Y$. I don't know how to make the continuity precise.
Intuitively it makes sense; we are taking the inverse of the projection map, so if the plane we are 'inverse-projecting' varies continuously, then the images $y_i$ will vary continuously. However, how to make this precise?
Writing $x_i$ for a basis is pretty bad, by the way.
Either list the ordered basis or write $\{x_i\}$. To me $x_i$ is a single vector.
sure, I can't edit my message anymore, but I can use that notation from now on
@TedShifrin I did
You've said that $Y = \phi(X_0)$ for a unique $\phi$, and $y_i = \phi(x_i)$ for each $i$.
@AkivaWeinberger We native English speakers thank you.
So the point is that $\phi$ varies continuously, by the definition of his topology.
19:42
wait, $\phi$ is not a symbol I introduced. Do you mean that $Y=\Gamma(\phi)$ for a unique $\phi$, and $y_i=p(x_i)$?
It's in your text, @Sha.
$\Gamma$ is the entire graph.
and $\phi\in\hom(X_0,X_0^\perp)$?
Oh, you're right.
My apologies.
no worries
Yes, and then you get a basis for $Y$ by applying $\phi$ to a fixed basis for $X_0$.
I think of this more concretely just in terms of matrices, which is, I'm sure, what Lee does.
19:45
don't we apply the inverse of the projection $p$ instead of $\phi$?
It's all the same thing. I actually prefer working with the Stiefel manifold of frames, and then passing to the Grassmannian.
$\phi$ is the inverse if you restrict to $Y$.
@TedShifrin well that's Milnor's approach, right? Milnor defines the quotient topology on the Grassmannian, which makes it homeomorphic to the Stiefel manifold modulo a group action
@TedShifrin aha, ok, so $\phi=(p\vert_Y)^{-1}$
and so my question is why $\phi$ varies continuously with $Y$
or if you will, why the images $\phi(x_i)$ vary continuously
oh, you're saying
@TedShifrin that $\phi$ caries continuously by the definition of the topology?
that's not immediately obvious to me, let me see
I'm saying that the Grassmannian is topologized by saying $T$ is a homeomorphism.
I no longer own that book, so I can't look at it.
$\phi$ has tooth decay?
Where is the cavity?
19:51
there's no need to look at the book; I wrote in my initial message how the topology on the Grassmannian is defined by Milnor
someone mentioned $\phi$ caries... (spelling nazi strikes again)
it's defined as having the quotient topology given by the map $q:V_n(\mathbb R^{n+k})\to Gr_n(\mathbb R^{n+k})$ where $V_n(\mathbb R^{n+k})\subset(\mathbb R^{n+k})^n$ consists of linearly independent vectors, and $q$ maps such a tuple to its span
I guess I don't know that word. Of course, Sha meant varies.
I've checked that $q$ is an open map btw, so that could be useful
So we think of the frame as giving us rows (or columns) of an $n\times (n+k)$ matrix and the natural topology on matrices gives the topology on the frames.
19:54
yes
and a subset of the Grassmannian is open if its corresponding collection of frames is open
But you can see the mapping $\phi$ precisely in that matrix.
OH
ok, that's promising
let me think
waits to see smoke rising on the horizon :D
spelling/grammar geheime staatspolizei @robjohn?
:P
@robjohn I've never in my life seen that word (and it apparently is a noun, not a verb :P).
19:56
@user726941 very secret :-p
:D
I've never seen it before either.
hm, the only thing I can think of is $x_i\mapsto \sum\langle x_i,v_i\rangle v_i$ where $(v_i)$ is our frame?
I have no idea how I should otherwise land into $Y$ where $Y$ is spanned by $(v_i)$
00:00 - 20:0020:00 - 00:00

« first day (4555 days earlier)      last day (761 days later) »