Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Agreement of relation-cell charts with the graph skeleton

Definition
AT260939824_SupportCellRestrictions

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

arxiv-2609-39824arxiv-2609-39824-positivecombinatoricslean-formalizationtopology

Fix support-torsion data for a graph HHH and a fan triangle of an odd relation cell. At each triangle vertex, the cell chart takes the base support pair with shore swap determined by the vertex's horizontal parity. If a probability distribution is supported on a lower, upper, left, or right boundary edge, the cell chart equals the skeleton formula.

The general pair restriction covers any adjacent graph vertices lying in a fan triangle, in either order. These identities are the boundary compatibility required to glue relation-cell interiors to the carrier graph skeleton, including distributions whose positive support reduces to one endpoint.

Definition code
import Definitions.Def_AT260939824_Actions
import Definitions.Def_AT260939824_BottomEdgeSplice
import Definitions.Def_AT260939824_CarrierCellRealization
import Definitions.Def_AT260939824_CarrierFanMoves
import Definitions.Def_AT260939824_CarrierGeometry
import Definitions.Def_AT260939824_CarrierTriangulation
import Definitions.Def_AT260939824_CompressedWords
import Definitions.Def_AT260939824_DigitPathRealization
import Definitions.Def_AT260939824_DoubleCoverLifts
import Definitions.Def_AT260939824_EndpointCorrection
import Definitions.Def_AT260939824_EquivariantCellCharts
import Definitions.Def_AT260939824_FixedSlotInterpolation
import Definitions.Def_AT260939824_IntervalCarriers
import Definitions.Def_AT260939824_ParitySwapGeometry
import Definitions.Def_AT260939824_Probability
import Definitions.Def_AT260939824_ProbabilityMap
import Definitions.Def_AT260939824_ProbabilityParameters
import Definitions.Def_AT260939824_ProbabilityTwoVertices
import Definitions.Def_AT260939824_RectangleHalfGluing
import Definitions.Def_AT260939824_ReducedWalks
import Definitions.Def_AT260939824_RelativePathContraction
import Definitions.Def_AT260939824_Rounding
import Definitions.Def_AT260939824_SegmentedOddPath
import Definitions.Def_AT260939824_SimplicialSupport
import Definitions.Def_AT260939824_SupportGeometry
import Definitions.Def_AT260939824_SupportModel
import Definitions.Def_AT260939824_SupportPathClasses
import Definitions.Def_AT260939824_SupportSkeletonMap
import Definitions.Def_AT260939824_SupportWitness
import Definitions.Def_AT260939824_TopologicalWalks
import Definitions.Def_AT260939824_TriangleChartIntersections
import Definitions.Def_AT260939824_VariableRowFamilies
import Definitions.Def_AT260939824_WordPathHelpers
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.Algebra.Ring.Parity
import Mathlib.AlgebraicTopology.FundamentalGroupoid.Basic
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.Bipartite
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.List.Chain
import Mathlib.Data.Nat.Log
import Mathlib.Data.Real.Basic
import Mathlib.Data.ZMod.Basic
import Mathlib.GroupTheory.OrderOfElement
import Mathlib.Tactic.FieldSimp
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

namespace AbelianTargets.SupportTorsionData
noncomputable section
open scoped unitInterval
variable {W : Type*} [Fintype W] {H : SimpleGraph W} (D : SupportTorsionData H)
variable {V : Type*} [Fintype V]

theorem cellChart_vertex (f : V → IntervalCarriers.Vertex) (c : IntervalCarriers.Vertex)
    (s : Finset IntervalCarriers.Vertex) (hs : IntervalCarriers.IsFanTriangle (2*D.power+1) c s)
    (v : V) (hv : f v∈s) :
    D.cellChart f c (Probability.dirac v)=SupportPair.paritySwap H (f v).1 D.base := by
  classical
  rcases hs with rfl | ⟨n,hn,rfl⟩
  · simp only [IntervalCarriers.upperTriangle,Finset.mem_insert,Finset.mem_singleton] at hv
    rcases hv with hv | hv | hv
    · exact D.cellChart_upperLeft_vertex f c v hv
    · exact D.cellChart_lower_vertex f c _ le_rfl v hv
    · exact D.cellChart_upperRight_vertex f c v hv
  · simp only [IntervalCarriers.lowerTriangle,Finset.mem_insert,Finset.mem_singleton] at hv
    rcases hv with hv | hv | hv
    · exact D.cellChart_upperLeft_vertex f c v hv
    · exact D.cellChart_lower_vertex f c n (by omega) v hv
    · exact D.cellChart_lower_vertex f c (n+1) (by omega) v hv

