返回题库

PUMaC 2015 · 加试 · 第 7 题

PUMaC 2015 — Power Round — Problem 7

专题
Discrete Math / 离散数学
难度
L3
来源
PUMaC

题目详情

  1. No communication with humans outside your team of 8 students about the content of these problems is allowed. If you have any questions regarding the test, please contact us at once at pumac@math.princeton.edu. Figure 1: Graphical View of kP. Updated 11/18/15. PUMaC 2015 Power Round Section 1 page 2 1 Introduction Elliptic curves appear often in mathematics because they possess remarkably nice properties. For example, elliptic curves relate elegantly to ideas from Galois theory. This Power Round will demonstrate the utility of elliptic curves and Galois theory by using them to prove an interesting fact about the Tiger sequence. We define the Tiger sequence { a } for non-negative n recursively by a = a = a = a = 1 and for n ≥ 4, the n 0 1 2 3 relation 2 a a = a a + a . n n − 4 n − 1 n − 3 n − 2 We ultimately seek to prove the following theorem. Theorem 1. Let π ( x ) be the number of primes less than or equal to x . Then |{ p ≤ x : p prime and p | a for some n }| 11 n lim = . x →∞ π ( x ) 21 11 This fraction is called the density of primes that divides a term of the Tiger sequence. 21 While much mathematical machinery is needed to prove this, we have broken down the task into a series of sections that culminate in a final proof in section 9. Please note that while the ultimate goal of this Power Round is to prove the given theorem, the sections may include problems that are not essential to the final proof, but are relevant and good problems to try. We have sorted the problems in as straightforward a manner as possible with regards to the final proof, but as the various topics are very interconnected you may find it useful to refer back to previous sections for ideas on how to proceed. As always, refer to the rules at the start of the document for how to reference other problems. In a similar vein, we have a couple housekeeping remarks: • All definitions, propositions, lemmas, and theorems are labeled in increasing order using the same index. For example, this document began by introducing a theorem labeled Theorem 1 and will soon introduce its first lemma labeled Lemma 2 followed by its first official definition labeled Definition 3. • While this document guides you through the final proof, it will not babysit your progress. In any given part of the document, we may make assertions that will be necessary when solving a later problem. It is your responsibility as the reader to keep track of such material. Details that are absolutely essential will often be written in bold, but this is not an if and only if criterion for discerning important facts. Lastly, you may be asking yourself: “Why is this interesting?” Well, we could name-drop famous math- ematicians who have answered similar questions, or lie and say this is a large area of mathematics (this specific flavor of math isn’t). But that would only tell you why this topic is interesting to others. Why will it be interesting to you? Well, if we take a slightly more general view, the question becomes: Why is math interesting to you? You have probably heard people say that math is necessary for science or as a life skill. But, if you have voluntarily decided to take this contest, you might have a different opinion. Sure, the science/life skills part might be true, but that’s not why you are here and that’s not why we have organized this tournament for you. PUMaC is a competition for many different types of people created by many different types of people, but we all share an interest in and appreciation for math for its own sake. Math is pretty. Back to the original question, we hope that this Power Round will expose you to an area of math you haven’t seen before and that is remarkably pretty (but we’ll leave that aesthetic judgment to you). Now, please don’t get too carried away by the scoring and the fact that this is a competition. It may be clich´ e, but please have fun as well. -Heesu Hwang. We’d like to acknowledge and thank many individuals and organizations for their support; without their help, this Power Round (and the entire competition) could not exist. Please refer to the solution of the Power Round for full acknowledgments. 2 PUMaC 2015 Power Round Section 1 page 3 Contents 1 Introduction 2 2 Let’s Get Started 4 3 Group Theory 5 4 Elliptic Curves 9 5 Sequences 13 6 Interlude 14 7 Galois Theory 16 8 Elliptic Curves and Galois Theory 18 9 Final Fraction 21 List of Problems 3.1 Problem (Basic Group Theory; 2, 2, 2, 2 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.2 Problem (Finite Field; 5 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.3 Problem (Finite Group; 5 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.4 Problem (Subgroup Test; 5 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.5 Problem (Lagrange’s Theorem; 10 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.6 Problem (Odd Order; 5 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.1 Problem (Transformation of EC; 2, 8 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.2 Problem (Addition Computation; 2, 2 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 4.3 Problem (Addition Theory; 2, 8 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 4.4 Problem (Reduced Rational Point; 5 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 4.5 Problem (E Symmetry; 2, 2 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.6 Problem (Sequence and Curve; 10 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 5.1 Problem (Secondary Sequence; 5, 2 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 5.2 Problem (Is Integral; 10 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 5.3 Problem (Sequence Divisibility; 5 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 5.4 Problem (Integrality, Integrality!; 8, 12 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 6.1 Problem (EC over Finite Field; 5 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 6.2 Problem (An Odd Divisor; 5 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 7.1 Problem (0 Ring; 5 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 7.2 Problem (Fields; 4, 2, 2, 4 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 7.3 Problem (Galois Automorphisms; 2, 8 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 9.1 Problem (Final Fraction; 10, 10, 10, 10 ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 3 PUMaC 2015 Power Round Section 2 page 4 2 Let’s Get Started Firstly, if you haven’t read the introduction, then go back and read the introduction! It really does add big- picture context to the problems you’re doing. Now as a preliminary and as an example of the standards of justification we expect throughout this power round, here is a classical number theory result called B´ ezout’s Lemma, with proof. Very quickly, here is a spot of terminology: Definition 2. Z represents the set of integers. Q represents the set of rational numbers. R represents the set of real numbers. C represents the set of complex numbers. Finally, N represents the set of positive integers. (A point of interest, Europeans include 0 in this set while Americans do not. Do you agree? Is 0 a natural number?) Definition 3. Sets. A set is a collection of objects. We write that set A = { a } for integers 1 ≤ i ≤ n if i A contains exactly elements a and nothing else. We may similarly have infinite sets. Here is some specific i notation with sets: • a ∈ A : Let A be a set such that A contains the element A ; then we write a ∈ A . • A \ B : Let A and B both be sets. Then A \ B denotes the set of elements that are inside A but not in B . • A ⊂ B : Let A and B both be sets. If every element of A lies inside B , we write A ⊂ B . • ∀ a ∈ A : The notation ∀ a ∈ A is read in English as “for all elements a in A ”, and means we consider all elements of set A . • ∃ a ( ∈ A ) : This notation is read as “there exists an element a (in set A).” It is usually followed up by the phrase “such that.” For example, ∃ x ∈ R such that x > 0 . Lemma 4 (B´ ezout’s Lemma) . Prove that if x and y are coprime integers, then there exist integers a and b such that ax + by = 1 . Proof. We prove the more general case of integers x and y with a general gcd. Examine the set S := { c ∈ N : c = ax + by where a, b ∈ Z } . Since gcd( x, y ) divides x and y , gcd( x, y ) divides any element of S . Suppose that l is the least element of S by the well-ordering principle (which states that every non-empty set of positive integers has a least element); thus let a and b be integers such that l = a x + b y . Take any 0 0 0 0 other arbitrary element of S ; for example k = a x + b y . Then by integer division, suppose that k = l · q + r 1 1 where 0 ≤ r < l . Thus l = a x + b y = ⇒ lq = a qx + b qy = ⇒ r = k − lq = ( a − a q ) x + ( b − x q ) y. 0 0 0 1 1 0 1 0 Since l by assumption was the least positive integer that was a linear combination of x and y , we must have r = 0. Thus k = l · q , and every element of S is divisible by l . Note that | x | , | y | ∈ S ; thus l | gcd( x, y ). But clearly gcd( x, y ) | l , and so they are equal. Thus there is some integer solution to l = ax + by . 4 PUMaC 2015 Power Round Section 3 page 5 3 Group Theory Groups are fundamental to mathematics. They form the basis (pun!) of algebra, one of the two overarching subjects of math. It is important that anyone who wishes to explore math further understands groups well. A group is defined as follows. Definition 5. A group is a set of elements G with a closed binary operation ∗ . Binary means ∗ operates on two elements. Closed means that for any a, b ∈ G , a ∗ b is contained inside G . These elements and operation obey the following three rules. • There exists an unique element e ∈ G such that for all elements g ∈ G , e ∗ g = g ∗ e = g . This is called the identity element. (In cases of ambiguity, we will denote this as e .) G • For any element g ∈ G , there exists a unique element h ∈ G such that g ∗ h = h ∗ g = e . This element − 1 h is usually denoted g (in additive groups (to be explained), it is denoted − g ). • For all a, b, c ∈ G , the associative property holds: a ∗ ( b ∗ c ) = ( a ∗ b ) ∗ c. Definition 6. Suppose { G, ∗} is a group. Suppose ∗ is commutative. That is, for all a and b in the group, a ∗ b = b ∗ a . Then G is called commutative or abelian. To demonstrate all this, Z is a group with addition as the operation. This is a group because we may always add two integers and get another integer, 0 is the additive identity, and similarly the other group properties are satisfied. In fact, { Z , + } is an abelian group. Now here are some warm-up problems.
解析

Problem 7.3 (Galois Automorphisms; 2, 8 ) . Let f ( x ) = x − 70 x + 25 . a) What are the roots of f ( x ) ? b) You are given that f ( x ) is a nice enough polynomial that Q [ x ] / ( f ( x )) is a Galois. Give four examples of Galois automorphisms—an isomorphism from one set to itself. (You may just tell us where each root is sent for each automorphism). √ √ √ √ √ √ √ √ Proof. a) We have that the roots of f are 20 + 15, 20 − 15, − 20 + 15, and 20 − 15. √ √ √ √ b) Let α = 20 + 15, and β = 20 − 15, here are all of them: σ ( α, − α, β, − β ) 7 → ( α, − α, β, − β ) , 1 σ ( α, − α, β, − β ) 7 → ( − α, α, − β, β ) , 2 σ ( α, − α, β, − β ) 7 → ( β, − β, α, − α ) , 3 σ ( α, − α, β, − β ) 7 → ( − β, β, − α, α ) . 4 The motivation for this comes from our example of Q [ i ]. A very natural thing to try is sending i 7 → − i . If we try a similar method here, we may guess and check how the signs flip. Before moving on though, we can go even further than what we have done here; we can adjoin multiple roots of many different polynomials at once to Q . For example, a classic example you may see if you study √ 3 2 3 mathematics more is adjoining to Q the roots of both x + x +1 and x − 2 at the same time to yield Q [ ω, 2] for ω a primitive 3rd root of unity. 8 Elliptic Curves and Galois Theory Galois theory is incredibly rich, but unfortunately there are details we must omit about the subject for the sake of time, and this is sufficient background; we can now relate Galois theory and elliptic curves. Suppose you have a general elliptic curve E and a general point P on it. We define a k -division point of P as some 2 point Q on E such that kQ = P . A fact of elliptic curves is that there are exactly k such k -division points in C (the coordinates of Q may be complex numbers), but likely many of them won’t be rational points. But examine for a moment such a non-rational point β such that kβ = P . Suppose we take the x and y k k coordinates of β and adjoined them to Q . What would we get? Going further, suppose we took all such k β such that kβ = P and adjoined to Q all of the x and y coordinates of these division points. We get k k i i some large field extension we label K . This directly gives us a way to use Galois theory in a way that gives k us information about our initial E and P . Take on faith that K / Q is indeed a Galois extension, and examine some Galois automorphism σ of this k extension; it acts on all these coordinates we just adjoined. Let ( a, b ) be one of the k -division points; then σ (( a, b )) = ( σ ( a ) , σ ( b )). Now we have a curious situation: we have found a Galois automorphism that acts on points on an elliptic curve! Weee. That these Galois automorphisms act on the set of k -division points is important. Can you visualize how they are acting? These functions send coordinate pairs, essentially vectors, to other vectors. This is quite similar to how matrices act on vectors! In fact, this leads to what is called a Galois representation: a homomorphism from the Galois group to a linear algebra construct. Here we become guilty of omitting some details, but it would take too much work to present in full rigor. But please take these two propositions to be true. 28 PUMaC 2015 Power Round Section 8 page 29 2 3 Proposition 33. Let E : y + y = x − x , P = (0 , 0) , and let K be the field described above, namely the k field extension of Q by adjoining all the coordinates of the k -division points of P . Then there is a surjective k k 2 k homomorphism from the Galois group Gal( K / Q ) to AGL ( Z / 2 Z ) = ( Z / 2 Z ) o GL ( Z / 2 Z ) . Denote k 2 2 k this by ϕ : Gal( K / Q ) → AGL ( Z / 2 Z ) . k 2 A quick word on notation here. We defined the semidirect product in Proposition 16, and here we see an k k 2 example of one. For an element of such a group AGL ( Z / 2 Z ), we will write it as ( ~ v, M ) where ~ v ∈ ( Z / 2 Z ) 2 k and M ∈ GL ( Z / 2 Z ). 2 2 3 Proposition 34. Let E : y + y = x − x and P = (0 , 0) be a point on E . Let be a prime larger than 37 . Then P has odd order in E ( F ) , the reduction of the curve to this finite field, if and only if for all k ∈ N , [ ] K / Q k k ∃ ( ~ v, M ) ∈ im( ) ⊂ AGL ( Z / 2 Z ) such that ~ v lies in the column space of M − I (the column space of 2 k 2 a matrix such as ( M − I ) is the set { ( M − I ) · ~ v, ~ v ∈ ( Z / 2 Z ) } ), where im is the image under the mapping [ ] K / Q k defined in Proposition 33. (This symbol is called the Artin symbol, which we unfortunately do not have the time to define thoroughly. It is, however, a subset of Gal( K / Q ) . Hint: most important for you, k the contestant, is Proposition 37.) Let’s parse this last proposition; recall from the interlude that prime divides some term of the sequence if and only if P has odd order in E ( F ). We saw earlier as well in problem 3.6 that this happens if and only i if for all integers i , there exists some element β ∈ E ( F ) such that 2 · β = P . Finally, this condition is i i equivalent to the latter part of the above proposition. If you are familiar with Galois theory, as a hint of why this might be true, the fact that such a β exists implies that it is fixed by the Fr¨ obenius automorphism. i k k 2 This leads to the fact that AGL ( Z / 2 Z ) acting on ( Z / 2 Z ) fixes some element ~ x . Thus ( ~ v, M )( ~ x ) := 2 M · ~ x + ~ v = ~ x = ⇒ ( M − I ) ~ x = − ~ v . From here it’s easy to see that ~ v ∈ im( M − I ) ⇔ − ~ v ∈ im( M − I ). k Definition 35. Let ( ~ v, M ) ∈ AGL ( Z / 2 Z ) be an element of the affine general linear group. We call ( ~ v, M ) 2 a ruminative element if ~ v is in the column space of M − I . For the observant reader, another way to describe this element ( ~ v, M ) is to say that M fixes a vector k 2 k k 2 ~ x ∈ ( Z / 2 Z ) where the action of AGL ( Z / 2 Z ) on ( Z / 2 Z ) is as described above. 2 Thus we have come from an original question about primes dividing terms of a sequence to a question about the column space of matrices. This latter is something that we can much more likely solve directly. (In general, this is a useful strategy. Linear algebra is a subject that is very well understood compared to other mathematical subjects. This is the motivation behind group representations, for example. In fact, that linear algebra is so well understood has given rise to the half-serious joke of dismissing a problem by saying, “it’s just linear algebra!”) For one final step before we try to use linear algebra to find a fraction, we present the Chebotarev Density Theorem. Theorem 36. Suppose K/ Q is a Galois extension with G := Gal( K/ Q ) where C ⊂ G is a conjugacy class [ ] K/ Q of G . Define π ( x ) := # { p ≤ x : p is a prime that is unramified in K and = C } . Then C p π ( x ) | C | C lim = . x →∞ π ( x ) | G | 29 PUMaC 2015 Power Round Section 8 page 30 (The definition of unramified is unimportant for us. In our specific case, this equivalently means primes that are greater than 37.) As written, this doesn’t seem to necessarily apply to anything we’ve written so far. However, one of the facts that we obscured in our presentation of the two propositions above is that the images of the Galois groups above are in fact images of conjugacy classes. The ultimate result of all of this is the following. ′ Proposition 37. Let π ( x ) denote the number of primes less than x , and let π ( x ) denote the number of [ ] K / Q k primes less than x that divide some term of the Tiger sequence. Let S represent , the conjugacy class k ′ k inside Gal( K / Q ) where the k was such that β such that 2 · β = P . Let S := im( S ) and AGL ( Z / 2 Z ) = k k k 2 k im(Gal( K / Q )) represent the images under the homomorphism ϕ : Gal( K / Q ) → AGL ( Z / 2 Z ) from above. k k 2 Then ′ π ( x ) | S | lim = lim x →∞ k →∞ π ( x ) | Gal( K / Q ) | k ′ | S | = lim . k k →∞ | AGL ( Z / 2 Z ) | 2 S here is equal to the Artin symbol of some prime number ` . In other words, the final fraction we have to compute is the last expression in the proposition above. The ′ ′ k best way to interpret S in the above is that S is the subset of AGL ( Z / 2 Z ) that consists of the ruminative 2 elements. Here is a final note on the previous two sections. We are not fully defining some definitions such as conjugacy classes and the Artin symbol. They are written here for full formality, but are not necessary for ′ you the contestants to fully understand. The only part of the previous parts to take away is that S is the k subset of AGL ( Z / 2 Z ) of elements that are ruminative, and we may calculate the number of such elements. 2 Hint: this interpretation is the only thing you have to take away from sections 7 and 8 in order to solve section 9. 30 PUMaC 2015 Power Round Section 9 page 31 9 Final Fraction Thus we are only left with calculating the density! Here are the final steps. Definition 38. Let v : Z → Z be a function such that v ( n ) = m , where m is the exponent of p in the p p prime factorization of n . For example, v (24) = 3 , v (8) = 0 , and v ( − 25) = 2 . 2 3 5 k Proposition 39. Let M ∈ GL ( Z / 2 Z ) be a matrix such that v (det( M − I )) = r . Then the number of 2 2 2 k − r elements in the column space of M − I is 2 . (Two notes: we do not regard the cases where det( M − I ) = 0 , k and by definition, det( M − I ) is reduced to be the integer n such that 0 ≤ n < 2 and n ≡ det( M − I ) k (mod 2 ) where det( M − I ) is evaluated in Z .)