M A T H E M A T I K O N

Similar documents
Constructions with ruler and compass

CONSTRUCTIBLE NUMBERS AND GALOIS THEORY

GALOIS THEORY : LECTURE 12

UNDERSTANDING RULER AND COMPASS CONSTRUCTIONS WITH FIELD THEORY

Constructions with ruler and compass

3.2 Constructible Numbers

Chapter 12: Ruler and compass constructions

Geometry beyond Euclid

The first-order theory of finitely generated fields

Section 6: Field and Galois theory

GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS

NOTES FOR DRAGOS: MATH 210 CLASS 12, THURS. FEB. 22

Galois Theory, summary

The pro-p Hom-form of the birational anabelian conjecture

GALOIS THEORY : LECTURE 11

The Three Ancient Problems 1

A sequence of thoughts on constructible angles.

Symmetries and Polynomials

The Three Ancient Geometric Problems

What do you think are the qualities of a good theorem? it solves an open problem (Name one..? )

Constructions with ruler and compass.

Notes on Quadratic Extension Fields

17 Geometric Constructions and Field Extensions

Section X.55. Cyclotomic Extensions

MEI Conference Squaring the Circle and Other Shapes

Rings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.

Galois Theory and Some Applications

CHMC: Finite Fields 9/23/17

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Extension theorems for homomorphisms

How to (Almost) Square a Circle

1 Finite abelian groups

Course 311: Abstract Algebra Academic year

The Complex Numbers c ). (1.1)

(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d

The four exponentials conjecture, the six exponentials theorem and related statements.

Individual Round CHMMC November 20, 2016

1 The Galois Group of a Quadratic

Galois theory and the Abel-Ruffini theorem

Number Theory and Algebraic Equations. Odile Marie-Thérèse Pons

Course 311: Hilary Term 2006 Part IV: Introduction to Galois Theory

AN INTRODUCTION TO GALOIS THEORY

Solutions to Practice Final

2. Two binary operations (addition, denoted + and multiplication, denoted

Outline. We will now investigate the structure of this important set.

3 COMPLEX NUMBERS. 3.0 Introduction. Objectives

Lecture 6. Three Famous Geometric Construction Problems

Page Points Possible Points. Total 200

Chapter 4. Fields and Galois Theory

Extending Euclidean constructions with dynamic geometry software

Rings and groups. Ya. Sysak

SF2729 GROUPS AND RINGS LECTURE NOTES

University of Toronto Faculty of Arts and Science Solutions to Final Examination, April 2017 MAT246H1S - Concepts in Abstract Mathematics

Anabelian Phenomena in Geometry and Arithmetic

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

Chapter 10: Rational Functions and the Riemann Sphere. By a rational function we mean a function f which can be expressed in the form

LECTURE 1: DIVISIBILITY. 1. Introduction Number theory concerns itself with studying the multiplicative and additive structure of the natural numbers

0. Introduction. Math 407: Modern Algebra I. Robert Campbell. January 29, 2008 UMBC. Robert Campbell (UMBC) 0. Introduction January 29, / 22

Solutions to November 2006 Problems

Transcendence in Positive Characteristic

HAMPSHIRE COLLEGE: YOU CAN T GET THERE FROM HERE : WHY YOU CAN T TRISECT AN ANGLE, DOUBLE THE CUBE, OR SQUARE THE CIRCLE. Contents. 1.

Math 1230, Notes 2. Aug. 28, Math 1230, Notes 2 Aug. 28, / 17

Section V.8. Cyclotomic Extensions

1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism

arxiv: v1 [math.gr] 3 Feb 2019

Definable henselian valuation rings

In Z: x + 3 = 2 3x = 2 x = 1 No solution In Q: 3x = 2 x 2 = 2. x = 2 No solution. In R: x 2 = 2 x = 0 x = ± 2 No solution Z Q.

Solutions to Practice Final 3

9.4. Mathematical Induction. Introduction. What you should learn. Why you should learn it

Groups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

1.1 The program of Lie

Gordon solutions. n=1 1. p n

Section VI.33. Finite Fields

12.2 Existence proofs: examples

Section V.3. Splitting Fields, Algebraic Closure, and Normality (Supplement)

Introduction to Number Theory

PRO-l ABELIAN-BY-CENTRAL GALOIS THEORY OF PRIME DIVISORS

Math 603, Spring 2003, HW 6, due 4/21/2003

Galois Theory and the Insolvability of the Quintic Equation

Fields and Galois Theory

NOTES ON GALOIS THEORY Alfonso Gracia-Saz, MAT 347

Ultraproducts of Finite Groups

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

Part IA Numbers and Sets

Euclid s Elements Part II

ECEN 5022 Cryptography

Pro-l birational anabelian geometry over algebraically closed fields I

An Additive Characterization of Fibers of Characters on F p

ECEN 5682 Theory and Practice of Error Control Codes

Lecture 6: Finite Fields

Introduction: Pythagorean Triplets

Galois Theory TCU Graduate Student Seminar George Gilbert October 2015

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

Definability in fields Lecture 2: Defining valuations

A Version of the Grothendieck Conjecture for p-adic Local Fields

Notes on Galois Theory

arxiv: v1 [math.ho] 5 Feb 2019

Introduction to Quadratic Forms over Fields

The following results are from the review sheet for the midterm.

Transcription:

M A T H E M A T I K O N Florian Pop UPenn Open House Feb 2017

FROM MYTHOS TO LOGOS: Construction Problems of the Ancient Greeks: The Questions a) Squaring the circle: = b) Trisecting the angle c) Doubling the cube Delian Problem ( 420 BC?) d) Constructing regular n- gones Triangle, Square, Pentagon, Hexagon, Octogon...... even the Heptagon(!)...