theorem cellChart_supported_lower_edge (f : V → IntervalCarriers.Vertex) (c : IntervalCarriers.Vertex)
    (n : ℕ) (hn : n<2*D.power+1) (p : Probability V) (l r : V)
    (hp : p.SupportedOn ({l,r}:Set V))
    (hl : f l=IntervalCarriers.lowerVertex (2*D.power+1) c.1 c.2 n)
    (hr : f r=IntervalCarriers.lowerVertex (2*D.power+1) c.1 c.2 (n+1)) :
    D.cellChart f c p=D.skeletonMap f p := by
  have hs : IntervalCarriers.HorizontalStep (2*D.power+1) (f l) (f r) := by
    rw [hl,hr]; exact IntervalCarriers.lowerVertex_step _ _ _ _
  have hne : l≠r := by
    intro he; subst r
    exact (IntervalCarriers.horizontal_adj (by omega) hs).ne rfl
  rw [D.skeletonMap_horizontal f p l r hp hs]
  conv_lhs => rw [p.eq_mix_dirac_of_pair l r hne hp]
  exact D.cellChart_lower_edge f c n hn l r hl hr _

theorem cellChart_supported_upper_edge (f : V → IntervalCarriers.Vertex) (c : IntervalCarriers.Vertex)
    (p : Probability V) (u v : V) (hp : p.SupportedOn ({u,v}:Set V))
    (hu : f u=IntervalCarriers.upperLeft c.1 c.2)
    (hv : f v=IntervalCarriers.upperRight (2*D.power+1) c.1 c.2) :
    D.cellChart f c p=D.skeletonMap f p := by
  have hs : IntervalCarriers.HorizontalStep (2*D.power+1) (f u) (f v) := by rw [hu,hv]; rfl
  have hne : u≠v := by
    intro he; subst v
    exact (IntervalCarriers.horizontal_adj (by omega) hs).ne rfl
  rw [D.skeletonMap_horizontal f p u v hp hs]
  conv_lhs => rw [p.eq_mix_dirac_of_pair u v hne hp]
  exact D.cellChart_upper_edge f c u v hu hv _

theorem cellChart_supported_left_edge (f : V → IntervalCarriers.Vertex) (c : IntervalCarriers.Vertex)
    (p : Probability V) (l u : V) (hp : p.SupportedOn ({l,u}:Set V))
    (hl : f l=IntervalCarriers.lowerVertex (2*D.power+1) c.1 c.2 0)
    (hu : f u=IntervalCarriers.upperLeft c.1 c.2) :
    D.cellChart f c p=D.skeletonMap f p := by
  have hc : (f l).1=(f u).1 := by simp [hl,hu,IntervalCarriers.lowerVertex,IntervalCarriers.upperLeft]
  have hne : l≠u := by
    intro he; subst u
    have hh := congrArg Prod.snd (hl.symm.trans hu)
    simp [IntervalCarriers.lowerVertex,IntervalCarriers.upperLeft] at hh
  rw [D.skeletonMap_vertical f p l u hp hc]
  conv_lhs => rw [p.eq_mix_dirac_of_pair l u hne hp]
  exact D.cellChart_left_edge f c l u hl hu _

