Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 7, p. 15 — Fréchet endpoint bounds on every attainable disparity

Proved
FairProxy.ClosedFormDD.eq_13_bounds

by mikedeng1 · Oct 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmic-fairnessdata-combinationdemographic-disparityfrechet-hoeffdingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1partial-identification

For valid observed marginals with both class probabilities positive, every attainable conditional class-weight function w∈W(PD)w\in\mathcal W(\mathcal P_D)w∈W(PD​) has demographic disparity between the two Fréchet endpoint expressions:

μ(a;wL)−μ(b;wU)≤μ(a;w)−μ(b;w)≤μ(a;wU)−μ(b;wL).\mu(a;w^L)-\mu(b;w^U)\le\mu(a;w)-\mu(b;w) \le\mu(a;w^U)-\mu(b;w^L).μ(a;wL)−μ(b;wU)≤μ(a;w)−μ(b;w)≤μ(a;wU)−μ(b;wL).

The lower inequality appears after equation (13) in the proof of Proposition 7; the paper says the upper inequality follows analogously. This gives containment of the identified set in the proposed interval.

Formalization Note The result includes both inequalities, with the group masses positive so μ\muμ has its intended probabilistic meaning.

Preamble
import Mathlib
import Definitions.Def_FairProxy_ClosedFormDD_Model
Formal statement
namespace FairProxy.ClosedFormDD

/-- The lower bound in the proof of Proposition 7, p. 15, after equation (13),
and its stated analogous upper bound. -/
theorem eq_13_bounds {Z : Type*} [MeasurableSpace Z]
    (M : Marginals Z) (hM : M.Valid)
    (ha : 0 < probA M .a) (hb : 0 < probA M .b)
    (w : Cls → Fin 2 → Z → ℝ) (hw : w ∈ WPD M) :
    mu M .a (wL M) - mu M .b (wU M) ≤ mu M .a w - mu M .b w ∧
      mu M .a w - mu M .b w ≤
        mu M .a (wU M) - mu M .b (wL M) := by sorry

end FairProxy.ClosedFormDD
Source
Kallus, Mao & Zhou, Assessing Algorithmic Fairness with Unobserved Protected Class Using Data Combination, arXiv:1906.00285v2, p. 15, proof of Proposition 7, after Eq. (13)
Human review
  • Endorsed by Shuze Chen · Oct 19, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 19, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me