AN INTRODUCTION to the P-ADIC NUMBERS Contents 1. Introduction

Total Page:16

File Type:pdf, Size:1020Kb

AN INTRODUCTION to the P-ADIC NUMBERS Contents 1. Introduction AN INTRODUCTION TO THE p-ADIC NUMBERS ALEXA POMERANTZ Abstract. This paper introduces the p-adic numbers with an emphasis on comparison to the real numbers. It is mostly self-contained, but some basic knowledge in number theory, analysis, topology, and geometry is assumed. We begin by defining the p-adic metric and using this metric to construct Qp and Zp. We then move on to sequences and series and writing p-adic expansions. Lastly, we discuss topology and geometry in Qp. Contents 1. Introduction 1 2. The p-adic Metric 2 3. Construction of Qp and Zp 5 4. Sequences and Series in Qp 6 5. p-adic Expansions 8 6. The Topology on Qp 10 7. Geometry in Qp 12 Acknowledgments 14 References 14 1. Introduction The p-adic numbers, where p is any prime number, come from an alternate way of defining the distance between two rational numbers. The standard distance function, the Euclidean absolute value, gives rise to the real numbers. While the real numbers are more natural to most of us, this paper aims to present the p-adic numbers on an equal footing. For example, both fields are complete metric spaces. Unlike the real numbers, the p-adic numbers are an ultrametric space, leading to a number of fascinating but often counterintuitive results. The p-adic numbers are useful because they provide another toolset for solving problems, one which is sometimes easier to work with than the real numbers. They have applications in number theory, analysis, algebra, and more. One example is Hensel's lemma for finding roots of a polynomial. Another is Mahler's Theorem, a p-adic analog of the Stone-Weierstrass Theorem. Yet another is Monsky's Theorem, a theorem about triangulating squares whose proof makes use of 2-adic numbers. The reader is encouraged to read more about these in their own time, but the rest of this paper will be focused on introducing p-adic numbers more broadly. We start off by introducing the p-adic metric and then employing it to construct the p-adic numbers using Cauchy sequences. We then move on to some unique results about sequences and series that do not appear in real analysis. This leads 1 2 ALEXA POMERANTZ into a discussion of p-adic expansions, which will help us think about p-adic numbers in a more concrete way. Next, we discuss the topology on Qp to get a sense for p-adic spaces. Finally, we look at how p-adic geometry differs from Euclidean geometry. 2. The p-adic Metric We begin by defining a general notion of absolute value for an arbitrary field K. Definition 2.1. An absolute value on K is a function |·|: K ! R≥0 that satisfies the following properties for all x; y 2 K: (i) jxj = 0 if and only if x = 0; (ii) jxyj = jxjjyj, and (iii) jx + yj ≤ jxj + jyj (Triangle Inequality). Moreover, an absolute value is non-Archimedean if it also satisfies the following property: (iv) jx + yj ≤ maxfjxj; jyjg (Strong Triangle Inequality). An absolute value that does not satisfy property (iv) is Archimedean. Remark 2.2. We note that any function satisfying Property (iv) necessarily satisfies Property (iii). Definition 2.3. A metric on K is defined by a distance function d: K × K ! R≥0. An absolute value induces a metric defined by d(x; y) = jx − yj for all x; y 2 K. A set on which a metric is defined is called a metric space. A set with a metric induced by a non-Archimedean absolute value is called an ultrametric space. Lemma 2.4. Let K be an ultrametric space, and let x; y 2 K. If jxj= 6 jyj, jx+yj = maxfjxj; jyjg. Proof. Without loss of generality, we assume that jxj > jyj. Since K is an ultra- metric space, jx + yj ≤ maxfjxj; jyjg = jxj (Definition 2.1 and Definition 2.3). Also, x = (x + y) + (−y), so jxj ≤ maxfjx + yj; jyjg. Since jxj > jyj, jx + yj > jyj. Thus, we have jx + yj ≤ jxj ≤ jx + yj. It follows that jx + yj = jxj = maxfjxj; jyjg. Exercise 2.5. Check that in a field with a metric induced by an absolute value, the following properties hold for all x; y; z 2 K: • d(x; y) > 0 () x 6= y, • d(x; y) = d(y; x), and • d(x; z) ≤ d(x; y) + d(y; z). We now begin to define the p-adic metric specifically. For the rest of the paper, let p be a fixed prime number. Definition 2.6. The p-adic valuation on Q is defined by a function vp : Q ! Z [ f1g. Let x 2 Q where x 6= 0. If x 2 Z, let vp(x) be the unique positive integer satisfying v (x) 0 0 x = p p x , where p - x : a For all nonzero x 2 , we may write x = where a; b 2 . Then we define Q b Z vp(x) = vp(a) − vp(b): Lastly, we define vp(0) = +1. AN INTRODUCTION TO THE p-ADIC NUMBERS 3 Remark 2.7. We can think of the p-adic valuation as describing how divisible by p a number is. In this way, it makes sense to define vp(0) = +1 since 0 can be divided by p infinitely many times, yielding an integer (namely 0) each time. Exercise 2.8. Show that the p-adic valuation does not depend on the representa- a a0 0 0 tion of a rational number (if b = b0 , then vp(a) − vp(b) = vp(a ) − vp(b )). a0 Exercise 2.9. Prove that if x 2 , x = pvp(x) , where p a0b0. Q b0 - Lemma 2.10. The following properties hold for all x; y 2 Q: (i) vp(xy) = vp(x) + vp(y) and (ii) vp(x + y) ≥ minfvp(x); vp(y)g. a c Proof. Let x; y 2 . Then x = and y = , where a; b; c; d 2 . Q b d Z First, if x = 0 or y = 0, then vp(xy) = vp(x) + vp(y) = +1. We therefore consider the case that both x and y are nonzero. Then vp(x) = vp(a) − vp(b); and vp(y) = vp(c) − vp(d) (Definition 2.6): ac Moreover, since xy = , bd vp(xy) = vp(ac) − vp(bd): Since a; c 2 Z, v (a) 0 v (c) 0 0 0 a = p p a and c = p p c ; where p - a and p - c (Definition 2.6): Then ac = pvp(a)a0 · pvp(c)c0 = pvp(a)+vp(c)a0c0: 0 0 0 0 Since p - a and p - c , p - a c . Thus, by Definition 2.6, vp(ac) = vp(a) + vp(c). By a similar argument, vp(bd) = vp(b) + vp(d). It follows that vp(xy) = vp(ac) − vp(bd) = vp(a) + vp(c) − vp(b) − vp(d) = vp(x) + vp(y): Hence, the p-adic valuation satisfies the first property. Next, if x + y = 0, then vp(x + y) = +1 ≥ minfvp(x); vp(y)g trivially. We therefore consider the case that x + y 6= 0. Without loss of generality, we assume that vp(x) ≤ vp(y). Then vp(x) is finite (if this were not the case, then x + y = 0 since x = y = 0). By Definition 2.6, vp(x) = vp(a) − vp(b): Also, if y = 0, vp(x + y) = vp(x) = minfvp(x); vp(y)g: Thus, we assume that y 6= 0, so vp(y) = vp(c) − vp(d): Since vp(x) ≤ vp(y), vp(a) − vp(b) ≤ vp(c) − vp(d): It follows that vp(a) + vp(d) ≤ vp(b) + vp(c): Equivalently, vp(ad) ≤ vp(bc) (by part (i)). Since ad 2 Z and bc 2 Z, v (ad) v (bc) ad = p p m and bc = p p n; where p - m and p - n (Definition 2.6): 4 ALEXA POMERANTZ Then ad + bc = pvp(ad)m + pvp(bc)n: vp(ad) vp(bc) vp(ad) Since vp(ad) ≤ vp(bc), p j p . It follows that p j ad + bc. Thus, vp(ad + bc) ≥ vp(ad). We now manipulate this inequality as follows, applying the result from part (i) as necessary: vp(ad + bc) ≥ vp(ad) =) vp(ad + bc) ≥ vp(a) + vp(d) =) vp(ad + bc) − vp(d) ≥ vp(a) =) vp(ad + bc) − vp(b) − vp(d) ≥ vp(a) − vp(b) =) vp(ad + bc) − vp(bd) ≥ vp(a) − vp(b) ad + bc We recall that x + y = , so bd vp(x + y) = vp(ad + bc) − vp(bd): Thus, we have vp(x + y) ≥ vp(x) = minfvp(x); vp(y)g. In other words, the p-adic valuation satisfies the second property. Definition 2.11. Let the p-adic absolute value function |·|p : Q ! R≥0 be defined by ( p−vp(x) if x 6= 0, jxjp = 0 if x = 0. The p-adic absolute value induces the p-adic metric, denoted by dp. Remark 2.12. Since the p-adic valuation for nonzero rational numbers is always an integer, the p-adic absolute value takes a discrete set of values. Proposition 2.13. The p-adic absolute value is a non-Archimedean absolute value on Q. Proof. Let x; y 2 Q. First, we suppose that x = 0. Then jxjp = 0 by Definition −vp(x) 2.11. Now, we suppose that x 6= 0. Then jxjp = p by Definition 2.11. Since p 6= 0, jxjp 6= 0. Thus, the p-adic absolute value satisfies Definition 2.1(i). Next, we check the second property.
Recommended publications
  • Formal Power Series - Wikipedia, the Free Encyclopedia
    Formal power series - Wikipedia, the free encyclopedia http://en.wikipedia.org/wiki/Formal_power_series Formal power series From Wikipedia, the free encyclopedia In mathematics, formal power series are a generalization of polynomials as formal objects, where the number of terms is allowed to be infinite; this implies giving up the possibility to substitute arbitrary values for indeterminates. This perspective contrasts with that of power series, whose variables designate numerical values, and which series therefore only have a definite value if convergence can be established. Formal power series are often used merely to represent the whole collection of their coefficients. In combinatorics, they provide representations of numerical sequences and of multisets, and for instance allow giving concise expressions for recursively defined sequences regardless of whether the recursion can be explicitly solved; this is known as the method of generating functions. Contents 1 Introduction 2 The ring of formal power series 2.1 Definition of the formal power series ring 2.1.1 Ring structure 2.1.2 Topological structure 2.1.3 Alternative topologies 2.2 Universal property 3 Operations on formal power series 3.1 Multiplying series 3.2 Power series raised to powers 3.3 Inverting series 3.4 Dividing series 3.5 Extracting coefficients 3.6 Composition of series 3.6.1 Example 3.7 Composition inverse 3.8 Formal differentiation of series 4 Properties 4.1 Algebraic properties of the formal power series ring 4.2 Topological properties of the formal power series
    [Show full text]
  • Proofs, Sets, Functions, and More: Fundamentals of Mathematical Reasoning, with Engaging Examples from Algebra, Number Theory, and Analysis
    Proofs, Sets, Functions, and More: Fundamentals of Mathematical Reasoning, with Engaging Examples from Algebra, Number Theory, and Analysis Mike Krebs James Pommersheim Anthony Shaheen FOR THE INSTRUCTOR TO READ i For the instructor to read We should put a section in the front of the book that organizes the organization of the book. It would be the instructor section that would have: { flow chart that shows which sections are prereqs for what sections. We can start making this now so we don't have to remember the flow later. { main organization and objects in each chapter { What a Cfu is and how to use it { Why we have the proofcomment formatting and what it is. { Applications sections and what they are { Other things that need to be pointed out. IDEA: Seperate each of the above into subsections that are labeled for ease of reading but not shown in the table of contents in the front of the book. ||||||||| main organization examples: ||||||| || In a course such as this, the student comes in contact with many abstract concepts, such as that of a set, a function, and an equivalence class of an equivalence relation. What is the best way to learn this material. We have come up with several rules that we want to follow in this book. Themes of the book: 1. The book has a few central mathematical objects that are used throughout the book. 2. Each central mathematical object from theme #1 must be a fundamental object in mathematics that appears in many areas of mathematics and its applications.
    [Show full text]
  • Genius Manual I
    Genius Manual i Genius Manual Genius Manual ii Copyright © 1997-2016 Jiríˇ (George) Lebl Copyright © 2004 Kai Willadsen Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License (GFDL), Version 1.1 or any later version published by the Free Software Foundation with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. You can find a copy of the GFDL at this link or in the file COPYING-DOCS distributed with this manual. This manual is part of a collection of GNOME manuals distributed under the GFDL. If you want to distribute this manual separately from the collection, you can do so by adding a copy of the license to the manual, as described in section 6 of the license. Many of the names used by companies to distinguish their products and services are claimed as trademarks. Where those names appear in any GNOME documentation, and the members of the GNOME Documentation Project are made aware of those trademarks, then the names are in capital letters or initial capital letters. DOCUMENT AND MODIFIED VERSIONS OF THE DOCUMENT ARE PROVIDED UNDER THE TERMS OF THE GNU FREE DOCUMENTATION LICENSE WITH THE FURTHER UNDERSTANDING THAT: 1. DOCUMENT IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES THAT THE DOCUMENT OR MODIFIED VERSION OF THE DOCUMENT IS FREE OF DEFECTS MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE OR NON-INFRINGING. THE ENTIRE RISK AS TO THE QUALITY, ACCURACY, AND PERFORMANCE OF THE DOCUMENT OR MODIFIED VERSION OF THE DOCUMENT IS WITH YOU.
    [Show full text]
  • The Evolution of Numbers
    The Evolution of Numbers Counting Numbers Counting Numbers: {1, 2, 3, …} We use numbers to count: 1, 2, 3, 4, etc You can have "3 friends" A field can have "6 cows" Whole Numbers Whole numbers are the counting numbers plus zero. Whole Numbers: {0, 1, 2, 3, …} Negative Numbers We can count forward: 1, 2, 3, 4, ...... but what if we count backward: 3, 2, 1, 0, ... what happens next? The answer is: negative numbers: {…, -3, -2, -1} A negative number is any number less than zero. Integers If we include the negative numbers with the whole numbers, we have a new set of numbers that are called integers: {…, -3, -2, -1, 0, 1, 2, 3, …} The Integers include zero, the counting numbers, and the negative counting numbers, to make a list of numbers that stretch in either direction indefinitely. Rational Numbers A rational number is a number that can be written as a simple fraction (i.e. as a ratio). 2.5 is rational, because it can be written as the ratio 5/2 7 is rational, because it can be written as the ratio 7/1 0.333... (3 repeating) is also rational, because it can be written as the ratio 1/3 More formally we say: A rational number is a number that can be written in the form p/q where p and q are integers and q is not equal to zero. Example: If p is 3 and q is 2, then: p/q = 3/2 = 1.5 is a rational number Rational Numbers include: all integers all fractions Irrational Numbers An irrational number is a number that cannot be written as a simple fraction.
    [Show full text]
  • On Homomorphism of Valuation Algebras∗
    Communications in Mathematical Research 27(1)(2011), 181–192 On Homomorphism of Valuation Algebras∗ Guan Xue-chong1,2 and Li Yong-ming3 (1. College of Mathematics and Information Science, Shaanxi Normal University, Xi’an, 710062) (2. School of Mathematical Science, Xuzhou Normal University, Xuzhou, Jiangsu, 221116) (3. College of Computer Science, Shaanxi Normal University, Xi’an, 710062) Communicated by Du Xian-kun Abstract: In this paper, firstly, a necessary condition and a sufficient condition for an isomorphism between two semiring-induced valuation algebras to exist are presented respectively. Then a general valuation homomorphism based on different domains is defined, and the corresponding homomorphism theorem of valuation algebra is proved. Key words: homomorphism, valuation algebra, semiring 2000 MR subject classification: 16Y60, 94A15 Document code: A Article ID: 1674-5647(2011)01-0181-12 1 Introduction Valuation algebra is an abstract formalization from artificial intelligence including constraint systems (see [1]), Dempster-Shafer belief functions (see [2]), database theory, logic, and etc. There are three operations including labeling, combination and marginalization in a valua- tion algebra. With these operations on valuations, the system could combine information, and get information on a designated set of variables by marginalization. With further re- search and theoretical development, a new type of valuation algebra named domain-free valuation algebra is also put forward. As valuation algebra is an algebraic structure, the concept of homomorphism between valuation algebras, which is derived from the classic study of universal algebra, has been defined naturally. Meanwhile, recent studies in [3], [4] have showed that valuation alge- bras induced by semirings play a very important role in applications.
    [Show full text]
  • Control Number: FD-00133
    Math Released Set 2015 Algebra 1 PBA Item #13 Two Real Numbers Defined M44105 Prompt Rubric Task is worth a total of 3 points. M44105 Rubric Score Description 3 Student response includes the following 3 elements. • Reasoning component = 3 points o Correct identification of a as rational and b as irrational o Correct identification that the product is irrational o Correct reasoning used to determine rational and irrational numbers Sample Student Response: A rational number can be written as a ratio. In other words, a number that can be written as a simple fraction. a = 0.444444444444... can be written as 4 . Thus, a is a 9 rational number. All numbers that are not rational are considered irrational. An irrational number can be written as a decimal, but not as a fraction. b = 0.354355435554... cannot be written as a fraction, so it is irrational. The product of an irrational number and a nonzero rational number is always irrational, so the product of a and b is irrational. You can also see it is irrational with my calculations: 4 (.354355435554...)= .15749... 9 .15749... is irrational. 2 Student response includes 2 of the 3 elements. 1 Student response includes 1 of the 3 elements. 0 Student response is incorrect or irrelevant. Anchor Set A1 – A8 A1 Score Point 3 Annotations Anchor Paper 1 Score Point 3 This response receives full credit. The student includes each of the three required elements: • Correct identification of a as rational and b as irrational (The number represented by a is rational . The number represented by b would be irrational).
    [Show full text]
  • Integer-Valued Polynomials on a : {P £ K[X]\P(A) C A}
    PROCEEDINGSof the AMERICANMATHEMATICAL SOCIETY Volume 118, Number 4, August 1993 INTEGER-VALUEDPOLYNOMIALS, PRUFER DOMAINS, AND LOCALIZATION JEAN-LUC CHABERT (Communicated by Louis J. Ratliff, Jr.) Abstract. Let A be an integral domain with quotient field K and let \x\\(A) be the ring of integer-valued polynomials on A : {P £ K[X]\P(A) C A} . We study the rings A such that lnt(A) is a Prtifer domain; we know that A must be an almost Dedekind domain with finite residue fields. First we state necessary conditions, which allow us to prove a negative answer to a question of Gilmer. On the other hand, it is enough that lnt{A) behaves well under localization; i.e., for each maximal ideal m of A , lnt(A)m is the ring Int(.4m) of integer- valued polynomials on Am . Thus we characterize this latter condition: it is equivalent to an "immediate subextension property" of the domain A . Finally, by considering domains A with the immediate subextension property that are obtained as the integral closure of a Dedekind domain in an algebraic extension of its quotient field, we construct several examples such that lnt(A) is Priifer. Introduction Throughout this paper A is assumed to be a domain with quotient field K, and lnt(A) denotes the ring of integer-valued polynomials on A : lnt(A) = {P£ K[X]\P(A) c A}. The case where A is a ring of integers of an algebraic number field K was first considered by Polya [13] and Ostrowski [12]. In this case we know that lnt(A) is a non-Noetherian Priifer domain [1,4].
    [Show full text]
  • E6-132-29.Pdf
    HISTORY OF MATHEMATICS – The Number Concept and Number Systems - John Stillwell THE NUMBER CONCEPT AND NUMBER SYSTEMS John Stillwell Department of Mathematics, University of San Francisco, U.S.A. School of Mathematical Sciences, Monash University Australia. Keywords: History of mathematics, number theory, foundations of mathematics, complex numbers, quaternions, octonions, geometry. Contents 1. Introduction 2. Arithmetic 3. Length and area 4. Algebra and geometry 5. Real numbers 6. Imaginary numbers 7. Geometry of complex numbers 8. Algebra of complex numbers 9. Quaternions 10. Geometry of quaternions 11. Octonions 12. Incidence geometry Glossary Bibliography Biographical Sketch Summary A survey of the number concept, from its prehistoric origins to its many applications in mathematics today. The emphasis is on how the number concept was expanded to meet the demands of arithmetic, geometry and algebra. 1. Introduction The first numbers we all meet are the positive integers 1, 2, 3, 4, … We use them for countingUNESCO – that is, for measuring the size– of collectionsEOLSS – and no doubt integers were first invented for that purpose. Counting seems to be a simple process, but it leads to more complex processes,SAMPLE such as addition (if CHAPTERSI have 19 sheep and you have 26 sheep, how many do we have altogether?) and multiplication ( if seven people each have 13 sheep, how many do they have altogether?). Addition leads in turn to the idea of subtraction, which raises questions that have no answers in the positive integers. For example, what is the result of subtracting 7 from 5? To answer such questions we introduce negative integers and thus make an extension of the system of positive integers.
    [Show full text]
  • An Introduction to the P-Adic Numbers Charles I
    Union College Union | Digital Works Honors Theses Student Work 6-2011 An Introduction to the p-adic Numbers Charles I. Harrington Union College - Schenectady, NY Follow this and additional works at: https://digitalworks.union.edu/theses Part of the Logic and Foundations of Mathematics Commons Recommended Citation Harrington, Charles I., "An Introduction to the p-adic Numbers" (2011). Honors Theses. 992. https://digitalworks.union.edu/theses/992 This Open Access is brought to you for free and open access by the Student Work at Union | Digital Works. It has been accepted for inclusion in Honors Theses by an authorized administrator of Union | Digital Works. For more information, please contact [email protected]. AN INTRODUCTION TO THE p-adic NUMBERS By Charles Irving Harrington ********* Submitted in partial fulllment of the requirements for Honors in the Department of Mathematics UNION COLLEGE June, 2011 i Abstract HARRINGTON, CHARLES An Introduction to the p-adic Numbers. Department of Mathematics, June 2011. ADVISOR: DR. KARL ZIMMERMANN One way to construct the real numbers involves creating equivalence classes of Cauchy sequences of rational numbers with respect to the usual absolute value. But, with a dierent absolute value we construct a completely dierent set of numbers called the p-adic numbers, and denoted Qp. First, we take p an intuitive approach to discussing Qp by building the p-adic version of 7. Then, we take a more rigorous approach and introduce this unusual p-adic absolute value, j jp, on the rationals to the lay the foundations for rigor in Qp. Before starting the construction of Qp, we arrive at the surprising result that all triangles are isosceles under j jp.
    [Show full text]
  • Chapter I, the Real and Complex Number Systems
    CHAPTER I THE REAL AND COMPLEX NUMBERS DEFINITION OF THE NUMBERS 1, i; AND p2 In order to make precise sense out of the concepts we study in mathematical analysis, we must first come to terms with what the \real numbers" are. Everything in mathematical analysis is based on these numbers, and their very definition and existence is quite deep. We will, in fact, not attempt to demonstrate (prove) the existence of the real numbers in the body of this text, but will content ourselves with a careful delineation of their properties, referring the interested reader to an appendix for the existence and uniqueness proofs. Although people may always have had an intuitive idea of what these real num- bers were, it was not until the nineteenth century that mathematically precise definitions were given. The history of how mathematicians came to realize the necessity for such precision in their definitions is fascinating from a philosophical point of view as much as from a mathematical one. However, we will not pursue the philosophical aspects of the subject in this book, but will be content to con- centrate our attention just on the mathematical facts. These precise definitions are quite complicated, but the powerful possibilities within mathematical analysis rely heavily on this precision, so we must pursue them. Toward our primary goals, we will in this chapter give definitions of the symbols (numbers) 1; i; and p2: − The main points of this chapter are the following: (1) The notions of least upper bound (supremum) and greatest lower bound (infimum) of a set of numbers, (2) The definition of the real numbers R; (3) the formula for the sum of a geometric progression (Theorem 1.9), (4) the Binomial Theorem (Theorem 1.10), and (5) the triangle inequality for complex numbers (Theorem 1.15).
    [Show full text]
  • Rational and Irrational Numbers 1
    CONCEPT DEVELOPMENT Mathematics Assessment Project CLASSROOM CHALLENGES A Formative Assessment Lesson Rational and Irrational Numbers 1 Mathematics Assessment Resource Service University of Nottingham & UC Berkeley Beta Version For more details, visit: http://map.mathshell.org © 2012 MARS, Shell Center, University of Nottingham May be reproduced, unmodified, for non-commercial purposes under the Creative Commons license detailed at http://creativecommons.org/licenses/by-nc-nd/3.0/ - all other rights reserved Rational and Irrational Numbers 1 MATHEMATICAL GOALS This lesson unit is intended to help you assess how well students are able to distinguish between rational and irrational numbers. In particular, it aims to help you identify and assist students who have difficulties in: • Classifying numbers as rational or irrational. • Moving between different representations of rational and irrational numbers. COMMON CORE STATE STANDARDS This lesson relates to the following Standards for Mathematical Content in the Common Core State Standards for Mathematics: N-RN: Use properties of rational and irrational numbers. This lesson also relates to the following Standards for Mathematical Practice in the Common Core State Standards for Mathematics: 3. Construct viable arguments and critique the reasoning of others. INTRODUCTION The lesson unit is structured in the following way: • Before the lesson, students attempt the assessment task individually. You then review students’ work and formulate questions that will help them improve their solutions. • The lesson is introduced in a whole-class discussion. Students then work collaboratively in pairs or threes to make a poster on which they classify numbers as rational and irrational. They work with another group to compare and check solutions.
    [Show full text]
  • [Li HUISHI] an Introduction to Commutative Algebra(Bookfi.Org)
    An Introduction to Commutative Algebra From the Viewpoint of Normalization This page intentionally left blank From the Viewpoint of Normalization I Jiaying University, China NEW JERSEY * LONDON * SINSAPORE - EElJlNG * SHANGHA' * HONG KONG * TAIPEI CHENNAI Published by World Scientific Publishing Co. Re. Ltd. 5 Toh Tuck Link, Singapore 596224 USA office: Suite 202,1060 Main Street, River Edge, NJ 07661 UK office: 57 Shelton Street, Covent Garden, London WC2H 9HE British Library Cataloguing-in-PublicationData A catalogue record for this book is available from the British Library AN INTRODUCTION TO COMMUTATIVE ALGEBRA From the Viewpoint of Normalization Copyright 0 2004 by World Scientific Publishing Co. Re. Ltd. All rights reserved. This book, or parts thereof. may not be reproduced in any form or by any means, electronic or mechanical, including photocopying, recording or any information storage and retrieval system now known or to be invented, without written permission from the Publisher. For photocopying of material in this volume, please pay a copying fee through the Copyright Clearance Center, Inc., 222 Rasewood Drive, Danvers, MA 01923, USA. In this case permission to photocopy is not required from the publisher. ISBN 981-238-951-2 Printed in Singapore by World Scientific Printers (S)Pte Ltd For Pinpin and Chao This page intentionally left blank Preface Why normalization? Over the years I had been bothered by selecting material for teaching several one-semester courses. When I taught senior undergraduate stu- dents a first course in (algebraic) number theory, or when I taught first-year graduate students an introduction to algebraic geometry, students strongly felt the lack of some preliminaries on commutative algebra; while I taught first-year graduate students a course in commutative algebra by quoting some nontrivial examples from number theory and algebraic geometry, of- ten times I found my students having difficulty understanding.
    [Show full text]