Construction Problems of the Ancient Greeks: Axiomatic One allows exclusively Compass & Straightedge! Given: P 0, P 1 fixed points in the plane, P 0 P 1 = 1. For finite sets M = {P 0, P 1,..., P n } of points in the plane, do: Step 1: Draw all the lines P i P j, and the circles C(P k, P i P j ), where P i, P j, P k M. - Let P M,1 be the set of intersection points from Step 1. N.B., M P M,1. - Let Z M,1 be the set of lengths P i P j with P j, P i P 1, e.g., 1 Z M,1. [Exercise : Estimate the cardinality of P M,1... ] Step 2: Proceed inductively/recursively to construct P M,2, Z M,2 ; P M,3, Z M,3 ; etc.... Define: - P M := n P M,n the set of M-constructible points. - Z M := n Z M,n the set of M-constructible numbers. - P := M P M the set of (absolutely) constructible points. - Z := M Z M the set of (absolutely) constructible numbers. [Comment: The points P M, P = P 0, P 1 are called auxiliary, etc.... ] THM. The domains of numbers Z, Z M are closed w.r.t addition, multiplication, und taking square roots.

Construction Problems of Ancient Greeks: Reformulation /K K M Reformulation of the Construction Problems: a) Is π a constructible number? b) Is 3 2 a constructible number? c) Is cos(α/3) M-constructible, if cos(α) is so (in general)? d) Is cos(2π/n) constructible for all n? The ancient Greeks could only do d), for n = 3, 4, 5, 6, 8, 12, 15,....

Construction Problems of Ancient Greeks: Reformulation /K K M Reformulation of the Construction Problems: a) Is π a constructible number? b) Is 3 2 a constructible number? c) Is cos(α/3) M-constructible, if cos(α) is so (in general)? d) Is cos(2π/n) constructible for all n? The ancient Greeks could only do d), for n = 3, 4, 5, 6, 8, 12, 15,.... Nowadays we know all the Answers: NO, NO, NO, NO (!)

Construction Problems of Ancient Greeks: Reformulation /K K M Reformulation of the Construction Problems: a) Is π a constructible number? b) Is 3 2 a constructible number? c) Is cos(α/3) M-constructible, if cos(α) is so (in general)? d) Is cos(2π/n) constructible for all n? The ancient Greeks could only do d), for n = 3, 4, 5, 6, 8, 12, 15,.... Nowadays we know all the Answers: NO, NO, NO, NO (!) Q : What is that we know, and the ancient Greeks did not?

Construction Problems of Ancient Greeks: Reformulation /K K M Reformulation of the Construction Problems: a) Is π a constructible number? b) Is 3 2 a constructible number? c) Is cos(α/3) M-constructible, if cos(α) is so (in general)? d) Is cos(2π/n) constructible for all n? The ancient Greeks could only do d), for n = 3, 4, 5, 6, 8, 12, 15,.... Nowadays we know all the Answers: NO, NO, NO, NO (!) Q : What is that we know, and the ancient Greeks did not? Answer: Notation & algebraic /analytic Structure!

Construction Problems of Ancient Greeks: Reformulation /K K M Reformulation of the Construction Problems: a) Is π a constructible number? b) Is 3 2 a constructible number? c) Is cos(α/3) M-constructible, if cos(α) is so (in general)? d) Is cos(2π/n) constructible for all n? The ancient Greeks could only do d), for n = 3, 4, 5, 6, 8, 12, 15,.... Nowadays we know all the Answers: NO, NO, NO, NO (!) Q : What is that we know, and the ancient Greeks did not? Answer: Notation & algebraic /analytic Structure! Coordinates (Descartes) & Complex plain (Gauß): - C = {z = a + bi a, b R}, z P(a, b) - P 0 := P(0, 0) z = 0 und P 1 := P(1, 0) z = 1. - Intersection points P P become complex numbers z = a + bi C... THM. The following hold: 1) K K M := {z C z P P} are subfields of C. 2) K is the closure of Q under taking square roots.

