The factorization solves the matrix flow (51)
ProvedSDYM.matrix_flow_of_generalized_darboux_halphenThe reduction of the matrix flow (51) to the generalized Darboux–Halphen system, taken in the direction that does not require a diagonalizability argument. The source writes a solution of
as , where , is the skew-symmetric matrix with , , , and is a complex orthogonal matrix satisfying the linear equation , equation (54). This milestone asserts that this recipe does produce a solution: if solve (52)–(53) and solves (54) and is complex orthogonal, then solves (51).
Orthogonality of is what makes the argument work and is not cosmetic: the right-hand side of (51) involves a transpose, and is equivariant under conjugation by only when .
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_of_generalized_darboux_halphen
(s : Set ℂ) (w₁ w₂ w₃ x₁ x₂ x₃ : ℂ → ℂ)
(A P M : ℂ → Matrix (Fin 3) (Fin 3) ℂ)
(hDH : IsGeneralizedDHSolution s w₁ w₂ w₃ x₁ x₂ x₃)
(hA : ∀ t : ℂ, A t = !![0, x₃ t, -x₂ t; -x₃ t, 0, x₁ t; x₂ t, -x₁ t, 0])
(hPorth : ∀ t ∈ s, (P t).transpose * P t = 1)
(hP : ∀ t ∈ s, ∀ i j, HasDerivAt (fun z => P z i j) ((-(P t * A t)) i j) t)
(hM : ∀ t : ℂ, M t = P t * (Matrix.diagonal ![w₁ t, w₂ t, w₃ t] + A t) * (P t).transpose) :
∀ 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 := 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 , six scalar functions on , and three matrix-valued functions assigning to each complex a complex matrix. There are five hypotheses.
-
The generalized Darboux–Halphen predicate for on : with , at every one has and its two cyclic images, and , , .
-
For every complex , is the skew-symmetric matrix
-
For every , is the identity matrix — that is, is complex orthogonal (with respect to the bilinear, not Hermitian, form; no conjugation is involved).
-
For every and all indices , the scalar function is complex differentiable at with derivative the entry of .
-
For every complex , .
The conclusion: for every and all indices , the scalar function is complex differentiable at , with derivative the entry of
where is the classical adjugate and the last term is scalar multiplication.
Observations. Hypotheses 2 and 5 are imposed at every complex , whereas 1, 3 and 4 hold only on ; this asymmetry is what makes the entrywise derivative at points of well defined. The conjugation in 5 uses the transpose , not an inverse; on these agree by hypothesis 3, but off they need not. No hypothesis says is invertible off , and none says . The three off-diagonal entries of are placed as , , , with the opposite signs below the diagonal. If is empty the conclusion holds vacuously.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.