theorem cellChart_supported_right_edge (f : V → IntervalCarriers.Vertex) (c : IntervalCarriers.Vertex)
    (p : Probability V) (l v : V) (hp : p.SupportedOn ({l,v}:Set V))
    (hl : f l=IntervalCarriers.lowerVertex (2*D.power+1) c.1 c.2 (2*D.power+1))
    (hv : f v=IntervalCarriers.upperRight (2*D.power+1) c.1 c.2) :
    D.cellChart f c p=D.skeletonMap f p := by
  have hc : (f l).1=(f v).1 := by
    rw [hl,hv]
    dsimp [IntervalCarriers.lowerVertex,IntervalCarriers.upperRight]
    rw [pow_succ,mul_comm]
  have hne : l≠v := by
    intro he; subst v
    have hh := congrArg Prod.snd (hl.symm.trans hv)
    simp [IntervalCarriers.lowerVertex,IntervalCarriers.upperRight] at hh
  rw [D.skeletonMap_vertical f p l v hp hc]
  conv_lhs => rw [p.eq_mix_dirac_of_pair l v hne hp]
  exact D.cellChart_right_edge f c l v hl hv _

theorem cellChart_supported_pair (f : V → IntervalCarriers.Vertex) (c : IntervalCarriers.Vertex)
    (s : Finset IntervalCarriers.Vertex) (hs : IntervalCarriers.IsFanTriangle (2*D.power+1) c s)
    (p : Probability V) (u v : V) (hp : p.SupportedOn ({u,v}:Set V))
    (hu : f u∈s) (hv : f v∈s) (he : (IntervalCarriers.graph (2*D.power+1)).Adj (f u) (f v)) :
    D.cellChart f c p=D.skeletonMap f p := by
  classical
  have pairCases : ∀a b:IntervalCarriers.Vertex,
      ({f u,f v}:Finset _)=({a,b}:Finset _) →
        (f u=a ∧ f v=b) ∨ (f u=b ∧ f v=a) := by
    intro a b h
    apply Set.pair_eq_pair_iff.mp
    have hcoe := congrArg (fun s:Finset IntervalCarriers.Vertex => (s:Set IntervalCarriers.Vertex)) h
    simpa only [Finset.coe_insert,Finset.coe_singleton] using hcoe
  have hp' : p.SupportedOn ({v,u}:Set V) := by simpa [Set.pair_comm] using hp
  rcases hs with rfl | ⟨n,hn,rfl⟩
  · rcases IntervalCarriers.upperTriangle_skeleton_edge (by omega) c hu hv he with h | h
    · rcases pairCases _ _ h with ⟨ha,hb⟩ | ⟨ha,hb⟩
      · exact D.cellChart_supported_upper_edge f c p u v hp ha hb
      · exact D.cellChart_supported_upper_edge f c p v u hp' hb ha
    · rcases pairCases _ _ h with ⟨ha,hb⟩ | ⟨ha,hb⟩
      · exact D.cellChart_supported_right_edge f c p u v hp ha hb
      · exact D.cellChart_supported_right_edge f c p v u hp' hb ha
  · rcases IntervalCarriers.lowerTriangle_skeleton_edge (by omega) c n hu hv he with h | ⟨rfl,h⟩
    · rcases pairCases _ _ h with ⟨ha,hb⟩ | ⟨ha,hb⟩
      · exact D.cellChart_supported_lower_edge f c n hn p u v hp ha hb
      · exact D.cellChart_supported_lower_edge f c n hn p v u hp' hb ha
    · rcases pairCases _ _ h with ⟨ha,hb⟩ | ⟨ha,hb⟩
      · exact D.cellChart_supported_left_edge f c p v u hp' hb ha
      · exact D.cellChart_supported_left_edge f c p u v hp ha hb

end
end AbelianTargets.SupportTorsionData
Source
Ruijun Wang, Continuous graph homomorphisms of higher dimensional abelian group actions, arXiv:2609.39824v1 (2026), Section(s) 4, 7.1; https://arxiv.org/abs/2609.39824v1. This item is auxiliary infrastructure of the accompanying formalization; its implementation definitions are not asserted to be separately numbered in the paper. Original Lean module AbelianTargets/SupportCellRestrictions.lean, selected declaration lines 10-25, 27-40, 42-53, 55-67, 69-84, 86-114; SHA-256 c1fe6773fe6ebf22bc261ad128a991d76c6538b358fab6ca6df63e4d41bc411d. 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