Normalized Divided-Difference Selection and Covering Symmetries
DefinitionMonodromy_ChoiceDefines the complex kernel K_f(r,z)=dslope(f,r,z)/f′(r) and finite kernel readout. Develops exact selection at distinct regular roots, composition and fiber-refinement identities, and restrictions imposed by transitive commuting families of covering symmetries.
-- Generated by Lean-fact skeleton subtraction; original source is frozen in imports/monodromy/source.
module
public import Definitions.Def_Monodromy_Covering
public import Mathlib.Analysis.Analytic.Constructions
public import Mathlib.Analysis.Analytic.IsolatedZeros
public import Mathlib.Analysis.Calculus.DSlope
public import Mathlib.Analysis.Calculus.Deriv.Add
public import Mathlib.Analysis.Calculus.Deriv.Comp
public import Mathlib.Analysis.Calculus.Deriv.Mul
public import Mathlib.Analysis.Complex.Basic
public import Mathlib.Logic.Function.Conjugate
public import Mathlib.Tactic.FunProp
public import Mathlib.Topology.Homotopy.Lifting
@[expose] public section
/-!
# Selection and covering symmetry
A selective loop fixes one branch and moves another. Transport naturality
gives a precise structural obstruction: transitive commuting symmetries.
-/
@[expose] public section
namespace Monodromy.Choice
universe u v
open scoped Topology Classical
def Selective {State : Type u} (operation : State → State) : Prop :=
∃ source target, operation source = source ∧ operation target ≠ target
variable {E : Type u} {X : Type v} [TopologicalSpace E] [TopologicalSpace X]
variable {projection : E → X} {base : X}
/-- The equation's removable divided difference, normalized at a marked regular root. -/
noncomputable def kernel (f : ℂ → ℂ) (r z : ℂ) : ℂ :=
dslope f r z / deriv f r
theorem kernel_self {f : ℂ → ℂ} {r : ℂ} (regular : deriv f r ≠ 0) :
kernel f r r = 1 := by
simp [kernel, regular]
theorem kernel_other {f : ℂ → ℂ} {r z : ℂ}
(other : z ≠ r) (same_fiber : f z = f r) : kernel f r z = 0 := by
simp [kernel, dslope_of_ne f other, slope_def_field, same_fiber]
/-- Standard finite cardinal interpolation from the equation's marked-root kernels. -/
noncomputable def dispatch {ι : Type*} [Fintype ι]
(f : ℂ → ℂ) (roots values : ι → ℂ) (z : ℂ) : ℂ :=
∑ i, kernel f (roots i) z * values i
theorem dispatch_root {ι : Type*} [Fintype ι]
{f : ℂ → ℂ} {roots values : ι → ℂ}
(distinct : Function.Injective roots)
(same_fiber : ∀ i j, f (roots i) = f (roots j))
(regular : ∀ i, deriv f (roots i) ≠ 0) (j : ι) :
dispatch f roots values (roots j) = values j := by
classical
unfold dispatch
rw [Finset.sum_eq_single j]
· rw [kernel_self (regular j), one_mul]
· intro i _ different
rw [kernel_other (fun h => different (distinct h).symm) (same_fiber j i), zero_mul]
· simp
end Monodromy.Choice
namespace Monodromy.Choice
end Monodromy.Choice
namespace Monodromy.Choice
end Monodromy.Choice
namespace Monodromy.Choice
end Monodromy.Choice
namespace Monodromy.Choice
end Monodromy.Choice
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every type and operation , the predicate called selective is defined to mean that there exist with and ; no group action or topology is part of this predicate, and an empty state type cannot supply the witnesses. For arbitrary and , define , where the removable divided difference is and for . The derivative is the total complex derivative, taking value when the function is not differentiable, and division by zero is ; the definition assumes neither differentiability nor nonzero derivative. The bundle asserts when , and whenever and , without a nonzero-derivative hypothesis for that latter assertion. For every finite type , roots , values and , it defines the finite dispatch sum . For every , it asserts if the root family is injective, all its -values are equal, and for every . The marked points need not exhaust a fiber. Empty gives an identically zero dispatch sum and no instance of the root-evaluation binder; repeated roots and singular or nondifferentiable points remain permitted in the dispatch definition, though not under the stated interpolation hypotheses.
Confirmed by the mission captain (proposal self-audit).