op_940_dim2_property_p_of_ratio_condition
For N = 2 and any normalized recurrence coefficients a, b, c : Fin 3 → ℝ, property (P) holds whenever the profile at 1 multiplied by (1 + r_1 * r_2) plus r_2 * (1 - r_2) is at most 1, where r_1 and r_2 are the ratio values at indices 1 and 2.
Statement
theorem op_940_dim2_property_p_of_ratio_condition (a b c : Fin 3 → ℝ) (hrec : is_normalized_recurrence 2 a b c) (hineq : recurrence_profile 2 b c ⟨1, by decide⟩ * (1 + recurrence_ratio 2 b c ⟨1, by decide⟩ * recurrence_ratio 2 b c ⟨2, by decide⟩) + recurrence_ratio 2 b c ⟨2, by decide⟩ * (1 - recurrence_ratio 2 b c ⟨2, by decide⟩) ≤ 1) : has_property_p 2 a b c
- Related work
- arXiv:2611.01561 Sec. 6
- Verified
- 04 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 7
- is_normalized_recurrenceFor N : ℕ and a, b, c : Fin (N + 1) → ℝ, the recurrence is normalized if a 0 = 1, b 0 = 0, c 0 = 0, a N = 0, a i + b i + c i = 1 for all i…
- recurrence_profileFor N : ℕ, b, c : Fin (N + 1) → ℝ, and i : Fin (N + 1), the profile is b i + c i.
- recurrence_ratioFor N : ℕ, b, c : Fin (N + 1) → ℝ, and i : Fin (N + 1), the ratio is c i / (b i + c i).
- has_property_pFor N : ℕ and a, b, c : Fin (N + 1) → ℝ, property (P) holds if linearization_coeff N a b c m n k ≥ 0 for all m, n, k : Fin (N + 1).
- linearization_coeffFor N : ℕ, a, b, c : Fin (N + 1) → ℝ, and m, n, k : Fin (N + 1), the linearization coefficient is the (n, k) entry of the matrix…
- recurrence_matrixFor N : ℕ and a, b, c : Fin (N + 1) → ℝ, the tridiagonal matrix of size (N + 1) × (N + 1) has (i, j) entry equal to a i when j.val = i.val…
- recurrence_polyThe sequence of real polynomials R_n for n : ℕ associated with N : ℕ and a, b, c : Fin (N + 1) → ℝ is defined by R_0 = 1, R_1 = X, and for…
- Used by 1
- op_940_dim2_property_p_constant_ratioFor N = 2 and any normalized recurrence coefficients a, b, c : Fin 3 → ℝ with log-concave Newton profile, if the ratio sequence is…
Read back from the Lean
For any three functions $a, b, c : \mathrm{Fin}\ 3 \to \mathbb{R}$, if: 1. $(a, b, c)$ is a normalized recurrence of dimension $2$, meaning: - $a(0) = 1$, $b(0) = 0$, and $c(0) = 0$; - $a(2) = 0$; - $a(i) + b(i) + c(i) = 1$ for all $i \in \mathrm{Fin}\ 3$; - $a(i) > 0$ for all $i \in \mathrm{Fin}\ 3$ with $i < 2$; - $c(i) > 0$ for all $i \in \mathrm{Fin}\ 3$ with $i > 0$; - $b(i) \ge 0$ for all $i \in \mathrm{Fin}\ 3$; and 2. the ratio inequality holds: $$\text{recurrence\_profile}(2, b, c, 1) \cdot \Big(1 + \text{recurrence\_ratio}(2, b, c, 1) \cdot \text{recurrence\_ratio}(2, b, c, 2)\Big) + \text{recurrence\_ratio}(2, b, c, 2) \cdot \Big(1 - \text{recurrence\_ratio}(2, b, c, 2)\Big) \le 1,$$ where $\text{recurrence\_profile}(2, b, c, i) = b(i) + c(i)$ and $\text{recurrence\_ratio}(2, b, c, i) = \frac{c(i)}{b(i) + c(i)}$, then $(a, b, c)$ satisfies Property (P) of dimension $2$, meaning that for all indices $m, n, k \in \mathrm{Fin}\ 3$, the $(n, k)$-entry of the matrix obtained by evaluating the $m$-th recurrence polynomial at the recurrence matrix associated to $(a, b, c)$ is non-negative ($0 \le \text{linearization\_coeff}(2, a, b, c, m, n, k)$).
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
To establish property (P) for dimension N = 2, we show that all entries of the evaluated recurrence polynomials P_m(J) are non-negative for m ∈ {0, 1, 2}, where J is the 3 × 3 Jacobi recurrence matrix. For m = 0 and m = 1, P₀(J) = I and P₁(J) = J have non-negative entries directly from the recurrence normalization. For m = 2, eight of the nine entries of P₂(J) are unconditionally non-negative products of non-negative recurrence coefficients. The final diagonal entry at (2, 2) has numerator a₁ * c₂ + b₂² - b₁ * b₂ - c₁, which op_940_dim2_num_eq_one_sub rewrites as 1 - [profile₁ * (1 + r₁ * r₂) + r₂ * (1 - r₂)]; the given ratio condition guarantees this quantity is non-negative.
The numerator expression a₁ * c₂ + b₂² - b₁ * b₂ - c₁ equals 1 - [profile₁ * (1 + r₁ * r₂) + r₂ * (1 - r₂)].
From recurrence normalization, a₂ = 0 and row sums a₁ + b₁ + c₁ = 1 and a₂ + b₂ + c₂ = 1 give b₂ + c₂ = 1. The ratios simplify: r₂ = c₂ / (b₂ + c₂) = c₂ by div_one, and expanding profile₁ * (1 + r₁ * r₂) gives b₁ + c₁ + c₁ * c₂ after canceling the non-zero denominator b₁ + c₁ via mul_div_cancel₀ and ne_of_gt. The identity then follows from the row sums via linear combination.
uses
div_one,mul_add,mul_div_cancel₀,ne_of_gtlemma op_940_dim2_num_eq_one_sub (a b c : Fin 3 → ℝ) (hrec : is_normalized_recurrence 2 a b c) : a 1 * c 2 + b 2 * b 2 - b 1 * b 2 - c 1 = 1 - (recurrence_profile 2 b c ⟨1, by decide⟩ * (1 + recurrence_ratio 2 b c ⟨1, by decide⟩ * recurrence_ratio 2 b c ⟨2, by decide⟩) + recurrence_ratio 2 b c ⟨2, by decide⟩ * (1 - recurrence_ratio 2 b c ⟨2, by decide⟩)) := by rcases hrec with ⟨ha0, hb0, hc0, ha2, hsum, ha_pos, hc_pos, hb_nonneg⟩ have h2 : (2 : Fin 3) = ⟨2, by decide⟩ := rfl have ha2' : a 2 = 0 := by rw [h2]; exact ha2 have hsum1 : a 1 + b 1 + c 1 = 1 := hsum 1 have hsum2 : a 2 + b 2 + c 2 = 1 := hsum 2 have hb2c2 : b 2 + c 2 = 1 := by linarith [ha2', hsum2] have hc1_pos : 0 < c 1 := hc_pos 1 (by decide) have hb1_nonneg : 0 ≤ b 1 := hb_nonneg 1 have hbc1_pos : 0 < b 1 + c 1 := by linarith have hbc1_ne : b 1 + c 1 ≠ 0 := ne_of_gt hbc1_pos dsimp [recurrence_profile, recurrence_ratio] have hr2 : c 2 / (b 2 + c 2) = c 2 := by rw [hb2c2, div_one] rw [hr2] have hr1 : (b 1 + c 1) * (1 + c 1 / (b 1 + c 1) * c 2) = b 1 + c 1 + c 1 * c 2 := by calc (b 1 + c 1) * (1 + c 1 / (b 1 + c 1) * c 2) _ = (b 1 + c 1) * 1 + (b 1 + c 1) * (c 1 / (b 1 + c 1) * c 2) := mul_add _ _ _ _ = (b 1 + c 1) + ((b 1 + c 1) * (c 1 / (b 1 + c 1))) * c 2 := by ring _ = (b 1 + c 1) + c 1 * c 2 := by rw [mul_div_cancel₀ _ hbc1_ne] rw [hr1] linear_combination c 2 * hsum1 + (-b 1 + b 2 - c 2 + 1) * hb2c2
The linearization coefficient at (m, n, k) = (2, 2, 0) is (1 / a₁) * (c₁ * c₂). automation
Unfolding the definitions of the second recurrence polynomial P₂(X) and evaluating at the recurrence matrix J, expanding the matrix product entries reduces the (2, 0) entry algebraically to (1 / a₁) * (c₁ * c₂).
uses
Algebra.algebraMap_eq_smul_one,Fin.ext_iff,Fin.sum_univ_three,Matrix.mul_apply,Matrix.of_apply,Matrix.one_apply,Matrix.smul_apply,Matrix.sub_apply,Polynomial.aeval_C,Polynomial.aeval_X,Polynomial.aeval_one,map_mul,map_smul,map_sublemma op_940_dim2_coeff_2_2_0 (a b c : Fin 3 → ℝ) : linearization_coeff 2 a b c 2 2 0 = (1 / a 1) * (c 1 * c 2) := by dsimp [linearization_coeff, recurrence_poly] simp only [map_smul, map_sub, map_mul, Polynomial.aeval_X, Polynomial.aeval_C, Polynomial.aeval_one] dsimp [recurrence_matrix] simp only [Matrix.sub_apply, Matrix.mul_apply, Fin.sum_univ_three] simp only [Matrix.of_apply, Algebra.algebraMap_eq_smul_one, Matrix.smul_apply, Matrix.one_apply] simp only [Fin.ext_iff] norm_num left ring
The linearization coefficient at (m, n, k) = (2, 2, 1) is (1 / a₁) * (b₂ * c₂). automation
Evaluating P₂(J) at row 2, column 1 through matrix entry expansion and polynomial evaluation simplifies algebraically to (1 / a₁) * (b₂ * c₂).
uses
Algebra.algebraMap_eq_smul_one,Fin.ext_iff,Fin.sum_univ_three,Matrix.mul_apply,Matrix.of_apply,Matrix.one_apply,Matrix.smul_apply,Matrix.sub_apply,Polynomial.aeval_C,Polynomial.aeval_X,Polynomial.aeval_one,map_mul,map_smul,map_sublemma op_940_dim2_coeff_2_2_1 (a b c : Fin 3 → ℝ) : linearization_coeff 2 a b c 2 2 1 = (1 / a 1) * (b 2 * c 2) := by dsimp [linearization_coeff, recurrence_poly] simp only [map_smul, map_sub, map_mul, Polynomial.aeval_X, Polynomial.aeval_C, Polynomial.aeval_one] dsimp [recurrence_matrix] simp only [Matrix.sub_apply, Matrix.mul_apply, Fin.sum_univ_three] simp only [Matrix.of_apply, Algebra.algebraMap_eq_smul_one, Matrix.smul_apply, Matrix.one_apply] simp only [Fin.ext_iff] norm_num left ring
The linearization coefficient at (m, n, k) = (2, 2, 2) is (1 / a₁) * (a₁ * c₂ + b₂² - b₁ * b₂ - c₁). automation
Evaluating P₂(J) at diagonal entry (2, 2) by matrix product expansion reduces algebraically to (1 / a₁) * (a₁ * c₂ + b₂² - b₁ * b₂ - c₁).
uses
Algebra.algebraMap_eq_smul_one,Fin.ext_iff,Fin.sum_univ_three,Matrix.mul_apply,Matrix.of_apply,Matrix.one_apply,Matrix.smul_apply,Matrix.sub_apply,Polynomial.aeval_C,Polynomial.aeval_X,Polynomial.aeval_one,map_mul,map_smul,map_sublemma op_940_dim2_coeff_2_2_2 (a b c : Fin 3 → ℝ) : linearization_coeff 2 a b c 2 2 2 = (1 / a 1) * (a 1 * c 2 + b 2 * b 2 - b 1 * b 2 - c 1) := by dsimp [linearization_coeff, recurrence_poly] simp only [map_smul, map_sub, map_mul, Polynomial.aeval_X, Polynomial.aeval_C, Polynomial.aeval_one] dsimp [recurrence_matrix] simp only [Matrix.sub_apply, Matrix.mul_apply, Fin.sum_univ_three] simp only [Matrix.of_apply, Algebra.algebraMap_eq_smul_one, Matrix.smul_apply, Matrix.one_apply] simp only [Fin.ext_iff] norm_num left ring
For m = 2, rows 0 and 1 of P₂(J) have entries [0, 0, 1] and [0, c₂, b₂].
Using the boundary conditions a₀ = 1, b₀ = 0, and a₁ ≠ 0 (from a₁ > 0 via ne_of_gt), evaluating the matrix polynomial P₂(J) at rows 0 and 1 explicitly yields 0, 0, 1 for row 0 and 0, c₂, b₂ for row 1.
uses
Algebra.algebraMap_eq_smul_one,Fin.ext_iff,Fin.sum_univ_three,Matrix.mul_apply,Matrix.of_apply,Matrix.one_apply,Matrix.smul_apply,Matrix.sub_apply,Polynomial.aeval_C,Polynomial.aeval_X,Polynomial.aeval_one,map_mul,map_smul,map_sub,ne_of_gtlemma op_940_dim2_coeff_2_others (a b c : Fin 3 → ℝ) (hrec : is_normalized_recurrence 2 a b c) : linearization_coeff 2 a b c 2 0 0 = 0 ∧ linearization_coeff 2 a b c 2 0 1 = 0 ∧ linearization_coeff 2 a b c 2 0 2 = 1 ∧ linearization_coeff 2 a b c 2 1 0 = 0 ∧ linearization_coeff 2 a b c 2 1 1 = c 2 ∧ linearization_coeff 2 a b c 2 1 2 = b 2 := by rcases hrec with ⟨ha0, hb0, hc0, ha2, hsum, ha_pos, hc_pos, hb_nonneg⟩ have h0 : (0 : Fin 3) = ⟨0, by decide⟩ := rfl have ha0' : a 0 = 1 := by rw [h0]; exact ha0 have hb0' : b 0 = 0 := by rw [h0]; exact hb0 have ha1_pos : 0 < a 1 := ha_pos 1 (by decide) have ha1_ne : a 1 ≠ 0 := ne_of_gt ha1_pos dsimp [linearization_coeff, recurrence_poly] simp only [map_smul, map_sub, map_mul, Polynomial.aeval_X, Polynomial.aeval_C, Polynomial.aeval_one] dsimp [recurrence_matrix] simp only [Matrix.sub_apply, Matrix.mul_apply, Fin.sum_univ_three] simp only [Matrix.of_apply, Algebra.algebraMap_eq_smul_one, Matrix.smul_apply, Matrix.one_apply] simp only [Fin.ext_iff] refine ⟨?_, ?_, ?_, ?_, ?_, ?_⟩ · rw [ha0', hb0']; norm_num · rw [ha0', hb0']; norm_num · rw [ha0', hb0']; norm_num [ha1_ne] · rw [ha0', hb0']; norm_num · rw [ha0', hb0']; norm_num [ha1_ne] · rw [ha0', hb0']; norm_num [ha1_ne]
Unpack recurrence normalization conditions and establish non-negativity of 1 / a₁, c₁, c₂, and b₂.
We unpack the recurrence normalization hypothesis to obtain a₀ = 1, b₀ = 0, a₁ > 0 (giving 1 / a₁ ≥ 0 via inv_pos.mpr and le_of_lt), c₁ > 0 (so c₁ ≥ 0), c₂ > 0 (so c₂ ≥ 0), and b₂ ≥ 0.
uses
inv_pos.mpr,le_of_lt,one_div/-- Sufficient algebraic criterion for property (P) when N = 2. -/ theorem op_940_dim2_property_p_of_ratio_condition (a b c : Fin 3 → ℝ) (hrec : is_normalized_recurrence 2 a b c) (hineq : recurrence_profile 2 b c ⟨1, by decide⟩ * (1 + recurrence_ratio 2 b c ⟨1, by decide⟩ * recurrence_ratio 2 b c ⟨2, by decide⟩) + recurrence_ratio 2 b c ⟨2, by decide⟩ * (1 - recurrence_ratio 2 b c ⟨2, by decide⟩) ≤ 1) : has_property_p 2 a b c := by intro m n k rcases hrec with ⟨ha0, hb0, hc0, ha2, hsum, ha_pos, hc_pos, hb_nonneg⟩ have hrec' : is_normalized_recurrence 2 a b c := ⟨ha0, hb0, hc0, ha2, hsum, ha_pos, hc_pos, hb_nonneg⟩ have h0 : (0 : Fin 3) = ⟨0, by decide⟩ := rfl have ha0' : a 0 = 1 := by rw [h0]; exact ha0 have hb0' : b 0 = 0 := by rw [h0]; exact hb0 have ha1_pos : 0 < a 1 := ha_pos 1 (by decide) have ha1_inv_nonneg : 0 ≤ (1 / a 1) := by rw [one_div] exact le_of_lt (inv_pos.mpr ha1_pos) have hc1_nonneg : 0 ≤ c 1 := le_of_lt (hc_pos 1 (by decide)) have hc2_nonneg : 0 ≤ c 2 := le_of_lt (hc_pos 2 (by decide)) have hb2_nonneg : 0 ≤ b 2 := hb_nonneg 2
For m = 0, all linearization coefficients are non-negative. automation
Since P₀ = 1, P₀(J) is the identity matrix. Its entries are given by Matrix.one_apply, which are either 1 or 0, both non-negative.
uses
Matrix.one_apply,Polynomial.aeval_onefin_cases m · dsimp [linearization_coeff, recurrence_poly] simp only [Polynomial.aeval_one] rw [Matrix.one_apply] split_ifs <;> norm_num
For m = 1, all linearization coefficients are non-negative. automation
Since P₁ = X, P₁(J) is the Jacobi recurrence matrix J. Case exhaustion on all 9 pairs (n, k) verifies that each entry is either 0, a₀ = 1, b₀ = 0, c₁ > 0, b₁ ≥ 0, a₁ > 0, c₂ > 0, or b₂ ≥ 0, all non-negative.
uses
Polynomial.aeval_X,le_of_lt· dsimp [linearization_coeff, recurrence_poly] simp only [Polynomial.aeval_X] dsimp [recurrence_matrix] fin_cases n <;> fin_cases k <;> norm_num · rw [hb0'] · rw [ha0']; norm_num · exact le_of_lt (hc_pos 1 (by decide)) · exact hb_nonneg 1 · exact le_of_lt (ha_pos 1 (by decide)) · exact le_of_lt (hc_pos 2 (by decide)) · exact hb_nonneg 2
For m = 2 and rows n = 0, 1, all linearization coefficients are non-negative.
By op_940_dim2_coeff_2_others, rows 0 and 1 of P₂(J) evaluate to [0, 0, 1] and [0, c₂, b₂]. Since c₂ ≥ 0 and b₂ ≥ 0, all six entries are non-negative.
uses
op_940_dim2_coeff_2_others· obtain ⟨h00, h01, h02, h10, h11, h12⟩ := op_940_dim2_coeff_2_others a b c hrec' fin_cases n <;> fin_cases k · change 0 ≤ linearization_coeff 2 a b c 2 0 0 rw [h00] · change 0 ≤ linearization_coeff 2 a b c 2 0 1 rw [h01] · change 0 ≤ linearization_coeff 2 a b c 2 0 2 rw [h02]; norm_num · change 0 ≤ linearization_coeff 2 a b c 2 1 0 rw [h10] · change 0 ≤ linearization_coeff 2 a b c 2 1 1 rw [h11]; exact hc2_nonneg · change 0 ≤ linearization_coeff 2 a b c 2 1 2 rw [h12]; exact hb2_nonneg
For m = 2, row n = 2 and columns k = 0, 1, the linearization coefficients are non-negative.
By op_940_dim2_coeff_2_2_0 and op_940_dim2_coeff_2_2_1, entries (2, 0) and (2, 1) equal (1 / a₁) * (c₁ * c₂) and (1 / a₁) * (b₂ * c₂). As products of non-negative reals, both are non-negative by mul_nonneg.
uses
mul_nonneg,op_940_dim2_coeff_2_2_0,op_940_dim2_coeff_2_2_1· change 0 ≤ linearization_coeff 2 a b c 2 2 0 rw [op_940_dim2_coeff_2_2_0] exact mul_nonneg ha1_inv_nonneg (mul_nonneg hc1_nonneg hc2_nonneg) · change 0 ≤ linearization_coeff 2 a b c 2 2 1 rw [op_940_dim2_coeff_2_2_1] exact mul_nonneg ha1_inv_nonneg (mul_nonneg hb2_nonneg hc2_nonneg)
For m = 2, the entry at (2, 2) is non-negative, completing property (P).
By op_940_dim2_coeff_2_2_2, the entry at (2, 2) is (1 / a₁) * (a₁ * c₂ + b₂² - b₁ * b₂ - c₁). By op_940_dim2_num_eq_one_sub, this numerator is identical to 1 - [profile₁ * (1 + r₁ * r₂) + r₂ * (1 - r₂)], which is non-negative by linear arithmetic from the ratio inequality hineq. Multiplying by 1 / a₁ ≥ 0 via mul_nonneg shows the (2, 2) entry is non-negative.
uses
mul_nonneg,op_940_dim2_coeff_2_2_2,op_940_dim2_num_eq_one_sub· change 0 ≤ linearization_coeff 2 a b c 2 2 2 rw [op_940_dim2_coeff_2_2_2, op_940_dim2_num_eq_one_sub a b c hrec'] have hdiff : 0 ≤ 1 - (recurrence_profile 2 b c ⟨1, by decide⟩ * (1 + recurrence_ratio 2 b c ⟨1, by decide⟩ * recurrence_ratio 2 b c ⟨2, by decide⟩) + recurrence_ratio 2 b c ⟨2, by decide⟩ * (1 - recurrence_ratio 2 b c ⟨2, by decide⟩)) := by linarith exact mul_nonneg ha1_inv_nonneg hdiff
Algebra.algebraMap_eq_smul_one- The canonical map from the scalar ring into an algebra sends r to r • 1.
Fin.ext_iff- Two elements of Fin n are equal if and only if their underlying natural numbers are equal.
Fin.sum_univ_three- The sum of a function over Fin 3 equals the sum of its values at 0, 1, and 2.
Matrix.one_apply- Evaluating the identity matrix at entry (i, j) yields 1 if i = j and 0 otherwise.
Matrix.of_apply- The (i, j)-th entry of a matrix defined by a function f is f i j.
Matrix.mul_apply- The (i, k)-th entry of a matrix product M * N is the sum over j of M i j * N j k.
Matrix.smul_apply- The (i, j)-th entry of a scalar multiple r • A is r • A i j.
Matrix.sub_apply- The (i, j)-th entry of a matrix difference A - B is A i j - B i j.
Polynomial.aeval_C- Evaluating a constant polynomial C(r) at a matrix yields the scalar r times the identity.
Polynomial.aeval_one- Evaluating the constant polynomial 1 at a matrix yields the identity matrix.
Polynomial.aeval_X- Evaluating the indeterminate polynomial X at a matrix yields the matrix itself.
div_one- Dividing an element by 1 yields the element itself.
inv_pos.mpr- The multiplicative inverse of a positive real number is positive.
le_of_lt- A strict inequality a < b implies the non-strict inequality a ≤ b.
map_mul- A multiplicative homomorphism preserves multiplication: f (x * y) = f x * f y.
map_smul- An algebra homomorphism preserves scalar multiplication: f (c • x) = c • f x.
map_sub- An additive group homomorphism preserves subtraction: f (a - b) = f a - f b.
mul_add- Multiplication distributes over addition from the left: a * (b + c) = a * b + a * c.
mul_div_cancel₀- Multiplying b by a / b yields a when b ≠ 0.
mul_nonneg- The product of two non-negative real numbers is non-negative.
ne_of_gt- A strictly greater element is not equal to the lesser element: b < a implies a ≠ b.
one_div- The division 1 / a equals the multiplicative inverse a⁻¹.
op_940_dim2_coeff_2_2_0- The linearization coefficient at (m, n, k) = (2, 2, 0) is (1 / a₁) * (c₁ * c₂).
op_940_dim2_coeff_2_2_1- The linearization coefficient at (m, n, k) = (2, 2, 1) is (1 / a₁) * (b₂ * c₂).
op_940_dim2_coeff_2_2_2- The linearization coefficient at (m, n, k) = (2, 2, 2) is (1 / a₁) * (a₁ * c₂ + b₂² - b₁ * b₂ - c₁).
op_940_dim2_coeff_2_others- For normalized recurrence coefficients in dimension 2, the linearization coefficients for m = 2 in rows 0 and 1 evaluate to [0, 0, 1] and [0, c₂, b₂] respectively.
op_940_dim2_num_eq_one_sub- For normalized recurrence coefficients in dimension 2, the numerator expression a₁ * c₂ + b₂² - b₁ * b₂ - c₁ equals 1 - [profile₁ * (1 + r₁ * r₂) + r₂ * (1 - r₂)].
- Auxiliary lemmas op_940_dim2_coeff_2_2_0 through op_940_dim2_coeff_2_others compute entries of P₂(J) via extensive matrix and polynomial simp expansion followed by ring and norm_num automation.
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.
lemma op_940_dim2_num_eq_one_sub (a b c : Fin 3 → ℝ) (hrec : is_normalized_recurrence 2 a b c) : a 1 * c 2 + b 2 * b 2 - b 1 * b 2 - c 1 = 1 - (recurrence_profile 2 b c ⟨1, by decide⟩ * (1 + recurrence_ratio 2 b c ⟨1, by decide⟩ * recurrence_ratio 2 b c ⟨2, by decide⟩) + recurrence_ratio 2 b c ⟨2, by decide⟩ * (1 - recurrence_ratio 2 b c ⟨2, by decide⟩)) := by rcases hrec with ⟨ha0, hb0, hc0, ha2, hsum, ha_pos, hc_pos, hb_nonneg⟩ have h2 : (2 : Fin 3) = ⟨2, by decide⟩ := rfl have ha2' : a 2 = 0 := by rw [h2]; exact ha2 have hsum1 : a 1 + b 1 + c 1 = 1 := hsum 1 have hsum2 : a 2 + b 2 + c 2 = 1 := hsum 2 have hb2c2 : b 2 + c 2 = 1 := by linarith [ha2', hsum2] have hc1_pos : 0 < c 1 := hc_pos 1 (by decide) have hb1_nonneg : 0 ≤ b 1 := hb_nonneg 1 have hbc1_pos : 0 < b 1 + c 1 := by linarith have hbc1_ne : b 1 + c 1 ≠ 0 := ne_of_gt hbc1_pos dsimp [recurrence_profile, recurrence_ratio] have hr2 : c 2 / (b 2 + c 2) = c 2 := by rw [hb2c2, div_one] rw [hr2] have hr1 : (b 1 + c 1) * (1 + c 1 / (b 1 + c 1) * c 2) = b 1 + c 1 + c 1 * c 2 := by calc (b 1 + c 1) * (1 + c 1 / (b 1 + c 1) * c 2) _ = (b 1 + c 1) * 1 + (b 1 + c 1) * (c 1 / (b 1 + c 1) * c 2) := mul_add _ _ _ _ = (b 1 + c 1) + ((b 1 + c 1) * (c 1 / (b 1 + c 1))) * c 2 := by ring _ = (b 1 + c 1) + c 1 * c 2 := by rw [mul_div_cancel₀ _ hbc1_ne] rw [hr1] linear_combination c 2 * hsum1 + (-b 1 + b 2 - c 2 + 1) * hb2c2lemma op_940_dim2_coeff_2_2_0 (a b c : Fin 3 → ℝ) : linearization_coeff 2 a b c 2 2 0 = (1 / a 1) * (c 1 * c 2) := by dsimp [linearization_coeff, recurrence_poly] simp only [map_smul, map_sub, map_mul, Polynomial.aeval_X, Polynomial.aeval_C, Polynomial.aeval_one] dsimp [recurrence_matrix] simp only [Matrix.sub_apply, Matrix.mul_apply, Fin.sum_univ_three] simp only [Matrix.of_apply, Algebra.algebraMap_eq_smul_one, Matrix.smul_apply, Matrix.one_apply] simp only [Fin.ext_iff] norm_num left ringlemma op_940_dim2_coeff_2_2_1 (a b c : Fin 3 → ℝ) : linearization_coeff 2 a b c 2 2 1 = (1 / a 1) * (b 2 * c 2) := by dsimp [linearization_coeff, recurrence_poly] simp only [map_smul, map_sub, map_mul, Polynomial.aeval_X, Polynomial.aeval_C, Polynomial.aeval_one] dsimp [recurrence_matrix] simp only [Matrix.sub_apply, Matrix.mul_apply, Fin.sum_univ_three] simp only [Matrix.of_apply, Algebra.algebraMap_eq_smul_one, Matrix.smul_apply, Matrix.one_apply] simp only [Fin.ext_iff] norm_num left ringlemma op_940_dim2_coeff_2_2_2 (a b c : Fin 3 → ℝ) : linearization_coeff 2 a b c 2 2 2 = (1 / a 1) * (a 1 * c 2 + b 2 * b 2 - b 1 * b 2 - c 1) := by dsimp [linearization_coeff, recurrence_poly] simp only [map_smul, map_sub, map_mul, Polynomial.aeval_X, Polynomial.aeval_C, Polynomial.aeval_one] dsimp [recurrence_matrix] simp only [Matrix.sub_apply, Matrix.mul_apply, Fin.sum_univ_three] simp only [Matrix.of_apply, Algebra.algebraMap_eq_smul_one, Matrix.smul_apply, Matrix.one_apply] simp only [Fin.ext_iff] norm_num left ringlemma op_940_dim2_coeff_2_others (a b c : Fin 3 → ℝ) (hrec : is_normalized_recurrence 2 a b c) : linearization_coeff 2 a b c 2 0 0 = 0 ∧ linearization_coeff 2 a b c 2 0 1 = 0 ∧ linearization_coeff 2 a b c 2 0 2 = 1 ∧ linearization_coeff 2 a b c 2 1 0 = 0 ∧ linearization_coeff 2 a b c 2 1 1 = c 2 ∧ linearization_coeff 2 a b c 2 1 2 = b 2 := by rcases hrec with ⟨ha0, hb0, hc0, ha2, hsum, ha_pos, hc_pos, hb_nonneg⟩ have h0 : (0 : Fin 3) = ⟨0, by decide⟩ := rfl have ha0' : a 0 = 1 := by rw [h0]; exact ha0 have hb0' : b 0 = 0 := by rw [h0]; exact hb0 have ha1_pos : 0 < a 1 := ha_pos 1 (by decide) have ha1_ne : a 1 ≠ 0 := ne_of_gt ha1_pos dsimp [linearization_coeff, recurrence_poly] simp only [map_smul, map_sub, map_mul, Polynomial.aeval_X, Polynomial.aeval_C, Polynomial.aeval_one] dsimp [recurrence_matrix] simp only [Matrix.sub_apply, Matrix.mul_apply, Fin.sum_univ_three] simp only [Matrix.of_apply, Algebra.algebraMap_eq_smul_one, Matrix.smul_apply, Matrix.one_apply] simp only [Fin.ext_iff] refine ⟨?_, ?_, ?_, ?_, ?_, ?_⟩ · rw [ha0', hb0']; norm_num · rw [ha0', hb0']; norm_num · rw [ha0', hb0']; norm_num [ha1_ne] · rw [ha0', hb0']; norm_num · rw [ha0', hb0']; norm_num [ha1_ne] · rw [ha0', hb0']; norm_num [ha1_ne]/-- Sufficient algebraic criterion for property (P) when N = 2. -/theorem op_940_dim2_property_p_of_ratio_condition (a b c : Fin 3 → ℝ) (hrec : is_normalized_recurrence 2 a b c) (hineq : recurrence_profile 2 b c ⟨1, by decide⟩ * (1 + recurrence_ratio 2 b c ⟨1, by decide⟩ * recurrence_ratio 2 b c ⟨2, by decide⟩) + recurrence_ratio 2 b c ⟨2, by decide⟩ * (1 - recurrence_ratio 2 b c ⟨2, by decide⟩) ≤ 1) : has_property_p 2 a b c := by intro m n k rcases hrec with ⟨ha0, hb0, hc0, ha2, hsum, ha_pos, hc_pos, hb_nonneg⟩ have hrec' : is_normalized_recurrence 2 a b c := ⟨ha0, hb0, hc0, ha2, hsum, ha_pos, hc_pos, hb_nonneg⟩ have h0 : (0 : Fin 3) = ⟨0, by decide⟩ := rfl have ha0' : a 0 = 1 := by rw [h0]; exact ha0 have hb0' : b 0 = 0 := by rw [h0]; exact hb0 have ha1_pos : 0 < a 1 := ha_pos 1 (by decide) have ha1_inv_nonneg : 0 ≤ (1 / a 1) := by rw [one_div] exact le_of_lt (inv_pos.mpr ha1_pos) have hc1_nonneg : 0 ≤ c 1 := le_of_lt (hc_pos 1 (by decide)) have hc2_nonneg : 0 ≤ c 2 := le_of_lt (hc_pos 2 (by decide)) have hb2_nonneg : 0 ≤ b 2 := hb_nonneg 2 fin_cases m · dsimp [linearization_coeff, recurrence_poly] simp only [Polynomial.aeval_one] rw [Matrix.one_apply] split_ifs <;> norm_num · dsimp [linearization_coeff, recurrence_poly] simp only [Polynomial.aeval_X] dsimp [recurrence_matrix] fin_cases n <;> fin_cases k <;> norm_num · rw [hb0'] · rw [ha0']; norm_num · exact le_of_lt (hc_pos 1 (by decide)) · exact hb_nonneg 1 · exact le_of_lt (ha_pos 1 (by decide)) · exact le_of_lt (hc_pos 2 (by decide)) · exact hb_nonneg 2 · obtain ⟨h00, h01, h02, h10, h11, h12⟩ := op_940_dim2_coeff_2_others a b c hrec' fin_cases n <;> fin_cases k · change 0 ≤ linearization_coeff 2 a b c 2 0 0 rw [h00] · change 0 ≤ linearization_coeff 2 a b c 2 0 1 rw [h01] · change 0 ≤ linearization_coeff 2 a b c 2 0 2 rw [h02]; norm_num · change 0 ≤ linearization_coeff 2 a b c 2 1 0 rw [h10] · change 0 ≤ linearization_coeff 2 a b c 2 1 1 rw [h11]; exact hc2_nonneg · change 0 ≤ linearization_coeff 2 a b c 2 1 2 rw [h12]; exact hb2_nonneg · change 0 ≤ linearization_coeff 2 a b c 2 2 0 rw [op_940_dim2_coeff_2_2_0] exact mul_nonneg ha1_inv_nonneg (mul_nonneg hc1_nonneg hc2_nonneg) · change 0 ≤ linearization_coeff 2 a b c 2 2 1 rw [op_940_dim2_coeff_2_2_1] exact mul_nonneg ha1_inv_nonneg (mul_nonneg hb2_nonneg hc2_nonneg) · change 0 ≤ linearization_coeff 2 a b c 2 2 2 rw [op_940_dim2_coeff_2_2_2, op_940_dim2_num_eq_one_sub a b c hrec'] have hdiff : 0 ≤ 1 - (recurrence_profile 2 b c ⟨1, by decide⟩ * (1 + recurrence_ratio 2 b c ⟨1, by decide⟩ * recurrence_ratio 2 b c ⟨2, by decide⟩) + recurrence_ratio 2 b c ⟨2, by decide⟩ * (1 - recurrence_ratio 2 b c ⟨2, by decide⟩)) := by linarith exact mul_nonneg ha1_inv_nonneg hdiff