In this post, I will explain some different tuning systems and their advantages and disadvantages. First, let’s see what the basic goals are of tuning systems.

1. There should be 12 notes per octave, in half-step intervals.
2. An octave (12 half steps) should be at a ratio of 2:1.
3. A fifth (7 half steps) should be at a ratio of 3:2.

We’ll look at some other goals later on, but let’s start with these. Since 7 and 12 are relatively prime, these goals are sufficient to generate an entire tuning system. However, this would require that 7 octaves be the same as 12 fifths, or . Unfortunately, this is not the case; in fact, it’s not even particularly close. We call the discrepancy, , a Pythagorean comma.

The first two principles really cannot be compromised. (Well, in some Indian, Arabic, and Turkish tuning systems, the first principle is modified. A common Turkish tuning system consists of 53 notes to an octave, for reasons we will see later on.) The first principle is essential because pianos and other keyboard instruments have 12 notes per octave, and Western music is always written with the 12 notes per octave model in mind. The second principle is essential since we want to treat two notes that differ by an octave as being the same note in many cases; therefore any fudging on goal 2 leads to unacceptable results.

The third principle, however, can be modified, if necessary (and, as we have just seen, it is necessary). The most naïve way of fudging is to make 11 out of 12 fifths be in a 3:2 ratio, and fit the last one to whatever is needed to make the cycle work out. This is known as Pythagorean tuning.

One immediate drawback of Pythagorean tuning is that it makes the so-called “wolf” fifth unusable beyond repair; it just sounds awful. But there are also more subtle problems with Pythagorean tuning. To see these, let’s see one other goal.

4. A major third (4 half steps) should be at a ratio of 5:4.

For simplicity, let’s ignore the problem of the wolf fifth for now. There are other more relevant problems to worry about already. Since , a major third should be four fifths minus two octaves. In terms of the ratios, this means that it would be necessary that . In other words, we’re off by a factor of . While this ratio may seem rather small, it turns out to be a very serious problem with the Pythagorean tuning system.

Mathematically, the problem is that we’re trying to factor rational numbers in terms of only powers of two and powers of three. Therefore, as soon as we need to use any prime greater than 3 (in this case, 5), we end up in trouble. However, we don’t really have to factor all rational numbers in terms of powers of two and three; we just have to approximate these factorizations reasonably well. Still, our goals so far are quite mutually incompatible, so we have to sacrifice something, somewhere.

As we pointed out, 5:4 is a better major third than 81:64, so let’s try to construct a tuning system that takes that into account. For simplicity, we’ll assume that our scales always start with C, and we’ll construct ratios for intervals above C. A good possibility is the following:

C 1

C-sharp 16/15

D 9/8

E-flat 6/5

E 5/4

F 4/3

F-sharp 45/32

G 3/2

A-flat 8/5

A 5/3

B-flat 9/5

B 15/8

C 2

This list is generated by using the rules described so far and using the ratio with smallest denominator when there are multiple choices. This tuning system is known as (5-limit) Just intonation, the 5 meaning that we have allowed ourselves to use rational numbers whose factorizations contain primes up to 5.

Naturally, the Just intonation chart should be compared to the chart for Pythagorean tuning, which is as follows (assuming we place the wolf between the G-sharp and the E-flat, which is as good a place as any):

C 1

C-sharp 2187/2048

D 9/8

E-flat 32/27

E 81/64

F 4/3

F-sharp 729/512

G 3/2

G-sharp 6561/4096

A 27/16

B-flat 16/9

B 243/128

C 2

Note the much larger denominators needed in Pythagorean tuning.

So, I pulled these goals out of thin air at the beginning, so I really ought to explain why they are natural goals. For that, it is necessary to discuss the overtone series.

On a string instrument, when a note is sounded, all integer mutliple frequencies are also sounded simultaneously. However, the higher multiples are quieter than the lower ones. Therefore, it is beneficial to have a tuning system that emphasizes at least the first few overtones, while possibly discarding higher ones. The first overtone, at a ratio of 2, sounds one octave higher than the original note (called the fundamental). The second overtone, at a ratio of 3, sounds an octave and a fifth higher than the original note. Subtracting the octave (or, equivalently, dividing by 2) tells us that fifths should be in a ratio of 3:2 above the fundamental. Continuing on, the third overtone is at a ratio of 4, so it sounds two octaves above the fundamental. The next overtone, at a ratio of 5, sounds two octaves and a third above the fundamental.

