AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Divisible.MeasureValuation.val_iUnion

theoremverifiedformalizationimported Lean

For a countably-indexed pairwise-disjoint family of measurable sets, MeasureValuation is countably additive (tsum).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MeasureTheory Set in
variable {N Ω : Type*} [MeasurableSpace Ω] (μ : N → MeasureTheory.Measure Ω) in
lemma SocialChoice.FairDivision.Divisible.MeasureValuation.val_iUnion [Countable N] (i : N) (A : Allocation N Ω)
    (hdisj : ∀ j k : N, j ≠ k → Disjoint (A j) (A k))
    (hmeas : ∀ j, MeasurableSet (A j)) :
    (MeasureValuation μ).val i (⋃ j, A j) = ∑' j, (MeasureValuation μ).val i (A j)
Formalizes
EconCSLib, `SocialChoice.FairDivision.Divisible.MeasureValuation.val_iUnion`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MeasureTheory Set in
variable {N Ω : Type*} [MeasurableSpace Ω] (μ : N → MeasureTheory.Measure Ω) in
/-- For a countably-indexed pairwise-disjoint family of measurable sets, `MeasureValuation` is countably additive (tsum). -/
lemma SocialChoice.FairDivision.Divisible.MeasureValuation.val_iUnion [Countable N] (i : N) (A : Allocation N Ω)
    (hdisj : ∀ j k : N, j ≠ k → Disjoint (A j) (A k))
    (hmeas : ∀ j, MeasurableSet (A j)) :
    (MeasureValuation μ).val i (⋃ j, A j) = ∑' j, (MeasureValuation μ).val i (A j) :=
  MeasureTheory.measure_iUnion (fun ⦃j k⦄ hjk => hdisj j k hjk) hmeas
See it in the graphDiscuss this resultChallenge it