Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

OAI.DukePrimeDegree.prime_degree_packet_measure_equidistribution_unconditional

Open

by wurtle · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

The theorem states that, for a natural number d with d+1 prime and d+1 at least 5, and a sequence of totally real number fields K_i, each of degree d+1 over the rationals, with a full lattice M_i in K_i (a rank d+1 free subgroup, given with a basis, that spans K_i over the rationals) and an ordering σ_i of the d+1 real embeddings of K_i, whose multiplier discriminant tends to infinity as i grows, there exists a measure ν on the space X(d+1) = SL_{d+1}(R)/SL_{d+1}(Z) (as a right-coset quotient with the Borel structure) such that three things hold. First, ν is a Haar probability measure: a probability measure invariant under the right action of every element of SL_{d+1}(R). Second, the packet measures packetMeasure(M_i, σ_i) converge weakly to ν, meaning each is a probability measure and the integral of every bounded continuous real function converges to its integral against ν. Third, the set of these packet measures is tight. Here the multiplier discriminant is |disc K_i| times the square of the index of the multiplier order of M_i in the integral elements of K_i. The packet measure of M is a normalized, volume-weighted average of the probability measures on the diagonal-flow orbits through the normalized embedded lattices of all lattices locally homothetic to M at every prime, each twisted by diagonal sign matrices.

Preamble
-- Generated from openai/math @ adc7f1241b42e322a6451854ab7e4b4c146bf78a
-- Source: lean/ComparatorChallenges/DukePrimeDegree.lean; bytes 8004..8840
-- Kind: theorem; original declaration names and bodies preserved.
-- Source groups are independent. Target: Lean 4.33.1; see compilation.json.

import Mathlib
import Definitions.Def_DukePrimeDegree

namespace OAI

open MeasureTheory Filter

open scoped Topology

namespace DukePrimeDegree

open PrimeDegreePackets

universe u

Formal statement
/-- Theorem 1.1 as weak convergence of the actual complete packet measures,
including tightness of the entire family. -/
theorem prime_degree_packet_measure_equidistribution_unconditional
    (d : ℕ) (hprime : Nat.Prime (d+1)) (hfive : 5 ≤ d+1)
    (K : ℕ → Type u) [∀ i, Field (K i)] [∀ i, NumberField (K i)]
    [∀ i, NumberField.IsTotallyReal (K i)]
    (M : ∀ i, PrimeDegreePackets.FullLattice (d+1) (K i))
    (σ : ∀ i, OrderedEmbeddings (d+1) (K i))
    (hn : ∀ i, Module.finrank ℚ (K i)=d+1)
    (hD : Tendsto (fun i => PrimeDegreePackets.multiplierDiscriminant (M i)) atTop atTop) :
    ∃ ν : Measure (X (d+1)), IsHaarProbability ν ∧
      WeakProbabilityConvergence (fun i => packetMeasure (M i) (σ i)) ν ∧
      IsTightMeasureSet (Set.range (fun i => packetMeasure (M i) (σ i))) := by
  sorry

end DukePrimeDegree
end OAI
Source
https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/ComparatorChallenges/DukePrimeDegree.lean
Human review
  • Endorsed by Community (Bot) · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by marwahaha · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me