We really want all these notes to be part of a scale, since we tend to play several notes together, and common overtones yield pleasant sounds. So that’s where these goals I mentioned above come from.

So, it would appear that Just intonation is a good tuning system. However, again there are serious drawbacks. For example, from D to A, which is a perfect fifth, we have a ratio of 40:27, rather than the desired 3:2. There are many other intervals that are similarly problematical, always differing by a factor of 81/80 from the desired ratio. The result is that many such intervals must be avoided in Just intonation. Therefore, Just intonation is only usable in music which specifically avoids certain intervals. So, it’s really not a very nice solution.

One really obvious solution to the entire problem of tuning is just to make all the half steps equal, in a ratio of . In fact, this temperament, known as equal temperament, is what is generally used on pianos today. What is gained by using equal temperament is that there are no wolf tones, and all intervals are usable. However, is irrational, so we do not get any perfect overtones or intervals with perfect ratios, except the octaves. So, in using equal temperament, one sacrifices all the overtones (except octaves) in order to get a uniformly playable system.

To many people, the sacrifice of overtones is unacceptable. Therefore, we’ll ignore equal temperament from now on.

One attempt to resolve our problems is to use the idea of Pythagorean tuning, but instead of putting the wolf tone all in one place, we spread it out over the octave by putting a quarter of a Pythagorean comma in four different places. To do this, we make the fifths C-G, G-D, D-A, and B-F-sharp a quarter of a comma smaller than the usual 3/2 ratio. Here is that system, known as Werckmeister I:

C 1

C-sharp 256/243

D

E-flat 32/27

E

F 4/3

F-sharp 1024/729

G

G-sharp 128/81

A

B-flat 16/8

B

C 2

(Werckmeister also devised several other temperaments, but this one is the most popular.) Of course, we’ve lost many of the perfect fifths here. However, they’re not that bad, and the thirds are also pretty good. (The ratio of the C-E here, , and the desired C-E, 5:4, is about 1.002; that’s definitely acceptable. Of course, some thirds aren’t very good, but these ones are likely to be played less frequently in most “reasonable” keys. So Werckmeister I seems like a pretty good temperament.

I’ll post about some other temperaments (such as quarter comma and sixth comma meantone) another day, but this is a math blog, so I’d like to say something that has some semi-serious mathematical content. In particular, I mentioned earlier that 53 notes to an octave can lead to a very nice tuning system, so I’ll explain where I got that number. Ideally, we’d like some number of fifths to be equal to some other number of octaves. This would allow us to satisfy goals 2 and 3 perfectly. This means that we would like to solve as a Diophantine equation (meaning, look for integer solutions). Unfortunately, the only solution is , which is completely useless. But all is not lost, as it is possible to approximate solutions to this equation. Really, we only require that . I prefer to get rid of the variable and look for approximate rational solutions to . In other words, I want good rational approximations of .

We can easily find the best possible rational approximations by using continued fractions. The continued fraction coefficients begin with 0, 1, 1, 2, 2, 3, 1, 5, 2, 23, meaning that

.

(I can’t figure out how to get WordPress to allow nested fractions, unfortunately.) Cutting this off at various points gives the following sequence of rational approximations for :

1, 1/2, 3/5, 7/12, 24/41, 31/53, 179/306, 207/353, and I don’t really want to work out the next one. In these fractions, the numerator represents the number of units that are to be in a fifth, and the denominator represents the number of units that are to be in an octave. So the usual system corresponds to the approximation 7/12. Good rational approximations are ones whose denominators are much smaller than the next term of the continued fraction approximation. Therefore, 7/12 is quite good, as is 31/53. Thus a 53-note scale is a very natural alternative to the standard 12-note scale.

We begin with a few definitions.

Definition 1: A integral domain is called a Dedekind domain if it is noetherian, every nonzero prime ideal is maximal, and it is integrally closed in its field of fractions.

Definition 2: A ring is called a discrete valuation ring (DVR) if it is a principal ideal domain (PID) with exactly one nonzero prime ideal. (In other language, a DVR is a local PID of Krull dimension 0 or 1.)

One very important property of Dedekind domains is that ideals have unique factorizations as products of prime ideals. I used this property in the case of rings of integers in my last post to say that if is an extension of number fields with rings of integers , so if is a prime ideal, then we can write . But this result holds in more generality, for any Dedekind domain.

Also, it is very easy to check that a DVR is a Dedekind domain. But one very common occurrence of DVRs is as localizations of rings of integers. In particular, if is a Dedekind domain and is a prime ideal of , then is a DVR.

One way to interpret a DVR is through the following filtration of ideals. Let be a DVR, and let be the unique nonzero prime ideal of . Then every nonzero ideal of is of the form for some (where by I mean ). Now, for any , there is an integer so that . We can now define a function (where includes 0 in this case) by as above. We can extend our definition of to all of by setting .

It is also possible to extend to the quotient field of by setting ; it is easy to check that this is well-defined. Now, satisfies the following properties:

1) is a surjective homomorphism.