Construction Problems of the Ancient Greeks: The Answers a) Lindemann (1882): π is transcendental, hence π K b) Field theory + Galois theory: 3 2 K c) In general: cos(α) K cos(α/3) K. d) Gauß (1796, 1801): cos(2π/n) K iff n = 2 k p 1... p l with p i Fermat Fermat prime numbers are of the Form F n := 2 2n + 1, n 0. Example: F 0 := 2 20 + 1 = 3, F 1 := 2 22 + 1 = 5, F 2 := 2 22 + 1 = 17, F 3 := 2 23 + 1 = 257, F 4 := 2 24 + 1 = 65537,... Conjecture (?): All the numbers F n are prime numbers. Euler: Unfortunately, F 5 := 2 25 + 1 = 4294967297 = 641 6700417,...

Construction Problems of the Ancient Greeks: The Answers a) Lindemann (1882): π is transcendental, hence π K b) Field theory + Galois theory: 3 2 K c) In general: cos(α) K cos(α/3) K. d) Gauß (1796, 1801): cos(2π/n) K iff n = 2 k p 1... p l with p i Fermat Fermat prime numbers are of the Form F n := 2 2n + 1, n 0. Example: F 0 := 2 20 + 1 = 3, F 1 := 2 22 + 1 = 5, F 2 := 2 22 + 1 = 17, F 3 := 2 23 + 1 = 257, F 4 := 2 24 + 1 = 65537,... Conjecture (?): All the numbers F n are prime numbers. Euler: Unfortunately, F 5 := 2 25 + 1 = 4294967297 = 641 6700417,... Proofs: Fact. u K Mipo u has degree a power of 2. To b): Mipo 3 2 = t3 2 over Q [WHY], hence 3 2 K. To c): u := 2 cos( α 3 ) u3 6u 2 cos(α) = 0, etc. [Exercise: For which values of u := cos(α) does it hold: cos(α/3) K {u}?] To d): By Gauß, ζ := cos(2π/n) + i sin(2π/n) has Mipo ζ = Φ n (t) [WHY]. n = 2 k p e 1+1 1... p e r+1 r deg(φ n ) = 2 k 1 p e 1 1... pe r(p 1 1)... (p r 1). Hence ζ K iff e 1 = = e r = 0, & p i 1 = 2 m i for some m i, etc.

MODERN POINT OF VIEW: Arithmetic in finitely generated fields Recall: M = {P 0, P 1,..., P n } = { 0, 1,..., z n } C finite subset - P M, Z M constructed inductively from M = {P 0, P 1,... }. - K M = Q(z 1,..., z n ) C is a finitely generated subfield - K M C is the closure of K M under square roots. - Z = { z, z K M } = K M are the M-constructible numbers A map T : P M P M is called algebraic symmetry, if the map T : K M K M is compatible with +, [Comment: One can characterize the algebraic symmetries in purely geometric way... ] The symmetry group Π M of K M is the set of all algebraic symmetries T : K M K M, which fix all points of M. Fact. K M K M is a Galois extension with Gal(K M K M ) = Π M. Examples. 1) The conjugation z := a + bi a bi =: σ(z) is an algebraic symmetry, which fixes R point wise. Further, one has: σ Π M M R. 2) Let M = { 0, 1}, hence K M = K. Then (i, 2) (±i, ± 2) can be prolonged to algebraic symmetries of K.

Quadratic / Pfister forms & Transcendence degree Pfister Forms are higher dimensional variants of q(x) = x 2... - n = 1: q a (x 1, x 2 ) := x 2 1 + ax2 2 - n = 2: q a,b (x 1, x 2, x 3, x 4 ) := x 2 1 + ax2 2 + bx2 3 + abx2 4 - n > 2: q a1,...,a n (x 1,..., x 2 n ) has 2 n Variables x 1,..., x 2 n. Fact. The images of q a, q a,b, q a,b,c,... are subgroups of K M. Quadratic forms q = i,j a ijx i X j generalize the above... Example: q = n i=1 X 2 i is a Pfister form iff n = 2 m [WHY]. THM A. Let i M. Then the transcendence degree d = td(k M ) is the smallest d such that n = d + 2 satisfies: q a1,...,a n (K 2n M ) = K M, for all a 1,..., a n K M. Hence the transcendence degree d = td(k M ) is in the arithmetic of K M uniformly encoded. (Big) Open Questions: - What is the Pythagoras number of K M? - What is the u-invariant of K M? - Do the quadratic/pfister forms distinguish K M from K M?

Symmetries and Isomorphism Type: Decoding K M from Π M Question: 1) To what extent are the properties of M reflected in the group Π M, and how does that take place? 2) Which properties of the field K M are encoded in the group Π M, and how does that take place? THM B. There exists a concrete group theoretical recipe which recovers the field K M functorially from the group Π M. In particular, the arithmetic of K M, e.g., tr.deg(k M ), can be recovered from the group Π M. (Big) Open Question: How does encode Π M the arithmetic of K M? Proofs: To THM A... Milnor Conjecture: proven (Vojevodsky, Rost,... ) To THM B... Pro-2 Anabelian Geometry... [Comment: These new insights would have been impossible without Ideas and Work of... ]

Alexander Grothendieck... Alexander Grothendieck March 28, 1928 - Nov 13, 2014