(Standard post on cardinals, as a prerequisite for forthcoming theory model post.)
An ordinal measures a total ordering. However, it does not do a fantastic job at measuring size.
For example, there is a bijection between the elements of ω and ω+1:
ω+1=ω={{ω0011223……}}.
In fact, as you likely already know, there is even a bijection between ω and ω2:
This one confused me for a long time, so I figured I should write this down before I forgot again.
Let M be an abstract smooth manifold.
We want to define the notion of a tangent vector to M at a point p∈M.
With that, we can define the tangent spaceTp(M),
which will just be the (real) vector space of tangent vectors at p.
Geometrically, we know what this should look like for our usual examples.
For example, if M=S1 is a circle embedded in R2,
then the tangent vector at a point p should just look like a vector running off tangent to the circle.
My favorite circle associated to a triangle is the A-mixtilinear incircle.
While it rarely shows up on olympiads, it is one of the richest configurations I have seen,
with many unexpected coincidences showing up,
and I would be overjoyed if they become fashionable within the coming years.
Here’s the picture:
The A-mixtilinear incircle.
The points D and E are the contact points of the incircle and A-excircle on the side BC.
Points MA, MB, MC are the midpoints of the arcs.
As a challenge to my recent USAMO class
(I taught at A* Summer Camp this year),
I asked them to find as many “coincidences” in the picture as I could …
Given a property P about primes, there’s two questions we can ask:
How many primes ≤x are there with this property?
What’s the least prime with this property?
As an example, consider an arithmetic progression a, a+d, …, with a<d and gcd(a,d)=1.
The strong form of Dirichlet’s Theorem tells us that basically,
the number of primes ≡a(modd) is d1 the total number of primes.
Moreover, the celebrated Linnik’s
Theorem tells us that the
first prime is
In this post I will sketch a proof Dirichlet Theorem’s in the following form:
Theorem 1(Dirichlet’s Theorem on Arithmetic Progression)
Let
ψ(x;q,a)=n≤xn≡amodq∑Λ(n).
Let N be a positive constant.
Then for some constant C(N)>0 depending on N, we have for any q such that q≤(logx)N we have
Prerequisites for this post: previous post,
and complex analysis. For this entire post, s is a complex variable with s=σ+it.
1. The Γ function
So there’s this thing called the Gamma function.
Denoted Γ(s), it is defined by
Γ(s)=∫0∞xs−1e−xdx
as long as σ>0. Here are its values at the first few integers:
Normally I don’t like to blog about something until I’m pretty confident that I
have a reasonably good understanding of what’s happening, but I desperately need to sort out my thoughts,
so here I go…
1. Primes
One day, an alien explorer lands on Earth in a 3rd grade classroom.
He hears the teacher talk about these things called primes.
So he goes up to the teacher and asks “how many primes are there less than x?”.
Answer: “uh. . .”.
Maybe that’s too hard, so the alien instead asks “about how many primes are there less than x?”.
This is again greeted with silence.
Confused, the alien asks a bunch of the teachers, who all respond similarly,
but then someone mentions that in the last couple hundred years,
someone …
This is a draft of an appendix chapter for my Napkin project.
In the world of olympiad math, there’s a famous functional equation that goes as follows:
f:R→Rf(x+y)=f(x)+f(y).
Everyone knows what its solutions are! There’s an obvious family of solutions f(x)=cx.
Then there’s also this family of… uh…
noncontinuous solutions (mumble grumble) pathological (mumble mumble) Axiom of Choice (grumble).
Don’t worry, I know what I’m doing!
There’s also this thing called Zorn’s Lemma.
It sounds terrifying, because it’s equivalent to the Axiom of Choice,
which is also terrifying because why not.
Good luck to everyone taking the January TST for the IMO 2015 tomorrow!
Now that we have products of irreducibles under our belt,
I’ll talk about the finite regular representation and use it to derive the
following two results about irreducibles.
The number of (isomorphsim classes) of irreducibles ρα is equal
to the number of conjugacy classes of G.
We have ∣G∣=∑α(dimρα)2.
These will actually follow as corollaries from the complete decomposition of the
finite regular representation.
In what follows k is an algebraically closed field, G is a finite group,
and the characteristic of k does not divide ∣G∣.
As a reminder, here are the …