« first day (4122 days earlier)      last day (1195 days later) » 

15:01
Well , it seems like:
G has an identity ⇒ G is a trivial group
But I don't know yet if G has an identiy or not...
Well, is $G$ the trivial group, or not?
Idk. I dont have that info :P
Well, then I suppose you cannot answer the question.
What you have learned is that a set $G$ together with the operation $\star : G\times G \to G : (a,b) \mapsto a$ either has no identity, or is the trivial group.
If you don't know anything else about $G$, that is the best you can say.
That being said, I am pretty sure that Neel's example began with the assumption that $G = \mathbb{Z}$, which gives you more information.
How does one think of the gwnerators of the first homology group of a space geometrically?
@monoidaltransform Personally? I don't.
15:08
Wait , ℤ has the property that ∀a,b ∈ ℤ ( a.b = a ) ?
@Prithubiswas I don't understand your question.
Neel was given an exercise, which began with "Define an operation $\star$ on $\mathbb{Z}$ by $a\star b = a$."
Neel was then asked to determine the properties satisfied by this operation.
Whoops I thought * was multiplication...
I have one question on limits.
@XanderHenderson Some more tinkering.
If e is an identity of (".", ℤ) , then for all x ∈ ℤ,
x = x.e = e.x = e
x = e
Let x be 0 and 1.
0 = e
1 = e
0 = 1
Contradiction
Thus (".", ℤ) doesn't have an identity.
Thus (".", ℤ) is not a group.
And I'm not sure if my answers to that are correct.
15:17
@Prithubiswas That doesn't make any sense to me.
$x$ cannot be two things.
Rather, if there is an identity $e$ for the operation $a\star b := a$, then $x = x\star e = e\star x = e$ for any $x \in \mathbb{Z}$. That is, $\mathbb{Z} = \{e\}. $ But $\mathbb{Z}$ contains more than one distinct element. Contradiction.
@Koro Don't ask to ask, just ask.
Let $f:\mathbb R\to \mathbb R$ be a continuous function such that $\int_0^\infty f(x) dx$ exists. Then there are four options: a)if $\lim_{n\to \infty} f(x)$ exists then it is must be equal to $0$. b) the limit in a) must exist and equal to $0$, c) if f is non negative then limit in a) must exist. d) if f is differentiable, then $\lim_{n\to \infty} f'(x)$ must exist and equal to $0$.
@Xander: I was thinking whether I should post on mse, because I wanted to show attempt also in one place.
So here, I think that option a) is correct. Because let $x_n:=\int_0^n f(x) dx$, then the sequence $(x_n)$ is convergent. By Fundamental theorem of calculus, the function $\int_o^u f(x) dx$ is differentiable for all $u$ so by LMVT, there exists a $c_n \in (n,n+1)$ such that $x_{n+1}-x_n= f(c_n)$. Taking limit on both sides, it follows that $\lim f(c_n)=0$
If ∃y ∈ ℤ ∀x ∈ ℤ (e.x = x.e = x)
    Let e ∈ ℤ such that ∀x ∈ ℤ (e.x = x.e = x)
    ∀x ∈ ℤ (e.x = x.e = x)
    Given a ∈ G
        ∀x ∈ ℤ (e.x = x.e = x)
        e.a = a.e = a
        ∀x,y ∈ ℤ (x.y = x)
        e.a = e
        e = e.a = a.e = a
        e = a
    ∀x ∈ G (e = x)
    e = 0
    e = 1
    0 = 1
    ⊥
¬∃y ∈ ℤ ∀x ∈ ℤ (e.x = x.e = x)

