0:006:17

Recursos

Resumen

Suppose someone hands you a possible limit of quartic torus-packet measures. You can now say which step of the proof rules it out, and why. The proof works by elimination: every limit that is not Haar gets excluded.

The setting and the theorem

Start with an invertible ideal of an order 𝒪 in a primitive totally real quartic field. Embed it in ℝ⁴ and rescale it to covolume one. That gives a lattice, and the diagonal group A₄ carries it around a compact orbit (by the unit theorem). Take every class in Pic(𝒪) with every sign pattern and weight each orbit by its volume. The result is the packet measure μ_𝒪 [1:06]. Theorem 1.1: as |Disc 𝒪| → ∞, μ_𝒪 → m₄ (Haar measure) and no mass escapes. Since |Disc 𝒪| = q²D, the field can stay fixed while only the index q grows [1:33].

The lineup: three suspects

  • Escape of mass. Counting short vectors makes the packets tight [2:06].
  • Zero-entropy components. A bound of order r⁴ on small balls, plus covering diagonal tubes by about r⁻³ balls, gives positive entropy in almost every component [2:16].
  • Intermediate homogeneous orbits. Einsiedler–Katok–Lindenstrauss makes the components homogeneous on an orbit ΛJ with J ⊇ A₄. The blocks of J must have equal size, so J is SL₄ (Haar), A₄ (zero entropy) or 2+2 blocks. Since 4 is not prime, the 2+2 case survives rigidity [2:36].

Killing the 2+2 limits with arithmetic

Each 2+2 orbit leaves a fingerprint E_b: an exterior-square vector lying in the plane of one pair split, with a nonzero integer value of Q [3:23]. A primitive field alone does not rule this out. For packet lattices, the three signed opposite products are the embeddings of an element z of the cubic resolvent field F. Lying near a split's plane puts z in a rectangle of area about r⁴ on the plane where the trace equals m. Theorem 5.2 bounds the count by κ√D·area, uniformly in the order, even at primes p | q. So μ(E_b) ≤ Cr⁴ → 0, and μ = m₄ [4:15].

Rule to keep: for any packet-equidistribution claim, check tightness, then entropy, then name the arithmetic count that rules out each intermediate homogeneous limit. Practice it on the three candidates at [5:17].

Equidistribution of quartic torus packets as orders grow

OpenAI Math Preprints

Clase 36 / 100

Ver clases