Winding flow/reset claim boundary
ProvedWindingDynamics.flowResetClaimBoundaryThe four mission gates hold simultaneously: intrinsic winding conservation for jointly continuous closed Circle fields with moving-basepoint normalization; branch-regular finite principal-winding conservation together with the continuity-only negative control; exact coherent finite reset-ledger balance on certified cycles; and the conditional preserved-carrier Circle-readout consumer together with the simply-connected-carrier fence.
import Definitions.Def_WindingDynamics_CoreV1
theorem WindingDynamics.flowResetClaimBoundary : WindingDynamics.ClaimBoundary := by sorry
Read-back
What the Lean code literally says, in plain math · gpt-5.6-sol
The theorem has no parameters and asserts all four of the following propositions simultaneously. First, for every continuous field on the closed unit interval whose spatial endpoints agree, for every , define the normalized based loop ; lift each through the circle exponential covering to the specified real-valued path starting at , set , and set . Then and are homotopic as based paths, their lifted endpoints are exactly equal, and their integer values are equal. Second, define , where is the integer quotient selected by division modulo that reduces to the half-open interval , call antipodal when , and, for maps , a phase , an integer edge weighting , and , define . For every topological preconnected type , every type , every finite type , and every such tail, head, and phase, if is continuous for every vertex and no ordered pair of endpoint phases is antipodal at any time and edge, then for every integer edge weighting and every ; moreover, independently of that universal assertion, there exist continuous functions for which , with no non-antipodality requirement imposed on this existential example. Third, for every type , every ledger consisting of a natural number and an arbitrary sequence indexed by all , and every , one has ; and, for every type , finite type , arbitrary incidence coefficients , such a ledger, and every integer edge chain certified to satisfy for every , writing , one has . Fourth, for every topological type and every segment consisting of a subset , a continuous trajectory lying in with for every , and a continuous readout , form , normalize it to the based loops , and compute by the same specified lift-and-floor construction above; then . Also, for every simply connected topological type , every continuous , every , and every loop in based at , the image loop is homotopic as a based path to the constant loop at . All universal type quantifiers include degenerate cases: the finite edge type may be empty, making all edge sums zero and assertions quantified over an edge vacuous; may be , making the ledger sums empty and both differences zero; , , , or is not explicitly assumed nonempty, so conclusions requiring chosen elements or structures may be vacuous when those data do not exist; an empty vertex type makes the chain-closure certificate vacuous; and the branch-regular conservation implication imposes no conclusion when either its continuity hypothesis or its non-antipodality hypothesis fails. Conversely, a carrier segment over an empty state or with an empty carrier cannot be supplied because its trajectory has the nonempty domain and must lie in the carrier. No closed-chain condition is imposed in the branch-regular conjunct, while the closedness certificate in the ledger conjunct is quantified but the displayed ledger identity itself is purely the stated finite-sum equality.
Confirmed by the mission captain (proposal self-audit).