pith. sign in
theorem

before_transitive

proved
show as:
module
IndisputableMonolith.Foundation.ArrowOfTime
domain
Foundation
line
76 · github
papers citing
8 papers (below)

plain-language theorem explainer

The before relation on real numbers, defined by strict inequality of Z-complexity, is transitive. Researchers modeling emergent time from Berry phase accumulation cite this to guarantee ordered temporal sequences without external thermodynamics. The proof is a one-line term that unfolds the definition and applies linear arithmetic.

Claim. If $z_1 < z_2$ and $z_2 < z_3$ then $z_1 < z_3$, where each $z_i$ is the absolute Berry phase complexity at successive snapshots.

background

The module derives the arrow of time from Berry phase monotonicity on the ledger. The relation isBefore is defined directly as $z_1 < z_2$ for real numbers $z$ that track absolute accumulated phase. Upstream, the before predicate on LedgerSnapshot compares tick indices: $a.tick.index < b.tick.index$. The module states that Z-complexity is monotonically non-decreasing, supplying an intrinsic before-after distinction.

proof idea

The term proof unfolds isBefore on the hypotheses and goal, then invokes linarith to obtain transitivity of the strict order on the reals.

why it matters

This result confirms that the Z-induced temporal order is transitive, supporting directed time in the Recognition framework. It underpins entropy_monotone and related claims in the same module. The module doc notes that forward R-hat steps accumulate phase while reversal does not decrease absolute Z, yielding the asymmetry.

Switch to Lean above to see the machine-checked source, dependencies, and usage graph.