Recently in Measure Theory we needed the following lemma.
Lemma: Let be non-constant, right-continuous and non-decreasing, and let . Define by . Then is left-continuous and non-decreasing. Moreover, for and ,
If you’re categorically minded, this last condition should remind you of the definition of a pair of adjoint functors. In fact it is possible to interpret the above lemma this way; it is a special case of the adjoint functor theorem for posets. Today I’d like to briefly explain this. (And who said category theory isn’t useful in analysis?)
The usual caveats regarding someone who’s never studied category talking about it apply. I welcome any corrections.
Read Full Post »
Posted in math.NT on October 15, 2010 |
5 Comments »
Another small example I noticed awhile ago and forgot to write up.
Prime numbers, as one of the most fundamental concepts in mathematics, have a way of turning up in unexpected places. For example, the life cycles of some cicadas are either or years. It’s thought that this is a response to predation by predators with shorter life cycles; if your life cycle is prime, a predator with any shorter life cycle can’t reliably predate upon you.
A month or so ago I noticed a similar effect happening in the card game BS. In BS, some number of players (usually about four) are dealt the same number of cards from a standard deck without jokers. Beginning with one fixed card, such as the two of clubs, players take turns placing some number of cards face-down in the center. The catch is that the players must claim that they are placing down some number of a specific card; Player 1 must claim that they are placing down twos, Player 2 must claim that they are placing down threes, and so forth until we get to kings and start over. Any time cards are played, another player can accuse the current player of lying. If the accusation is right, the lying player must pick up the pile in the center. If it is wrong, the accusing player must pick up the pile in the center. The goal is to get rid of all of one’s cards.
I’ve been playing this game for years, but I didn’t notice until quite recently that the reason the game terminates in practice is that , the number of types of cards in a standard deck, is prime. If, for example, we stopped playing with aces and only used types of cards, then a game with people need not terminate. Consider a game in which Player 1 has only cards , Player 2 has only cards , Player 3 has only cards , and Player 4 has only cards , and suppose that Player 1 has to play threes at some point in the game. Then no player can get rid of their cards without lying; since the number of players divides the number of card types, every player will always be asked to play a card they don’t have. Once every player is aware of this, every player can call out every other player’s lies, and it will become impossible to end the game reasonably.
More generally, such situations can occur if is replaced by a composite number such that the number of players is at least the smallest prime factor of . This is because people who get rid of their cards will leave the game until the number of players is equal to the smallest prime factor of , at which point the game may stall. But because is prime, any game played with less than people has the property that each player will eventually be asked to play a card that they have.
Read Full Post »
Posted in math.NT on October 13, 2010 |
3 Comments »
In the first few lectures of Graph Theory, the lecturer (Paul Russell) presented a cute application of Ramsey theory to Fermat’s Last Theorem. It makes a great introduction to the general process of casting a problem in one branch of mathematics as a problem in another and is the perfect size for a blog post, so I thought I’d talk about it.
The setup is as follows. One naive way to go about proving the nonexistence of nontrivial integer solutions to (that is, solutions such that are not equal to zero) is using modular arithmetic; that is, one might hope that for every it might be possible to find a modulus such that the equation has no nontrivial solution . To simplify matters, we’ll assume that are relatively prime to , or else there is some subtlety in the definition of “nontrivial” (e.g. we might have not divisible by but .) Note that it might be the case that is not relatively prime to a particular nontrivial solution in the integers, but if we can prove non-existence of nontrivial solutions for infinitely many (in particular, such that any integer is relatively prime to at least one such ) then we can conclude that no nontrivial integer solutions exist.
By the Chinese Remainder Theorem, this is possible if and only if it is possible with a prime power, say . If is relatively prime to , this is possible if and only if it is possible with . This is because given a nontrivial solution we can use Hensel’s lemma to lift it to a nontrivial solution for any (and even to ), and the converse is obvious. (Again to simplify matters, we’ll ignore the finitely many primes that divide .) So we are led to the following question.
For a fixed positive integer do there exist infinitely many primes relatively prime to such that has no nontrivial solutions?
As it turns out, the answer is no. In 1916 Schur found a clever way to prove this by proving the following theorem.
Theorem: For every positive integer there exists a positive integer such that if is partitioned into disjoint subsets , then there exists such that there exist with . In other words, the Schur number exists. (Note that I am using a convention which is off by .)
If we let be a prime greater than and let the be the cosets of the subgroup of powers in , which has index at most , we obtain the following as a corollary.
Corollary: Fix a positive integer . For any sufficiently large prime , there exists a nontrivial solution to .
Read Full Post »