Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Prism charts for possibly degenerate cells

Definition
AT260939824_IntegerPrismChart

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

arxiv-2609-39824-positivegraph-theorylean-formalizationtopological-dynamics

For an integer rectangular cell RRR and a distinguished nondegenerate coordinate iii, active transverse coordinates are those other coordinates with positive width. The cell is parametrized by the unit interval in direction iii and a sup-norm ball on the active transverse coordinates. Explicit normalization maps recover these parameters continuously; transverse sphere points land on the cell boundary. Collapsed coordinates require no artificial extra dimensions.

Definition code
import Definitions.Def_AT260939824_Actions
import Definitions.Def_AT260939824_AnisotropicMarkers
import Definitions.Def_AT260939824_AtlasBoundaryCarrierMaps
import Definitions.Def_AT260939824_AtlasBoxes
import Definitions.Def_AT260939824_AtlasRankRecursion
import Definitions.Def_AT260939824_CarrierCellRealization
import Definitions.Def_AT260939824_CarrierGeometry
import Definitions.Def_AT260939824_CarrierIntervalInclusion
import Definitions.Def_AT260939824_ClopenMarkers
import Definitions.Def_AT260939824_CompressedWords
import Definitions.Def_AT260939824_ContinuousAtlasPatterns
import Definitions.Def_AT260939824_ContinuousMarkerBoxes
import Definitions.Def_AT260939824_ControlledCone
import Definitions.Def_AT260939824_CovariantCuts
import Definitions.Def_AT260939824_DigitPathRealization
import Definitions.Def_AT260939824_Dimension
import Definitions.Def_AT260939824_FixedSlotInterpolation
import Definitions.Def_AT260939824_IntegerGridIntervals
import Definitions.Def_AT260939824_IntervalCarriers
import Definitions.Def_AT260939824_MarkerExistence
import Definitions.Def_AT260939824_MarkerMap
import Definitions.Def_AT260939824_MarkerPriorities
import Definitions.Def_AT260939824_MarkerWindows
import Definitions.Def_AT260939824_OrbitMarkerCuts
import Definitions.Def_AT260939824_ParityCoordinates
import Definitions.Def_AT260939824_ParityFields
import Definitions.Def_AT260939824_PriorityCuts
import Definitions.Def_AT260939824_Probability
import Definitions.Def_AT260939824_ProbabilityMap
import Definitions.Def_AT260939824_RectangularAtlasBoundary
import Definitions.Def_AT260939824_RectangularBoundaryStrata
import Definitions.Def_AT260939824_RectangularCells
import Definitions.Def_AT260939824_RectangularCone
import Definitions.Def_AT260939824_RectangularFaceRefinement
import Definitions.Def_AT260939824_RectangularTranslation
import Definitions.Def_AT260939824_RegularAnisotropicAtlas
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.Finset.Basic
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.Group.Constructions
import Mathlib.Analysis.Normed.Module.Basic
import Mathlib.Analysis.Normed.Module.RCLike.Real
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Combinatorics.SimpleGraph.Basic
import Mathlib.Combinatorics.SimpleGraph.Maps
import Mathlib.Combinatorics.SimpleGraph.Prod
import Mathlib.Combinatorics.SimpleGraph.Walk.Maps
import Mathlib.Data.Countable.Basic
import Mathlib.Data.Finset.Max
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Finset.Preimage
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.Union
import Mathlib.Data.Fintype.Card
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Int.Interval
import Mathlib.Data.List.Basic
import Mathlib.Data.Nat.Log
import Mathlib.Data.Real.Archimedean
import Mathlib.Data.Real.Basic
import Mathlib.Data.ZMod.Basic
import Mathlib.Dynamics.Transitive
import Mathlib.Order.Filter.AtTopBot.Archimedean
import Mathlib.Order.Filter.Finite
import Mathlib.Order.Monotone.Basic
import Mathlib.Tactic
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.Clopen
import Mathlib.Topology.Compactness.Compact
import Mathlib.Topology.Compactness.Lindelof
import Mathlib.Topology.Constructions
import Mathlib.Topology.ContinuousMap.Compact
import Mathlib.Topology.Homotopy.Path
import Mathlib.Topology.Instances.Discrete
import Mathlib.Topology.Instances.Int
import Mathlib.Topology.Instances.Real.Lemmas
import Mathlib.Topology.LocallyConstant.Basic
import Mathlib.Topology.LocallyFinite
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