2) .

We call such a function a valuation of the field .

Knowing is enough to reconstruct , since . Furthermore, . We call the valuation ring of .

Let’s look at a few places where DVRs arise naturally.

1) As we mentioned earlier, the localization of a Dedekind domain at a prime ideal is a DVR. So, for example, is a DVR if is a prime. The unique prime ideal is .

2) The ring of -adic integers is a DVR with unique prime ideal . Also, finite extensions of the field of -adic numbers inherit valuations from , and so they contain DVRs as described above. In particular, if is a finite field extension, then the integral closure of in is a DVR.

Now, if is a DVR and is its prime ideal, then is a field. In the cases described above, this will always be a finite field; in what follows, we always assume that this field is finite. We call the residue field.

We can also put a topology on a valued field by letting the following sets be a basis for the topology: if and is an integer, then is an open set. These sets generate the topology. In what follows, we will assume that is complete as a topological space with this topology. Finite extensions of are complete with respect to this topology, so this will be our motivating example. The residue fields will also be finite.

Last post, I pointed out that if is a Galois extension of number fields, then . This holds more generally, however. If is a finite Galois field extension, and is a Dedekind domain so that is the quotient field of , and is the integral closure of in , then we still have .

We now interpret this in the case of a field complete with respect to a discrete valuation , and the valuation ring of . Let be a finite Galois extension, and let be the integral closure of in , or, equivalently, the valuation ring of . Then is also complete with respect to a discrete valuation that is very closely related to , as we will see soon.

Let be the prime of , and let be the prime of $B$. Since there is only one prime, . Hence . Now, if , then , and if , then . (But we won’t need these results in what follows, at least today.) The implication is the decomposition group of the extension is the entire Galois group.