Thus (".", ℤ) doesn't have an identity.
Thus (".", ℤ) is not a group.
@XanderHenderson Is this proof understandable to you?
15:36
b) is not correct. Counterexample can be constructed as follows: Let's consider a triangle OAB of height $\frac 12$ and base of length 1 with $O$ as origin, I call this triangle T1. Then, I inductively define $Tn$ as the triangle which has base length equal to half of base length of $T_{n-1}$. Also, suppose all Tn's have the same height that is 1/2. These Tn's define a function g with domain $[0,\infty)$ and range =$[0,1/2]$. This function can be extended to $f:R\to R$ by setting f(x)=0
on x<0 and $f(x):=g(x)$ on $x\ge 0$.
It can be shown that $\int_0^\infty f(x) dx=\lim_{n\to \infty}\sum_{i=1}^n (\frac 12)^i=1$ but clearly $\lim_{x\to \infty} f(x)$ does not exist.
c) is false by b)
d) I couldn't come up with a counterexample nor could I prove it.
Also, I'm not sure if my understanding for b) is correct.
@Prithubiswas what is G? And how does that differ from $\mathbb Z$. I think you meant $\mathbb Z$ there.
@Koro Yep it is a typo.
How can I force myself to get started on my presentation?
Oh yeah, and for those of you who were here when I was asking for topics -- I chose Zorn's Lemma.
I don't expect a response to that...just putting it out there.
16:14
@Prithubiswas First off, I don't know why you are writing it in that format. Most working mathematicians (other than, like, formal proofs people) try to write in English. When I am reading an argument, I prefer that things be written in words as much as possible, with notation used only when words are going to cause problems or create ambiguity.
Second, you have $e=0$ and $e=1$. This makes no sense to me.
Again, there is a simple, direct argument: If $a\star b = a$ for all $a,b\in \mathbb{Z}$ and this operation has an identity element $e$, then $x = e$, which implies that $\mathbb{Z} = \{e\}$, i.e. the set with one element. But $\mathbb{Z}$ contains more than one element.
can anyone please verify my solution above? Thanks.
@UnderMathUate What do you plan on covering about it? :)
@XanderHenderson Not sure what being a "formal proof people" means. If it's a question in math logic, or in logic, we see that due to the contradiction, the proof is complete. But I agree that in other classes, words help immensely, to make a proof flow better.
16:30
@UnderMathUate you might like kconrad.math.uconn.edu/blurbs/zorn1.pdf (pg 17 and on if you don't know any abstract algebra).
@amWhy I was thinking about folk who study formal proofs, e.g. proofs written in a more-or-less computer readable format.
To put my thoughts on the above question in one place, I have posted my answer here: math.stackexchange.com/questions/4307916/…
I request verification of the same please.
@XanderHenderson I get it, and agree, save for what seems to happen on this site, where folks struggling with English, feel more confident in using the "universal language of math". But thanks for clarifying.
16:46
Consider the group $\Bbb R/\Bbb Q$. That is, $\Bbb R/{\sim}$ where $x\sim y$ iff $x-y\in\Bbb Q$.
Apparently, you need the axiom of choice to prove that that has a total order
That is, you cannot constructively define a relation $\prec$ on $\Bbb R/\Bbb Q$ with $x\nprec x$ (irreflexivity), $x\prec y\land y\prec z\Rightarrow x\prec z$ (transitivity), and $x\prec y\lor x=y\lor y\prec x$ (connectivity)
@Koro: Does $\int_0^\infty \sin(x^2)\,dx$ exist? (I assume we're doing Riemann integrals?)
@XanderHenderson hey... that's how I make my living. I wrote and maintain the formal system that is used by UCLA and some other places to teach symbolic logic.
Not that I used those methods in my own proofs.
Have I shared this before? The Natural Number Game. It teaches you Lean, a formal proof assistant
(@XanderHenderson @amWhy @robjohn)
(@Prithubiswas)
DogAteMy is aiming for the prize for maximal number of pings on one line.
@AkivaWeinberger In the system we use, Certain exercises are answered to justify Theorems that can then be used. Students can also cite theorems they have written and proven themselves in other proofs.
16:57
@robjohn Oh, that's clever.
@TedShifrin professor Ted, yes that converges and yes we are doing Riemann integrals. It's nice example that works for my b)
I intended it for d). :)
My standard example for b) is what you envisioned.
and for d) as well :)
@XanderHenderson Isn't it just Universal instantiation?
@Ted, I could appreciate "smoothing out" corners in the linked post in my post as I recalled that from Spivak's. :)
Thanks a lot for review professor Ted. I'm glad my solution for b) is correct. :)
17:01
Yeah, smoothing out corners is a common approach (and an important one, for example approximating a piecewise-smooth curve by a smooth one).
I haven't read through all the moderator self-nomination stuff. Is there anyone running who thinks that there is a rôle for those of us who like to comment interactively and engage in socratic education (as opposed to posting textbook proofs for people to copy into their homework)?
@TedShifrin another example is $$\int_{-\infty}^\infty\left(\cos^2(x)\right)^{x^4}\,\mathrm{d}x$$
But that integrand is always positive
Oh my God.
@XanderHenderson Oh wait my proof has a big mistake at the start.
@robjohn LOL. Oh, that’s a natural one!
17:20
The integral over each spike is like $\frac1{n^2}$
Yeah, I removed my "at first thought."
Did you just invent it @professor Rob?
So is $4$ the optimal exponent there?
@Koro yeah. Just trying to find a smooth function to replace the sawtooth functions that are often used for this purpose.
@TedShifrin Anything greater than $2$ will converge over the positive reals, but $4$ makes the exponent positive
@XanderHenderson I think the proof will be valid if I replace the "e" in the first and last line of my proof with "y". I think that was the big issue (is it?)
17:28
About 2% of the eligible voters have voted in the election so far.
$$\int_{-\infty}^\infty\left(\cos^2(x)\right)^{x^2}\,\mathrm{d}x$$ diverges
I've not considered such integrals up to this point in my checkered life.
If Leibnitz looks at this integral, I think he'll be very happy.
I haven't either, but it seemed like a thing to use for convergent integrals that do not tend to $0$
I would be very surprised if it has a simple closed form (the one with $x^4$)
I would be more than "very surprised."
i'm having trouble with hatcher, page 151, namely the homology group of klein bottle pi.math.cornell.edu/~hatcher/AT/AT.pdf. How in the world does $\Phi(1)=(2,-2)$ and what in the world does that have to do with "since the boundary circle of a M¨obius band wraps twice around the core circle."
17:42
Hello@TedShifrin
How's everything going?
Hi, Sayan. Bumbling along, and you?
Loads of work, Ted. Have started writing my master's thesis
Wow, that was fast.
@monoidal What is the generator of $H_1(A\cap B)$?
i'm not sure. I don't know how to understand the generators geometrically or how to get them @TedShifrin. I know $A\cap B$ is homomotpy equivalent to $\mathbb{S}^1$
@TedShifrin
@TedShifrin Lol fast in the sense?
17:48
Forget about the Klein bottle and understand the statement he makes about a single Möbius strip.
Draw the rectangle picture.
@Prithubiswas I don't enjoy reading proofs which are presented purely symbolically. I am not the person to proofread your purely symbolic proof. I have already told you how I would present the proof. If you want to know how to write it in a completely formal or symbolic manner, ask someone else.
@Sayan It seems like yesterday you were still in high school.
I second @Xander.
@monoidal Even better, make a Möbius strip out of paper and follow the boundary circle around. What does it do?
@TedShifrin Yeah I am shocked that I have decided to even continue doing math, given how solitary this field sometime feels.
@amWhy Sure---but perhaps my point would better have been made by saying "most work-a-day mathematicians write in natural language, not in the language of formal proofs". I, personally, have no desire to proofread a proof which is written purely symbolically. Someone working in the field of formal proofs might, on the other hand, be interested.
It doesn't have to be. It's just antisocial people who make it that way.
17:52
Overleaf just crashed and I have to send this writeup by today night as I had promised :(
it's already 11:30 pm
Ah, another good argument not to use web-based LaTeX :P
you only have half an hour till EOD :)
@TedShifrin Yeah sometimes I do see collaboration and people talking which genuinely feels good, but there are lots of antisocial people and just people who are not interested in sharing and listening (which is a general fact I guess)
@XanderHenderson ok
17:55
@TedShifrin it always returns to the same place we started with
@Sayan Most of my publications were joint with 1 or 2 coauthors.
@monoidaltransform That's always true with a closed curve. We need more insight than that.
That is really nice @Ted, my peers prefer working alone, so it sometimes rubs me off the wrong way.
@monoidal Here's a suggestion. Put a blue dot on the boundary and attach it with a string to a red dot on the central circle. As the blue dot goes around the entire boundary, what does the red dot do?
@Sayan The best thing to do is to have a seminar with several other mathematicians where you go through a paper of common interest. Interacting on that often leads to joint research work later on.
it goes to the same place twice, once in one side and another in the other side
I just think as math people, or atleast the community I have been around, we put "the problem/idea" way ahead of ourselves. This sometimes goes to the point where you lose your self identity and all you are is a husk of theorems/ideas which looks down upon anyone and everything who maybe wants not to be one dimensional
18:00
Aha. So when you go once around the boundary circle, the red dot goes twice around the central circle. There is the $2$.
fin
fin
Hi @TedShifrin
Hi @fin
@Sayan I wonder if this is a cultural hang-up with some Indians? I have experienced that with some, too.
fin
fin
one question in my textbook asks to prove that if $AB$ and $B$ are nonsingular then $A$ must be nonsingular
and it says to use the theorem that an $n \times n$ matrix is invertible iff its nonsingular
OK, there are different ways to do that, @fin. One is to use the theorem about invertibility and non-singularity. One is to use just nonsingularity so show that the only solution of $Ax=0$ is the trivial solution.
fin
fin
but how do i apply that if I didnt know $A$ and $B$ are square?
18:03
They have to be square by definition.
$B$ is square and $AB$ is square.
fin
fin
whys that
Look at the definitions!
Okay. I see. Now i'm starting to understand things. Why do we get the map $\Phi(1)=(2,-2)$. Isnt the map supposed to be $\Phi: H_1(A\cap B)\rightarrow H_1(A)\oplus H_1(B)$. I know theyre isomorphic to $\mathbb{Z}$ and $\mathbb{Z}^2$ respectively, 1 is the generator for $\mathbb{Z}$ but where does $(2,-2)$ come from?
We just explained one $2$, @monoidal. The other one is either $2$ or $-2$, but you have to say how you're picking your generators in the first place.
Okay. I see where i'm confused. I'm not sure how what you explained relates to the idea of a generator of the homology group
fin
fin
18:05
OH
singular/nonsingular only applies to square
Bingo :)
fin
fin
but then why do we have the term invertible too
There's a reason I made 1/6 of my final exam in that course statements of definitions. :)
fin
fin
are there other kinds of spaces where invertible <=/=> nonsingular
Because it's a different and important concept. The wonder is that they coincide.
18:06
@TedShifrin Maybe but for instance not to make things weird, being in the LGBTQ community and being open about it (personlly) has made life kind of difficult to not be judged around in the Indian math community. This identity is thought of as an accessory which I put around and becomes a justification whenever I have mathematical shortcomings
Singular/nonsingular is used only in the contexts of matrices.
So in general what do generators of the first homology group mean geometrically?
fin
fin
@SayanChattopadhyay i live in america and im trans and its pretty bad here too
I had no idea, @Sayan, but, yes, there are lots of bigots out there. Good for you for being open.
fin
fin
when i went to the psych ward they refused to call me a different name lol
even tho they let other patients have nicknames
18:08
@monoidal Every closed loop is homologous to some integer linear combination of the generators. Start with a circle. :)
Yeah it's frustrating. Anyway, I do enjoy math, but I don't know till when I can do it sustainably. Hopefully I can understand a few things until then.
@fin I think a lot of the progress that we'd made in this country has been reversed by the enabling of the overt white supremacy and hatred thanks to the last administration. And it is not going away. There have been anti LBGT trends most places in the world.
Overleaf is back so I should go. Thanks for listening @Ted
Happy typing. Chat soon.
@fin Back to the math. If you were going to pursue more mathematics, you would encounter invertibility more generally in groups and rings. This is a very natural algebraic notion, just like inverse functions. Singularity/non-singularity is just talking about rank of a square matrix.
fin
fin
gotcha
so invertible in this context happens to coincide with a matrix having rank r = n
18:12
Precisely.
@monoidal You're just starting on computing homology groups, I guess. But think about a torus and a torus with two holes. Those might be less confusing than the Klein bottle.
@fin So did you figure out a proof of that question with $AB$ and $B$? Can you write a formula for $A$ in terms of those two matrices $AB$ and $B$?
fin
fin
$(AB)B^{-1}$?
parentheses important
Excellent.
So you have $A$ written as the product of two nonsingular (invertible) matrices. Does that make it nonsingular (invertible)?
fin
fin
yes
fin
fin
lol now i feel dumb
18:17
The other proof is to consider $Ax=0$ for some $x$. Since $B$ is nonsingular, we can write $x=By$ for some $y$. Can you finish this proof?
So my understanding is this, $\Phi:H_1(A\cap B)\cong \mathbb{Z} \rightarrow H_1(A)\oplus H_1(B)\cong \mathbb{Z}^2$. hence $H_1(A\cap B)$ is free abelian of rank $1$ and $H_1(A)\oplus H_1(B)$ is free abelian of rank $2$. So as a map $\mathbb{Z}\rightarrow \mathbb{Z}^2$. $A\cap B$ is the boundary of the mobius band, the boundary circle is homologous to the integer linear combination $\sum_i\sigma_i$ of the generators. Since the boundary circle wraps itself twice around the core circle
$A\cap B$ is open, of course, but it deformation retracts onto the boundary ...
fin
fin
$Ax = 0$ has only the trivial solution iff $A$ is nonsingular/invertible right?
Right. So we're trying to show that $x=0$ is the only option.
so that means the boundary circle is just $2\sigma$ for some generator $\sigma$ of $H_1(A\cap B)$
18:20
No, it's $2\sigma$ for $\sigma$ a generator of $H_1(A)$ or $H_1(B)$.
fin
fin
also another thing is that $Ax = b$ has 1 and only 1 solution for any $b$ iff A is nonsingular/invertible?
That's true, too, but an unnecessary complication here, @fin.
fin
fin
nah just making sure i understood it righ
OK
I'm using that to say $x=By$ for some (unique) $y$, although I don't think we care about uniqueness. We'll see.
(You have to play alphabet soup and change letters, of course.)
Sorry, I meant to say the boundary circle is $2\sigma + B_1(A\cap B)$ where $\sigma$ is a 1 simplex
where $\sigma$ is contained in $A$ and $B$
$B_1(A\cap B)$ is just the image of $\partial_2$
fin
fin
18:24
" Since B is nonsingular, we can write x=By for some y" how do we get that
No, no, we're living inside $H_1(A)$ now, not $H_1(A\cap B)$.
fin
fin
without the thing i said above
@fin Yes, I'm agreeing.
fin
fin
oh ok
My previous sentence acknowledged that I was in error. :P
18:25
why is that @TedShifrin ?
Because we're looking at the image of the boundary circle in either/both of $H_1(A)$ and $H_1(B)$.
$\sigma$ doesn't actually live in $H_1(A\cap B)$ !!
You can see that with paper, too.
fin
fin
so $Ax = (AB)y$ then
@fin Great. Go on!
fin
fin
so the only solution for $Ax = 0$ is the same for $(AB)y = 0$
Well, that doesn't quite make sense. But we're trying to solve $Ax=0$. So we solve $(AB)y=0$ instead. What are those solutions?
fin
fin
18:30
y can only be 0
Perfect. From which we conclude ... ?
fin
fin
Ax = 0?
We started with that assumption.
fin
fin
oh right
Where did $y$ come from in the first place?
fin
fin
18:31
x = By
OK, so ... ?
fin
fin
oh
so x = 0
Bingo. End of proof. :)
fin
fin
since B0 = 0
great now i have two proofs
time to work on the other problems
Cool. :)
fin
fin
18:33
thank you
btw you can just call me Allie now
Sure, if I remember :)
fin
fin
ok so 7a asks to prove the following matrix is invertible for invertible A, B
[A | O
_____
O | B]
Nope, $B$ on the right.
fin
fin
oops
since A and B both have no nonzero rows (due to them being nonsingular) there will be no nonzero rows in that matrix
qed?
That's way too oversimplified. There are lots of matrices with no nonzero rows that fail to be nonsingular (invertible).
You're talking about echelon form, of course.
18:39
If $H_1(X)\cong \mathbb{Z}$ then any two paths in $X$ are homologous?
Nooooo.
First, you mean closed paths. Second, still nooooooo.
fin
fin
oops
sorry my compiuter crashed
well you can put the $A$ in the top left by using elementary matrices whos product is $E_A$ by just multiplying the big matrix by:
left multiplying*
[E_A | O
O | I_n]
OK, this will make a valid proof.
Do you also see how to do it with inverses instead?
fin
fin
and then put B in echelon form with the same kind of thing
hmm
im glad im doing these problems im starting to get the subtleties with this stuff
its not too easy lol
Hmm. So $\Phi:H_1(A\cap B)\mathbb{Z}\rightarrow H_1(A)\oplus H_1(B)\mathbb{Z}^2$. We need to calculate the matrix representation of it as a map $\mathbb{Z}\rightarrow \mathbb{Z}^2$. Let $[\sigma]\in H_1(A\cap B)$ be a generator of $H_1(A\cap B)$ then $\Phi([\sigma])=([\sigma]_{A},[\sigma]_{B})$ where $_$ denotes the target of the path being in $A$ or $B$
18:45
That's still misleading. I would let $\iota_A\colon A\cap B \to A$ be the inclusion map. Then you're looking at $\iota_A(\sigma)$, etc.
If you understand that when you write your notation, OK, but otherwise it's important to be clear.
fin
fin
ted do you ever still study math
Not in the usually meaning of "study." Occasionally answering a question on MSE is involved, but that hasn't happened in years.
fin
fin
ah
@TedShifrin yes. That's what I meant. Now I don't see how that relates to our discussion above
That is exactly what we were discussing with the $2$s.
fin
fin
18:48
also i dont exactly see how to do it with inverses
You should be able to guess a formula for the inverse and just check it.
fin
fin
oh
its probably just
[A^-1 O
O B^-1]
Probably :)
fin
fin
since the two "groups" of variables (the variables in A and B) are basically independent
no row or column overlap
Yup. Block multiplication was discussed in an exercise in chapter 1.
18:51
I'm probably very tired, But how do I relate $\sigma$ to the core circle and how do I use the fact that every closed loop is homologous to a $\mathbb{Z}-linear$ combinations?
@monoidal We've been all through this. I am going to tell you to sleep and then reread all our conversation on your own time.
What is the discussion about? Mayer-Vietoris?
Also, hi
Hi @Astyx. Yes, for Klein bottle.
I only recently gained understanding of what the Mayer-Vietoris connection is
fin
fin
klein bottlee
18:56
I only knew it as the thing you get when you chase the diagram
connection?
the boundary map
$H_n(A\cup B)\to H_{n-1}(A\cap B)$
oh, connecting homomorphism
definitely not connection, in English
Well, I always understood it by following the maps in the definition ... same thing with Cech cohomology, too.
Yeah probably not in french either
I'm just too lazy to use the correct terminology
I thought you were thinking of gluing connections on vector bundles or something
fin
fin
19:02
ok ted for the next problem it asks me about
[A | C
O | B]
where A, B are invertible
Oh, cool, you changed names :)
actually
Same thing, Allie. You can do it both ways.
ill just take a pic
Do you know about the Gauss-Manin connection?
19:04
Yes, I once did.
@Allie That looks right.
thank you
im gonna go attend my virtual class and have a cigarette
i need to quit im such an idiot for trying it out
i appreciate the help
talk to you later
Bubye.
@Allie same boat. I'm on my last 2-3 cigs
My mom hid them in the main house
The story of the moral is: Quit smoking.
Except you are way more advanced of a cohomologist than I. :)
19:17
Huh? Allie was just discussing linear algebra questions.
@Ted I know right!
@Ted oh I misread the conversation
I'm working on software today. It involves visualization of HA concepts
All 1000+ arrow styles are working now. Homological Algebra = HA
Oh, enjoy your formalism :P
I only coded about 10 independent parameters, but combinatorially there must be thousands of styles possible
It's very difficult. I think my least favorite, time-consuming code is geometric codes
19:20
Well, @leslie would applaud you for that. He hates all things geometric. Allegedly.
Um, yeah, you have to click that image and zoom in to see the detail
But that's an arrow exhibitting a combination of many style parameters as you can see in the menu
Seems way too involved for human consumption.
It's supposed to help humans (eventually, one day). Think of it as a virtual library of books, but theorems are encoded in a graphical language
It has a much easier user experience once all the core libraries are fleshed out
Just drawing arrows essentially. If you surmise, there are only 4 or so atomic operations in Category Theory diagramming world. The theorems combine these operations into diagram rules, but each edit to the diagram is just adding/deleting an arrow/object
Desktop software has to be complicated for the advanced users yet streamlined / simple enough for new users
So right now essentially all I have going is a fancy unicode-based mathematical diagram editor (sort of like Quiver, but without the LaTeX / TikzCD output for now). But eventually I'm going to becoding diagram look-up and rule application
*comprehensive not complicated
19:49
Hi.Can anyone help me with this problem?
0
Q: Prove that $(h_1 \times h_2)(f) $ = $h_1(f) \circ h_2(f)$ .

