Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Barycentric formulas for one- and two-vertex probability masses

Definition
AT260939824_ProbabilityTwoVertices

by username · Oct 19, 2026 · Mathlib c5ea003 (Lean v4.30.0)

arxiv-2609-39824-positive

For a finite set VVV, a probability mass μ\muμ supported on a singleton {v}\{v\}{v} equals δv\delta_vδv​. If v≠wv\ne wv=w and μ\muμ is supported on {v,w}\{v,w\}{v,w}, then

μ(v)+μ(w)=1,μ=(1−μ(w))δv+μ(w)δw.\mu(v)+\mu(w)=1,\qquad \mu=(1-\mu(w))\delta_v+\mu(w)\delta_w.μ(v)+μ(w)=1,μ=(1−μ(w))δv​+μ(w)δw​.

For any coordinate function c:V→Rc:V\to\mathbb Rc:V→R, define the weighted coordinate and its finite bound by

xc(μ)=∑uμ(u)c(u),Cc=∑u∣c(u)∣.x_c(\mu)=\sum_u\mu(u)c(u),\qquad C_c=\sum_u|c(u)|.xc​(μ)=u∑​μ(u)c(u),Cc​=u∑​∣c(u)∣.

On a two-vertex support, xc(μ)=μ(v)c(v)+μ(w)c(w)x_c(\mu)=\mu(v)c(v)+\mu(w)c(w)xc​(μ)=μ(v)c(v)+μ(w)c(w). These formulas recover interval parameters from mass coordinates.

Definition code
import Definitions.Def_AT260939824_Actions
import Definitions.Def_AT260939824_CarrierCellRealization
import Definitions.Def_AT260939824_CarrierGeometry
import Definitions.Def_AT260939824_CompressedWords
import Definitions.Def_AT260939824_DigitPathRealization
import Definitions.Def_AT260939824_FixedSlotInterpolation
import Definitions.Def_AT260939824_IntervalCarriers
import Definitions.Def_AT260939824_Probability
import Definitions.Def_AT260939824_RelativePathContraction
import Definitions.Def_AT260939824_Rounding
import Definitions.Def_AT260939824_SupportGeometry
import Definitions.Def_AT260939824_SupportModel
import Init
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Algebra.Group.Action.Basic
import Mathlib.Algebra.Group.Conj
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Analysis.Convex.Basic
import Mathlib.Analysis.Normed.Affine.AddTorsor
import Mathlib.Analysis.Normed.Module.RCLike.Real
import Mathlib.Combinatorics.SimpleGraph.Basic
import Mathlib.Combinatorics.SimpleGraph.Maps
import Mathlib.Combinatorics.SimpleGraph.Walk.Maps
import Mathlib.Data.Finset.Max
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.Union
import Mathlib.Data.Fintype.Card
import Mathlib.Data.Int.Interval
import Mathlib.Data.List.Basic
import Mathlib.Data.Nat.Log
import Mathlib.Data.Real.Basic
import Mathlib.Tactic.FunProp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Mathlib.Topology.Algebra.MulAction
import Mathlib.Topology.Compactness.Compact
import Mathlib.Topology.Constructions
import Mathlib.Topology.Homotopy.Path
import Mathlib.Topology.Instances.Real.Lemmas
import Mathlib.Topology.MetricSpace.Basic
import Mathlib.Topology.MetricSpace.Isometry
import Mathlib.Topology.MetricSpace.Lipschitz
import Mathlib.Topology.MetricSpace.Polish
import Mathlib.Topology.MetricSpace.Pseudo.Pi
import Mathlib.Topology.Path
import Mathlib.Topology.Separation.Basic
import Mathlib.Topology.Separation.Profinite
import Mathlib.Topology.UniformSpace.HeineCantor
import Mathlib.Topology.UnitInterval

set_option autoImplicit false

/-! Exact barycentric coordinates on an edge, used to invert the literal
height-zero carrier parametrization. -/

