Algebraic and Transcendental irrational numbers

KevB
Messages
11
Reaction score
0
It's my understanding that algebraic numbers are the roots of polynomials with rational (or equivalently integer) coefficients. I know all surds have a simple repeating continued fraction representation

Is it also the case that all simple repeating continued fractions are algebraic numbers?

e.g. \sqrt{}2= [ 1; 2, 2, 2, 2, ...] = [1,2],[0]

\sqrt{}3 = [ 1; 1, 2, 1, 2,...] = [1, 1, 2],[0,0]

\ \ \varphi = [1; 1, 1, 1, 1, ... ] = [1],[0] = golden \ ratio<br />

While many transcendental numbers, like e, have interesting continued fractions, but the pattern isn't a simple repeat.

e.g.
e \ \ = [2; 1, 2, 1, 1, 4, 1, 1, 6, 1, ...] = [2; 1, 2, 1],[0, 2, 0] = [ 1, 0, 1],[0, 2, 0]
e^{(1/n)}_{}= [1, n-1, 1, 1, 3n-1, 1, 1, 5n-1, ...] = [1, (n-1), 1],[0, 2n, 0]
 
Physics news on Phys.org
Hi KevB! :smile:

Check out wikipedia: http://en.wikipedia.org/wiki/Continued_fraction

The numbers with periodic continued fraction expansion are precisely the irrational solutions of quadratic equations with rational coefficients (rational solutions have finite continued fraction expansions as previously stated). The simplest examples are the golden ratio φ = [1; 1, 1, 1, 1, 1, ...] and √ 2 = [1; 2, 2, 2, 2, ...]; while √14 = [3;1,2,1,6,1,2,1,6...] and √42 = [6;2,12,2,12,2,12...]. All irrational square roots of integers have a special form for the period; a symmetrical string, like the empty string (for √ 2) or 1,2,1 (for √14), followed by the double of the leading integer.

So the simple repeating continued fractions that you're talking about are exactly the irrational solutions to quadratic equations. So they are indeed all algebraic. Euler was the first one to prove this.

Also, this would imply that the continued fraction of \sqrt[3]{2} is not a nice repeating continued fraction...
 
micromass said:
Also, this would imply that the continued fraction of \sqrt[3]{2} is not a nice repeating continued fraction...

Nonetheless, it does have a rapidly converging http://en.wikipedia.org/wiki/Generalized_continued_fraction" , namely

\frac{5}{4} + \frac{2.5}{252 - \frac{8}{759 - \frac{35}{\ldots}}}

Also you might be interested in http://en.wikipedia.org/wiki/Gauss%27s_continued_fraction" , which is a very wide class.
 
Last edited by a moderator:
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top