op223_rational_shift_diagonal_certificate
The displayed rational values satisfy the root secular identity and the strict core, tail, and six path diagonal inequalities for the proposed rational weighted example. Its matrix interpretation needs separate proof.
Statement
theorem op223_rational_shift_diagonal_certificate : let C : ℚ := 272781/137530 let P : ℚ := 5913/13753 let E : ℚ := 6597/4045 let d : ℚ := 3/P^2 let dv : ℚ := 3/7 + ((3/14 : ℚ)^2)*d let dj : ℚ := 8/3 + ((4/3 : ℚ)^2)*dv let dx : ℚ := 28/3 + ((7/3 : ℚ)^2)*dv let db : ℚ := 36/5 + (2 : ℚ)^2*dv let da : ℚ := 8/15 + ((1/3 : ℚ)^2)*dv let tail : ℚ := 1/3 + C^2*d/9 let pathdiag := fun k : Fin 6 => let t : ℚ := (k : ℕ) 2*(t+1)*(6-t)/21 + E^2*d*(4/7 : ℚ)^2*((6-t)/6)^2 C^2+P^2+(12/7 : ℚ)*E^2 = 243/28 ∧ dv < d ∧ dj < d ∧ dx < d ∧ db < d ∧ da < d ∧ tail < d ∧ (∀ k : Fin 6, pathdiag k < d)
- Source
- Exact finite arithmetic for the rational weighted-shift example, experiment 27866.
- Verified
- 15 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext
The proof, explained
The proof verifies the rational certificate by direct computation. After unfolding all local definitions and decomposing the eight-part conjunction into individual subgoals, the root secular identity and the six scalar diagonal inequalities are confirmed via exact rational arithmetic (`norm_num`). The remaining condition on the path diagonals is established by exhaustively checking each of the six elements of `Fin 6` through case analysis and rational computation.
The problem reduces to verifying the secular identity, the six scalar inequalities, and the universal path diagonal inequality individually.
Expanding the local `let` definitions (`dsimp only`) substitutes the explicit rational values of $C$, $P$, $E$, $d$, $dv$, $dj$, $dx$, $db$, $da$, $tail$, and $pathdiag$ into the goal. Splitting the resulting eight-part conjunction (`refine ⟨?_, ...⟩`) yields eight independent subgoals.
dsimp only refine ⟨?_, ?_, ?_, ?_, ?_, ?_, ?_, ?_⟩
The root secular identity $C^2 + P^2 + \frac{12}{7} E^2 = \frac{243}{28}$ holds.
Evaluating the left-hand side with the rational values $C = \frac{272781}{137530}$, $P = \frac{5913}{13753}$, and $E = \frac{6597}{4045}$ simplifies both sides to identical rational numbers, verified by exact arithmetic computation (`norm_num`).
· norm_numThe six core and tail strict diagonal inequalities $dv < d$, $dj < d$, $dx < d$, $db < d$, $da < d$, and $tail < d$ hold.
Each of the six subgoals is an inequality between concrete rational expressions. Exact rational arithmetic (`norm_num`) evaluates the arithmetic operations on fractions and confirms each strict inequality in turn.
· norm_num · norm_num · norm_num · norm_num · norm_num · norm_num
For every index $k \in \{0, 1, 2, 3, 4, 5\}$, the path diagonal inequality $pathdiag(k) < d$ holds.
Introducing an arbitrary index $k$ in the finite domain `Fin 6` (`intro k`) and performing exhaustive case analysis (`fin_cases k`) reduces the universal quantifier to the six cases $k = 0, 1, 2, 3, 4, 5$. In each case, exact rational arithmetic (`norm_num`) checks that the strict inequality holds.
· intro k fin_cases k <;> norm_num
- The verification relies on the `norm_num` decision procedure to perform exact rational arithmetic with large fractions, discharging the algebraic identity and all strict inequalities algorithmically without manual calculation steps.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option maxHeartbeats 1000000theorem op223_rational_shift_diagonal_certificate : let C : ℚ := 272781/137530 let P : ℚ := 5913/13753 let E : ℚ := 6597/4045 let d : ℚ := 3/P^2 let dv : ℚ := 3/7 + ((3/14 : ℚ)^2)*d let dj : ℚ := 8/3 + ((4/3 : ℚ)^2)*dv let dx : ℚ := 28/3 + ((7/3 : ℚ)^2)*dv let db : ℚ := 36/5 + (2 : ℚ)^2*dv let da : ℚ := 8/15 + ((1/3 : ℚ)^2)*dv let tail : ℚ := 1/3 + C^2*d/9 let pathdiag := fun k : Fin 6 => let t : ℚ := (k : ℕ) 2*(t+1)*(6-t)/21 + E^2*d*(4/7 : ℚ)^2*((6-t)/6)^2 C^2+P^2+(12/7 : ℚ)*E^2 = 243/28 ∧ dv < d ∧ dj < d ∧ dx < d ∧ db < d ∧ da < d ∧ tail < d ∧ (∀ k : Fin 6, pathdiag k < d) := by dsimp only refine ⟨?_, ?_, ?_, ?_, ?_, ?_, ?_, ?_⟩ · norm_num · norm_num · norm_num · norm_num · norm_num · norm_num · norm_num · intro k fin_cases k <;> norm_num