G
Topic
First Poster
Last Poster
k a April Highlights and 2025 AoPS Online Class Information
jlacosta   0
Yesterday at 3:18 PM
Spring is in full swing and summer is right around the corner, what are your plans? At AoPS Online our schedule has new classes starting now through July, so be sure to keep your skills sharp and be prepared for the Fall school year! Check out the schedule of upcoming classes below.

WOOT early bird pricing is in effect, don’t miss out! If you took MathWOOT Level 2 last year, no worries, it is all new problems this year! Our Worldwide Online Olympiad Training program is for high school level competitors. AoPS designed these courses to help our top students get the deep focus they need to succeed in their specific competition goals. Check out the details at this link for all our WOOT programs in math, computer science, chemistry, and physics.

Looking for summer camps in math and language arts? Be sure to check out the video-based summer camps offered at the Virtual Campus that are 2- to 4-weeks in duration. There are middle and high school competition math camps as well as Math Beasts camps that review key topics coupled with fun explorations covering areas such as graph theory (Math Beasts Camp 6), cryptography (Math Beasts Camp 7-8), and topology (Math Beasts Camp 8-9)!

Be sure to mark your calendars for the following events:
[list][*]April 3rd (Webinar), 4pm PT/7:00pm ET, Learning with AoPS: Perspectives from a Parent, Math Camp Instructor, and University Professor
[*]April 8th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS State Discussion
April 9th (Webinar), 4:00pm PT/7:00pm ET, Learn about Video-based Summer Camps at the Virtual Campus
[*]April 10th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MathILy and MathILy-Er Math Jam: Multibackwards Numbers
[*]April 22nd (Webinar), 4:00pm PT/7:00pm ET, Competitive Programming at AoPS (USACO).[/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Sunday, Apr 13 - Aug 10
Tuesday, May 13 - Aug 26
Thursday, May 29 - Sep 11
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29

Prealgebra 2 Self-Paced

Prealgebra 2
Sunday, Apr 13 - Aug 10
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Monday, Apr 7 - Jul 28
Sunday, May 11 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, May 14 - Aug 27
Friday, May 30 - Sep 26
Monday, Jun 2 - Sep 22
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Wednesday, Apr 16 - Jul 2
Thursday, May 15 - Jul 31
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 9 - Sep 24
Sunday, Jul 27 - Oct 19

Introduction to Number Theory
Thursday, Apr 17 - Jul 3
Friday, May 9 - Aug 1
Wednesday, May 21 - Aug 6
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Wednesday, Apr 16 - Jul 30
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Wednesday, Apr 23 - Oct 1
Sunday, May 11 - Nov 9
Tuesday, May 20 - Oct 28
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19

Intermediate: Grades 8-12

Intermediate Algebra
Monday, Apr 21 - Oct 13
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22

Intermediate Counting & Probability
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Friday, Apr 11 - Jun 27
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Wednesday, Apr 9 - Sep 3
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Tuesday, May 27 - Nov 11
Wednesday, Jun 25 - Dec 17

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Wednesday, Apr 16 - Jul 2
Friday, May 23 - Aug 15
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

MATHCOUNTS/AMC 8 Advanced
Friday, Apr 11 - Jun 27
Sunday, May 11 - Aug 10
Tuesday, May 27 - Aug 12
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Problem Series
Friday, May 9 - Aug 1
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Final Fives
Sunday, May 11 - Jun 8
Tuesday, May 27 - Jun 17
Monday, Jun 30 - Jul 21

AMC 12 Problem Series
Tuesday, May 27 - Aug 12
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22

AMC 12 Final Fives
Sunday, May 18 - Jun 15

F=ma Problem Series
Wednesday, Jun 11 - Aug 27

WOOT Programs
Visit the pages linked for full schedule details for each of these programs!


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
Thursday, May 22 - Aug 7
Sunday, Jun 15 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Tuesday, Jun 17 - Sep 2
Monday, Jun 30 - Sep 22

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22

USACO Bronze Problem Series
Tuesday, May 13 - Jul 29
Sunday, Jun 22 - Sep 1

Physics

Introduction to Physics
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Sat & Sun, Apr 26 - Apr 27 (4:00 - 7:00 pm ET/1:00 - 4:00pm PT)
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
1 viewing
jlacosta
Yesterday at 3:18 PM
0 replies
Easy matrix equation involving invertibility
Ciobi_   2
N 18 minutes ago by Moubinool
Source: Romania NMO 2025 11.2
Let $n$ be a positive integer, and $a,b$ be two complex numbers such that $a \neq 1$ and $b^k \neq 1$, for any $k \in \{1,2,\dots ,n\}$. The matrices $A,B \in \mathcal{M}_n(\mathbb{C})$ satisfy the relation $BA=a I_n + bAB$. Prove that $A$ and $B$ are invertible.
2 replies
1 viewing
Ciobi_
Yesterday at 1:46 PM
Moubinool
18 minutes ago
determine F'(0)
EthanWYX2009   0
37 minutes ago
Source: 2024 Aug taca-13
Let
\[F(x)=\int\limits_0^{x}\left(\sin\frac 1t\right)^4\mathrm dt.\]Determine the value of $F'(0).$
0 replies
+1 w
EthanWYX2009
37 minutes ago
0 replies
Strange limit
Snoop76   6
N 41 minutes ago by Figaro
Find: $\lim_{n \to \infty} n\cdot\sum_{k=1}^n \frac 1 {k(n-k)!}$
6 replies
Snoop76
Mar 29, 2025
Figaro
41 minutes ago
Binomial inequality
Snoop76   10
N an hour ago by Snoop76
Is it true? $$\sum_{k=0}^n (2k-1)!!{n\choose k} >\left(\frac{2n}{e}\right)^n\sqrt{2e}$$
10 replies
Snoop76
Feb 2, 2025
Snoop76
an hour ago
No more topics!
Question about Riemann Hypothesis
hashtagmath   11
N May 28, 2021 by greenturtle3141
I am just learning about the Riemann Hypothesis and a question that has been nagging me is why can't we just find the zeroes of the functional equation and see if it holds against the hypothesis? It seems to me that finding the zeroes of that equations would easily prove/disprove the hypothesis. But obviously, it's more complex (no pun intended) than that. Can someone provide a glimpse into the difficulty of the problem?

Thanks again :D
11 replies
hashtagmath
May 26, 2021
greenturtle3141
May 28, 2021
Question about Riemann Hypothesis
G H J
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
hashtagmath
1600 posts
#1 • 2 Y
Y by centslordm, etvat
I am just learning about the Riemann Hypothesis and a question that has been nagging me is why can't we just find the zeroes of the functional equation and see if it holds against the hypothesis? It seems to me that finding the zeroes of that equations would easily prove/disprove the hypothesis. But obviously, it's more complex (no pun intended) than that. Can someone provide a glimpse into the difficulty of the problem?

Thanks again :D
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Tintarn
9029 posts
#2 • 5 Y
Y by MathNinja7, hashtagmath, centslordm, Mango247, Mango247
I suppose that by the functional equation you mean Riemann's Functional Equation for the Zeta Function:
\[\pi^{-s/2} \Gamma\left(\frac{s}{2}\right)\zeta(s)=\pi^{-(1-s)/2} \Gamma\left(\frac{1-s}{2}\right)\zeta(1-s).\]If so, I don't understand what you mean by "finding the zeroes of that equation".
If we ignore for the moment the powers of $\pi$ and the Gamma Function (which we can assume to be well-understood, in particular regardings its zeroes and poles), the functional equation relates the values of $\zeta(s)$ and $\zeta(1-s)$.
In particular, it tells us that a zero of $\zeta$ at $s$ gives us a zero at $1-s$ (unless we are at a pole of the Gamma Function which would cancel the zero, this happens exactly at the even negative integers, giving the so-called "trivial zeroes").
So we do know that the non-trivial zeroes of $\zeta$ possess some structure: For $s$ a zero, also $1-s$ is a zero.
We also know that since $\overline{\zeta(s)}=\zeta(\overline{s})$, for $s$ a zero, also $\overline{s}$ is a zero.
So the zeroes are symmetrical around $s=\frac{1}{2}$ in several ways.
This explains naturally why something interesting could happen at the line $\text{Re}(s)=\frac{1}{2}$ but of course it does not tell us at all whether the zeroes are on that line or not.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
hashtagmath
1600 posts
#3 • 1 Y
Y by centslordm
I see, thank you for your thorough explanation.

I was actually thinking about the equation $\zeta(s) = 2^s\pi^{s-1}\sin\left(\frac{\pi s}{2}\right)\Gamma(1-s)\zeta(1-s)$ (which I assume is a manipulation of the equation in your post). The trivial zeroes are completely obvious in the $\sin$ part of the equation. But I now I understand the difficult part about proving the zeroes lie on one line is the part such that $\zeta(s) = \zeta(1-s)?$.
This post has been edited 2 times. Last edited by hashtagmath, May 26, 2021, 4:18 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Tintarn
9029 posts
#4 • 2 Y
Y by hashtagmath, centslordm
Indeed your version is just a rearrangement of mine (the other one is more natural, for instance because it generalizes more nicely to Dirichlet L-functions). However I don't understand what you mean by "the part such that $\zeta(s)=\zeta(1-s)$".
Of course, when $\zeta(s)=0$, the equation $\zeta(s)=\zeta(1-s)$ is true, but I don't see why you would study exactly this equation.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
hashtagmath
1600 posts
#5 • 2 Y
Y by centslordm, Mango247
It may be a misunderstanding, but wouldn't finding the zeroes of this functional equation directly prove/disprove if the hypothesis is true?

Also, I meant to say, wouldn't studying the behavior of $\zeta(1-s)$ help in finding when the equation is equal to zero? Intuitively, I would expect that part is the most nontrivial as it's almost like a recursive function
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Tintarn
9029 posts
#6 • 2 Y
Y by hashtagmath, centslordm
Well, as you maybe can see better from my version of the functional equation, this is really not a recurrence, but a symmetry:
You can relate $\zeta(s)$ to $\zeta(1-s)$ and vice versa, but applying it twice really does not give you anything interesting, but a tautology!
It doesn't simplify anything to work with $1-s$ instead of $s$, this is just a change of variables.
Of course there are regions where $\zeta$ is well-understood. For instance, when $\text{Re}(s)>1$ we have the Euler product from which one can read off that there are no zeroes. One can then use the functional equation to "translate" this to the region $\text{Re}(s)<0$ where there will only be the trivial zeroes.
This leaves you with the so-called "critical strip" $0<\text{Re}(s)<1$. Again you could translate from $\frac{1}{2}<\text{Re}(s)<1$ to $0<\text{Re}(s)<\frac{1}{2}$ and vice versa. Indeed, if you can prove that one of them does not contain any zeroes, then the other won't as well. The point is that we understand neither of the two regions and neither of them is a priori simpler than the other!

Maybe I should also mention that it would already be a major advance (most likely winning you a Fields medal, unless you miss the age restriction) to prove that there are no zeroes with $0.999999<\text{Re}(s)<1$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
naenaendr
639 posts
#7 • 4 Y
Y by hashtagmath, Mango247, Mango247, Mango247
Not sure if I'm misunderstanding your notion, but just finding the zeros to $\zeta(s)$ is not sufficient. Computers have been able to detect over a quadrillion non-trivial zeros, all of which have a real component of $\frac{1}{2}$. Just one counterexample would disprove the hypothesis, but until we can mathematically prove that all of the non-trivial zeros have this property, the hypothesis will remain hypothetical.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
hashtagmath
1600 posts
#8 • 2 Y
Y by centslordm, Mango247
Tintarn wrote:
Well, as you maybe can see better from my version of the functional equation, this is really not a recurrence, but a symmetry:
You can relate $\zeta(s)$ to $\zeta(1-s)$ and vice versa, but applying it twice really does not give you anything interesting, but a tautology!
It doesn't simplify anything to work with $1-s$ instead of $s$, this is just a change of variables.
Of course there are regions where $\zeta$ is well-understood. For instance, when $\text{Re}(s)>1$ we have the Euler product from which one can read off that there are no zeroes. One can then use the functional equation to "translate" this to the region $\text{Re}(s)<0$ where there will only be the trivial zeroes.
This leaves you with the so-called "critical strip" $0<\text{Re}(s)<1$. Again you could translate from $\frac{1}{2}<\text{Re}(s)<1$ to $0<\text{Re}(s)<\frac{1}{2}$ and vice versa. Indeed, if you can prove that one of them does not contain any zeroes, then the other won't as well. The point is that we understand neither of the two regions and neither of them is a priori simpler than the other!

Maybe I should also mention that it would already be a major advance (most likely winning you a Fields medal, unless you miss the age restriction) to prove that there are no zeroes with $0.999999<\text{Re}(s)<1$.

Thanks for the explanation!
naenaendr wrote:
Not sure if I'm misunderstanding your notion, but just finding the zeros to $\zeta(s)$ is not sufficient. Computers have been able to detect over a quadrillion non-trivial zeros, all of which have a real component of $\frac{1}{2}$. Just one counterexample would disprove the hypothesis, but until we can mathematically prove that all of the non-trivial zeros have this property, the hypothesis will remain hypothetical.

I was originally thinking to find ALL zeroes to the Riemann zeta function, it may be sufficient to set each individual part of the function equation (i.e. $2^s$, $\pi^{s-1}$, etc.) equal to zero and find the values of $s$ such that it is true. But it seems like the $\zeta(1-s)$ creates a symmetry which makes it more difficult to solve. Is my understanding correct?

And yes, you are correct about the large amount of non-trivial zeroes; in fact, Hardy proved that there are infinitely many zeroes on the critical line.

A follow-up question that I may ask about this is, would all the zeroes of the Riemann zeta function arise from the functional equation? In other words, is every zero check/verified/found through finding when the functional equation equals zero?
This post has been edited 3 times. Last edited by hashtagmath, May 27, 2021, 4:41 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
naenaendr
639 posts
#9 • 2 Y
Y by centslordm, hashtagmath
That would be an extremely challenging way to calculate zeros. Instead, computers input complex numbers into the function and notice if they are trending closer towards $0$. It's just like how computers calculate limits. So they are fund randomly, not from actual calculation. The zeta function is much more irregular than a polynomial like $f(x)=x^3-2x^2+1$. We currently do not have a way of calculating zeros of zeta directly. They are just detected
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
hashtagmath
1600 posts
#10
Y by
Interesting, is there a known pattern for the distribution of zeroes on the critical line? Or are they irregularly distributed?

Also, separately, is the Riemann functional equation the only possible analytic continuation of the Riemann zeta function $\left(\zeta(s) = \sum_{n = 1}^{\infty}\frac{1}{n^s}\right)?$ In other words, does there exist a possibility for a different equation to extend the domain of the Riemann Zeta function?
This post has been edited 6 times. Last edited by hashtagmath, May 27, 2021, 6:31 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Tintarn
9029 posts
#11 • 1 Y
Y by hashtagmath
Yes, any meromorphic function defined on a non-empty open set has at most one analytic continuation (Proof: The difference of two such analytic continuations vanishes on a non-empty open set hence is identically zero.) Nothing special about $\zeta$ here.
Regarding the zeroes: I think there is some fundamental misunderstanding. We don't (and we cannot!) "find" the zeroes from the functional equation. Again, regarding the zeroes inside the critical strip, the functional equation tells us that if $\zeta(s)=0$ then $\zeta(1-s)=0$. No more, no less. The other factors (the power of $\pi$ and the sine) are completely irrelevant for that purpose.
Instead there are clever methods that actually allow you to check for any finite number of zeroes whether they are on the critical line or not. But as already mentioned several times in this thread now, there are infinitely many zeroes so we will never prove the Hypothesis in this way.
Regarding the distribution: There is no obvious pattern, but there is some regularity. One can estimate how many zeroes roughly are there up to a certain imaginary part. Also, there are very deep conjectures about the "fine-scale statistics" i.e. how the distances between successive zeroes should behave, but this is all very speculative and certainly at least as hard to prove as the Riemann Hypothesis. (At this point we cannot even decide whether there could be a double zero, or whether the imaginary part of some of the zeroes is rational etc... we certainly expect that all of this does not happen and that these are essentially "random" numbers on the critical line.)
This post has been edited 1 time. Last edited by Tintarn, May 27, 2021, 6:49 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
greenturtle3141
3541 posts
#12 • 5 Y
Y by hashtagmath, PhysKid11, centslordm, Mango247, Mango247
Just to elaborate on the above re analytic continuation, there is a theorem in complex analysis that I like to call "rigidity" this post became longer than i thought it would be, so treat this as an advertisement for learning complex analysis because it's SO cool:

Definition (Accumulation Point): Let $S$ be a set of complex numbers. Then $z_0 \in \mathbb{C}$ is an accumulation point of $S$ if for every $r > 0$, I can find $z \in S$ with $z \ne z_0$ such that $|z-z_0| < r$.

For example, the set $\{1,1/2,1/4,1/8,\cdots\}$ has an accumulation point, namely $0$. (The definition of accumulation point generalizes to arbitrary metric spaces, which you'll encounter very often in real analysis.)

Definition (Holomorphic): Let $\Omega \subseteq \mathbb{C}$ be an open region. Then $f:\Omega \to \mathbb{C}$ is holomorphic if it is "differentiable"; that is the limit $\lim_{z \to z_0} \frac{f(z)-f(z_0)}{z-z_0}$ exists for all $z_0 \in \Omega$.

This may sound boring for such a fancy word, but the fact that the limit holds over complex numbers actually spawns a crazy amount of properties that makes the word "holomorphic" a hundred time fancier than "differentiable". For example:
- If you're holomorphic, you're also analytic, i.e. have a power series representation. (Proof left as a very hard exercise, pirate a textbook for elaboration)
- If you're analytic, you're also holomorphic... (Left as an exercise)
- Shocking Conclusion: Any complex function that can be differentiated (i.e. is holomorphic) can be differentiated infinitely many times.

Note that the shocking conclusion above does not hold in real analysis, e.g. the function $f(x) = \begin{cases}x^2, & x \geq 0 \\ -x^2, x < 0\end{cases}$ can only be differentiated once. This shows that complex analysis is super lit.

These facts also show that being holomorphic and being analytic is the same thing in the complex world, so these words are used interchangeably when we're talking about complex analysis.

Theorem (Rigidity): Let $\Omega$ be an open region, $f:\Omega \to \mathbb{C}$ be holomorphic. Suppose the zeroes of $f$ (i.e. the set $\{z \in \Omega : f(z) = 0\}$) has an accumulation point. Then $f$ is the zero function.

Proof. Pirate a textbook. $\blacksquare$

For example, suppose $f:\mathbb{C} \to \mathbb{C}$ is holomorphic.
- If I know that $f$ is zero everywhere in the unit disk $\mathbb{D} := \{z \in \mathbb{C} : |z| < 1\}$, then $f$ has to be zero everywhere else because $\mathbb{D}$ has an accumulation point (in fact any point in the closure $\overline{\mathbb{D}} = \{z \in \mathbb{C} : |z| \leq 1\}$ is an accumulation point).
- If I know that $f(i/n) = 0$ for all $n \in \mathbb{N}$, then $f$ is zero everywhere else too.

But why do we care?

Corollary: Let $\Omega$ be an open region, $f,g:\Omega \to \mathbb{C}$ be holomorphic. Suppose the set for which $f = g$ has an accumulation point. Then $f \equiv g$ everywhere.

Proof. Apply the rigidity theorem on the holomorphic function $f-g$. $\blacksquare$

This lets us show that analytic continuations are unique.

Definition (Analytic Continuation): Let $\Omega_1,\Omega_2$ be open regions with $\Omega_1 \subset \Omega_2$. Let $f_1:\Omega_1 \to \mathbb{C}$ and $f_2,\Omega_2 \to \mathbb{C}$ be holomorphic. We say that $f_2$ is the analytic continuation of $f_1$ if $f_1$ and $f_2$ agree on $\Omega_1$, i.e. $f_1(z) = f_2(z) \quad \forall z \in \Omega_1$.

Theorem: Analytic continuations are unique.

Proof. Unless you're doing something incredibly dumb, $\Omega_1$ is non-empty, and by virtue of being open (look this up if you're unfamiliar) it definitely has an accumulation point. So if $f_2,f_3$ are both continuations of $f_1$ to $\Omega_2$, then surely $f_2,f_3$ must agree on $\Omega_1$. By the corollary it follows that $f_2$ and $f_3$ agree everywhere, i.e. they're the same analytic continuation. $\blacksquare$

With regards to the Riemann Zeta function, we have the "original" definition:
$$\zeta(s) := \sum_{n=1}^\infty \frac{1}{n^s}$$Where does this sum actually converge? Write $s = \sigma + it$. Then if $\sigma > 1$ then:
$$\left|\sum_{n=1}^N \frac{1}{n^s}\right| \leq \sum_{n=1}^N \frac{1}{|n^s|} = \sum_{n=1}^N \frac{1}{|e^{\log(n)\sigma + i\log(n)t}|} = \sum_{n=1}^N \frac{1}{e^{\log(n)\sigma}} = \sum_{n=1}^N \frac{1}{n^\sigma}$$Any I think by sending $N \to \infty$ the RHS converges via an integral test or something. Then absolute convergence implies convergence, so it follows that $\zeta(s)$ converges (and is thus well-defined) for all $s$ with real part greater than $1$.

But these silly mathematicians somehow defined $\zeta(-1)$ and stuff, how could they possibly do that? The short version is that using black magic, you can prove that
$$\zeta(s) = \frac{\pi^{s/2}\xi(s)}{\Gamma(s/2)} \qquad \forall \text{Re}(s) > 1$$and that using additional black magic you can show that $1/\Gamma$ extends everywhere (this proof is actually pretty cool) and $\xi$ extends everywhere except at $s=0,1$ or something, idk I don't remember the proof and this is above my paygrade of zero dollars an hour. Anyways what's important is that an analytic continuation of $\zeta(s)$ exists over $\mathbb{C} \setminus \{1\}$. And by the previous theorem, it's the only possible analytic continuation!

tl;dr pls study complex analysis its fun i promise might want to learn some real analysis first though
This post has been edited 1 time. Last edited by greenturtle3141, May 28, 2021, 4:45 AM
Z K Y
N Quick Reply
G
H
=
a