Documentation

Lean 4 Proof

theorem commitment_dominates_discretion {c phi_prev sigma_old sigma_new sigma_prev delta
    beta_old beta_new : ℝ}
    (hs_old : sigma_old ≠ 0) (hs_new : sigma_new ≠ 0)
    (hs_prev : 0 < sigma_prev) (hdelta : delta ≠ 0)
    (hb1 : 0 < beta_old) (hb2 : 0 < beta_new) (h12 : beta_old < beta_new) :
    discretionaryGain c phi_prev sigma_old sigma_new delta ≤
    commitmentGain sigma_prev delta beta_old beta_new := by
  rw [discretionary_gain_zero hs_old hs_new]
  exact le_of_lt (commitmentGain_positive hs_prev hdelta hb1 hb2 h12)

Dependency Graph

Location

thesis/CESProofs/Applications/TimeInconsistency.lean:190

Module Section

Time Inconsistency Resolution via Upstream Reform (Gap 11)

In the same file