The matrix flow (51) for diagonal is the classical Darboux–Halphen system
ProvedSDYM.matrix_flow_diagonal_iff_classical_darboux_halphenThe matrix flow obtained by reducing the Nahm equations with the gauge algebra of divergence-free vector fields on is
equation (51) of the source. This milestone identifies its diagonal sector: if then the flow holds if and only if solve the classical Darboux–Halphen system. It is the base case of the general factorization — the case , — and it fixes the normalization of the matrix equation against the first-order system.
The matrix derivative is imposed entrywise, so that no normed-space structure on matrices has to be chosen; the adjugate is the classical adjugate, defined for every matrix without an invertibility hypothesis.
Conventions shared with the rest of the mission. All functions are complex-valued functions of a complex variable; a system is required to hold only at the points of an arbitrary set , with no openness, connectedness or holomorphy assumed; and each derivative that a statement mentions is carried by an explicit companion function tied to it by a pointwise differentiability assertion, so no statement ever refers to the value of a derivative that does not exist.
import Definitions.Def_SDYM_ChazyEquations import Definitions.Def_SDYM_DarbouxHalphenRamanujan
namespace SDYM
theorem matrix_flow_diagonal_iff_classical_darboux_halphen
(s : Set ℂ) (w₁ w₂ w₃ : ℂ → ℂ) (M : ℂ → Matrix (Fin 3) (Fin 3) ℂ)
(hM : ∀ t : ℂ, M t = Matrix.diagonal ![w₁ t, w₂ t, w₃ t]) :
((∀ t ∈ s, ∀ i j, HasDerivAt (fun z => M z i j)
(((M t).adjugate.transpose + (M t).transpose * M t
- Matrix.trace (M t) • M t) i j) t)
↔ IsClassicalDHSolution s w₁ w₂ w₃) := by sorry
end SDYMRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Disclosure — non-blind read-back. This read-back was written by the same agent that drafted the Lean statement it describes, with full knowledge of the source paper and of the intended meaning. It is therefore not independent testimony and must not be mistaken for an audit: the point of a read-back is that a blind reader, given only the code, renders back what the code literally says, so that any gap between intent and code becomes visible. That safeguard is absent here. A reviewer should obtain a genuinely blind read-back before relying on this item.
Fix a set , three functions , and a function assigning to each complex a matrix over (rows and columns indexed by ). The single hypothesis is that for every complex — not just for — the matrix is the diagonal matrix with diagonal entries in that order, all off-diagonal entries being .
The conclusion is a logical equivalence between the following two statements.
(A) For every and every pair of indices , the scalar function is complex differentiable at , with derivative equal to the entry of
where is the classical adjugate (the transpose of the cofactor matrix, defined for every square matrix, invertible or not), is the transpose, is the trace, and the last term is the scalar acting on the matrix by scalar multiplication.
(B) The classical Darboux–Halphen predicate holds for on : at every , and the two cyclic images.
Observations. Statement (A) quantifies over all nine entries, including the six off-diagonal ones; for those the function is identically , so those nine-fold conditions carry content only on the diagonal — provided the right-hand side also has vanishing off-diagonal entries, which is part of what the equivalence encodes. The hypothesis on is global in , which is what makes the entrywise derivative of at meaningful. Nothing is assumed about ; if is empty both (A) and (B) are vacuously true and the equivalence is trivial. The equivalence is asserted as a single biconditional, in both directions.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.