Parametrization of Pythagorean triples by a single triple of polynomials

Similar documents
Factorization of integer-valued polynomials with square-free denominator

This theorem allows us to describe all integer solutions as follows:

Integral closure of rings of integer-valued polynomials on algebras

Polynomial functions on subsets of non-commutative rings a link between ringsets and null-ideal sets

Irreducible Polynomials and Factorization Properties of the Ring of Integer-Valued Polynomials

D-MATH Algebraic Geometry FS 2018 Prof. Emmanuel Kowalski. Solutions Sheet 1. Classical Varieties

Polynomial functions on upper triangular matrix algebras

Diophantine equations for second order recursive sequences of polynomials

Number Theory and Graph Theory

A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:

Lecture 7.4: Divisibility and factorization

David Adam. Jean-Luc Chabert LAMFA CNRS-UMR 6140, Université de Picardie, France

POLYNOMIAL FUNCTIONS ON UPPER TRIANGULAR MATRIX ALGEBRAS

Rational Points on Conics, and Local-Global Relations in Number Theory

Group, Rings, and Fields Rahul Pandharipande. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S,

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.

ON ALMOST PSEUDO-VALUATION DOMAINS, II. Gyu Whan Chang

On p-blocks of symmetric and alternating groups with all irreducible Brauer characters of prime power degree. Christine Bessenrodt

Tomáš Madaras Congruence classes

Sets of Lengths of Puiseux Monoids

Commutative Rings and Fields

POSITIVE POLYNOMIALS LECTURE NOTES (09: 10/05/10) Contents

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM

K. Johnson Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada D. Patterson

