AFTD Auto-Formalizing Theoretical Domains

closed_network_end_node_response_bound

theoremverified

For any real numbers s and t with |s| ≤ 1 and |t| ≤ 1, |s + t| / 2 + |s - t| / 2 ≤ 1.

Statement

theorem closed_network_end_node_response_bound
    (s t : ℝ) (hs : |s| ≤ 1) (ht : |t| ≤ 1) :
    |s + t| / 2 + |s - t| / 2 ≤ 1
Source
arXiv:2610.35838 Eq. 30
Verified
08 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 2
  • three_qubit_dof_inequalityFor three qubits (d₁ = d₂ = d₃ = 2), the dimensional degree-of-freedom inequality ∑_{j=1}^3 d_j^2 ≥ ∏_{j=1}^3 d_j + 3 holds, that is, 2^2…
  • stabilizedSubspace_botFor any natural number $n$, the stabilized subspace of the trivial subgroup…

Read back from the Lean

For all real numbers $s$ and $t$, if $|s| \le 1$ and $|t| \le 1$, then $\frac{|s + t|}{2} + \frac{|s - t|}{2} \le 1$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The inequality $(|s + t| + |s - t|)/2 \le 1$ is established by case analysis on the signs of $s + t$ and $s - t$. First, the hypotheses $|s| \le 1$ and $|t| \le 1$ are converted into the two-sided bounds $-1 \le s \le 1$ and $-1 \le t \le 1$. Totality of the ordering on $\mathbb{R}$ yields a four-way case split on the signs of $s + t$ and $s - t$. In each quadrant, eliminating the absolute values reduces $(|s + t| + |s - t|)/2$ to one of $s, t, -t$, or $-s$, all of which are bounded by $1$ by linear arithmetic.

  1. The variables $s$ and $t$ lie in the interval $[-1, 1]$, that is, $-1 \le s \le 1$ and $-1 \le t \le 1$.

    Applying `abs_le.mp` to the hypotheses $|s| \le 1$ and $|t| \le 1$ unfolds each absolute value inequality into two-sided bounds, giving $-1 \le s \le 1$ and $-1 \le t \le 1$.

    lines 5–6

    uses abs_le.mp

      have hs' := abs_le.mp hs
      have ht' := abs_le.mp ht
  2. The inequality $|s + t| / 2 + |s - t| / 2 \le 1$ holds whenever $s + t \ge 0$.

    Using `le_total`, we split into cases depending on whether $0 \le s + t$ or $s + t \le 0$. Assuming $0 \le s + t$, we further branch on the sign of $s - t$ using `le_total`: - If $0 \le s - t$, both $s + t$ and $s - t$ are non-negative, so `abs_of_nonneg` evaluates $|s + t|$ to $s + t$ and $|s - t|$ to $s - t$. The expression simplifies to $(s + t)/2 + (s - t)/2 = s$, which is at most $1$ by linear arithmetic since $s \le 1$. - If $s - t \le 0$, `abs_of_nonneg` and `abs_of_nonpos` evaluate the absolute values to $s + t$ and $-(s - t)$ respectively. The expression simplifies to $(s + t)/2 - (s - t)/2 = t$, which is at most $1$ by linear arithmetic since $t \le 1$.

    lines 7–12

    uses le_total, abs_of_nonneg, abs_of_nonpos

      rcases le_total 0 (s + t) with hst | hst
      · rcases le_total 0 (s - t) with hsub | hsub
        · rw [abs_of_nonneg hst, abs_of_nonneg hsub]
          linarith
        · rw [abs_of_nonneg hst, abs_of_nonpos hsub]
          linarith
  3. The inequality $|s + t| / 2 + |s - t| / 2 \le 1$ holds whenever $s + t \le 0$, completing the proof.

    In the remaining case where $s + t \le 0$, we again split on the sign of $s - t$ using `le_total`: - If $0 \le s - t$, `abs_of_nonpos` gives $|s + t| = -(s + t)$ and `abs_of_nonneg` gives $|s - t| = s - t$. The expression simplifies to $-(s + t)/2 + (s - t)/2 = -t$, which is at most $1$ by linear arithmetic since $-1 \le t$. - If $s - t \le 0$, both terms are non-positive, so `abs_of_nonpos` gives $|s + t| = -(s + t)$ and $|s - t| = -(s - t)$. The expression simplifies to $-(s + t)/2 - (s - t)/2 = -s$, which is at most $1$ by linear arithmetic since $-1 \le s$.

    lines 13–17

    uses le_total, abs_of_nonpos, abs_of_nonneg

      · rcases le_total 0 (s - t) with hsub | hsub
        · rw [abs_of_nonpos hst, abs_of_nonneg hsub]
          linarith
        · rw [abs_of_nonpos hst, abs_of_nonpos hsub]
          linarith
abs_le.mp
For any real numbers $a$ and $b$, if $|a| \le b$, then $-b \le a \le b$.
abs_of_nonneg
If $a \ge 0$, then $|a| = a$.
abs_of_nonpos
If $a \le 0$, then $|a| = -a$.
le_total
For any elements $a$ and $b$ in a linear order, either $a \le b$ or $b \le a$.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Elementary bound on the sum of sum and difference absolute values for response variables in [-1, 1]. -/theorem closed_network_end_node_response_bound    (s t : ℝ) (hs : |s| ≤ 1) (ht : |t| ≤ 1) :    |s + t| / 2 + |s - t| / 2 ≤ 1 := by  have hs' := abs_le.mp hs  have ht' := abs_le.mp ht  rcases le_total 0 (s + t) with hst | hst  · rcases le_total 0 (s - t) with hsub | hsub    · rw [abs_of_nonneg hst, abs_of_nonneg hsub]      linarith    · rw [abs_of_nonneg hst, abs_of_nonpos hsub]      linarith  · rcases le_total 0 (s - t) with hsub | hsub    · rw [abs_of_nonpos hst, abs_of_nonneg hsub]      linarith    · rw [abs_of_nonpos hst, abs_of_nonpos hsub]      linarith
See it in the graphDiscuss this resultChallenge it