How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Correct finite-time bound for partial-homogeneity zero crossing
Statement
Let , , , , and let and be absolutely continuous until the first time reaches zero. Assume , , and, almost everywhere before the crossing,
Then reaches zero at some . At the first such time,
Thus the crossing remains in whenever the displayed bound is less than . The crossing-time bound depends on the initial negative-weight magnitude .
Statement references
Facts & Assumptions
Given: The differential inequalities and initial data in the Statement.
The functions and are absolutely continuous on each interval before the first zero of .
Proof
Given: as in the Statement.
Suppose first that and has not reached zero by . Integrating gives , contradicting the assumed strict negativity before the first crossing. Hence the first crossing time exists and satisfies the stated bound. If , then and .
On , is strictly increasing with , so it is an admissible absolutely continuous time change. Its inverse satisfies . If , set . The inequality for gives , and integration from to yields . Rearranging gives . If , direct integration gives . The same bounds hold with zero right-hand side when .
Source note
Chizat and Bach's printed proof claims a common crossing time for every . Integrating gives the correct worst-case bound . The estimate above proves hitting at an actual time and the corresponding -displacement bound; it does not assert at one fixed time for all initial weights.
Used by
Nothing in the library uses this result yet.
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- Lénaïc Chizat and Francis Bach, On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport (standard reference, not scraped)