Neutral winding proto-clock core
DefinitionWindingDynamics_NeutralClockCoreV1Defines a parameter-neutral lifted phase reading, principal representative and integer sheet, affine origin and global deck actions, orientation reversal, an endpoint-to-winding adapter, and the scalar remaining-scale power-law budget. The event carrier has no built-in physical time.
import Mathlib.Analysis.SpecialFunctions.Integrability.Basic
import Mathlib.Analysis.SpecialFunctions.Complex.Circle
noncomputable section
namespace WindingDynamics
open Set MeasureTheory
abbrev ClockLift (Event : Type*) := Event → ℝ
noncomputable def clockPhase {Event : Type*}
(reading : ClockLift Event) (event : Event) : Circle :=
Circle.exp (reading event)
noncomputable def clockPrincipal {Event : Type*}
(cut : ℝ) (reading : ClockLift Event) (event : Event) : ℝ :=
toIocMod Real.two_pi_pos cut (reading event)
noncomputable def clockTurn {Event : Type*}
(cut : ℝ) (reading : ClockLift Event) (event : Event) : ℤ :=
toIocDiv Real.two_pi_pos cut (reading event)
noncomputable def reconstructedReading {Event : Type*}
(cut : ℝ) (reading : ClockLift Event) (event : Event) : ℝ :=
clockPrincipal cut reading event +
(clockTurn cut reading event : ℝ) * (2 * Real.pi)
def ClockPrecedes {Event : Type*}
(reading : ClockLift Event) (first second : Event) : Prop :=
reading first < reading second
def deckShift {Event : Type*}
(turn : ℤ) (reading : ClockLift Event) : ClockLift Event :=
fun event ↦ reading event + (turn : ℝ) * (2 * Real.pi)
def originShift {Event : Type*}
(offset : ℝ) (reading : ClockLift Event) : ClockLift Event :=
fun event ↦ reading event + offset
def SameIncrements {Event : Type*}
(first second : ClockLift Event) : Prop :=
∀ initial final : Event,
second final - second initial = first final - first initial
def reverseReading {Event : Type*}
(reading : ClockLift Event) : ClockLift Event :=
fun event ↦ -reading event
noncomputable def principalEdgeTurn (base difference : ℝ) : ℤ :=
-toIocDiv Real.two_pi_pos (base - Real.pi) (base + difference)
noncomputable def powerLawFrequency (exponent remainingScale : ℝ) : ℝ :=
remainingScale ^ (-exponent)
def FiniteWindingBudget (exponent : ℝ) : Prop :=
IntegrableOn (powerLawFrequency exponent) (Set.Ioo (0 : ℝ) 1)
def PrincipalLedgerReconstructionGate : Prop :=
(∀ (Event : Type) (cut : ℝ) (reading : ClockLift Event) (event : Event),
cut < clockPrincipal cut reading event ∧
clockPrincipal cut reading event ≤ cut + 2 * Real.pi) ∧
(∀ (Event : Type) (cut : ℝ) (reading : ClockLift Event) (event : Event),
reconstructedReading cut reading event = reading event) ∧
(∀ (Event : Type) (firstCut secondCut : ℝ)
(reading : ClockLift Event) (event : Event),
reconstructedReading firstCut reading event =
reconstructedReading secondCut reading event ∧
Circle.exp (clockPrincipal firstCut reading event) =
Circle.exp (clockPrincipal secondCut reading event)) ∧
(∀ (Event : Type) (reading : ClockLift Event) (event : Event),
clockTurn (-Real.pi) reading event =
-principalEdgeTurn 0 (reading event))
def InducedClockOrderGate : Prop :=
(∀ (Event : Type) (reading : ClockLift Event),
(∀ event : Event, ¬ClockPrecedes reading event event) ∧
(∀ first second third : Event,
ClockPrecedes reading first second →
ClockPrecedes reading second third →
ClockPrecedes reading first third)) ∧
(∀ (Event : Type) (reading : ClockLift Event),
Function.Injective reading →
∀ first second : Event,
first ≠ second →
ClockPrecedes reading first second ∨
ClockPrecedes reading second first) ∧
(∀ (Event : Type) (_ : LinearOrder Event) (reading : ClockLift Event),
StrictMono reading →
∀ first second : Event,
ClockPrecedes reading first second ↔ first < second) ∧
(∃ reading : ClockLift (Fin 3),
reading 0 = 0 ∧
reading 1 = 4 * Real.pi ∧
reading 2 = 2 * Real.pi ∧
reading 2 - reading 0 = 2 * Real.pi ∧
¬StrictMono reading)
def DeckOriginFreedomGate : Prop :=
(∀ (Event : Type) (reading : ClockLift Event),
originShift 0 reading = reading) ∧
(∀ (Event : Type) (firstOffset secondOffset : ℝ)
(reading : ClockLift Event),
originShift (firstOffset + secondOffset) reading =
originShift firstOffset (originShift secondOffset reading)) ∧
(∀ (Event : Type) (offset : ℝ) (reading : ClockLift Event)
(first second : Event),
originShift offset reading second - originShift offset reading first =
reading second - reading first ∧
(ClockPrecedes (originShift offset reading) first second ↔
ClockPrecedes reading first second)) ∧
(∀ (Event : Type) (_ : Nonempty Event)
(first second : ClockLift Event),
SameIncrements first second →
∃! offset : ℝ, second = originShift offset first) ∧
(∀ (Event : Type) (reading : ClockLift Event),
deckShift 0 reading = reading) ∧
(∀ (Event : Type) (firstTurn secondTurn : ℤ)
(reading : ClockLift Event),
deckShift (firstTurn + secondTurn) reading =
deckShift firstTurn (deckShift secondTurn reading)) ∧
(∀ (Event : Type) (turn : ℤ) (reading : ClockLift Event) (event : Event),
clockPhase (deckShift turn reading) event = clockPhase reading event) ∧
(∀ (Event : Type) (turn : ℤ) (reading : ClockLift Event)
(first second : Event),
ClockPrecedes (deckShift turn reading) first second ↔
ClockPrecedes reading first second) ∧
(∀ (Event : Type) (_ : Nonempty Event) (turn : ℤ)
(reading : ClockLift Event),
deckShift turn reading = reading ↔ turn = 0)
def OrientationReversalGate : Prop :=
(∀ (Event : Type) (reading : ClockLift Event) (event : Event),
clockPhase (reverseReading reading) event =
(clockPhase reading event)⁻¹) ∧
(∀ (Event : Type) (reading : ClockLift Event) (first second : Event),
ClockPrecedes (reverseReading reading) first second ↔
ClockPrecedes reading second first) ∧
(∀ (Event : Type) (turn : ℤ) (reading : ClockLift Event),
reverseReading (deckShift turn reading) =
deckShift (-turn) (reverseReading reading))
def LandedWindingClockGate : Prop :=
(∀ (endpoint : ℝ) (winding : ℤ),
endpoint = (winding : ℝ) * (2 * Real.pi) →
clockTurn (-Real.pi) (fun _ : Unit ↦ endpoint) () = winding) ∧
(∀ winding : ℤ,
clockTurn (-Real.pi)
(fun _ : Unit ↦ (winding : ℝ) * (2 * Real.pi)) () = winding)
def PowerLawWindingBudgetGate : Prop :=
(∀ exponent : ℝ, FiniteWindingBudget exponent ↔ exponent < 1) ∧
(∀ h : ℝ, 0 ≤ h → ¬FiniteWindingBudget (1 + h))
def ClaimBoundary : Prop :=
PrincipalLedgerReconstructionGate ∧
InducedClockOrderGate ∧
DeckOriginFreedomGate ∧
OrientationReversalGate ∧
LandedWindingClockGate ∧
PowerLawWindingBudgetGate
end WindingDynamicsRead-back
What the Lean code literally says, in plain math · gpt-5.6-sol
This defines a proposition as the conjunction of the following six groups of assertions. Write a clock reading on an event type as a function ; write for the representative of modulo in the left-open, right-closed interval , and for the corresponding quotient, so that ; write , for , , , and . First, for every small type , every , every , and every , one has and ; for every two cuts , both reconstructed values are equal and ; and , because the custom “principal edge turn” at base and difference is defined as . Second, for every , is irreflexive and transitive; if is injective, every two distinct events are comparable in one direction; if carries a linear order and is strictly increasing for that order, then iff ; and there exists with , , , , and not strictly increasing in the canonical order on . Third, for every , ; ; for all events , and iff ; whenever is nonempty and two readings satisfy for every , there exists a unique with ; ; ; ; iff ; and, when is nonempty, iff . Fourth, for every , , iff , and . Fifth, for every and , if , then applying to the value of the constant reading on the sole element of gives ; and, separately, the same equality is asserted directly for the constant value for every integer . Sixth, if means Lebesgue integrability on the open interval of the real-power function , then for every , iff , and for every , including , is false. All unrestricted assertions over include the empty type, where event-indexed universal clauses and equalities between readings may be vacuous; nonemptiness is imposed only in the two explicitly stated origin/deck uniqueness clauses.