unit 1991We have linear map from $R[x]\to End(V)$ ($R[x]-polynomials$) For elements in $End(V)$ we have composition. I am reading notes and it says that we have $(h_1 \times h_2)(f) $ = $h_1(f) \circ h_2(f)$ and if you want to derive you can easily derive it from $f_1 \circ(f_2+f_3)=(f_1\circ f_2)+(f_1\ci...

This lacking details. What type of spaces are $R$ and $V$ and, most importantly, what's the linear map $R[x]\rightarrow\mathrm{End}(V)$ that you say you have? And in which space do $h_1,h_2$ and $f$ live? And what does the $\times$ denote?
What you mean by what type of spaces?$R[x]$ denotes polynomials over real numbers.We have $\beta_f$ linear map from polynomial of real numbers to $EndV$ but now I understand that I gave extra information.$h_1,h_2 \in R[x]$,$f_1,f_2,f_3 \in End(V)$
$\times$ denotes multiplication of polynomials.
20:13
@anakhro Thanks for the link! I'm going to cover the history and also the proof. I recently learned that it was independently discovered by two different mathematicians. So I'm going to look into if there are two different proofs and choose which to cover for the sake of time.
Convergent evolution of maths
20:28
@unit1991 whenever you introduce a new variable, ask yourself, "have I defined or specified it?"
for the real numbers, the LaTeX code is \mathbb{R} $\mathbb{R}$ or \Bbb{R} $\Bbb{R}$
and you should specify that $V$ is a vector space over $\Bbb R$ (I assume)
and also you should specify where the linear map comes from (is it constructed from something? or is it an assumption?)
In Conway's book on complex analysis, he identifies the extended complex plan $\Bbb{C}_\infty$ with the sphere $S = \{(x_1,x_2,x_3) \mid x_1^2 + x_2^2 + x_3^2 = 1\}$ and $\Bbb{C}$ with $\{(x_1,x_2,0) \mid x_1,x_2 \in \Bbb{R}\}$. However, he says something I don't quite understand. He says that for each point $z$ in $\Bbb{C}$, the straight line in $\Bbb{R}^3$ through $z$ and the northpole $N= (0,0,1)$ intersects the sphere at exactly one point $Z \neq N$.
He says that if $|z| > 1$, then $Z$ is in the northern hemisphere; if $|z| < 1$, then $Z$ is in the southern hemisphere. Doesn't $|z| < 1$ correspond to being inside the sphere? And if so, I don't see how the straight line from $z$ to $N$ intersects the sphere at any other point besides $N$.
Let alone intersecting some point on the southern hemisphere.
wow even the variable names match up
Oh...of course...I was thinking line segment between $N$ and $z$
Oh, yeah, very nice! Where did you find this?
I was googling "stereographical projection" in google images
it was the 9th result
@LeakyNun Thanks for response.Yes linear map is given by assumption.
20:35
@unit1991 I suspect that you are given a ring map instead of a linear map. Please provide a source otherwise.
@LeakyNun I have not learned ring map yet.Source is not in English, I am translating it.
@unit1991 what language is it in?
@LeakyNun Armenian.
I see. Unfortunately I cannot read Armenian.
I only read Artinian :)
20:41
5
Q: Can this function have a limit? $\lim_{n\to\infty}\sqrt[n]{1+\cos2n}$.

