Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Discontinuity-matrix index maps

Definition
Monotonicity_Theorem_DiscTower

by Tamas Fulop · Sep 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

geometry-topologyo-minimality

The coordinate index maps selecting graph, epsilon, delta, and bad-point slots out of flattened tuples, plus the point-as-lambda identity.

Definition code
import Definitions.Def_Monotonicity_Theorem_Framework
import Mathlib.Tactic.FinCases

open Monotonicity_Theorem

-- Points are determined by coordinates.
theorem ptLam {R : Type} (x : Power R 1) : x = fun _ => Power.coord1 x := by
  funext k
  have hk : k.val = 0 := by
    have := k.isLt
    omega
  have ek : k = (⟨0, by decide⟩ : Fin 1) := Fin.ext hk
  rw [ek]
  rfl

-- Index maps for the discontinuity matrix (wide layout, arity 8).
-- Slots: 0:x, 1:w0, 2:e1, 3:e2, 4:d1, 5:d2, 6:y, 7:q.
def dIx : Fin 1 → Fin 8 := fun _ => ⟨0, by decide⟩
def dGy : Fin 2 → Fin 8 := fun j => if _ : j.val = 0 then ⟨6, by decide⟩ else ⟨7, by decide⟩
def dD1y : Fin 2 → Fin 8 := fun j => if _ : j.val = 0 then ⟨4, by decide⟩ else ⟨6, by decide⟩
def dYD2 : Fin 2 → Fin 8 := fun j => if _ : j.val = 0 then ⟨6, by decide⟩ else ⟨5, by decide⟩
def dE1q : Fin 2 → Fin 8 := fun j => if _ : j.val = 0 then ⟨2, by decide⟩ else ⟨7, by decide⟩
def dQe2 : Fin 2 → Fin 8 := fun j => if _ : j.val = 0 then ⟨7, by decide⟩ else ⟨3, by decide⟩
-- Delta maps at arity 6 (tuple x,w0,e1,e2,d1,d2).
def dD1x6 : Fin 2 → Fin 6 := fun j => if _ : j.val = 0 then ⟨4, by decide⟩ else ⟨0, by decide⟩
def dXD26 : Fin 2 → Fin 6 := fun j => if _ : j.val = 0 then ⟨0, by decide⟩ else ⟨5, by decide⟩
-- Graph/epsilon maps at arity 4 (tuple x,w0,e1,e2).
def dGx4 : Fin 2 → Fin 4 := fun j => if _ : j.val = 0 then ⟨0, by decide⟩ else ⟨1, by decide⟩
def dE1w4 : Fin 2 → Fin 4 := fun j => if _ : j.val = 0 then ⟨2, by decide⟩ else ⟨1, by decide⟩
def dWe24 : Fin 2 → Fin 4 := fun j => if _ : j.val = 0 then ⟨1, by decide⟩ else ⟨3, by decide⟩
Source
van den Dries, Tame Topology and O-Minimal Structures, Ch. 3
Read-back

What the Lean code literally says, in plain math · muse-spark

arrow? Skew?arrawextra

Human review
  • Endorsed by Shuze Chen · Sep 15, 2026

  • Endorsed by Tamas Fulop · Sep 15, 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