vEnhance's avatar
Previous Next #math Page 6 of 7

Nov 16, 2015

🖉 Cardinals

(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 ω\omega and ω+1\omega+1:

ω+1={ω012}ω={0123}. \begin{array}{rccccccc} \omega+1 = & \{ & \omega & 0 & 1 & 2 & \dots & \} \\ \omega = & \{ & 0 & 1 & 2 & 3 & \dots & \}. \end{array}

In fact, as you likely already know, there is even a bijection between ω\omega and ω2\omega^2:

+012340013610ω24711ω25812ω3913ω414 \begin{array}{l|cccccc} + & 0 & 1 & 2 & 3 & 4 & \dots …

Read more...

Oct 04, 2015

🖉 Constructing the Tangent and Cotangent Space

This one confused me for a long time, so I figured I should write this down before I forgot again.

Let MM be an abstract smooth manifold. We want to define the notion of a tangent vector to MM at a point pMp \in M. With that, we can define the tangent space Tp(M)T_p(M), which will just be the (real) vector space of tangent vectors at pp.

Geometrically, we know what this should look like for our usual examples. For example, if M=S1M = S^1 is a circle embedded in R2\mathbb R^2, then the tangent vector at a point pp should just look like a vector running off tangent to the circle.

Tangent space to a circle.
Tangent space to a circle.

Similarly, given a …

Read more...

Sep 05, 2015

🖉 Some Notes on Valuations

There are some notes on valuations from the first lecture of Math 223a at Harvard.

1. Valuations

Let kk be a field.

Definition 1. A valuation :kR0\left\lvert - \right\rvert : k \rightarrow \mathbb R_{\ge 0} is a function obeying the axioms

  • α=0    α=0\left\lvert \alpha \right\rvert = 0 \iff \alpha = 0.
  • αβ=αβ\left\lvert \alpha\beta \right\rvert = \left\lvert \alpha \right\rvert \left\lvert \beta \right\rvert.
  • Most importantly: there should exist a real constant CC, such that 1+α<C\left\lvert 1+\alpha \right\rvert < C whenever α1\left\lvert \alpha \right\rvert \le 1.

The third property is the interesting one. Note in particular it can be rewritten as a+b<Cmax{a,b …

Read more...

Aug 11, 2015

🖉 The Mixtilinear Incircle

This blog post corresponds to my newest olympiad handout on mixtilinear incircles.

My favorite circle associated to a triangle is the AA-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 A-mixtilinear incircle.

The points DD and EE are the contact points of the incircle and AA-excircle on the side BCBC. Points MAM_A, MBM_B, MCM_C 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 …

Read more...

Jul 05, 2015

🖉 Linnik's Theorem for Sato-Tate Laws on CM Elliptic Curves

Here I talk about my first project at the Emory REU. Prerequisites for this post: some familiarity with number fields.

1. Motivation: Arithmetic Progressions

Given a property PP about primes, there’s two questions we can ask:

  1. How many primes x\le x are there with this property?
  2. What’s the least prime with this property?

As an example, consider an arithmetic progression aa, a+da+d, …, with a<da < d and gcd(a,d)=1\gcd(a,d) = 1. The strong form of Dirichlet’s Theorem tells us that basically, the number of primes a(modd)\equiv a \pmod d is 1d\frac 1d the total number of primes. Moreover, the celebrated Linnik’s Theorem tells us that the first prime is O(d …

Read more...

Jun 12, 2015

🖉 Proof of Dirichlet's Theorem on Arithmetic Progressions

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)=nxnamodqΛ(n).\psi(x;q,a) = \sum_{\substack{n \le x \\ n \equiv a \mod q}} \Lambda(n). Let NN be a positive constant. Then for some constant C(N)>0C(N) > 0 depending on NN, we have for any qq such that q(logx)Nq \le (\log x)^N we have ψ(x;q,a)=1ϕ(q)x+O(xexp(C(N)logx))\psi(x;q,a) = \frac{1}{\phi(q)} x + O\left( x\exp\left(-C(N) \sqrt{\log …

Read more...

May 29, 2015

🖉 Zeros and Primes

Prerequisites for this post: previous post, and complex analysis. For this entire post, ss is a complex variable with s=σ+its = \sigma + it.

1. The Γ\Gamma function

So there’s this thing called the Gamma function. Denoted Γ(s)\Gamma(s), it is defined by Γ(s)=0xs1exdx\Gamma(s) = \int_0^{\infty} x^{s-1} e^{-x} dx as long as σ>0\sigma > 0. Here are its values at the first few integers:

Γ(1)=1Γ(2)=1Γ(3)=2Γ(4)=6Γ(5)=24. \begin{aligned} \Gamma(1) &= 1 \\ \Gamma(2) &= 1 \\ \Gamma(3) &= 2 \\ \Gamma(4) &= 6 \\ \Gamma(5) &= 24. \end{aligned}

Read more...

May 25, 2015

🖉 von Mangoldt and Zeta

Prerequisites for this post: definition of Dirichlet convolution, and big OO-notation.

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 xx?”.

Answer: “uh. . .”.

Maybe that’s too hard, so the alien instead asks “about how many primes are there less than xx?”.

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 …

Read more...

Apr 10, 2015

🖉 Cauchy's Functional Equation and Zorn's Lemma

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:RRf(x+y)=f(x)+f(y).f : {\mathbb R} \rightarrow {\mathbb R} \qquad f(x+y) = f(x) + f(y). Everyone knows what its solutions are! There’s an obvious family of solutions f(x)=cxf(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!
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.

In this post I will try to de-terrify …

Read more...

Jan 21, 2015

🖉 Representation Theory, Part 4: The Finite Regular Representation

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.

  1. The number of (isomorphsim classes) of irreducibles ρα\rho_\alpha is equal to the number of conjugacy classes of GG.
  2. We have G=α(dimρα)2\left\lvert G \right\rvert = \sum_\alpha \left( \dim \rho_\alpha \right)^2.

These will actually follow as corollaries from the complete decomposition of the finite regular representation.

In what follows kk is an algebraically closed field, GG is a finite group, and the characteristic of kk does not divide G\left\lvert G \right\rvert. As a reminder, here are the …

Read more...
Previous Next #math Page 6 of 7