Commit 700cdc94 by Rene Thiemann

tuned proofs

parent 9ff0da80391b
 ... ... @@ -654,7 +654,6 @@ proof - from j j_n have jR: "j \ C" and j: "j < n" by auto let ?exp = "\ k. sum (\ ii. P \$\$ (i, ii) * (J ^\<^sub>m k) \$\$ (ii,j)) {.. k. cmod (?exp (f off k) * inv_op off k))" let ?j = "j - (m - 1)" define G where "G = (\ k. (A ^\<^sub>m f off k *\<^sub>v v) \$v i * inv_op off k)" { fix kk ... ... @@ -754,8 +753,7 @@ proof - Re (\jj = 0..ia = 0.. C \ jj = ia - (m - 1) then (lambda ia)^off else 0) * u \$v ia))" unfolding A_to_u G_def by (rule tendsto_Re[OF tendsto_sum[OF tendsto_mult[OF _ tendsto_sum[OF tendsto_mult[OF limit_jordan_matrix]]]]], auto) by (intro tendsto_intros limit_jordan_matrix, auto) also have "(\jj = 0..ia = 0.. C \ jj = ia - (m - 1) then (lambda ia)^off else 0) * u \$v ia)) = (\jj = 0..ia \ C. (if ia \ C \ jj = ia - (m - 1) then P \$\$ (i, jj) else 0) * ((lambda ia)^off * u \$v ia)))" ... ...
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!