I am watching Complex analysis lectures by Prof Bernd Schroder, and I have doubt regarding this theorem:
But, this proof suggests that if power series converges at ANY point on the circle of convergence, then it is uniformly convergent on entire open disk of convergence! i.e., if power series not uniformly convergent in entire disk, then it does not converge on any point on the circle of convergence!
That doesn't sound unreasonable to me. It doesn't (and shouldn't!) guarantee convergence on the boundary of said open disk, but the interior seems fine
i don't see it dealing with the circle of convergence. the condition is an open condition, |z - z_0| < R, where R is some distance from z_0 at which the series is known to converge. but it's < and not $\leq$.
@leslietownes Ted answered something for me a day or so ago and at the time I thought Oh yes, but now Thomas has returned with his doubts.
It was a questions about some $z^n$ being real only for $n=0$. And Ted's response was z is a root of an irreducible quartic. So could it be a root of unity?
@Semiclassical So, is it uniformly convergent in |x|<1, where x is any complex number? (as is suggested by this theore, since it is convergent on one point on circle of convergence)
@Semiclassical yes, but we can infer from the proof uniform convergence as well, as is done later in other context by prof himself. (I am posting link to entire pdf)
the circle of convergence can be a very messed up set. note that the theorem does not exclude convergence outside of the stated region, or try to identify the full set of z for which the series converges. maybe that is helpful.
@leslietownes yes yes! But if $z_1$ is considered to be sitting on circle of convergence =, which is indeed a possibility, then maybe we can infer something strong, I think. Hence my original doubt
it's possible for the series to converge at one or more complex numbers exactly R away from z_0. it's just not generally guaranteed. and should the series diverge somewhere on that circle the behavior at the boundary will be potentially annoying to analyze.
@leslietownes I know that part!! My question is not regarding convergence of power series on circle of convergence! nor regarding absolute convergence inside circle! Its regrading uniform convergence on disk.
david letterman did a variant about that bit. he was out somewhere dealing with shady characters in queens. buying things. "paul, does rollex have two l's?"
@Semiclassical the original question was math.stackexchange.com/questions/4090491/show-that-for-any-n%e2%88%88-bbb-n-numbers-x-n-and-y-n-are-nonzero/4093455#4093455
one time i had a friend visit from sweden and the only thing he wanted was a fake rolex. we went to chinatown in SF and could not find the right stuff. he was so disappointed.
we found a multitude of cheap watches but not ones that purported to be what they were not.
another guy i knew is of chinese ancestry and worked for the office of the US trade representative. they were in beijing for some kind of meeting, and he was shopping, and he said "where can i get some dvds? i want iron man 2 [or whatever]" and the owner said "those are gone because the americans are in town this week for some kind of trade conference."
one time i got a phone call from someone who somehow knew that i had a bunch of CAD files on my computer for a diagnostic device and insisted that i email them over. i was like, "who are you, again?" about ten times, and he never said anything that made sense so i hung up. i don't know how he suspected i had those files. that keeps me up at night.
:57581759 From this proof, can't we infer that? Since $M\sum_{n=N+1}^{\infty}q_n\to0$, as $n\to\infty$, we see that for any $\epsilon>0$, there is $N_0$ such that for any $n>N_0$ we have $\sum_{n=N+1}^{\infty}|a_n(z-z_0)^n|\le|M\sum_{n=N+1}^{\infty}q_n|<\epsilon$ for any $|z-z_0|<R$, implying uniform convergence.
something can converge uniformly for all |z| <= r < R for all r < R without converging uniformly on the open disc |z| < R. i think. unless part of my brain fell out.
my real analysis class was a clueless postdoc who had never thought about analysis and turned it into a point set topology course, which i enjoyed somewhat but wasn't analysis.
there were two kinds of undergrads at berkeley when i went there, people who tried to enroll in classes taught by postdocs for everything, because they were perceived to be easier, and people who tried to avoid them and get classes from real professors. i fell into the latter group.
he had a lot of heart trouble while i was learning from him. one time i was in the campus health center for an eye exam and he'd had a heart attack, or something, i saw him on a stretcher. i forgave him for a lot of his angry moments after that.
he seemed to be a very lonely person. he lashed out at me once or twice. he also presented a homework exercise i had done to the entire class as an example of how to do homework.
i regret not being able to go to a number of funerals or memorial services. i got the emails for all of them, i just didn't have the money or the time.
there's way, way, way too much of that in graduate school. this touches a nerve, my step brother attempted suicide this week by stepping in front of a train.
there's something about the culture of graduate school about not asking for help. it's horrific. i hope my daughter doesn't go. or she goes to a good school and not some kind of pissing contest school.
my wife's second shot was non consequential but my father, mother, and step mother all were completely out of commission after the second shot, for about 48 hours.
i'd love to see those notes. i'm very tempted to scan or somehow reproduce my notes of chernoff's unbounded operators. he'd say the textbook had a proof of x, and then do it in a paragraph, where the textbook took something like three pages.
Shy but super friendly. I loved his wife Grace. Super spunky. She and Mrs Chern pretended to fight over who could see more bridges from their respective living rooms.
it was socially isolating to be older than everyone in my class by several years, although i sometimes got outdated jokes that the instructors made. i don't actually recommend it.
there's a lot of cool stuff happening in microfluidics right now.
trying to figure out what sort of math to bracket this under. one example i have from my very old experimental physics book is to start with the equation $\omega^2 =\frac{gh}{h^2+k^2}$
in the old days you'd need a couple of lenses and a very expensive camera to detect what a biochemical reaction was doing. now you just put it on something resembling a digital camera chip of pixels, and you throw it away after the picture is taken, because that's cheap now.
suppose I have some polynomial condition $H(x,y)=0$. Is there a name for the scenario: there exist rational functions $f(x,y)$ and $g(x,y)$ such that $H(x,y)=0$ is equivalent to a linear relationship between $f(x,y)$ and $g(x,y)$
basically, is there a name for this kind of construction?
pick a line in the plane. pick two distinct points not on the line. find a point on the line such that the sum of the distances from the distinct point on the line is minimised.
problem is straightforward.
but the first order conditions are a mess, yet there is a simple ('reflection') solution.
just curious if there is some detangling of the first order conditions that can give an explicit solution.
@copper.hat If the points are on the opposite side of the given line, the minimizing point is the intersection of the given line and the line between the points. If they are on the same side of the given line, move one of the points orthogonally to the opposite side, solve and move back.
what area of maths deals with operators on functions?
From the footnote in the book I am reading: > An “operator” is an instruction to do something to the function that follows; it takes in one function, and spits out some other function.
Let $X$ be random variable supported in $[1,2]$. And Let $\varepsilon$ be the standard Gaussian distribution. Is the product $X\varepsilon$ a positive random variable (like $X$), or is it an unbounded random variable like $\varepsilon$?
In algebra, polynomial long division is an algorithm for dividing a polynomial by another polynomial of the same or lower degree, a generalized version of the familiar arithmetic technique called long division. It can be done easily by hand, because it separates an otherwise complex division problem into smaller ones. Sometimes using a shorthand version called synthetic division is faster, with less writing and fewer calculations. Another abbreviated method is polynomial short division (Blomqvist's method).
Polynomial long division is an algorithm that implements the Euclidean division of polynomials...