namespace AbelianTargets.Probability
noncomputable section
open scoped BigOperators unitInterval NNReal
variable {V : Type*} [Fintype V]

def weightedCoordinate (c : V → ℝ) (p : Probability V) : ℝ := ∑ u,p.mass u*c u

def weightedCoordinateConstant (c : V → ℝ) : ℝ≥0 :=
  ⟨∑ u,|c u|,Finset.sum_nonneg (fun u _ => abs_nonneg _)⟩



theorem mass_pair_sum (p : Probability V) (v w : V) (hne : v ≠ w)
    (hp : p.SupportedOn ({v,w} : Set V)) : p.mass v+p.mass w=1 := by
  classical
  have hsum : ∑ u ∈ ({v,w} : Finset V),p.mass u = ∑ u,p.mass u := by
    apply Finset.sum_subset (Finset.subset_univ _)
    intro u hu hn
    apply (supportedOn_iff_zero.mp hp) u
    simpa using hn
  simpa [hne] using hsum.trans p.sum_one

theorem eq_mix_dirac_of_pair (p : Probability V) (v w : V) (hne : v ≠ w)
    (hp : p.SupportedOn ({v,w} : Set V)) :
    p = mix (dirac v) (dirac w) ⟨p.mass w,p.nonneg w,p.mass_le_one w⟩ := by
  classical
  have hs := p.mass_pair_sum v w hne hp
  ext u
  by_cases huv : u=v
  · subst u
    simp [mix_mass,dirac_mass,hne]
    linarith
  · by_cases huw : u=w
    · subst u
      simp [mix_mass,dirac_mass,hne.symm]
    · have hz : p.mass u=0 := (supportedOn_iff_zero.mp hp) u (by simp [huv,huw])
      simp [mix_mass,dirac_mass,huv,huw,hz]

theorem eq_dirac_of_singleton (p : Probability V) (v : V)
    (hp : p.SupportedOn ({v} : Set V)) : p=dirac v := by
  classical
  have hs : p.mass v=1 := by
    have hsum : ∑ u ∈ ({v} : Finset V),p.mass u = ∑ u,p.mass u := by
      apply Finset.sum_subset (Finset.subset_univ _)
      intro u hu hn
      apply (supportedOn_iff_zero.mp hp) u
      simpa using hn
    simpa using hsum.trans p.sum_one
  ext u
  by_cases hu : u=v
  · subst u
    simp [dirac_mass,hs]
  · have hz := (supportedOn_iff_zero.mp hp) u (by simp [hu])
    simp [dirac_mass,hu,hz]

theorem weighted_pair_sum (p : Probability V) (v w : V) (hne : v ≠ w)
    (hp : p.SupportedOn ({v,w} : Set V)) (c : V → ℝ) :
    ∑ u,p.mass u*c u=p.mass v*c v+p.mass w*c w := by
  classical
  have hsum : ∑ u ∈ ({v,w} : Finset V),p.mass u*c u = ∑ u,p.mass u*c u := by
    apply Finset.sum_subset (Finset.subset_univ _)
    intro u hu hn
    have hz := (supportedOn_iff_zero.mp hp) u (by simpa using hn)
    simp [hz]
  simpa [hne] using hsum.symm





end
end AbelianTargets.Probability
Source
Ruijun Wang, Continuous graph homomorphisms of higher dimensional abelian group actions, arXiv:2609.39824v1 (30 September 2026), Sections 2–7, supporting construction for Theorem 1.4 and Proposition 7.1; https://arxiv.org/html/2609.39824v1. Formalization-specific infrastructure in the import closure; individual helper assertions are not represented as separately numbered paper theorems. Original Lean module AbelianTargets/ProbabilityTwoVertices.lean, selected declaration lines 11, 13-14, 32-40, 42-56, 58-73, 75-84; SHA-256 b519bc40567569c7d4afc3111657083941f20b383c0e75e0590b1a9d4542eaf9. Selected spans are from the final generated manifest. The original source snapshot is local; no public repository URL or commit was available.

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