Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Measure of finitely many disjoint translates

Proved
MeasureTheory.Measure.measure_biUnion_sub_mem

by riccardo.brasca · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theorytauceti-chebotarev

Let EEE be an additive group with a measurable structure and measurable addition, and let μ\muμ be a right-translation-invariant measure. Let F⊆EF\subseteq EF⊆E be measurable and suppose its translates F+wF+wF+w for www in a set AAA are pairwise disjoint. For every finite subset T⊆AT\subseteq AT⊆A,

μ ⁣(⋃w∈T(F+w))=∣T∣ μ(F).\mu\!\left(\bigcup_{w\in T}(F+w)\right)=|T|\,\mu(F).μ(w∈T⋃​(F+w))=∣T∣μ(F).

This computes the measure of a finite disjoint family of congruent measurable pieces, without assuming finite measure.

Source and proof credit: the Tau Ceti contributors, original declaration and proof, Apache-2.0, commit 948fe4751b1fe528b6d580c522ca5d743d47f185; adapted to Lean 4.33.1.

Preamble
/- Transplanted from https://github.com/TauCetiProject/TauCeti at 948fe4751b1fe528b6d580c522ca5d743d47f185.
Original source copyright/license notices are retained below.
Generated exclusively from compiler declaration, command, and reference facts. -/
import Mathlib.MeasureTheory.Group.Measure

section
set_option autoImplicit true
/-
Copyright (c) 2026 The Tau Ceti contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: The Tau Ceti contributors
-/
/-!
# Measures invariant under addition

This file records measure formulas for finite families of disjoint additive translates.  In
lattice-point counting, the formula turns disjoint translates of a fundamental-domain cell into
measure bounds that can be compared with the number of cells.

## Main results

* `Measure.measure_biUnion_sub_mem`: a finite disjoint union of translates has measure
  equal to the number of translates times the measure of the original set.
-/

 section

open MeasureTheory Set

namespace TauCeti
end TauCeti
section TauCeti
open TauCeti

variable {E : Type*} [AddGroup E] [MeasurableSpace E] [MeasurableAdd E]


Formal statement
theorem MeasureTheory.Measure.measure_biUnion_sub_mem
    (mu : _root_.MeasureTheory.Measure E) [mu.IsAddRightInvariant]
    {G F : _root_.Set E} (hFm : _root_.MeasurableSet F)
    (hdisj : ∀ w₁ ∈ G, ∀ w₂ ∈ G, w₁ ≠ w₂ →
      _root_.Disjoint {y : E | y - w₁ ∈ F} {y : E | y - w₂ ∈ F})
    {T : _root_.Finset E} (hT : ↑T ⊆ G) :
    mu (⋃ w ∈ T, {y : E | y - w ∈ F}) = T.card * mu F := by sorry
Source
https://github.com/TauCetiProject/TauCeti/blob/948fe4751b1fe528b6d580c522ca5d743d47f185/TauCeti/MeasureTheory/Group/Measure.lean#L31-L53

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me