. In particular if a b then N(

Precalculus Chapter P.1 Part 2 of 3. Mr. Chapman Manchester High School

CHAPTER 10: POLYNOMIALS (DRAFT)

Algebraic structures I

Math 109 HW 9 Solutions

Robert Gilmer s Contributions to the Theory of Integer-Valued Polynomials

CONGRUENT NUMBERS AND ELLIPTIC CURVES

On the prime divisors of elements of a D( 1) quadruple

x 9 or x > 10 Name: Class: Date: 1 How many natural numbers are between 1.5 and 4.5 on the number line?

Homework 9 Solutions to Selected Problems

What is a Linear Space/Vector Space?

ON THE ZERO-DIVISOR GRAPH OF A RING

Computing the elasticity of a Krull monoid

A Diophantine System and a Problem on Cubic Fields

Summary Slides for MATH 342 June 25, 2018

How many units can a commutative ring have?

ELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS

12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.

A SHARP RESULT ON m-covers. Hao Pan and Zhi-Wei Sun

ABSTRACT 1. INTRODUCTION

Explicit Methods in Algebraic Number Theory

Integral Similarity and Commutators of Integral Matrices Thomas J. Laffey and Robert Reams (University College Dublin, Ireland) Abstract

LESSON 7.1 FACTORING POLYNOMIALS I

Chapter 14: Divisibility and factorization

On a Generalization of the Coin Exchange Problem for Three Variables

DIOPHANTINE m-tuples FOR LINEAR POLYNOMIALS

Bulletin of the. Iranian Mathematical Society

MEMORIAL UNIVERSITY OF NEWFOUNDLAND

SOME PÓLYA-TYPE IRREDUCIBILITY CRITERIA FOR MULTIVARIATE POLYNOMIALS NICOLAE CIPRIAN BONCIOCAT, YANN BUGEAUD, MIHAI CIPU, AND MAURICE MIGNOTTE

Diophantine Equations and Hilbert s Theorem 90

Prime and irreducible elements of the ring of integers modulo n

SOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM

ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008

inv lve a journal of mathematics 2009 Vol. 2, No. 1 Atoms of the relative block monoid mathematical sciences publishers

AP-DOMAINS AND UNIQUE FACTORIZATION

Test 2. Monday, November 12, 2018

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.

Solutions to Homework for M351 Algebra I

Simplifying Rational Expressions and Functions

Homework problems from Chapters IV-VI: answers and solutions

Galois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a.

Handout - Algebra Review

arxiv: v3 [math.ac] 29 Aug 2018

INFINITE RINGS WITH PLANAR ZERO-DIVISOR GRAPHS

Polynomials, Ideals, and Gröbner Bases

Lecture Notes. Advanced Discrete Structures COT S

A 4 -SEXTIC FIELDS WITH A POWER BASIS. Daniel Eloff, Blair K. Spearman, and Kenneth S. Williams

Grade VIII. Mathematics Formula Notes. #GrowWithGreen

Resolution of Singularities in Algebraic Varieties

MATH 361: NUMBER THEORY FOURTH LECTURE

Lagrange s polynomial

Chapter 4 Finite Fields

DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS

Mathematical Olympiad Training Polynomials

Primary Decompositions of Powers of Ideals. Irena Swanson

3.4. ZEROS OF POLYNOMIAL FUNCTIONS

' Liberty and Umou Ono and Inseparablo "

Solving Diophantine Equations With Unique Factorization

On a Sequence of Nonsolvable Quintic Polynomials

PYTHAGOREAN TRIPLES KEITH CONRAD

THE RING OF POLYNOMIALS. Special Products and Factoring

Computations/Applications

MATH 433 Applied Algebra Lecture 22: Semigroups. Rings.

g(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.

x y z 2x y 2y z 2z x n

Binomial Thue equations and power integral bases in pure quartic fields

M381 Number Theory 2004 Page 1

Proof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have

Factorization in Polynomial Rings

CHARACTERIZING INTEGERS AMONG RATIONAL NUMBERS WITH A UNIVERSAL-EXISTENTIAL FORMULA

MODULE CATEGORIES WITHOUT SHORT CYCLES ARE OF FINITE TYPE

COUNTING SEPARABLE POLYNOMIALS IN Z/n[x]

Quizzes for Math 401

Section 1.1 Notes. Real Numbers

A WEAK VERSION OF ROLLE S THEOREM

Math 120 HW 9 Solutions

Transcription:

J Pure Appl Algebra 1 008 1 71 74 Parametrization of Pythagorean triples by a single triple of polynomials Sophie Frisch and Leonid Vaserstein Abstract It is well known that Pythagorean triples can be parametrized by two triples of polynomials with integer coefficients We show that no single triple of polynomials with integer coefficients in any number of variables is sufficient, but that there exists a parametrization of Pythagorean triples by a single triple of integer-valued polynomials The second author has recently studied polynomial parametrizations of solutions of Diophantine equations [8], and the first author has wondered if it were possible in some cases to parametrize by a k-tuple of integer-valued polynomials a solution set that is not parametrizable by a k-tuple of polynomials with integer coefficients [6] Pythagorean triples provide an example that this is indeed so We call a triple of integers x,y,z Z 3 satisfying x + y = z a Pythagorean triple, and, if x,y,z > 0, a positive Pythagorean triple It is well known that every Pythagorean triple is either of the form ca b, cab, ca + b or of the form cab, ca b, ca + b 000 Math Subj Classification: primary 11D09, secondary 11D85, 11C08, 13F0 1

with a,b,c Z, see for instance [7] To make precise our usage of the term polynomial parametrization, consider a set S Z k Let f 1,,f k be a k-tuple of polynomials either in the ring of polynomials with integer coefficients in n variables, Z[x 1,,x n ], or in IntZ n = {f Q[x 1,,x n ] a Z n fa Z}, the ring of integer-valued polynomials in n variables, for some n In either case F = f 1,,f k defines a function F: Z n Z k If S is the image of this function, S =FZ n, we say that f 1,,f k parametrizes S We call this a parametrization of S by a single k-tuple of polynomials If S Z k is the union of the images of finitely many k-tuples of polynomials F i = f i1,,f ik, S = m i=1 F iz n, we call this a parametrization of S by a finite number of k-tuples of polynomials, and we distinguish between parametrizations by polynomials with integer coefficients, meaning F i Z[x 1,,x n ] k for all i, and by integer-valued polynomials, meaning F i IntZ n k Unless explicitly specified otherwise, we are using integer parameters, that is, we let all variables of all polynomials range through the integers We will give a parametrization of the set of Pythagorean triples by a single triple of integer-valued polynomials in 4 variables, that is, by f 1,f,f 3 with f i Q[x,y,z,w] such that f i x,y,z,w Z whenever x,y,z,w Z First we will show that it is not possible to parametrize Pythagorean triples by a single triple of polynomials with integer coefficients in any number of variables Note, however, that every set of k-tuples of integers that is parametrizable by a single k-tuple of integer-valued polynomials is parametrizable by a finite number of k-tuples of polynomials with integer coefficients [6] Remark There do not exist f,g,h Z[x 1,,x n ] for any n such that f,g,h parametrizes the set of Pythagorean triples Proof Suppose f, g, h parametrizes the Pythagorean triples As Z[x] is a unique factorization domain, there exists d = gcdg, h unique up to sign, which also divides f, since f + g = h Let ϕ = f/d, ψ = g/d and θ = h/d Then ϕ = θ ψ = θ + ψθ ψ and gcdθ + ψ,θ ψ is either 1 or, but it can t be, because there exist Pythagorean triples with odd first coordinate such as 3, 4, 5 Since θ + ψ and θ ψ are co-prime and their product is a square, θ + ψ and θ ψ are either both squares, or both 1 times a square, and we can get rid of the latter alternative by retro-actively changing the sign of the polynomial d, if necessary

So there exist polynomials s and t with θ + ψ = s and θ ψ = t, and therefore θ = s + t and ψ = s t Since s t = s + ts t is divisible by, it is actually divisible by 4, so that ψ is divisible by, which contradicts the existence of Pythagorean triples with odd second coordinate such as 4,3,5 In a way, it was the unique factorization property of Z[x] that prevented us from finding a triple of polynomials in Z[x] parametrizing Pythagorean triples Before we construct a parametrization of Pythagorean triples by a triple of integer-valued polynomials, we remark in passing that IntZ n does not enjoy unique factorization into irreducibles An example of non-unique factorization into irreducibles in IntZ is given by x xx 1 x k + 1 = k! k The lefthand side is a product of k irreducibles, while the righthand side, after factorization of k! in Z, becomes a product of far more irreducibles for large k See [4] for integer-valued polynomials in general, and [1, 3, 5] for factorization properties Theorem There exist f,g,h IntZ 4 such that f,g,h parametrizes the set of Pythagorean triples as the variables range through Z namely, x xwy + zw z yw, x xwy + zwz yw, x xwy + zw + z yw Proof Every Pythagorean triple x,y,z with gcdx,y,z = 1 and z > 0 is either of the form T 1 a,b = a b, ab, a + b, or of the form with a,b Z Since T a,b = ab, a b, a + b, T a,b = T 1 a + b, a b, 3

every Pythagorean triple with gcdx,y,z = 1 and z > 0 is of the form c T 1 a,b/ with c {1,} and a,b Z Let ca b Ta,b,c =, cab, ca + b Then every Pythagorean triple is of the form Ta,b,c with a,b,c Z Also, every triple Ta,b,c with a,b,c Z is a rational solution of x + y = z So, the set of Pythagorean triples is precisely the set of integer triples in the range of the function T: Z 3 Q 3 Now Ta,b,c Z 3 if and only if c 0 mod or a b mod Triples a,b,c Z 3 satisfying this condition can be parametrized by for instance y + zw, z yw, x xw Indeed, if w is even then c 0 mod, if w is odd then a b mod, and all a,b,c satisfying either congruence actually occur for some x,y,z,w Z 4, as can be seen by setting w = 0 or w = 1 Therefore, substituting y + zw for a, z yw for b, and x xw for c in Ta,b,c yields a parametrization of the set of Pythagorean triples by a triple of integer-valued polynomials Remark The set of positive Pythagorean triples is parametrized by x + 1 w xy + 1 + wz y, x + 1 w xy + 1 + wzy, x + 1 w xy + 1 + wz + y where x,y,z range through the positive integers and w through the non-negative integers From this formula, a parametrization of positive Pythagorean triples with integer parameters can be obtained using the 4-square theorem by replacing w by w 1 + w + w 3 + w 4 and x, y, z by x 1 + x + x 3 + x 4 + 1, y 1 + y + y 3 + y 4 + 1, and z 1 + z + z 3 + z 4 + 1, respectively Proof As in the proof of the theorem above, the positive Pythagorean triples are precisely the triples with positive integer coordinates in the range of the function T: Z 3 Q 3 Now Ta,b,c is a positive triple if and only if a,b,c are positive 4

integers with a > b and either c 0 mod or a b mod Such triples a,b,c are parametrized by for instance y + 1 + wz, y, x + 1 w x with x,y,z > 0 and w 0 Therefore substituting y + 1 + wz for a, y for b and x + 1 w x for c in Ta,b,c gives a parametrization of positive Pythagorean triples where w ranges through non-negative integers and x,y,z through positive integers The 4-square theorem allows us to convert this to a parametrization with 16 integer parameters References [1] D F Anderson, P-J Cahen, S Chapman, and W W Smith, Some factorization properties of the ring of integer-valued polynomials, in Anderson and Dobbs [], 15 14 [] D F Anderson and D Dobbs, eds, Zero-dimensional commutative rings Knoxville, TN, 1994, vol 171 of Lecture Notes in pure and applied mathematics, Dekker, 1995 [3] P-J Cahen and J-L Chabert, Elasticity for integral-valued polynomials, J Pure Appl Algebra 103 1995, 303 311 [4] P-J Cahen and J-L Chabert, Integer-valued polynomials, vol 48 of Mathematical Surveys and Monographs, Amer Math Soc, 1997 [5] S Chapman and B A McClain, Irreducible polynomials and full elasticity in rings of integer-valued polynomials, J Algebra 93 005, 595 610 [6] S Frisch, Remarks on polynomial parametrization of sets of integer points, to appear in Comm Algebra [7] E Hlawka and J Schoißengeier, Zahlentheorie Eine Einführung, Manz, Vienna, 1979 [8] L Vaserstein, Polynomial parametrization for the solutions of Diophantine equations and arithmetic groups, to appear in Ann of Math SF Institut für Mathematik C Technische Universität Graz Steyrergasse 30 A-8010 Graz, Austria frisch@blahmathtu-grazacat LV Department of mathematics Pennsylvania State University University Park, PA 1680 USA vstein@mathpsuedu 5