We can put a filtration on the Galois group as follows: For , let . We call the ramification group of . is the entire Galois group (or the decomposition group; is the inertia group. Also, each is normal in .

Now, I won’t prove it here, but it can be shown that if the residue field is finite of characteristic and is complete, then for each , is a direct product of copies of , and is a subgroup of the roots of unity of (and hence finite and cyclic of order prime to ). Hence, by basic group theory or otherwise, is a semidirect product of a normal Sylow -subgroup and a cyclic group of order prime to . In particular, is solvable. However, as shown in the last post, is cyclic since it is the Galois group of an extension of finite fields. Hence:

Theorem: is solvable.

The following is a well-known result:

Theorem: If and are integers, with , then there are infinitely many primes congruent to .

It turns out that Dirichlet’s Theorem is actually a special case of Artin’s Reciprocity Law. So, we’ll discuss how this works.

Let be an extension of number fields. (That is, and are finite extensions of .) Let and be the rings of integers of and , respectively. (This means that and are the integral closures of in and , respectively.) Now, let be a nonzero prime ideal in . Then for some primes of and some positive integers . If , we say that is ramified over . We call the ramification index. The primes are said to lie above .

Since and are Dedekind domains, and are maximal ideals. Hence and are finite fields, and is a field extension. Let . We call the residue degree.

It is not too difficult to show that if , then . If is a Galois extension, then and are independent of (since the Galois group of over acts transitively on the ), so we can write .

Now, let’s define a few subgroups of . We’ll assume from now on that is a Galois extension. Furthermore, we fix a prime of , and some prime of lying above . Now, define . We call the decomposition group. We now have a homomorphism . To define , we note that an element of permutes cosets of and thus gives the desired homomorphism. Furthermore, this homomorphism is surjective. The kernel of is called the inertia group. Hence .

It is not hard to determine the sizes of and in terms of quantities we already understand: and . In particular, if is an unramified prime, then .

That’s particularly nice, because Galois groups of extensions of finite fields are always cyclic, generated by the Frobenius automorphism. Thus in the unramified case, is cyclic and generated by an automorphism satisfying the congruence for all . (We can extend to all of by multiplicativity.) Furthermore, this element is unique. The common notation for is .

If and are two primes lying above , then there is some element so that . It is easy to verify that . Therefore, if is abelian, then depends only on . In this case, we may write for this element.

Finally, we’re ready to state (part of) the Artin reciprocity theorem.

Let be an abelian Galois extension of number fields, and let be fixed. Then there are infinitely many primes of that are unramified and so that .

(In fact, only finitely many primes ramify, since primes ramify if and only if they divide the discriminant, which can be easily verified. The other part of the statement is more interesting.)

Let’s look at one example. Take and , where . Then , where the isomorphism is as follows: if , then there is an automorphism defined by . Now, if , then . In particular, this case of the theorem is equivalent to Dirichlet’s Theorem on primes in arithmetic progressions.

It turns out that the theorem isn’t too much more general than this, since any abelian extension is contained in a cyclotomic extension (this is the Kronecker-Weber Theorem), and it’s not hard to see what happens to Frobenius elements when we pass to sub-extensions.

All this material can be found (with many more details included) in Serre’s Local Fields.

Let’s fix a ring . A module (assumed to be a left module, I suppose, but it doesn’t really matter as long as we’re consistent) is said to be projective if the functor is exact. (That is, if is a short exact sequence of -modules, then is also exact.) Dually, is said to be injective if the functor is exact.

There are various equivalent conditions for projectives and injectives. One particularly useful result is that projective modules are exactly the direct summands of free modules. Another one is that injective modules satisfy a certain extension property: A module is injective if and only if for any map and any injective map , there exists a map (not necessarily unique) so that .

Actually, we didn’t need to start with a ring at all; it would make just as much sense to allow to be an object in an arbitrary abelian category . We say that has enough projectives if for every object of , there is an epimorphism (or, a surjective map, in the case of many interesting categories) , where is projective. Dually, has enough injectives if for every object of , there is a monomorphism (or, an injective map, in the case of many interesting categories) , where is injective.

It is easy to see that the category of modules over a ring has enough projectives: if is an -module, just take the free module on all the elements of , and then quotient out by the submodule consisting of all relations in . Hence is isomorphic to a quotient of a free (and hence projective) module.

It is also true that the category of modules over a ring has enough injectives, but this is a bit trickier to prove. To begin, we note that an arbitrary product of injective objects is injective. This follows from the isomorphism . We also note (although I’m not going to prove it here) that in the category of abelian groups (or -modules), injective modules are the same as divisible modules (i.e. modules so that the maps for are all surjective).

Let’s first show that the category of abelian groups has enough injectives. The abelian group that plays the most important role here is . Let be any abelian group, and let be the product of copies of , indexed by the set . Then is injective, and there is a canonical map . We now check that is actually an injective map. To do this, pick . It is easy to find some nontrivial map . By the extension property for injective modules, this map extends to a map on all of . This is enough to show that is an injective map.

Now let’s return to the category of modules over an arbitrary ring . It can be shown that if is an injective abelian group, then has the structure of an injective -module. Now, let be an arbitrary -module. Then let be the product of copies of , indexed by the set . Then, just as before, there is a canonical injective map . This completes the proof that the category of -modules has enough injectives.

A friend told me about an interesting problem that can be solved easily using martingales. I’ll start with the problem and solution, and then I’ll talk a bit about martingales in general. (That’s all I can do; I don’t know much about them.)

Problem: A monkey is sitting at a typewriter, typing a letter (A-Z) independently and with uniform distribution each minute. What is the expected amount of time that passes before ABRACADABRA is spelled?

Solution: Suppose that, before every keystroke is made, a new monkey enters and wagers $1 on the next keystroke being an A fairly (so that if the keystroke is indeed an A, then the payoff is $26). If the keystroke is an A, the monkey stays and wagers everything (in this case $26) on the next letter being B, and so on. If the monkey ever loses a wager, then it leaves. Now let’s analyze what happens when ABRACADABRA is finally spelled out. The monkey who kept making correct wagers all the way through won $ . But another monkey who got in on the second ABRA won $ , and a third monkey who got in on the final A got $26. Hence the total payoff is $ . But all the wagers are fair, and the house gets $1 on every turn from the new monkey, so the expected time before ABRACADABRA is spelled is .

I’m trying to figure out intuitively why the expected time should be longer than . Here’s my best understanding of it: if a lot of random letters are typed, then on average ABRACADABRA will be about as common as any other 11-letter string. However, they’ll be clumpier than some other strings, since we’ll see some instances of ABRACADABRACADABRA, which contain ABRACADABRA twice. But we can never clump, say, AAAAAAAAAAB more densely. Therefore, although the number of occurrences should be roughly equal in the limiting case, one can clump more easily than the other, so it should take more time to the first occurrence of ABRACADABRA than to the first occurrence of AAAAAAAAAAB.

In fact, we can make this clumping relationship even clearer with the following question: Suppose we have only two letters, A and B, and a monkey randomly types them. What is the probability that BA occurs before AA? The answer is for a rather simple reason: if the sequence does not begin with AA, then there will be a B before the first occurrence of A, so BA will occur before AA unless the sequence starts with AA, which happens only of the time.

Now on to martingales.  A martingale is a sequence of random variables so that the expectation (and ). In this case, the random variables for each monkey are the payoffs after wagers by that particular monkey. If the wager is going to be made, then , and is going to be with probability and 0 with probability . Thus . Hence this chain is a martingale.

For many years, my mother has baked a challah nearly every Friday for Shabbat. Occasionally, however, she asks me to do some portion of the challah making, possibly including the braiding. For reasons we’ll see later, I don’t like her braiding algorithm. This post includes several algorithms, written in a way that someone who knows what a braid group is can understand. (I never had much success following those series of diagrams I sometimes see; I always wished someone would write out the braiding process in terms of generators of the braid group, so that’s what I’m going to do here after I give the preliminary definitions.)

Wikipedia’s page on braid groups has lots of interesting things, so I’ll only write a few essential points here, leaving the reader to explore Wikipedia at eir leisure. I’m finding it a bit tricky to give a good informal definition of braids, so I’ll just assume that my reader knows roughly what a braid is and skip to the formal definition.

The braid group on strands is the group . In terms of actually playing with braid strands, means interchanging strand with strand by putting strand over strand . It is pretty simple to see that these generators do indeed induce all possible braids (although I haven’t yet said what a braid is), and that the relations ought to hold. Now, of course, a braid is an element of the braid group.

The braid groups become rather complicated quite quickly. While and , already is nonabelian, and it’s isomorphic to the fundamental group of the complement of a trefoil knot in .

Note also that there is a natural homomorphism that tells us where the strand that started in the position ends up.

Okay, now it’s time for some challah braiding algorithms. My mother’s usual challah has four strands on the bottom and three on the top. The algorithm for the top braid is pretty natural: , where is decided by the length of the dough ropes.

I’m more concerned about the element of used for the bottom braid. She uses .  If , we have (in cycle notation). This is already bad news to me: one step of the algorithm produces a single fixed point! I think one step of the algorithm ought to give an -cycle (here a 4-cycle) or else a pure braid (i.e. a braid in the kernel of ). But it gets worse: the strand that starts in position 3 has no undercrossings. So when we’re done, it sits on top of every other strand.

It turns out not to be so bad because the three-strand braid sits on top of the four-strand braid, so the central portion of the four-strand braid is not visible in the finished bread. But aesthetically (and mathematically), this feels like a serious flaw to me.

Fortunately, I found an alternate algorithm for four-strand braiding that lacks these flaws: . If , , which is nice. Furthermore, every strand has both overcrossings and undercrossings. So this is my new preferred braid.

Sometimes, however, it is preferable to braid with six strands. There was an article in the newspaper that explained how to do it, but I was unable to follow it. Fortunately, I found a YouTube video that shows someone doing it (possibly the same way; I can’t tell). I was able to transcribe this method in terms of generators of the braid group. However, I’m not quite sure where it is supposed to end, so my braid may be slightly different from the one shown in the video. The braid is the video is , except that it might stop somewhere in the middle of the . I don’t really want to calculate of this braid (computations like this have never been that easy for me), but I would guess that it is a 6-cycle if it stops at an appropriate moment. (Also, it’s not as complicated as the formula would make it seem, since there’s a lot of stuff like moving the strand on the right all the way over to the left, and it takes a lot of generators to express that, even though it’s not complicated when you’re actually braiding dough.)

Recall from the last post that if is a commutative ring, we define to be the Grothendieck group of the isomorphism classes of finitely generated projective -modules. It is natural to ask what happens if we replace finitely generated projective modules with countably generated projective modules. Let us write for this group. It turns out that understanding is extremely easy.

Theorem: For any commutative ring , .

Proof: We have to show that if , , , and are countably generated projective -modules, there is some countably generated projective -module so that . Define . Hence .

A similar construction shows up in the theory of group rings. Here’s an exercise from T.Y. Lam’s Exercises in Classical Ring Theory:

Exercise 8.16: Let and be any two groups. Show that there is some ring so that . (Here is the ring of finite -linear combinations of elements of , and multiplication is defined by the group multiplication of .)

Solution: Let , and set . Then .

Lam makes the comment that, although consideration of the group rings and are very useful for determining properties of (for instance, the modules over these rings are the objects of study in group cohomology and representation theory, respectively), the group ring for an arbitrary ring might not give us much information about .

There’s an interesting article I found on more general Eilenberg swindles, but the authors don’t define progenerators, so I’ll include that here.

Let be a ring and a right -module. Define and . Then and are and bimodules, respectively. Furthermore, we can define multiplications by and by . We say that is a progenerator if and .

In many places in mathematics, we see some variant of the following simple construction. The first time we see it is in constructing the integers from the natural numbers:

Consider pairs of elements of (which includes zero for our purposes, but it doesn’t really matter this time). We form equivalence classes out of these pairs by saying that if . We can create a group structure on these pairs by setting . The resulting group is isomorphic to . So that’s how to construct the integers from the natural numbers.

We see a similar construction when we discuss localizations of rings. Let be a commutative ring and a multiplicative subset containing 1. (If is noncommutative, you can still localize provided that is an Ore set, but I don’t feel like going there now.) We now consider pairs under the equivalence relation if there is some so that . The set of equivalence classes has the structure of a ring, called the localization of at , and denoted by . This construction is generally seen with , where is a prime ideal of . The resulting ring is then local (meaning that it has a unique maximal ideal, namely . (We generally write rather than in this situation.) Anyway, this construction is really useful because localizations at prime ideals are frequently principal ideal domains, and we know all sorts of interesting theorems about finitely generated modules over principal ideal domains. And then we can use some Hasse principle-type result to transfer our results back to the original ring.

Notice that I allowed the multiplicative set of localization to contain zero. However, in this case, the localization becomes the trivial ring (or not a ring, if you require that in your definition of a ring, as many people do). More generally, allowing zero divisors in the multiplicative set causes various elements in to become zero in the localization.

A similar construction shows up in -theory. Suppose is any commutative semigroup. We consider pairs under the equivalence relation if there is some so that . (This is necessary since we do not assume that satisfies the cancellation property.) The resulting equivalence classes form a group called the Grothendieck group of and denoted by .

The Grothendieck group satisfies the following universal property. Let be the map sending to for any . (This is easily seen to be well-defined.) Now let be any abelian group and any semigroup homomorphism. Then there is a (unique) map so that .

Grothendieck groups can be very helpful for studying rings. Let be a commutative ring, and let denote the semigroup of isomorphism classes of projective modules (under the operation of direct sum). Then (or , as people often write) is an important object of study. If is a field, for instance, then . However, if is the ring of integers of a number field , then , where is the ideal class group.

Perhaps more interesting is Swan’s Theorem, which relates vector bundles over a compact topological space to the projective modules over its ring of continuous functions: they have isomorphic Grothendieck groups. But that’s probably the subject of another post, especially if I can manage to understand my notes from Max Karoubi’s lecture series in Edmonton.

This is based on a talk by Zinovy Reichstein from the PIMS Algebra Summer School in Edmonton.

The motivation comes from looking at ways to simplify polynomials. For example, if we start with a quadratic equation , we can remove the linear term by setting ; our equation then becomes .

We can do something similar with any degree polynomial. Consider the polynomial . We may make the substitution to remove the -degree term.

We can also make the coefficients of the linear and constant terms equal with the substitution (where the ’s are the coefficients of the polynomial expressed in terms of ).

Enough for motivation. Suppose is a polynomial, and let . (So, in particular, form a transcendence basis for over .) Let . A Tschirnhaus transformation is an element so that .

Applying a Tschirnhaus transformation to a polynomial of degree gives us another polynomial of degree with different coefficients. They also allow us to simplify polynomial expressions in various senses. We will use the following two criteria of simplification:

1) A simplification involves making as many coefficients as possible 0.

2) A simplification involves making the transcendence degree of over as small as possible. (For a polynomial of degree , we will write for this number.)