/-! Literal active-coordinate prism charts for possibly degenerate atlas
cells. The first coordinate retains its own interval parameter. -/

namespace AbelianTargets
noncomputable section
open scoped unitInterval
namespace RectangularCell
variable {d : ℕ}
attribute [local instance] Classical.propDecidable

abbrev ActiveTransverse (R : RectangularCell d) (i : Fin d) :=
  {j : Fin d // j ≠ i ∧ R.lower j < R.upper j}

instance (R : RectangularCell d) (i : Fin d) : Fintype (R.ActiveTransverse i) := Fintype.ofFinite _

def transverseWidth (R : RectangularCell d) (j : Fin d) : ℝ :=
  (R.upper j : ℝ)-(R.lower j : ℝ)

theorem transverseWidth_pos (R : RectangularCell d) (i : Fin d) (j : R.ActiveTransverse i) :
    0 < R.transverseWidth j.val := by
  exact sub_pos.mpr (by exact_mod_cast j.property.2)

def prismCoordinates (R : RectangularCell d) (i : Fin d)
    (r : unitInterval) (v : ConeBall (R.ActiveTransverse i → ℝ)) : RealCoordinates d :=
  fun j => if hji : j=i then (R.lower j : ℝ)+R.transverseWidth j*r
    else if hpos : R.lower j < R.upper j then
      ((R.lower j : ℝ)+(R.upper j : ℝ))/2+R.transverseWidth j/2*v.val ⟨j,hji,hpos⟩
    else (R.lower j : ℝ)

theorem prismCoordinates_mem (R : RectangularCell d) (i : Fin d)
    (r : unitInterval) (v : ConeBall (R.ActiveTransverse i → ℝ)) :
    R.prismCoordinates i r v ∈ R.closedBox := by
  intro j
  have ho : (R.lower j : ℝ) ≤ (R.upper j : ℝ) := by exact_mod_cast R.ordered j
  have hw : 0 ≤ R.transverseWidth j := sub_nonneg.mpr ho
  by_cases hji : j=i
  · simp only [prismCoordinates,dif_pos hji]
    have h₀ := mul_nonneg hw r.property.1
    have h₁ := mul_le_mul_of_nonneg_left r.property.2 hw
    dsimp [transverseWidth] at *
    constructor <;> linarith
  · by_cases hpos : R.lower j < R.upper j
    · simp only [prismCoordinates,dif_neg hji,dif_pos hpos]
      have hv := (pi_norm_le_iff_of_nonneg (by norm_num : (0 : ℝ) ≤ 1)).mp v.property ⟨j,hji,hpos⟩
      rw [Real.norm_eq_abs,abs_le] at hv
      have h₀ := mul_le_mul_of_nonneg_left hv.1 (show 0 ≤ R.transverseWidth j/2 by positivity)
      have h₁ := mul_le_mul_of_nonneg_left hv.2 (show 0 ≤ R.transverseWidth j/2 by positivity)
      dsimp [transverseWidth] at *
      constructor <;> linarith
    · simp only [prismCoordinates,dif_neg hji,dif_neg hpos]
      exact ⟨le_rfl,ho⟩

def prismPoint (R : RectangularCell d) (i : Fin d)
    (r : unitInterval) (v : ConeBall (R.ActiveTransverse i → ℝ)) : CellClosedDomain R :=
  ⟨R.prismCoordinates i r v,R.prismCoordinates_mem i r v⟩

theorem continuous_prismPoint (R : RectangularCell d) (i : Fin d) :
    Continuous (fun z : unitInterval × ConeBall (R.ActiveTransverse i → ℝ) => R.prismPoint i z.1 z.2) := by
  apply Continuous.subtype_mk
  apply continuous_pi
  intro j
  by_cases hji : j=i
  · simp only [prismPoint,prismCoordinates,dif_pos hji]
    fun_prop
  · by_cases hpos : R.lower j < R.upper j
    · simp only [prismPoint,prismCoordinates,dif_neg hji,dif_pos hpos]
      exact continuous_const.add (continuous_const.mul
        ((continuous_apply (⟨j,hji,hpos⟩ : R.ActiveTransverse i)).comp
          (continuous_subtype_val.comp continuous_snd)))
    · simp only [prismPoint,prismCoordinates,dif_neg hji,dif_neg hpos]
      exact continuous_const

def normalizeTransverse (R : RectangularCell d) (i : Fin d) (z : CellClosedDomain R) :
    ConeBall (R.ActiveTransverse i → ℝ) :=
  ⟨fun j => (2*z.val j.val-(R.lower j.val : ℝ)-(R.upper j.val : ℝ))/R.transverseWidth j.val,by
    apply (pi_norm_le_iff_of_nonneg (by norm_num : (0 : ℝ) ≤ 1)).mpr
    intro j
    rw [Real.norm_eq_abs,abs_div,abs_of_pos (R.transverseWidth_pos i j)]
    apply (div_le_iff₀ (R.transverseWidth_pos i j)).mpr
    rw [one_mul,abs_le]
    have hz := z.property j.val
    dsimp [transverseWidth]
    constructor <;> linarith⟩

theorem continuous_normalizeTransverse (R : RectangularCell d) (i : Fin d) :
    Continuous (R.normalizeTransverse i) := by
  apply Continuous.subtype_mk
  apply continuous_pi
  intro j
  exact ((continuous_const.mul ((continuous_apply j.val).comp continuous_subtype_val)).sub
    continuous_const |>.sub continuous_const).div_const _

def firstIntervalParameter (R : RectangularCell d) (i : Fin d)
    (hi : R.lower i < R.upper i) (z : CellClosedDomain R) : unitInterval :=
  ⟨(z.val i-(R.lower i : ℝ))/R.transverseWidth i,by
    have hw : 0 < R.transverseWidth i := sub_pos.mpr (by exact_mod_cast hi)
    constructor
    · exact div_nonneg (sub_nonneg.mpr (z.property i).1) hw.le
    · apply (div_le_iff₀ hw).mpr
      have hz := (z.property i).2
      dsimp [transverseWidth]
      linarith⟩

theorem continuous_firstIntervalParameter (R : RectangularCell d) (i : Fin d)
    (hi : R.lower i < R.upper i) : Continuous (R.firstIntervalParameter i hi) := by
  apply Continuous.subtype_mk
  exact (((continuous_apply i).comp continuous_subtype_val).sub continuous_const).div_const _

theorem prismPoint_inverse (R : RectangularCell d) (i : Fin d)
    (hi : R.lower i < R.upper i) (z : CellClosedDomain R) :
    R.prismPoint i (R.firstIntervalParameter i hi z) (R.normalizeTransverse i z)=z := by
  apply Subtype.ext
  funext j
  by_cases hji : j=i
  · subst j
    simp [prismPoint,prismCoordinates,firstIntervalParameter]
    have hw : R.transverseWidth i ≠ 0 := ne_of_gt (sub_pos.mpr (by exact_mod_cast hi))
    field_simp
    ring
  · by_cases hpos : R.lower j < R.upper j
    · simp only [prismPoint,prismCoordinates,dif_neg hji,dif_pos hpos,normalizeTransverse]
      have hw : R.transverseWidth j ≠ 0 := ne_of_gt (sub_pos.mpr (by exact_mod_cast hpos))
      dsimp [transverseWidth] at *
      field_simp
      ring
    · simp only [prismPoint,prismCoordinates,dif_neg hji,dif_neg hpos]
      have he : R.lower j=R.upper j := le_antisymm (R.ordered j) (le_of_not_gt hpos)
      have hz := z.property j
      exact le_antisymm hz.1 (by simpa only [← he] using hz.2)



theorem prismSphere_mem_boundary (R : RectangularCell d) (i : Fin d)
    (r : unitInterval) (v : ConeSphere (R.ActiveTransverse i → ℝ)) :
    (R.prismPoint i r ⟨v.val,v.property.le⟩).val ∈ R.boundary := by
  refine ⟨(R.prismPoint i r ⟨v.val,v.property.le⟩).property,?_⟩
  intro hrel
  have hnorm : ‖v.val‖ < 1 := (pi_norm_lt_iff (by norm_num : (0 : ℝ) < 1)).mpr (by
    intro j
    have hz := hrel j.val
    simp only [relativeInterior,ne_of_lt j.property.2,if_false] at hz
    simp only [prismPoint,prismCoordinates,dif_neg j.property.1,dif_pos j.property.2] at hz
    rw [Real.norm_eq_abs,abs_lt]
    have hw := R.transverseWidth_pos i j
    dsimp [transverseWidth] at *
    have hlow : -(R.transverseWidth j.val) < R.transverseWidth j.val*v.val j := by
      dsimp [transverseWidth]
      linarith
    have hup : R.transverseWidth j.val*v.val j < R.transverseWidth j.val := by
      dsimp [transverseWidth]
      linarith
    constructor
    · apply lt_of_mul_lt_mul_left ?_ hw.le
      simpa only [mul_neg,mul_one] using hlow
    · apply lt_of_mul_lt_mul_left ?_ hw.le
      simpa only [mul_one] using hup)
  rw [v.property] at hnorm
  exact (lt_irrefl _) hnorm

theorem prismPoint_first (R : RectangularCell d) (i : Fin d)
    (r : unitInterval) (v : ConeBall (R.ActiveTransverse i → ℝ)) :
    (R.prismPoint i r v).val i=(R.lower i : ℝ)+R.transverseWidth i*r := by
  simp [prismPoint,prismCoordinates]

theorem firstIntervalParameter_zero (R : RectangularCell d) (i : Fin d)
    (hi : R.lower i < R.upper i) (z : CellClosedDomain R)
    (hz : z.val i=(R.lower i : ℝ)) : R.firstIntervalParameter i hi z=0 := by
  apply Subtype.ext
  simp [firstIntervalParameter,hz]

theorem firstIntervalParameter_one (R : RectangularCell d) (i : Fin d)
    (hi : R.lower i < R.upper i) (z : CellClosedDomain R)
    (hz : z.val i=(R.upper i : ℝ)) : R.firstIntervalParameter i hi z=1 := by
  apply Subtype.ext
  have hw : R.transverseWidth i ≠ 0 := ne_of_gt (sub_pos.mpr (by exact_mod_cast hi))
  change (z.val i-(R.lower i : ℝ))/R.transverseWidth i=1
  rw [hz]
  exact div_self hw

theorem normalizeTransverse_boundary (R : RectangularCell d) (i : Fin d)
    (z : CellBoundaryDomain R)
    (hlo : z.val i ≠ (R.lower i : ℝ)) (hhi : z.val i ≠ (R.upper i : ℝ)) :
    ‖(R.normalizeTransverse i ⟨z.val,z.property.1⟩).val‖=1 := by
  obtain ⟨j,hj,hend⟩ := R.boundary_has_endpoint z.property
  have hji : j ≠ i := by
    intro he
    subst j
    rcases hend with he | he
    · exact hlo he
    · exact hhi he
  let jt : R.ActiveTransverse i := ⟨j,hji,hj⟩
  let v := R.normalizeTransverse i ⟨z.val,z.property.1⟩
  have hw := R.transverseWidth_pos i jt
  have hwidth : (R.upper j : ℝ) - (R.lower j : ℝ) ≠ 0 := by
    exact ne_of_gt (sub_pos.mpr (by exact_mod_cast hj))
  have hv : v.val jt=-1 ∨ v.val jt=1 := by
    rcases hend with he | he
    · left
      dsimp [v,normalizeTransverse,jt]
      rw [he]
      dsimp [transverseWidth]
      field_simp [hwidth]
      ring
    · right
      dsimp [v,normalizeTransverse,jt]
      rw [he]
      dsimp [transverseWidth]
      field_simp [hwidth]
      ring
  apply le_antisymm v.property
  have hle := (pi_norm_le_iff_of_nonneg (norm_nonneg v.val)).mp le_rfl jt
  rcases hv with hv | hv <;> simpa [hv] using hle

end RectangularCell
end
end AbelianTargets
Source
Ruijun Wang, Continuous graph homomorphisms of higher dimensional abelian group actions, arXiv:2609.39824v1 (30 September 2026), Sections 2-7; https://arxiv.org/html/2609.39824v1. Formalization-specific infrastructure in the import closure of Theorem 1.4 and Proposition 7.1; individual helper assertions are not represented as separately numbered paper theorems. Original Lean module AbelianTargets/IntegerPrismChart.lean, selected declaration lines 14-15, 17, 19-20, 22-24, 26-31, 33-54, 56-58, 60-74, 76-86, 88-94, 96-105, 107-110, 112-132, 145-170, 172-175, 177-181, 183-190, 192-224; SHA-256 61d66d52d6355f780edb9b8d8ba8eac6dc704c6f894399c25e1fd588958e6471. 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