1.08k likes | 1.49k Views
Algebraic and Transcendental Numbers. Dr. Dan Biebighauser. Outline. Countable and Uncountable Sets. Outline. Countable and Uncountable Sets Algebraic Numbers. Outline. Countable and Uncountable Sets Algebraic Numbers Existence of Transcendental Numbers. Outline.
E N D
Algebraic and Transcendental Numbers Dr. Dan Biebighauser
Outline • Countable and Uncountable Sets
Outline • Countable and Uncountable Sets • Algebraic Numbers
Outline • Countable and Uncountable Sets • Algebraic Numbers • Existence of Transcendental Numbers
Outline • Countable and Uncountable Sets • Algebraic Numbers • Existence of Transcendental Numbers • Examples of Transcendental Numbers
Outline • Countable and Uncountable Sets • Algebraic Numbers • Existence of Transcendental Numbers • Examples of Transcendental Numbers • Constructible Numbers
Number Systems • N = natural numbers = {1, 2, 3, …}
Number Systems • N = natural numbers = {1, 2, 3, …} • Z = integers = {…, -2, -1, 0, 1, 2, …}
Number Systems • N = natural numbers = {1, 2, 3, …} • Z = integers = {…, -2, -1, 0, 1, 2, …} • Q = rational numbers
Number Systems • N = natural numbers = {1, 2, 3, …} • Z = integers = {…, -2, -1, 0, 1, 2, …} • Q = rational numbers • R = real numbers
Number Systems • N = natural numbers = {1, 2, 3, …} • Z = integers = {…, -2, -1, 0, 1, 2, …} • Q = rational numbers • R = real numbers • C = complex numbers
Countable Sets • A set is countable if there is a one-to-one correspondence between the set and N, the natural numbers
Countable Sets • A set is countable if there is a one-to-one correspondence between the set and N, the natural numbers
Countable Sets • N, Z, and Q are all countable
Countable Sets • N, Z, and Q are all countable
Uncountable Sets • R is uncountable
Uncountable Sets • R is uncountable • Therefore C is also uncountable
Uncountable Sets • R is uncountable • Therefore C is also uncountable • Uncountable sets are “bigger”
Algebraic Numbers • A complex number is algebraic if it is the solution to a polynomial equation where the ai’s are integers.
Algebraic Number Examples • 51 is algebraic: x – 51 = 0
Algebraic Number Examples • 51 is algebraic: x – 51 = 0 • 3/5 is algebraic: 5x – 3 = 0
Algebraic Number Examples • 51 is algebraic: x – 51 = 0 • 3/5 is algebraic: 5x – 3 = 0 • Every rational number is algebraic: Let a/b be any element of Q. Then a/b is a solution to bx – a = 0.
Algebraic Number Examples • is algebraic: x2 – 2 = 0
Algebraic Number Examples • is algebraic: x2 – 2 = 0 • is algebraic: x3 – 5 = 0
Algebraic Number Examples • is algebraic: x2 – 2 = 0 • is algebraic: x3 – 5 = 0 • is algebraic: x2 – x – 1 = 0
Algebraic Number Examples • is algebraic: x2 + 1 = 0
Algebraic Numbers • Any number built up from the integers with a finite number of additions, subtractions, multiplications, divisions, and nth roots is an algebraic number
Algebraic Numbers • Any number built up from the integers with a finite number of additions, subtractions, multiplications, divisions, and nth roots is an algebraic number • But not all algebraic numbers can be built this way, because not every polynomial equation is solvable by radicals
Solvability by Radicals • A polynomial equation is solvable by radicals if its roots can be obtained by applying a finite number of additions, subtractions, multiplications, divisions, and nth roots to the integers
Solvability by Radicals • Every Degree 1 polynomial is solvable:
Solvability by Radicals • Every Degree 1 polynomial is solvable:
Solvability by Radicals • Every Degree 2 polynomial is solvable:
Solvability by Radicals • Every Degree 2 polynomial is solvable:
Solvability by Radicals • Every Degree 2 polynomial is solvable: (Known by ancient Egyptians/Babylonians)
Solvability by Radicals • Every Degree 3 and Degree 4 polynomial is solvable
Solvability by Radicals • Every Degree 3 and Degree 4 polynomial is solvable del Ferro Tartaglia Cardano Ferrari (Italy, 1500’s)
Solvability by Radicals • Every Degree 3 and Degree 4 polynomial is solvable Cubic Formula Quartic Formula
Solvability by Radicals • For every Degree 5 or higher, there are polynomials that are not solvable
Solvability by Radicals • For every Degree 5 or higher, there are polynomials that are not solvable Ruffini (Italian) Abel (Norwegian) (1800’s)
Solvability by Radicals • For every Degree 5 or higher, there are polynomials that are not solvable is not solvable by radicals
Solvability by Radicals • For every Degree 5 or higher, there are polynomials that are not solvable is not solvable by radicals The roots of this equation are algebraic
Solvability by Radicals • For every Degree 5 or higher, there are polynomials that are not solvable is solvable by radicals
Algebraic Numbers • The algebraic numbers form a field, denoted by A
Algebraic Numbers • The algebraic numbers form a field, denoted by A • In fact, A is the algebraic closure of Q
Question • Are there any complex numbers that are not algebraic?
Question • Are there any complex numbers that are not algebraic? • A complex number is transcendental if it is not algebraic
Question • Are there any complex numbers that are not algebraic? • A complex number is transcendental if it is not algebraic • Terminology from Leibniz
Question • Are there any complex numbers that are not algebraic? • A complex number is transcendental if it is not algebraic • Terminology from Leibniz • Euler was one of the first to conjecture the existence of transcendental numbers
Existence of Transcendental Numbers • In 1844, the French mathematician Liouville proved that some complex numbers are transcendental
Existence of Transcendental Numbers • In 1844, the French mathematician Liouville proved that some complex numbers are transcendental