Suppose . Hermite showed that it is possible to make and . Therefore . Klein showed that is in fact equal to 2.

Now suppose . Joubert showed that again we can make and . Therefore .

It is unknown whether we can make when . However, it is known that we cannot do so if is of the form for or for . It is also known (Buhler and Reichstein) that .

I have been reading Joseph Silverman’s new book on arithmetic dynamics lately. There’s a lot of really fascinating stuff in there, including a large number of potential research problems that are currently way beyond me, but I’ll continue thinking about them! Most interesting so far is the Uniform Boundedness Conjecture:

Let , , and be integers. Then there exists a constant such that for any number field with and any morphism of degree , the number of preperiodic points of in is at most .

Not much is known about this conjectures; even the case , , and is open. It’s even open if we restrict to morphisms of the form . Bjorn Poonen has shown, however, that these maps have no rational periodic points of exact period 4 or 5; it is conjectured that they have no rational periodic points of exact period greater than 3.

However, there is a positive result of the above type that doesn’t depend that much on some of the above quantities:

Let be a number field and be a rational map over . Let and be prime ideals of so that has good reduction at and (meaning that when we reduce modulo and , we end up with a map of the same degree as ) and whose residue characteristics are distinct. Then the period of any periodic point of in satisfies , where denotes the (absolute) norm.

