Composite Kernel Readout Factors Through Inner Readouts
ProvedMonodromy.Choice.dispatch_compLet I and J be finite types, f,g:ℂ→ℂ, outer roots r_i, and complex tables c_{ij},v_{ij}. Suppose g(c_{ij})=r_i, f is complex differentiable at each r_i, and g is complex differentiable at each c_{ij}. For every w∈ℂ, the normalized-kernel readout over the composite roots satisfies . No distinctness or nonzero-derivative premise is required here.
Statement dependencies: Monodromy.Choice.dispatch, Monodromy.Choice.kernel.
Original proof dependencies: Monodromy.Choice.dispatch, Monodromy.Choice.kernel, Monodromy.Choice.kernel_comp.
Statement elaboration dependencies: Monodromy.Choice.dispatch, Monodromy.Choice.kernel.
Proof elaboration dependencies: Monodromy.Choice.dispatch, Monodromy.Choice.kernel, Monodromy.Choice.kernel_comp.
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.dispatch_comp {ι κ : Type*} [Fintype ι] [Fintype κ]
{f g : ℂ → ℂ} (outerRoots : ι → ℂ) (children values : ι → κ → ℂ)
(projects : ∀ i j, g (children i j) = outerRoots i)
(outer : ∀ i, DifferentiableAt ℂ f (outerRoots i))
(inner : ∀ i j, DifferentiableAt ℂ g (children i j)) (w : ℂ) :
dispatch (f ∘ g) (fun index : ι × κ => children index.1 index.2)
(fun index : ι × κ => values index.1 index.2) w =
∑ i, kernel f (outerRoots i) (g w) * dispatch g (children i) (values i) w := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
Let be arbitrary finite types, possibly empty; let be arbitrary functions; let , and satisfy for all . Assume is complex differentiable at each and is complex differentiable at each . For every , define , where and for , and define . Then . Neither distinctness of the marked points nor equality of their -values nor nonzero derivatives is assumed; division is complex field division, so division by zero is . Empty index sets give empty sums equal to , and may equal any marked point.
Confirmed by the mission captain (proposal self-audit).