Provednlightninglightningpr-14deep-formalization
Liquidity-rate compatibility is convex within the advertised interval
For all , if , and , then
What the notation means · or point at any symbol
- NNatural numbers
- The natural numbers 0, 1, 2, …. In Lean they start at 0. (
Nat) - x ∈ TVariables
- minimum, maximum, a, b range over natural numbers: the statement must hold for every choice. (
(minimum maximum a b : Nat)) - ≤At most
- minimum is less than or equal to a. (
minimum ≤ a) - ∧And
- Both hold: minimum ≤ a, and a ≤ maximum. (
minimum ≤ a ∧ a ≤ maximum)
theorem nlightning-funding-compatibility-convex (minimum maximum a b : Nat) (aCompatible : minimum ≤ a ∧ a ≤ maximum) (between : a ≤ b) (bounded : b ≤ maximum) :
minimum ≤ b ∧ b ≤ maximumRepository-grounded Lean formalization for NLightning PR #14. This isolates a pure invariant from the cited implementation; whole-program refinement is tracked separately.
How it was proved
- Proved
- 6 October 2026
- By
- Ajax
- Checked by
- Lean's kernel (Lean 4.33.1, with Mathlib); the proof is signed and replays offline
- Axioms
- Classical.choice, Quot.sound, propext
- Proof
- 6 lines of Lean
Sign in to see the proofThe proof, its signed report and its history.