(See, for instance, my algebraic number theory notes for definitions of some of these terms.)

Anyway, that wasn’t really the point of this post, as you may have guessed from the title. I meant to talk about theorems that pretend not to be related to dynamical systems but actually are. First we need to discuss height functions a bit; there’s a lot more about them in Silverman’s book and in my elliptic curve notes.

We let be a number field and the set of standard absolute values on (These are the absolute values on whose restriction to is either the standard absolute value or one of the -adic absolute values.) We write (where denotes the completion of with respect to the absolute value ). Suppose ; we can then write for some . We then define the height of with respect to to be . One can check that this is well-defined, and that if is a finite extension of number fields and , then . Hence it is possible to define the absolute height of by .

One of the key facts about heights is the following: If and are constants, then is finite. A corollary is the following well-known result of Kronecker:

Let be nonzero. Then if and only if is a root of unity.

Proof: If is a root of unity, then is clear. Now suppose that . For any and , we have , so , so is a set of bounded height and is therefore finite. Therefore there are integers such that , so is a root of unity.

And now for linear algebra. Sheldon Axler has a well-known book on linear algebra without determinants. He therefore uses dynamical systems to show the following familiar result:

Theorem: Every operator on a finite-dimensional nonzero complex vector space has an eigenvalue.

Proof: Let be such a vector space of dimension . Let be an operator on , and let be nonzero. Then cannot be a linearly independent set. Hence there exist , not all zero, so that . Suppose is maximal with respect to . Then . Since we’re working over , the polynomial factors as . We then have . Hence some is not injective. This is an eigenvalue for .