skip to content

Foreclosure clock

Operates Lemma 1 · new sim engine derived from (P1)–(P5)

0.00.51.010^010^110^210^310^4τ (log scale)S(τ; θ_t)θ_ref
θ_t
0.0100
tick
0
S(θ_ref; θ_t)
4.54e-5
κ_Φ = (β/α)·L_D0.20

You are watching the survival function collapse at the reflective threshold as the platform's policy converges to its fixed point . The shaded region — chrono-debt — is the framework's name for the foreclosed pause-time accumulated against the pre-closure baseline.

What the plate operates. Lemma 1 (foreclosure) establishes that under (R1), (R2), (P-I)–(P-III), the survival probability approaches operational zero as . The plate renders this convergence: as the closure's optimization runs, the warm-ink survival curve decays past the dashed line; the oxblood-shaded region grows beneath the dashed cream baseline.

The controls.

  • β, α, L_D → κ_Φ (contractivity). The plate exposes the operator modulus through its three constituents: reward smoothness , strong-concavity modulus , and distribution sensitivity . It computes ; axiom R1 (under R2's strong concavity) requires . Driving toward 1 slows convergence — the closure operator becomes “barely a contraction.” The closure-amplification factor (Theorem 9) diverges as — the crisis boundary (Theorem 12).
  • θ_ref / δ_min (structural separation). Empirically to on contemporary platforms. Higher ratios deepen the foreclosure; Lemma 1's polynomial bound gives , so doubling the ratio quarters the upper bound.

The sim engine.A 1-D scalar reduction of the apparatus's setup (P1)-(P5). User state collapses to scalar ; policy ∈ [0, 1] indexes the firing-rate (with corresponding to the rate ceiling per Lemma 1 Step 2); ISIs are exponential at rate ; the policy update is geometric convergence at modulus . The simplifications preserve Lemma 1's qualitative behavior; the full multi-register sim is Phase 3's primary engine.

What the reader produces. Press play. Watch the survival curve decay past . The S(θ_ref; θ_t) readout drops from at to at . The regime you produced — where is operationally zero — is what Lemma 1 names.

Cross-references