Neutral winding proto-clock claim boundary
ProvedWindingDynamics.claimBoundaryThe neutral winding proto-clock core simultaneously satisfies principal-sheet reconstruction, conditional order, affine-origin and global-deck freedom, orientation reversal, landed endpoint winding arithmetic, and the exact scalar power-law integrability threshold.
import Definitions.Def_WindingDynamics_NeutralClockCoreV1
theorem WindingDynamics.claimBoundary :
WindingDynamics.ClaimBoundary := by sorryRead-back
What the Lean code literally says, in plain math · gpt-5.6-sol
This theorem asserts the entire proposition just described: with , , , , , , , and having the expanded meanings above, it simultaneously asserts (i) the principal interval bounds, reconstruction identity, cut-independent reconstruction and phase, and the equation ; (ii) irreflexivity and transitivity of the order induced by every reading, comparability under injectivity, exact agreement with an existing linear order under strict monotonicity, and existence of the specified non-strictly-monotone reading on ; (iii) the identity, composition, increment preservation, order preservation, unique-offset result on nonempty event types, corresponding integer deck-shift laws, phase invariance, order invariance, and faithfulness on nonempty event types; (iv) phase inversion, order reversal, and negation of deck shifts under pointwise sign reversal; (v) both universally quantified constant- quotient assertions for integer multiples of ; and (vi) together with for every . Every event type is allowed to be empty except where a Nonempty assumption is explicitly present, so the corresponding eventwise clauses can be vacuous on an empty type.
Confirmed by the mission captain (proposal self-audit).