The generalized Chazy equation (81) from the generalized Darboux–Halphen system with
ProvedSDYM.generalized_chazy_of_darboux_halphenAblowitz, Chakravarty and Halburd showed that for a solution of the generalized Darboux–Halphen system (52) with given in the closed form (56),
the trace variable solves the generalized Chazy equation
precisely when either , or exactly one of equals and the other two equal . This milestone is the first of those two cases: it fixes and asserts the resulting generalized Chazy equation. The classical Chazy equation is the limit .
The statement records the first two derivatives of in closed form. Writing for the elementary symmetric functions of the and , they are
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 generalized_chazy_of_darboux_halphen
(n : ℂ) (hn : n ≠ 0) (hn36 : n ^ 2 ≠ 36) (s : Set ℂ) (w₁ w₂ w₃ : ℂ → ℂ)
(h₁ : ∀ t ∈ s, HasDerivAt w₁ (w₂ t * w₃ t - w₁ t * (w₂ t + w₃ t)
+ (2 / n) ^ 2 * ((w₁ t - w₂ t) * (w₃ t - w₁ t) + (w₂ t - w₃ t) * (w₁ t - w₂ t)
+ (w₃ t - w₁ t) * (w₂ t - w₃ t))) t)
(h₂ : ∀ t ∈ s, HasDerivAt w₂ (w₃ t * w₁ t - w₂ t * (w₃ t + w₁ t)
+ (2 / n) ^ 2 * ((w₁ t - w₂ t) * (w₃ t - w₁ t) + (w₂ t - w₃ t) * (w₁ t - w₂ t)
+ (w₃ t - w₁ t) * (w₂ t - w₃ t))) t)
(h₃ : ∀ t ∈ s, HasDerivAt w₃ (w₁ t * w₂ t - w₃ t * (w₁ t + w₂ t)
+ (2 / n) ^ 2 * ((w₁ t - w₂ t) * (w₃ t - w₁ t) + (w₂ t - w₃ t) * (w₁ t - w₂ t)
+ (w₃ t - w₁ t) * (w₂ t - w₃ t))) t) :
IsGeneralizedChazySolution n s
(fun t => -2 * (w₁ t + w₂ t + w₃ t))
(fun t => 2 * (w₁ t * w₂ t + w₂ t * w₃ t + w₃ t * w₁ t)
- 6 * (4 / n ^ 2 * (3 * (w₁ t * w₂ t + w₂ t * w₃ t + w₃ t * w₁ t)
- (w₁ t + w₂ t + w₃ t) ^ 2)))
(fun t => -12 * (w₁ t * w₂ t * w₃ t)
+ 4 / n ^ 2 * (-4 * (w₁ t + w₂ t + w₃ t) ^ 3
+ 108 * (w₁ t * w₂ t * w₃ 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 complex number with and , a set , and three functions .
Write
The three hypotheses say that at every , each is complex differentiable with
all evaluated at , with the same added to each.
The conclusion is the generalized Chazy predicate with parameter , on the same set , for the triple
where , and . Unfolded, this asserts: at every , is differentiable with derivative ; is differentiable with derivative ; and is differentiable with derivative
Observations. Both hypotheses and are explicit, so neither nor is a division by zero. The parameter enters the hypotheses only through and the conclusion only through and , so the statement cannot distinguish from . There is no assumption that the are distinct, nor any functions: the coupling term is the closed quadratic expression above, which is the source's after the substitution , and the auxiliary system for the has already been eliminated. The statement covers only that symmetric case, not the second case of the source's criterion, and it asserts only the implication, not the 'only if' half. Empty makes it vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.