Kernel Refinement Is Equivalent to Exhausting the Inner Fiber
ProvedMonodromy.Choice.kernel_refinement_iffLet J be a finite type, f,g:ℂ→ℂ, p∈ℂ, and c:J→ℂ be injective with g(c_j)=p. Assume f has nonzero complex derivative at p and f∘g has nonzero complex derivative at every c_j. For the normalized divided-difference kernels, the identity for every z satisfying f(g(z))=f(p) holds if and only if every z with g(z)=p equals c_j for some j.
Statement dependencies: Monodromy.Choice.kernel.
Original proof dependencies: Monodromy.Choice.dispatch, Monodromy.Choice.dispatch_root, Monodromy.Choice.kernel, Monodromy.Choice.kernel_other, Monodromy.Choice.kernel_self.
Statement elaboration dependencies: Monodromy.Choice.kernel.
Proof elaboration dependencies: Monodromy.Choice.dispatch, Monodromy.Choice.dispatch_root, Monodromy.Choice.kernel, Monodromy.Choice.kernel_other, Monodromy.Choice.kernel_self.
module public import Definitions.Def_Monodromy_Choice 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 open Monodromy open Monodromy.Choice
theorem Monodromy.Choice.kernel_refinement_iff {κ : Type*} [Fintype κ]
{f g : ℂ → ℂ} {parent : ℂ} (children : κ → ℂ)
(distinct : Function.Injective children)
(projects : ∀ child, g (children child) = parent)
(regular : deriv f parent ≠ 0)
(children_regular : ∀ child, deriv (f ∘ g) (children child) ≠ 0) :
(∀ z, f (g z) = f parent →
kernel f parent (g z) = ∑ child, kernel (f ∘ g) (children child) z) ↔
∀ z, g z = parent → ∃ child, children child = z := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
Let be a finite type, arbitrary functions, , and an injective family such that for every . Suppose and for every . Define , with and when , using the total complex derivative and the convention . Then the identity for every satisfying holds if and only if every with equals for some . The left identity is required on the whole stated composite fiber, not just on the -fiber; no further differentiability or surjectivity hypotheses occur. Empty is permitted, in which case the sum is and the right side says the -fiber over is empty.
Confirmed by the mission captain (proposal self-audit).