TK Lover $\lim_{n\to\infty}\sqrt[n]{1+\cos2n}$ It took me and my tutor 2 days to find this limit, we believe that this function has no limit or if it has, we are not intellectual enough to find it. Hope someone can help us.

Any views on this?
$n \mod \pi$ is dense in $[0,\pi]$.
cos $n$ is dense in [-1,1] and cos 2n is a subsequence of cos n
this will be tricky because from the graph it depends on how fast you can get away from 0 vs. how often the n mod pi gets close to 0
So if $n_k$ be indices such that $\cos n_k\to -1$ then $\cos 2n_k$ being a subsequence of $\cos n_k$ converges to $-1$ and now what can be said about $\lim_{k\to \infty} (1+\cos 2n_k)^{\frac 1{n_k}}$
i.e. it depends on the "degree of irrationality" of $\pi$
20:45
Plotting $f(x)=(1+\cos 2x)^\frac 1x$ on desmos hints that the above limit is $1$.
and the irrationality measure of $\pi$ is bounded above by 7.10320534 by Zeilberger and Zudilin (2020)
man what a recent result
that means $0 < |\pi - \frac{p}{q}| < |q|^{-8}$ has only at most finitely many solutions
maybe that will help as a starting point
I recall from Dirichlet's theorem that it was $q^2$ instead of $q^8$ on RHS.
@Allie don't smoke!
lol
@geocalc33 hey mon
you are spacecraft, right?
Yes, abstract spacecraft
That's the name of my app, I figured I would advertise sometimes with username
20:52
:)
@geocalc33 that arrow style code took forever to get right
I think abstract mathematicians will go nuts once they see all the arrow styles.
How do we post hyperlink in comment?
Just paste it in
like normal text
[text](url)
20:56
Thanks a lot.
:)
@geocalc33 how's your Python training going?
21:14
@LeakyNun my conclusion is that the limit does not exist.
And the reason is that if $\cos n_k\to 0$ then $(1+\cos 2n_k)^{\frac 1{n_k}}$ converges to $0$.
and how did you prove that?
That doesn't sound convincing at all.
Proof: $(1+\cos 2n_k)^{\frac 1{n_k}}=2^{\frac 1{n_k}} |\cos n_k| ^{\frac 2{n_k}}$. Now, $\frac{|\cos (n_k+1)|}{|\cos n_k|}=\frac {\cos n_k\cos 1 -\sin n_k\sin 1}{\cos n_k}$
This can be fixed, I think. I made a mistake here. I plan to use $\lim|x_n|^\frac 1n=\lim \frac{x_{n+1}}{x_n}$ if limit on RHS exists.
$\frac{|\cos^2 (n_k+1)|}{|\cos^2 n_k|}=2\frac {(\cos n_k\cos 1 -\sin n_k\sin 1)^2}{2\cos^2 n_k}=2\frac {(\cos n_k\cos 1 -\sin n_k\sin 1)^2}{1+\cos 2n_k}$ and $\cos 2n_k$ is a subsequence of $\cos n_k$ so $\lim \cos 2n_k=0$ hence the limit is $\sim 2(\cos n_k\cos 1 -\sin n_k\sin 1)^2\to 2\sin^2 1<1$ so by ratio test, the limit exists.
no that's wrong.
Or may be not completely. I think that we can conclude: $|\cos^2 n_k|^{\frac 1{n_k}}\to 2 \sin ^2 1$
So, $(1+\cos 2n_k)^{\frac 1{n_k}}=2^{\frac 1{n_k}} |\cos n_k|^{\frac 2{n_k}}\to 2 \sin ^2 1$
21:37
i am just getting slammed with email today. i can't bother people in here like i normally like to do.
Now, we are almost done. There exist a subsequence $\cos n_j$ such that $\cos n_j\to 1$, it follows that $(1+\cos 2n_j)^{\frac 1{n_j}}=e^{\frac 1n \log (1+\cos 2n_j)}\to 1$
@LeakyNun and professor Ted, is this okay?
Hi Leslie!
@Koro never mind, that's wrong. It is just not true that $2\sin^2 1<1$. I fed it into calculator which understood 1 as 1 degree hence the wrong conclusion.
21:55
An item in diablo 2 has usually a fingerprint which is 4 bytes big. So that would be 2^32 possibilities if I'm right. What is the formula to calculate the neccessary items to have a P% chance to have 2 or more items with the same fingerprint? This is just the birthday paradoxon with different numbers or?
I have enjoyed the peace and quiet, @leslie.
Except for having kitchen plumbing all messed up and we'll see if the maintenance guy can actually put it back together with no leaks.

« first day (4122 days earlier)      last day (1195 days later) »