src/HOL/Multivariate_Analysis/Linear_Algebra.thy
 author wenzelm Fri Oct 05 13:57:48 2012 +0200 (2012-10-05) changeset 49711 e5aaae7eadc9 parent 49663 b84fafaea4bb child 50104 de19856feb54 permissions -rw-r--r--
tuned proofs;
 huffman@44133 ` 1` ```(* Title: HOL/Multivariate_Analysis/Linear_Algebra.thy ``` huffman@44133 ` 2` ``` Author: Amine Chaieb, University of Cambridge ``` huffman@44133 ` 3` ```*) ``` huffman@44133 ` 4` huffman@44133 ` 5` ```header {* Elementary linear algebra on Euclidean spaces *} ``` huffman@44133 ` 6` huffman@44133 ` 7` ```theory Linear_Algebra ``` huffman@44133 ` 8` ```imports ``` huffman@44133 ` 9` ``` Euclidean_Space ``` huffman@44133 ` 10` ``` "~~/src/HOL/Library/Infinite_Set" ``` huffman@44133 ` 11` ```begin ``` huffman@44133 ` 12` huffman@44133 ` 13` ```lemma cond_application_beta: "(if b then f else g) x = (if b then f x else g x)" ``` huffman@44133 ` 14` ``` by auto ``` huffman@44133 ` 15` huffman@44133 ` 16` ```notation inner (infix "\" 70) ``` huffman@44133 ` 17` huffman@44133 ` 18` ```lemma square_bound_lemma: "(x::real) < (1 + x) * (1 + x)" ``` wenzelm@49522 ` 19` ```proof - ``` huffman@44133 ` 20` ``` have "(x + 1/2)^2 + 3/4 > 0" using zero_le_power2[of "x+1/2"] by arith ``` wenzelm@49652 ` 21` ``` then show ?thesis by (simp add: field_simps power2_eq_square) ``` huffman@44133 ` 22` ```qed ``` huffman@44133 ` 23` huffman@44133 ` 24` ```lemma square_continuous: "0 < (e::real) ==> \d. 0 < d \ (\y. abs(y - x) < d \ abs(y * y - x * x) < e)" ``` wenzelm@49522 ` 25` ``` using isCont_power[OF isCont_ident, of 2, unfolded isCont_def LIM_eq, rule_format, of e x] ``` wenzelm@49522 ` 26` ``` apply (auto simp add: power2_eq_square) ``` huffman@44133 ` 27` ``` apply (rule_tac x="s" in exI) ``` huffman@44133 ` 28` ``` apply auto ``` huffman@44133 ` 29` ``` apply (erule_tac x=y in allE) ``` huffman@44133 ` 30` ``` apply auto ``` huffman@44133 ` 31` ``` done ``` huffman@44133 ` 32` huffman@44133 ` 33` ```lemma real_le_lsqrt: "0 <= x \ 0 <= y \ x <= y^2 ==> sqrt x <= y" ``` huffman@44133 ` 34` ``` using real_sqrt_le_iff[of x "y^2"] by simp ``` huffman@44133 ` 35` huffman@44133 ` 36` ```lemma real_le_rsqrt: "x^2 \ y \ x \ sqrt y" ``` huffman@44133 ` 37` ``` using real_sqrt_le_mono[of "x^2" y] by simp ``` huffman@44133 ` 38` huffman@44133 ` 39` ```lemma real_less_rsqrt: "x^2 < y \ x < sqrt y" ``` huffman@44133 ` 40` ``` using real_sqrt_less_mono[of "x^2" y] by simp ``` huffman@44133 ` 41` wenzelm@49522 ` 42` ```lemma sqrt_even_pow2: ``` wenzelm@49522 ` 43` ``` assumes n: "even n" ``` huffman@44133 ` 44` ``` shows "sqrt(2 ^ n) = 2 ^ (n div 2)" ``` wenzelm@49522 ` 45` ```proof - ``` huffman@44133 ` 46` ``` from n obtain m where m: "n = 2*m" unfolding even_mult_two_ex .. ``` huffman@44133 ` 47` ``` from m have "sqrt(2 ^ n) = sqrt ((2 ^ m) ^ 2)" ``` huffman@44133 ` 48` ``` by (simp only: power_mult[symmetric] mult_commute) ``` huffman@44133 ` 49` ``` then show ?thesis using m by simp ``` huffman@44133 ` 50` ```qed ``` huffman@44133 ` 51` huffman@44133 ` 52` ```lemma real_div_sqrt: "0 <= x ==> x / sqrt(x) = sqrt(x)" ``` huffman@44133 ` 53` ``` apply (cases "x = 0", simp_all) ``` huffman@44133 ` 54` ``` using sqrt_divide_self_eq[of x] ``` huffman@44133 ` 55` ``` apply (simp add: inverse_eq_divide field_simps) ``` huffman@44133 ` 56` ``` done ``` huffman@44133 ` 57` huffman@44133 ` 58` ```text{* Hence derive more interesting properties of the norm. *} ``` huffman@44133 ` 59` huffman@44133 ` 60` ```lemma norm_eq_0_dot: "(norm x = 0) \ (inner x x = (0::real))" ``` huffman@44666 ` 61` ``` by simp (* TODO: delete *) ``` huffman@44133 ` 62` wenzelm@49522 ` 63` ```lemma norm_cauchy_schwarz: "inner x y <= norm x * norm y" ``` huffman@44666 ` 64` ``` (* TODO: move to Inner_Product.thy *) ``` huffman@44133 ` 65` ``` using Cauchy_Schwarz_ineq2[of x y] by auto ``` huffman@44133 ` 66` huffman@44133 ` 67` ```lemma norm_triangle_sub: ``` huffman@44133 ` 68` ``` fixes x y :: "'a::real_normed_vector" ``` huffman@44133 ` 69` ``` shows "norm x \ norm y + norm (x - y)" ``` huffman@44133 ` 70` ``` using norm_triangle_ineq[of "y" "x - y"] by (simp add: field_simps) ``` huffman@44133 ` 71` huffman@44133 ` 72` ```lemma norm_le: "norm(x) <= norm(y) \ x \ x <= y \ y" ``` huffman@44133 ` 73` ``` by (simp add: norm_eq_sqrt_inner) ``` huffman@44666 ` 74` huffman@44133 ` 75` ```lemma norm_lt: "norm(x) < norm(y) \ x \ x < y \ y" ``` huffman@44133 ` 76` ``` by (simp add: norm_eq_sqrt_inner) ``` huffman@44666 ` 77` huffman@44133 ` 78` ```lemma norm_eq: "norm(x) = norm (y) \ x \ x = y \ y" ``` wenzelm@49522 ` 79` ``` apply (subst order_eq_iff) ``` wenzelm@49522 ` 80` ``` apply (auto simp: norm_le) ``` wenzelm@49522 ` 81` ``` done ``` huffman@44666 ` 82` huffman@44133 ` 83` ```lemma norm_eq_1: "norm(x) = 1 \ x \ x = 1" ``` huffman@44666 ` 84` ``` by (simp add: norm_eq_sqrt_inner) ``` huffman@44133 ` 85` huffman@44133 ` 86` ```text{* Squaring equations and inequalities involving norms. *} ``` huffman@44133 ` 87` huffman@44133 ` 88` ```lemma dot_square_norm: "x \ x = norm(x)^2" ``` huffman@44666 ` 89` ``` by (simp only: power2_norm_eq_inner) (* TODO: move? *) ``` huffman@44133 ` 90` huffman@44133 ` 91` ```lemma norm_eq_square: "norm(x) = a \ 0 <= a \ x \ x = a^2" ``` huffman@44133 ` 92` ``` by (auto simp add: norm_eq_sqrt_inner) ``` huffman@44133 ` 93` huffman@44133 ` 94` ```lemma real_abs_le_square_iff: "\x\ \ \y\ \ (x::real)^2 \ y^2" ``` huffman@44133 ` 95` ```proof ``` huffman@44133 ` 96` ``` assume "\x\ \ \y\" ``` huffman@44133 ` 97` ``` then have "\x\\ \ \y\\" by (rule power_mono, simp) ``` huffman@44133 ` 98` ``` then show "x\ \ y\" by simp ``` huffman@44133 ` 99` ```next ``` huffman@44133 ` 100` ``` assume "x\ \ y\" ``` huffman@44133 ` 101` ``` then have "sqrt (x\) \ sqrt (y\)" by (rule real_sqrt_le_mono) ``` huffman@44133 ` 102` ``` then show "\x\ \ \y\" by simp ``` huffman@44133 ` 103` ```qed ``` huffman@44133 ` 104` huffman@44133 ` 105` ```lemma norm_le_square: "norm(x) <= a \ 0 <= a \ x \ x <= a^2" ``` huffman@44133 ` 106` ``` apply (simp add: dot_square_norm real_abs_le_square_iff[symmetric]) ``` huffman@44133 ` 107` ``` using norm_ge_zero[of x] ``` huffman@44133 ` 108` ``` apply arith ``` huffman@44133 ` 109` ``` done ``` huffman@44133 ` 110` huffman@44133 ` 111` ```lemma norm_ge_square: "norm(x) >= a \ a <= 0 \ x \ x >= a ^ 2" ``` huffman@44133 ` 112` ``` apply (simp add: dot_square_norm real_abs_le_square_iff[symmetric]) ``` huffman@44133 ` 113` ``` using norm_ge_zero[of x] ``` huffman@44133 ` 114` ``` apply arith ``` huffman@44133 ` 115` ``` done ``` huffman@44133 ` 116` huffman@44133 ` 117` ```lemma norm_lt_square: "norm(x) < a \ 0 < a \ x \ x < a^2" ``` huffman@44133 ` 118` ``` by (metis not_le norm_ge_square) ``` huffman@44133 ` 119` ```lemma norm_gt_square: "norm(x) > a \ a < 0 \ x \ x > a^2" ``` huffman@44133 ` 120` ``` by (metis norm_le_square not_less) ``` huffman@44133 ` 121` huffman@44133 ` 122` ```text{* Dot product in terms of the norm rather than conversely. *} ``` huffman@44133 ` 123` huffman@44282 ` 124` ```lemmas inner_simps = inner_add_left inner_add_right inner_diff_right inner_diff_left ``` wenzelm@49522 ` 125` ``` inner_scaleR_left inner_scaleR_right ``` huffman@44133 ` 126` huffman@44133 ` 127` ```lemma dot_norm: "x \ y = (norm(x + y) ^2 - norm x ^ 2 - norm y ^ 2) / 2" ``` huffman@44133 ` 128` ``` unfolding power2_norm_eq_inner inner_simps inner_commute by auto ``` huffman@44133 ` 129` huffman@44133 ` 130` ```lemma dot_norm_neg: "x \ y = ((norm x ^ 2 + norm y ^ 2) - norm(x - y) ^ 2) / 2" ``` wenzelm@49525 ` 131` ``` unfolding power2_norm_eq_inner inner_simps inner_commute ``` wenzelm@49525 ` 132` ``` by (auto simp add: algebra_simps) ``` huffman@44133 ` 133` huffman@44133 ` 134` ```text{* Equality of vectors in terms of @{term "op \"} products. *} ``` huffman@44133 ` 135` huffman@44133 ` 136` ```lemma vector_eq: "x = y \ x \ x = x \ y \ y \ y = x \ x" (is "?lhs \ ?rhs") ``` huffman@44133 ` 137` ```proof ``` wenzelm@49652 ` 138` ``` assume ?lhs ``` wenzelm@49652 ` 139` ``` then show ?rhs by simp ``` huffman@44133 ` 140` ```next ``` huffman@44133 ` 141` ``` assume ?rhs ``` huffman@44133 ` 142` ``` then have "x \ x - x \ y = 0 \ x \ y - y \ y = 0" by simp ``` wenzelm@49652 ` 143` ``` then have "x \ (x - y) = 0 \ y \ (x - y) = 0" by (simp add: inner_diff inner_commute) ``` huffman@44454 ` 144` ``` then have "(x - y) \ (x - y) = 0" by (simp add: field_simps inner_diff inner_commute) ``` huffman@44133 ` 145` ``` then show "x = y" by (simp) ``` huffman@44133 ` 146` ```qed ``` huffman@44133 ` 147` huffman@44133 ` 148` ```lemma norm_triangle_half_r: ``` huffman@44133 ` 149` ``` shows "norm (y - x1) < e / 2 \ norm (y - x2) < e / 2 \ norm (x1 - x2) < e" ``` huffman@44133 ` 150` ``` using dist_triangle_half_r unfolding dist_norm[THEN sym] by auto ``` huffman@44133 ` 151` wenzelm@49522 ` 152` ```lemma norm_triangle_half_l: ``` wenzelm@49522 ` 153` ``` assumes "norm (x - y) < e / 2" "norm (x' - (y)) < e / 2" ``` huffman@44133 ` 154` ``` shows "norm (x - x') < e" ``` huffman@44133 ` 155` ``` using dist_triangle_half_l[OF assms[unfolded dist_norm[THEN sym]]] ``` huffman@44133 ` 156` ``` unfolding dist_norm[THEN sym] . ``` huffman@44133 ` 157` huffman@44133 ` 158` ```lemma norm_triangle_le: "norm(x) + norm y <= e ==> norm(x + y) <= e" ``` huffman@44666 ` 159` ``` by (rule norm_triangle_ineq [THEN order_trans]) ``` huffman@44133 ` 160` huffman@44133 ` 161` ```lemma norm_triangle_lt: "norm(x) + norm(y) < e ==> norm(x + y) < e" ``` huffman@44666 ` 162` ``` by (rule norm_triangle_ineq [THEN le_less_trans]) ``` huffman@44133 ` 163` huffman@44133 ` 164` ```lemma setsum_clauses: ``` huffman@44133 ` 165` ``` shows "setsum f {} = 0" ``` wenzelm@49525 ` 166` ``` and "finite S \ setsum f (insert x S) = (if x \ S then setsum f S else f x + setsum f S)" ``` huffman@44133 ` 167` ``` by (auto simp add: insert_absorb) ``` huffman@44133 ` 168` huffman@44133 ` 169` ```lemma setsum_norm_le: ``` huffman@44133 ` 170` ``` fixes f :: "'a \ 'b::real_normed_vector" ``` huffman@44176 ` 171` ``` assumes fg: "\x \ S. norm (f x) \ g x" ``` huffman@44133 ` 172` ``` shows "norm (setsum f S) \ setsum g S" ``` wenzelm@49522 ` 173` ``` by (rule order_trans [OF norm_setsum setsum_mono]) (simp add: fg) ``` huffman@44133 ` 174` huffman@44133 ` 175` ```lemma setsum_norm_bound: ``` huffman@44133 ` 176` ``` fixes f :: "'a \ 'b::real_normed_vector" ``` huffman@44133 ` 177` ``` assumes fS: "finite S" ``` wenzelm@49522 ` 178` ``` and K: "\x \ S. norm (f x) \ K" ``` huffman@44133 ` 179` ``` shows "norm (setsum f S) \ of_nat (card S) * K" ``` huffman@44176 ` 180` ``` using setsum_norm_le[OF K] setsum_constant[symmetric] ``` huffman@44133 ` 181` ``` by simp ``` huffman@44133 ` 182` huffman@44133 ` 183` ```lemma setsum_group: ``` huffman@44133 ` 184` ``` assumes fS: "finite S" and fT: "finite T" and fST: "f ` S \ T" ``` huffman@44133 ` 185` ``` shows "setsum (\y. setsum g {x. x\ S \ f x = y}) T = setsum g S" ``` huffman@44133 ` 186` ``` apply (subst setsum_image_gen[OF fS, of g f]) ``` huffman@44133 ` 187` ``` apply (rule setsum_mono_zero_right[OF fT fST]) ``` wenzelm@49522 ` 188` ``` apply (auto intro: setsum_0') ``` wenzelm@49522 ` 189` ``` done ``` huffman@44133 ` 190` huffman@44133 ` 191` ```lemma vector_eq_ldot: "(\x. x \ y = x \ z) \ y = z" ``` huffman@44133 ` 192` ```proof ``` huffman@44133 ` 193` ``` assume "\x. x \ y = x \ z" ``` wenzelm@49522 ` 194` ``` then have "\x. x \ (y - z) = 0" by (simp add: inner_diff) ``` wenzelm@49522 ` 195` ``` then have "(y - z) \ (y - z) = 0" .. ``` wenzelm@49652 ` 196` ``` then show "y = z" by simp ``` huffman@44133 ` 197` ```qed simp ``` huffman@44133 ` 198` huffman@44133 ` 199` ```lemma vector_eq_rdot: "(\z. x \ z = y \ z) \ x = y" ``` huffman@44133 ` 200` ```proof ``` huffman@44133 ` 201` ``` assume "\z. x \ z = y \ z" ``` wenzelm@49522 ` 202` ``` then have "\z. (x - y) \ z = 0" by (simp add: inner_diff) ``` wenzelm@49522 ` 203` ``` then have "(x - y) \ (x - y) = 0" .. ``` wenzelm@49652 ` 204` ``` then show "x = y" by simp ``` huffman@44133 ` 205` ```qed simp ``` huffman@44133 ` 206` wenzelm@49522 ` 207` wenzelm@49522 ` 208` ```subsection {* Orthogonality. *} ``` huffman@44133 ` 209` huffman@44133 ` 210` ```context real_inner ``` huffman@44133 ` 211` ```begin ``` huffman@44133 ` 212` huffman@44133 ` 213` ```definition "orthogonal x y \ (x \ y = 0)" ``` huffman@44133 ` 214` huffman@44133 ` 215` ```lemma orthogonal_clauses: ``` huffman@44133 ` 216` ``` "orthogonal a 0" ``` huffman@44133 ` 217` ``` "orthogonal a x \ orthogonal a (c *\<^sub>R x)" ``` huffman@44133 ` 218` ``` "orthogonal a x \ orthogonal a (-x)" ``` huffman@44133 ` 219` ``` "orthogonal a x \ orthogonal a y \ orthogonal a (x + y)" ``` huffman@44133 ` 220` ``` "orthogonal a x \ orthogonal a y \ orthogonal a (x - y)" ``` huffman@44133 ` 221` ``` "orthogonal 0 a" ``` huffman@44133 ` 222` ``` "orthogonal x a \ orthogonal (c *\<^sub>R x) a" ``` huffman@44133 ` 223` ``` "orthogonal x a \ orthogonal (-x) a" ``` huffman@44133 ` 224` ``` "orthogonal x a \ orthogonal y a \ orthogonal (x + y) a" ``` huffman@44133 ` 225` ``` "orthogonal x a \ orthogonal y a \ orthogonal (x - y) a" ``` huffman@44666 ` 226` ``` unfolding orthogonal_def inner_add inner_diff by auto ``` huffman@44666 ` 227` huffman@44133 ` 228` ```end ``` huffman@44133 ` 229` huffman@44133 ` 230` ```lemma orthogonal_commute: "orthogonal x y \ orthogonal y x" ``` huffman@44133 ` 231` ``` by (simp add: orthogonal_def inner_commute) ``` huffman@44133 ` 232` wenzelm@49522 ` 233` wenzelm@49522 ` 234` ```subsection {* Linear functions. *} ``` wenzelm@49522 ` 235` wenzelm@49522 ` 236` ```definition linear :: "('a::real_vector \ 'b::real_vector) \ bool" ``` wenzelm@49522 ` 237` ``` where "linear f \ (\x y. f(x + y) = f x + f y) \ (\c x. f(c *\<^sub>R x) = c *\<^sub>R f x)" ``` wenzelm@49522 ` 238` wenzelm@49522 ` 239` ```lemma linearI: ``` wenzelm@49522 ` 240` ``` assumes "\x y. f (x + y) = f x + f y" "\c x. f (c *\<^sub>R x) = c *\<^sub>R f x" ``` wenzelm@49522 ` 241` ``` shows "linear f" ``` wenzelm@49522 ` 242` ``` using assms unfolding linear_def by auto ``` huffman@44133 ` 243` huffman@44133 ` 244` ```lemma linear_compose_cmul: "linear f ==> linear (\x. c *\<^sub>R f x)" ``` huffman@44133 ` 245` ``` by (simp add: linear_def algebra_simps) ``` huffman@44133 ` 246` huffman@44133 ` 247` ```lemma linear_compose_neg: "linear f ==> linear (\x. -(f(x)))" ``` huffman@44133 ` 248` ``` by (simp add: linear_def) ``` huffman@44133 ` 249` huffman@44133 ` 250` ```lemma linear_compose_add: "linear f \ linear g ==> linear (\x. f(x) + g(x))" ``` huffman@44133 ` 251` ``` by (simp add: linear_def algebra_simps) ``` huffman@44133 ` 252` huffman@44133 ` 253` ```lemma linear_compose_sub: "linear f \ linear g ==> linear (\x. f x - g x)" ``` huffman@44133 ` 254` ``` by (simp add: linear_def algebra_simps) ``` huffman@44133 ` 255` huffman@44133 ` 256` ```lemma linear_compose: "linear f \ linear g ==> linear (g o f)" ``` huffman@44133 ` 257` ``` by (simp add: linear_def) ``` huffman@44133 ` 258` huffman@44133 ` 259` ```lemma linear_id: "linear id" by (simp add: linear_def id_def) ``` huffman@44133 ` 260` huffman@44133 ` 261` ```lemma linear_zero: "linear (\x. 0)" by (simp add: linear_def) ``` huffman@44133 ` 262` huffman@44133 ` 263` ```lemma linear_compose_setsum: ``` huffman@44133 ` 264` ``` assumes fS: "finite S" and lS: "\a \ S. linear (f a)" ``` huffman@44133 ` 265` ``` shows "linear(\x. setsum (\a. f a x) S)" ``` huffman@44133 ` 266` ``` using lS ``` huffman@44133 ` 267` ``` apply (induct rule: finite_induct[OF fS]) ``` wenzelm@49522 ` 268` ``` apply (auto simp add: linear_zero intro: linear_compose_add) ``` wenzelm@49522 ` 269` ``` done ``` huffman@44133 ` 270` huffman@44133 ` 271` ```lemma linear_0: "linear f \ f 0 = 0" ``` huffman@44133 ` 272` ``` unfolding linear_def ``` huffman@44133 ` 273` ``` apply clarsimp ``` huffman@44133 ` 274` ``` apply (erule allE[where x="0::'a"]) ``` huffman@44133 ` 275` ``` apply simp ``` huffman@44133 ` 276` ``` done ``` huffman@44133 ` 277` wenzelm@49522 ` 278` ```lemma linear_cmul: "linear f ==> f(c *\<^sub>R x) = c *\<^sub>R f x" ``` wenzelm@49522 ` 279` ``` by (simp add: linear_def) ``` huffman@44133 ` 280` huffman@44133 ` 281` ```lemma linear_neg: "linear f ==> f (-x) = - f x" ``` huffman@44133 ` 282` ``` using linear_cmul [where c="-1"] by simp ``` huffman@44133 ` 283` wenzelm@49522 ` 284` ```lemma linear_add: "linear f ==> f(x + y) = f x + f y" ``` wenzelm@49522 ` 285` ``` by (metis linear_def) ``` huffman@44133 ` 286` huffman@44133 ` 287` ```lemma linear_sub: "linear f ==> f(x - y) = f x - f y" ``` huffman@44133 ` 288` ``` by (simp add: diff_minus linear_add linear_neg) ``` huffman@44133 ` 289` huffman@44133 ` 290` ```lemma linear_setsum: ``` huffman@44133 ` 291` ``` assumes lf: "linear f" and fS: "finite S" ``` huffman@44133 ` 292` ``` shows "f (setsum g S) = setsum (f o g) S" ``` wenzelm@49522 ` 293` ``` using fS ``` wenzelm@49522 ` 294` ```proof (induct rule: finite_induct) ``` wenzelm@49522 ` 295` ``` case empty ``` wenzelm@49522 ` 296` ``` then show ?case by (simp add: linear_0[OF lf]) ``` huffman@44133 ` 297` ```next ``` wenzelm@49522 ` 298` ``` case (insert x F) ``` wenzelm@49522 ` 299` ``` have "f (setsum g (insert x F)) = f (g x + setsum g F)" using insert.hyps ``` huffman@44133 ` 300` ``` by simp ``` huffman@44133 ` 301` ``` also have "\ = f (g x) + f (setsum g F)" using linear_add[OF lf] by simp ``` wenzelm@49522 ` 302` ``` also have "\ = setsum (f o g) (insert x F)" using insert.hyps by simp ``` huffman@44133 ` 303` ``` finally show ?case . ``` huffman@44133 ` 304` ```qed ``` huffman@44133 ` 305` huffman@44133 ` 306` ```lemma linear_setsum_mul: ``` huffman@44133 ` 307` ``` assumes lf: "linear f" and fS: "finite S" ``` huffman@44133 ` 308` ``` shows "f (setsum (\i. c i *\<^sub>R v i) S) = setsum (\i. c i *\<^sub>R f (v i)) S" ``` wenzelm@49522 ` 309` ``` using linear_setsum[OF lf fS, of "\i. c i *\<^sub>R v i" , unfolded o_def] linear_cmul[OF lf] ``` wenzelm@49522 ` 310` ``` by simp ``` huffman@44133 ` 311` huffman@44133 ` 312` ```lemma linear_injective_0: ``` huffman@44133 ` 313` ``` assumes lf: "linear f" ``` huffman@44133 ` 314` ``` shows "inj f \ (\x. f x = 0 \ x = 0)" ``` wenzelm@49663 ` 315` ```proof - ``` huffman@44133 ` 316` ``` have "inj f \ (\ x y. f x = f y \ x = y)" by (simp add: inj_on_def) ``` huffman@44133 ` 317` ``` also have "\ \ (\ x y. f x - f y = 0 \ x - y = 0)" by simp ``` huffman@44133 ` 318` ``` also have "\ \ (\ x y. f (x - y) = 0 \ x - y = 0)" ``` huffman@44133 ` 319` ``` by (simp add: linear_sub[OF lf]) ``` huffman@44133 ` 320` ``` also have "\ \ (\ x. f x = 0 \ x = 0)" by auto ``` huffman@44133 ` 321` ``` finally show ?thesis . ``` huffman@44133 ` 322` ```qed ``` huffman@44133 ` 323` wenzelm@49522 ` 324` wenzelm@49522 ` 325` ```subsection {* Bilinear functions. *} ``` huffman@44133 ` 326` huffman@44133 ` 327` ```definition "bilinear f \ (\x. linear(\y. f x y)) \ (\y. linear(\x. f x y))" ``` huffman@44133 ` 328` huffman@44133 ` 329` ```lemma bilinear_ladd: "bilinear h ==> h (x + y) z = (h x z) + (h y z)" ``` huffman@44133 ` 330` ``` by (simp add: bilinear_def linear_def) ``` wenzelm@49663 ` 331` huffman@44133 ` 332` ```lemma bilinear_radd: "bilinear h ==> h x (y + z) = (h x y) + (h x z)" ``` huffman@44133 ` 333` ``` by (simp add: bilinear_def linear_def) ``` huffman@44133 ` 334` huffman@44133 ` 335` ```lemma bilinear_lmul: "bilinear h ==> h (c *\<^sub>R x) y = c *\<^sub>R (h x y)" ``` huffman@44133 ` 336` ``` by (simp add: bilinear_def linear_def) ``` huffman@44133 ` 337` huffman@44133 ` 338` ```lemma bilinear_rmul: "bilinear h ==> h x (c *\<^sub>R y) = c *\<^sub>R (h x y)" ``` huffman@44133 ` 339` ``` by (simp add: bilinear_def linear_def) ``` huffman@44133 ` 340` huffman@44133 ` 341` ```lemma bilinear_lneg: "bilinear h ==> h (- x) y = -(h x y)" ``` huffman@44133 ` 342` ``` by (simp only: scaleR_minus1_left [symmetric] bilinear_lmul) ``` huffman@44133 ` 343` huffman@44133 ` 344` ```lemma bilinear_rneg: "bilinear h ==> h x (- y) = - h x y" ``` huffman@44133 ` 345` ``` by (simp only: scaleR_minus1_left [symmetric] bilinear_rmul) ``` huffman@44133 ` 346` huffman@44133 ` 347` ```lemma (in ab_group_add) eq_add_iff: "x = x + y \ y = 0" ``` huffman@44133 ` 348` ``` using add_imp_eq[of x y 0] by auto ``` huffman@44133 ` 349` wenzelm@49663 ` 350` ```lemma bilinear_lzero: assumes "bilinear h" shows "h 0 x = 0" ``` wenzelm@49663 ` 351` ``` using bilinear_ladd [OF assms, of 0 0 x] by (simp add: eq_add_iff field_simps) ``` wenzelm@49663 ` 352` wenzelm@49663 ` 353` ```lemma bilinear_rzero: assumes "bilinear h" shows "h x 0 = 0" ``` wenzelm@49663 ` 354` ``` using bilinear_radd [OF assms, of x 0 0 ] by (simp add: eq_add_iff field_simps) ``` huffman@44133 ` 355` huffman@44133 ` 356` ```lemma bilinear_lsub: "bilinear h ==> h (x - y) z = h x z - h y z" ``` huffman@44133 ` 357` ``` by (simp add: diff_minus bilinear_ladd bilinear_lneg) ``` huffman@44133 ` 358` huffman@44133 ` 359` ```lemma bilinear_rsub: "bilinear h ==> h z (x - y) = h z x - h z y" ``` huffman@44133 ` 360` ``` by (simp add: diff_minus bilinear_radd bilinear_rneg) ``` huffman@44133 ` 361` huffman@44133 ` 362` ```lemma bilinear_setsum: ``` wenzelm@49663 ` 363` ``` assumes bh: "bilinear h" ``` wenzelm@49663 ` 364` ``` and fS: "finite S" ``` wenzelm@49663 ` 365` ``` and fT: "finite T" ``` huffman@44133 ` 366` ``` shows "h (setsum f S) (setsum g T) = setsum (\(i,j). h (f i) (g j)) (S \ T) " ``` wenzelm@49522 ` 367` ```proof - ``` huffman@44133 ` 368` ``` have "h (setsum f S) (setsum g T) = setsum (\x. h (f x) (setsum g T)) S" ``` huffman@44133 ` 369` ``` apply (rule linear_setsum[unfolded o_def]) ``` wenzelm@49522 ` 370` ``` using bh fS apply (auto simp add: bilinear_def) ``` wenzelm@49522 ` 371` ``` done ``` huffman@44133 ` 372` ``` also have "\ = setsum (\x. setsum (\y. h (f x) (g y)) T) S" ``` huffman@44133 ` 373` ``` apply (rule setsum_cong, simp) ``` huffman@44133 ` 374` ``` apply (rule linear_setsum[unfolded o_def]) ``` wenzelm@49522 ` 375` ``` using bh fT ``` wenzelm@49522 ` 376` ``` apply (auto simp add: bilinear_def) ``` wenzelm@49522 ` 377` ``` done ``` huffman@44133 ` 378` ``` finally show ?thesis unfolding setsum_cartesian_product . ``` huffman@44133 ` 379` ```qed ``` huffman@44133 ` 380` wenzelm@49522 ` 381` wenzelm@49522 ` 382` ```subsection {* Adjoints. *} ``` huffman@44133 ` 383` huffman@44133 ` 384` ```definition "adjoint f = (SOME f'. \x y. f x \ y = x \ f' y)" ``` huffman@44133 ` 385` huffman@44133 ` 386` ```lemma adjoint_unique: ``` huffman@44133 ` 387` ``` assumes "\x y. inner (f x) y = inner x (g y)" ``` huffman@44133 ` 388` ``` shows "adjoint f = g" ``` wenzelm@49522 ` 389` ``` unfolding adjoint_def ``` huffman@44133 ` 390` ```proof (rule some_equality) ``` huffman@44133 ` 391` ``` show "\x y. inner (f x) y = inner x (g y)" using assms . ``` huffman@44133 ` 392` ```next ``` huffman@44133 ` 393` ``` fix h assume "\x y. inner (f x) y = inner x (h y)" ``` wenzelm@49652 ` 394` ``` then have "\x y. inner x (g y) = inner x (h y)" using assms by simp ``` wenzelm@49652 ` 395` ``` then have "\x y. inner x (g y - h y) = 0" by (simp add: inner_diff_right) ``` wenzelm@49652 ` 396` ``` then have "\y. inner (g y - h y) (g y - h y) = 0" by simp ``` wenzelm@49652 ` 397` ``` then have "\y. h y = g y" by simp ``` wenzelm@49652 ` 398` ``` then show "h = g" by (simp add: ext) ``` huffman@44133 ` 399` ```qed ``` huffman@44133 ` 400` huffman@44133 ` 401` ```lemma choice_iff: "(\x. \y. P x y) \ (\f. \x. P x (f x))" by metis ``` huffman@44133 ` 402` wenzelm@49522 ` 403` ```subsection {* Interlude: Some properties of real sets *} ``` huffman@44133 ` 404` huffman@44133 ` 405` ```lemma seq_mono_lemma: assumes "\(n::nat) \ m. (d n :: real) < e n" and "\n \ m. e n <= e m" ``` huffman@44133 ` 406` ``` shows "\n \ m. d n < e m" ``` huffman@44133 ` 407` ``` using assms apply auto ``` huffman@44133 ` 408` ``` apply (erule_tac x="n" in allE) ``` huffman@44133 ` 409` ``` apply (erule_tac x="n" in allE) ``` huffman@44133 ` 410` ``` apply auto ``` huffman@44133 ` 411` ``` done ``` huffman@44133 ` 412` huffman@44133 ` 413` huffman@44133 ` 414` ```lemma infinite_enumerate: assumes fS: "infinite S" ``` huffman@44133 ` 415` ``` shows "\r. subseq r \ (\n. r n \ S)" ``` wenzelm@49525 ` 416` ``` unfolding subseq_def ``` wenzelm@49525 ` 417` ``` using enumerate_in_set[OF fS] enumerate_mono[of _ _ S] fS by auto ``` huffman@44133 ` 418` huffman@44133 ` 419` ```lemma approachable_lt_le: "(\(d::real)>0. \x. f x < d \ P x) \ (\d>0. \x. f x \ d \ P x)" ``` wenzelm@49522 ` 420` ``` apply auto ``` wenzelm@49522 ` 421` ``` apply (rule_tac x="d/2" in exI) ``` wenzelm@49522 ` 422` ``` apply auto ``` wenzelm@49522 ` 423` ``` done ``` huffman@44133 ` 424` huffman@44133 ` 425` huffman@44133 ` 426` ```lemma triangle_lemma: ``` huffman@44133 ` 427` ``` assumes x: "0 <= (x::real)" and y:"0 <= y" and z: "0 <= z" and xy: "x^2 <= y^2 + z^2" ``` huffman@44133 ` 428` ``` shows "x <= y + z" ``` wenzelm@49522 ` 429` ```proof - ``` huffman@44133 ` 430` ``` have "y^2 + z^2 \ y^2 + 2*y*z + z^2" using z y by (simp add: mult_nonneg_nonneg) ``` huffman@44133 ` 431` ``` with xy have th: "x ^2 \ (y+z)^2" by (simp add: power2_eq_square field_simps) ``` huffman@44133 ` 432` ``` from y z have yz: "y + z \ 0" by arith ``` huffman@44133 ` 433` ``` from power2_le_imp_le[OF th yz] show ?thesis . ``` huffman@44133 ` 434` ```qed ``` huffman@44133 ` 435` wenzelm@49522 ` 436` huffman@44133 ` 437` ```subsection {* A generic notion of "hull" (convex, affine, conic hull and closure). *} ``` huffman@44133 ` 438` wenzelm@49522 ` 439` ```definition hull :: "('a set \ bool) \ 'a set \ 'a set" (infixl "hull" 75) ``` wenzelm@49522 ` 440` ``` where "S hull s = Inter {t. S t \ s \ t}" ``` huffman@44170 ` 441` huffman@44170 ` 442` ```lemma hull_same: "S s \ S hull s = s" ``` huffman@44133 ` 443` ``` unfolding hull_def by auto ``` huffman@44133 ` 444` huffman@44170 ` 445` ```lemma hull_in: "(\T. Ball T S ==> S (Inter T)) ==> S (S hull s)" ``` wenzelm@49522 ` 446` ``` unfolding hull_def Ball_def by auto ``` huffman@44170 ` 447` huffman@44170 ` 448` ```lemma hull_eq: "(\T. Ball T S ==> S (Inter T)) ==> (S hull s) = s \ S s" ``` wenzelm@49522 ` 449` ``` using hull_same[of S s] hull_in[of S s] by metis ``` huffman@44133 ` 450` huffman@44133 ` 451` huffman@44133 ` 452` ```lemma hull_hull: "S hull (S hull s) = S hull s" ``` huffman@44133 ` 453` ``` unfolding hull_def by blast ``` huffman@44133 ` 454` huffman@44133 ` 455` ```lemma hull_subset[intro]: "s \ (S hull s)" ``` huffman@44133 ` 456` ``` unfolding hull_def by blast ``` huffman@44133 ` 457` huffman@44133 ` 458` ```lemma hull_mono: " s \ t ==> (S hull s) \ (S hull t)" ``` huffman@44133 ` 459` ``` unfolding hull_def by blast ``` huffman@44133 ` 460` huffman@44170 ` 461` ```lemma hull_antimono: "\x. S x \ T x ==> (T hull s) \ (S hull s)" ``` huffman@44133 ` 462` ``` unfolding hull_def by blast ``` huffman@44133 ` 463` huffman@44170 ` 464` ```lemma hull_minimal: "s \ t \ S t ==> (S hull s) \ t" ``` huffman@44133 ` 465` ``` unfolding hull_def by blast ``` huffman@44133 ` 466` huffman@44170 ` 467` ```lemma subset_hull: "S t ==> S hull s \ t \ s \ t" ``` huffman@44133 ` 468` ``` unfolding hull_def by blast ``` huffman@44133 ` 469` wenzelm@49652 ` 470` ```lemma hull_unique: "s \ t \ S t \ ``` wenzelm@49652 ` 471` ``` (\t'. s \ t' \ S t' \ t \ t') \ (S hull s = t)" ``` wenzelm@49652 ` 472` ``` unfolding hull_def by auto ``` huffman@44133 ` 473` huffman@44133 ` 474` ```lemma hull_induct: "(\x. x\ S \ P x) \ Q {x. P x} \ \x\ Q hull S. P x" ``` huffman@44133 ` 475` ``` using hull_minimal[of S "{x. P x}" Q] ``` huffman@44170 ` 476` ``` by (auto simp add: subset_eq) ``` huffman@44133 ` 477` wenzelm@49522 ` 478` ```lemma hull_inc: "x \ S \ x \ P hull S" ``` wenzelm@49522 ` 479` ``` by (metis hull_subset subset_eq) ``` huffman@44133 ` 480` huffman@44133 ` 481` ```lemma hull_union_subset: "(S hull s) \ (S hull t) \ (S hull (s \ t))" ``` wenzelm@49522 ` 482` ``` unfolding Un_subset_iff by (metis hull_mono Un_upper1 Un_upper2) ``` wenzelm@49522 ` 483` wenzelm@49522 ` 484` ```lemma hull_union: ``` wenzelm@49522 ` 485` ``` assumes T: "\T. Ball T S ==> S (Inter T)" ``` huffman@44133 ` 486` ``` shows "S hull (s \ t) = S hull (S hull s \ S hull t)" ``` wenzelm@49522 ` 487` ``` apply rule ``` wenzelm@49522 ` 488` ``` apply (rule hull_mono) ``` wenzelm@49522 ` 489` ``` unfolding Un_subset_iff ``` wenzelm@49522 ` 490` ``` apply (metis hull_subset Un_upper1 Un_upper2 subset_trans) ``` wenzelm@49522 ` 491` ``` apply (rule hull_minimal) ``` wenzelm@49522 ` 492` ``` apply (metis hull_union_subset) ``` wenzelm@49522 ` 493` ``` apply (metis hull_in T) ``` wenzelm@49522 ` 494` ``` done ``` huffman@44133 ` 495` huffman@44133 ` 496` ```lemma hull_redundant_eq: "a \ (S hull s) \ (S hull (insert a s) = S hull s)" ``` huffman@44133 ` 497` ``` unfolding hull_def by blast ``` huffman@44133 ` 498` huffman@44133 ` 499` ```lemma hull_redundant: "a \ (S hull s) ==> (S hull (insert a s) = S hull s)" ``` wenzelm@49522 ` 500` ``` by (metis hull_redundant_eq) ``` wenzelm@49522 ` 501` huffman@44133 ` 502` huffman@44666 ` 503` ```subsection {* Archimedean properties and useful consequences *} ``` huffman@44133 ` 504` huffman@44133 ` 505` ```lemma real_arch_simple: "\n. x <= real (n::nat)" ``` huffman@44666 ` 506` ``` unfolding real_of_nat_def by (rule ex_le_of_nat) ``` huffman@44133 ` 507` huffman@44133 ` 508` ```lemma real_arch_inv: "0 < e \ (\n::nat. n \ 0 \ 0 < inverse (real n) \ inverse (real n) < e)" ``` huffman@44133 ` 509` ``` using reals_Archimedean ``` huffman@44133 ` 510` ``` apply (auto simp add: field_simps) ``` huffman@44133 ` 511` ``` apply (subgoal_tac "inverse (real n) > 0") ``` huffman@44133 ` 512` ``` apply arith ``` huffman@44133 ` 513` ``` apply simp ``` huffman@44133 ` 514` ``` done ``` huffman@44133 ` 515` huffman@44133 ` 516` ```lemma real_pow_lbound: "0 <= x ==> 1 + real n * x <= (1 + x) ^ n" ``` wenzelm@49522 ` 517` ```proof (induct n) ``` wenzelm@49522 ` 518` ``` case 0 ``` wenzelm@49522 ` 519` ``` then show ?case by simp ``` huffman@44133 ` 520` ```next ``` huffman@44133 ` 521` ``` case (Suc n) ``` wenzelm@49522 ` 522` ``` then have h: "1 + real n * x \ (1 + x) ^ n" by simp ``` huffman@44133 ` 523` ``` from h have p: "1 \ (1 + x) ^ n" using Suc.prems by simp ``` huffman@44133 ` 524` ``` from h have "1 + real n * x + x \ (1 + x) ^ n + x" by simp ``` huffman@44133 ` 525` ``` also have "\ \ (1 + x) ^ Suc n" apply (subst diff_le_0_iff_le[symmetric]) ``` huffman@44133 ` 526` ``` apply (simp add: field_simps) ``` wenzelm@49522 ` 527` ``` using mult_left_mono[OF p Suc.prems] apply simp ``` wenzelm@49522 ` 528` ``` done ``` huffman@44133 ` 529` ``` finally show ?case by (simp add: real_of_nat_Suc field_simps) ``` huffman@44133 ` 530` ```qed ``` huffman@44133 ` 531` huffman@44133 ` 532` ```lemma real_arch_pow: assumes x: "1 < (x::real)" shows "\n. y < x^n" ``` wenzelm@49522 ` 533` ```proof - ``` huffman@44133 ` 534` ``` from x have x0: "x - 1 > 0" by arith ``` huffman@44666 ` 535` ``` from reals_Archimedean3[OF x0, rule_format, of y] ``` huffman@44133 ` 536` ``` obtain n::nat where n:"y < real n * (x - 1)" by metis ``` huffman@44133 ` 537` ``` from x0 have x00: "x- 1 \ 0" by arith ``` huffman@44133 ` 538` ``` from real_pow_lbound[OF x00, of n] n ``` huffman@44133 ` 539` ``` have "y < x^n" by auto ``` huffman@44133 ` 540` ``` then show ?thesis by metis ``` huffman@44133 ` 541` ```qed ``` huffman@44133 ` 542` huffman@44133 ` 543` ```lemma real_arch_pow2: "\n. (x::real) < 2^ n" ``` huffman@44133 ` 544` ``` using real_arch_pow[of 2 x] by simp ``` huffman@44133 ` 545` wenzelm@49522 ` 546` ```lemma real_arch_pow_inv: ``` wenzelm@49522 ` 547` ``` assumes y: "(y::real) > 0" and x1: "x < 1" ``` huffman@44133 ` 548` ``` shows "\n. x^n < y" ``` wenzelm@49522 ` 549` ```proof - ``` wenzelm@49522 ` 550` ``` { assume x0: "x > 0" ``` huffman@44133 ` 551` ``` from x0 x1 have ix: "1 < 1/x" by (simp add: field_simps) ``` huffman@44133 ` 552` ``` from real_arch_pow[OF ix, of "1/y"] ``` huffman@44133 ` 553` ``` obtain n where n: "1/y < (1/x)^n" by blast ``` wenzelm@49522 ` 554` ``` then have ?thesis using y x0 ``` wenzelm@49522 ` 555` ``` by (auto simp add: field_simps power_divide) } ``` huffman@44133 ` 556` ``` moreover ``` wenzelm@49522 ` 557` ``` { assume "\ x > 0" ``` wenzelm@49522 ` 558` ``` with y x1 have ?thesis apply auto by (rule exI[where x=1], auto) } ``` huffman@44133 ` 559` ``` ultimately show ?thesis by metis ``` huffman@44133 ` 560` ```qed ``` huffman@44133 ` 561` wenzelm@49522 ` 562` ```lemma forall_pos_mono: ``` wenzelm@49522 ` 563` ``` "(\d e::real. d < e \ P d ==> P e) \ ``` wenzelm@49522 ` 564` ``` (\n::nat. n \ 0 ==> P(inverse(real n))) \ (\e. 0 < e ==> P e)" ``` huffman@44133 ` 565` ``` by (metis real_arch_inv) ``` huffman@44133 ` 566` wenzelm@49522 ` 567` ```lemma forall_pos_mono_1: ``` wenzelm@49522 ` 568` ``` "(\d e::real. d < e \ P d ==> P e) \ ``` wenzelm@49522 ` 569` ``` (\n. P(inverse(real (Suc n)))) ==> 0 < e ==> P e" ``` huffman@44133 ` 570` ``` apply (rule forall_pos_mono) ``` huffman@44133 ` 571` ``` apply auto ``` huffman@44133 ` 572` ``` apply (atomize) ``` huffman@44133 ` 573` ``` apply (erule_tac x="n - 1" in allE) ``` huffman@44133 ` 574` ``` apply auto ``` huffman@44133 ` 575` ``` done ``` huffman@44133 ` 576` wenzelm@49522 ` 577` ```lemma real_archimedian_rdiv_eq_0: ``` wenzelm@49522 ` 578` ``` assumes x0: "x \ 0" and c: "c \ 0" and xc: "\(m::nat)>0. real m * x \ c" ``` huffman@44133 ` 579` ``` shows "x = 0" ``` wenzelm@49522 ` 580` ```proof - ``` wenzelm@49522 ` 581` ``` { assume "x \ 0" with x0 have xp: "x > 0" by arith ``` huffman@44666 ` 582` ``` from reals_Archimedean3[OF xp, rule_format, of c] ``` huffman@44666 ` 583` ``` obtain n::nat where n: "c < real n * x" by blast ``` huffman@44133 ` 584` ``` with xc[rule_format, of n] have "n = 0" by arith ``` wenzelm@49522 ` 585` ``` with n c have False by simp } ``` huffman@44133 ` 586` ``` then show ?thesis by blast ``` huffman@44133 ` 587` ```qed ``` huffman@44133 ` 588` wenzelm@49522 ` 589` huffman@44133 ` 590` ```subsection{* A bit of linear algebra. *} ``` huffman@44133 ` 591` wenzelm@49522 ` 592` ```definition (in real_vector) subspace :: "'a set \ bool" ``` wenzelm@49522 ` 593` ``` where "subspace S \ 0 \ S \ (\x\ S. \y \S. x + y \ S) \ (\c. \x \S. c *\<^sub>R x \S )" ``` huffman@44133 ` 594` huffman@44133 ` 595` ```definition (in real_vector) "span S = (subspace hull S)" ``` huffman@44133 ` 596` ```definition (in real_vector) "dependent S \ (\a \ S. a \ span(S - {a}))" ``` huffman@44133 ` 597` ```abbreviation (in real_vector) "independent s == ~(dependent s)" ``` huffman@44133 ` 598` huffman@44133 ` 599` ```text {* Closure properties of subspaces. *} ``` huffman@44133 ` 600` huffman@44133 ` 601` ```lemma subspace_UNIV[simp]: "subspace(UNIV)" by (simp add: subspace_def) ``` huffman@44133 ` 602` huffman@44133 ` 603` ```lemma (in real_vector) subspace_0: "subspace S ==> 0 \ S" by (metis subspace_def) ``` huffman@44133 ` 604` huffman@44133 ` 605` ```lemma (in real_vector) subspace_add: "subspace S \ x \ S \ y \ S ==> x + y \ S" ``` huffman@44133 ` 606` ``` by (metis subspace_def) ``` huffman@44133 ` 607` huffman@44133 ` 608` ```lemma (in real_vector) subspace_mul: "subspace S \ x \ S \ c *\<^sub>R x \ S" ``` huffman@44133 ` 609` ``` by (metis subspace_def) ``` huffman@44133 ` 610` huffman@44133 ` 611` ```lemma subspace_neg: "subspace S \ x \ S \ - x \ S" ``` huffman@44133 ` 612` ``` by (metis scaleR_minus1_left subspace_mul) ``` huffman@44133 ` 613` huffman@44133 ` 614` ```lemma subspace_sub: "subspace S \ x \ S \ y \ S \ x - y \ S" ``` huffman@44133 ` 615` ``` by (metis diff_minus subspace_add subspace_neg) ``` huffman@44133 ` 616` huffman@44133 ` 617` ```lemma (in real_vector) subspace_setsum: ``` huffman@44133 ` 618` ``` assumes sA: "subspace A" and fB: "finite B" ``` wenzelm@49522 ` 619` ``` and f: "\x\ B. f x \ A" ``` huffman@44133 ` 620` ``` shows "setsum f B \ A" ``` huffman@44133 ` 621` ``` using fB f sA ``` wenzelm@49522 ` 622` ``` by (induct rule: finite_induct[OF fB]) ``` wenzelm@49522 ` 623` ``` (simp add: subspace_def sA, auto simp add: sA subspace_add) ``` huffman@44133 ` 624` huffman@44133 ` 625` ```lemma subspace_linear_image: ``` huffman@44133 ` 626` ``` assumes lf: "linear f" and sS: "subspace S" ``` huffman@44133 ` 627` ``` shows "subspace(f ` S)" ``` huffman@44133 ` 628` ``` using lf sS linear_0[OF lf] ``` huffman@44133 ` 629` ``` unfolding linear_def subspace_def ``` huffman@44133 ` 630` ``` apply (auto simp add: image_iff) ``` huffman@44133 ` 631` ``` apply (rule_tac x="x + y" in bexI, auto) ``` huffman@44133 ` 632` ``` apply (rule_tac x="c *\<^sub>R x" in bexI, auto) ``` huffman@44133 ` 633` ``` done ``` huffman@44133 ` 634` huffman@44521 ` 635` ```lemma subspace_linear_vimage: "linear f \ subspace S \ subspace (f -` S)" ``` huffman@44521 ` 636` ``` by (auto simp add: subspace_def linear_def linear_0[of f]) ``` huffman@44521 ` 637` huffman@44133 ` 638` ```lemma subspace_linear_preimage: "linear f ==> subspace S ==> subspace {x. f x \ S}" ``` huffman@44133 ` 639` ``` by (auto simp add: subspace_def linear_def linear_0[of f]) ``` huffman@44133 ` 640` huffman@44133 ` 641` ```lemma subspace_trivial: "subspace {0}" ``` huffman@44133 ` 642` ``` by (simp add: subspace_def) ``` huffman@44133 ` 643` huffman@44133 ` 644` ```lemma (in real_vector) subspace_inter: "subspace A \ subspace B ==> subspace (A \ B)" ``` huffman@44133 ` 645` ``` by (simp add: subspace_def) ``` huffman@44133 ` 646` huffman@44521 ` 647` ```lemma subspace_Times: "\subspace A; subspace B\ \ subspace (A \ B)" ``` huffman@44521 ` 648` ``` unfolding subspace_def zero_prod_def by simp ``` huffman@44521 ` 649` huffman@44521 ` 650` ```text {* Properties of span. *} ``` huffman@44521 ` 651` huffman@44133 ` 652` ```lemma (in real_vector) span_mono: "A \ B ==> span A \ span B" ``` huffman@44133 ` 653` ``` by (metis span_def hull_mono) ``` huffman@44133 ` 654` huffman@44133 ` 655` ```lemma (in real_vector) subspace_span: "subspace(span S)" ``` huffman@44133 ` 656` ``` unfolding span_def ``` huffman@44170 ` 657` ``` apply (rule hull_in) ``` huffman@44133 ` 658` ``` apply (simp only: subspace_def Inter_iff Int_iff subset_eq) ``` huffman@44133 ` 659` ``` apply auto ``` huffman@44133 ` 660` ``` done ``` huffman@44133 ` 661` huffman@44133 ` 662` ```lemma (in real_vector) span_clauses: ``` huffman@44133 ` 663` ``` "a \ S ==> a \ span S" ``` huffman@44133 ` 664` ``` "0 \ span S" ``` huffman@44133 ` 665` ``` "x\ span S \ y \ span S ==> x + y \ span S" ``` huffman@44133 ` 666` ``` "x \ span S \ c *\<^sub>R x \ span S" ``` huffman@44133 ` 667` ``` by (metis span_def hull_subset subset_eq) ``` huffman@44133 ` 668` ``` (metis subspace_span subspace_def)+ ``` huffman@44133 ` 669` huffman@44521 ` 670` ```lemma span_unique: ``` wenzelm@49522 ` 671` ``` "S \ T \ subspace T \ (\T'. S \ T' \ subspace T' \ T \ T') \ span S = T" ``` huffman@44521 ` 672` ``` unfolding span_def by (rule hull_unique) ``` huffman@44521 ` 673` huffman@44521 ` 674` ```lemma span_minimal: "S \ T \ subspace T \ span S \ T" ``` huffman@44521 ` 675` ``` unfolding span_def by (rule hull_minimal) ``` huffman@44521 ` 676` huffman@44521 ` 677` ```lemma (in real_vector) span_induct: ``` wenzelm@49522 ` 678` ``` assumes x: "x \ span S" ``` wenzelm@49522 ` 679` ``` and P: "subspace P" ``` wenzelm@49522 ` 680` ``` and SP: "\x. x \ S ==> x \ P" ``` huffman@44521 ` 681` ``` shows "x \ P" ``` wenzelm@49522 ` 682` ```proof - ``` huffman@44170 ` 683` ``` from SP have SP': "S \ P" by (simp add: subset_eq) ``` huffman@44170 ` 684` ``` from x hull_minimal[where S=subspace, OF SP' P, unfolded span_def[symmetric]] ``` huffman@44170 ` 685` ``` show "x \ P" by (metis subset_eq) ``` huffman@44133 ` 686` ```qed ``` huffman@44133 ` 687` huffman@44133 ` 688` ```lemma span_empty[simp]: "span {} = {0}" ``` huffman@44133 ` 689` ``` apply (simp add: span_def) ``` huffman@44133 ` 690` ``` apply (rule hull_unique) ``` huffman@44170 ` 691` ``` apply (auto simp add: subspace_def) ``` huffman@44133 ` 692` ``` done ``` huffman@44133 ` 693` huffman@44133 ` 694` ```lemma (in real_vector) independent_empty[intro]: "independent {}" ``` huffman@44133 ` 695` ``` by (simp add: dependent_def) ``` huffman@44133 ` 696` wenzelm@49522 ` 697` ```lemma dependent_single[simp]: "dependent {x} \ x = 0" ``` huffman@44133 ` 698` ``` unfolding dependent_def by auto ``` huffman@44133 ` 699` huffman@44133 ` 700` ```lemma (in real_vector) independent_mono: "independent A \ B \ A ==> independent B" ``` huffman@44133 ` 701` ``` apply (clarsimp simp add: dependent_def span_mono) ``` huffman@44133 ` 702` ``` apply (subgoal_tac "span (B - {a}) \ span (A - {a})") ``` huffman@44133 ` 703` ``` apply force ``` huffman@44133 ` 704` ``` apply (rule span_mono) ``` huffman@44133 ` 705` ``` apply auto ``` huffman@44133 ` 706` ``` done ``` huffman@44133 ` 707` huffman@44133 ` 708` ```lemma (in real_vector) span_subspace: "A \ B \ B \ span A \ subspace B \ span A = B" ``` huffman@44170 ` 709` ``` by (metis order_antisym span_def hull_minimal) ``` huffman@44133 ` 710` wenzelm@49711 ` 711` ```lemma (in real_vector) span_induct': ``` wenzelm@49711 ` 712` ``` assumes SP: "\x \ S. P x" ``` wenzelm@49711 ` 713` ``` and P: "subspace {x. P x}" ``` wenzelm@49711 ` 714` ``` shows "\x \ span S. P x" ``` huffman@44133 ` 715` ``` using span_induct SP P by blast ``` huffman@44133 ` 716` huffman@44170 ` 717` ```inductive_set (in real_vector) span_induct_alt_help for S:: "'a set" ``` huffman@44133 ` 718` ``` where ``` huffman@44170 ` 719` ``` span_induct_alt_help_0: "0 \ span_induct_alt_help S" ``` wenzelm@49522 ` 720` ```| span_induct_alt_help_S: ``` wenzelm@49522 ` 721` ``` "x \ S \ z \ span_induct_alt_help S \ (c *\<^sub>R x + z) \ span_induct_alt_help S" ``` huffman@44133 ` 722` huffman@44133 ` 723` ```lemma span_induct_alt': ``` wenzelm@49522 ` 724` ``` assumes h0: "h 0" and hS: "\c x y. x \ S \ h y \ h (c *\<^sub>R x + y)" ``` wenzelm@49522 ` 725` ``` shows "\x \ span S. h x" ``` wenzelm@49522 ` 726` ```proof - ``` wenzelm@49522 ` 727` ``` { fix x:: "'a" assume x: "x \ span_induct_alt_help S" ``` huffman@44133 ` 728` ``` have "h x" ``` huffman@44133 ` 729` ``` apply (rule span_induct_alt_help.induct[OF x]) ``` huffman@44133 ` 730` ``` apply (rule h0) ``` huffman@44133 ` 731` ``` apply (rule hS, assumption, assumption) ``` wenzelm@49522 ` 732` ``` done } ``` huffman@44133 ` 733` ``` note th0 = this ``` wenzelm@49522 ` 734` ``` { fix x assume x: "x \ span S" ``` huffman@44170 ` 735` ``` have "x \ span_induct_alt_help S" ``` wenzelm@49522 ` 736` ``` proof (rule span_induct[where x=x and S=S]) ``` wenzelm@49522 ` 737` ``` show "x \ span S" using x . ``` wenzelm@49522 ` 738` ``` next ``` wenzelm@49522 ` 739` ``` fix x assume xS : "x \ S" ``` wenzelm@49522 ` 740` ``` from span_induct_alt_help_S[OF xS span_induct_alt_help_0, of 1] ``` wenzelm@49522 ` 741` ``` show "x \ span_induct_alt_help S" by simp ``` wenzelm@49522 ` 742` ``` next ``` wenzelm@49522 ` 743` ``` have "0 \ span_induct_alt_help S" by (rule span_induct_alt_help_0) ``` wenzelm@49522 ` 744` ``` moreover ``` wenzelm@49522 ` 745` ``` { fix x y ``` wenzelm@49522 ` 746` ``` assume h: "x \ span_induct_alt_help S" "y \ span_induct_alt_help S" ``` wenzelm@49522 ` 747` ``` from h have "(x + y) \ span_induct_alt_help S" ``` wenzelm@49522 ` 748` ``` apply (induct rule: span_induct_alt_help.induct) ``` wenzelm@49522 ` 749` ``` apply simp ``` wenzelm@49522 ` 750` ``` unfolding add_assoc ``` wenzelm@49522 ` 751` ``` apply (rule span_induct_alt_help_S) ``` wenzelm@49522 ` 752` ``` apply assumption ``` wenzelm@49522 ` 753` ``` apply simp ``` wenzelm@49522 ` 754` ``` done } ``` wenzelm@49522 ` 755` ``` moreover ``` wenzelm@49522 ` 756` ``` { fix c x ``` wenzelm@49522 ` 757` ``` assume xt: "x \ span_induct_alt_help S" ``` wenzelm@49522 ` 758` ``` then have "(c *\<^sub>R x) \ span_induct_alt_help S" ``` wenzelm@49522 ` 759` ``` apply (induct rule: span_induct_alt_help.induct) ``` wenzelm@49522 ` 760` ``` apply (simp add: span_induct_alt_help_0) ``` wenzelm@49522 ` 761` ``` apply (simp add: scaleR_right_distrib) ``` wenzelm@49522 ` 762` ``` apply (rule span_induct_alt_help_S) ``` wenzelm@49522 ` 763` ``` apply assumption ``` wenzelm@49522 ` 764` ``` apply simp ``` wenzelm@49522 ` 765` ``` done } ``` wenzelm@49522 ` 766` ``` ultimately ``` wenzelm@49522 ` 767` ``` show "subspace (span_induct_alt_help S)" ``` wenzelm@49522 ` 768` ``` unfolding subspace_def Ball_def by blast ``` wenzelm@49522 ` 769` ``` qed } ``` huffman@44133 ` 770` ``` with th0 show ?thesis by blast ``` huffman@44133 ` 771` ```qed ``` huffman@44133 ` 772` huffman@44133 ` 773` ```lemma span_induct_alt: ``` huffman@44133 ` 774` ``` assumes h0: "h 0" and hS: "\c x y. x \ S \ h y \ h (c *\<^sub>R x + y)" and x: "x \ span S" ``` huffman@44133 ` 775` ``` shows "h x" ``` wenzelm@49522 ` 776` ``` using span_induct_alt'[of h S] h0 hS x by blast ``` huffman@44133 ` 777` huffman@44133 ` 778` ```text {* Individual closure properties. *} ``` huffman@44133 ` 779` huffman@44133 ` 780` ```lemma span_span: "span (span A) = span A" ``` huffman@44133 ` 781` ``` unfolding span_def hull_hull .. ``` huffman@44133 ` 782` huffman@44133 ` 783` ```lemma (in real_vector) span_superset: "x \ S ==> x \ span S" by (metis span_clauses(1)) ``` huffman@44133 ` 784` huffman@44133 ` 785` ```lemma (in real_vector) span_0: "0 \ span S" by (metis subspace_span subspace_0) ``` huffman@44133 ` 786` huffman@44133 ` 787` ```lemma span_inc: "S \ span S" ``` huffman@44133 ` 788` ``` by (metis subset_eq span_superset) ``` huffman@44133 ` 789` huffman@44133 ` 790` ```lemma (in real_vector) dependent_0: assumes "0\A" shows "dependent A" ``` huffman@44133 ` 791` ``` unfolding dependent_def apply(rule_tac x=0 in bexI) ``` huffman@44133 ` 792` ``` using assms span_0 by auto ``` huffman@44133 ` 793` huffman@44133 ` 794` ```lemma (in real_vector) span_add: "x \ span S \ y \ span S ==> x + y \ span S" ``` huffman@44133 ` 795` ``` by (metis subspace_add subspace_span) ``` huffman@44133 ` 796` huffman@44133 ` 797` ```lemma (in real_vector) span_mul: "x \ span S ==> (c *\<^sub>R x) \ span S" ``` huffman@44133 ` 798` ``` by (metis subspace_span subspace_mul) ``` huffman@44133 ` 799` huffman@44133 ` 800` ```lemma span_neg: "x \ span S ==> - x \ span S" ``` huffman@44133 ` 801` ``` by (metis subspace_neg subspace_span) ``` huffman@44133 ` 802` huffman@44133 ` 803` ```lemma span_sub: "x \ span S \ y \ span S ==> x - y \ span S" ``` huffman@44133 ` 804` ``` by (metis subspace_span subspace_sub) ``` huffman@44133 ` 805` huffman@44133 ` 806` ```lemma (in real_vector) span_setsum: "finite A \ \x \ A. f x \ span S ==> setsum f A \ span S" ``` huffman@44133 ` 807` ``` by (rule subspace_setsum, rule subspace_span) ``` huffman@44133 ` 808` huffman@44133 ` 809` ```lemma span_add_eq: "x \ span S \ x + y \ span S \ y \ span S" ``` huffman@44133 ` 810` ``` apply (auto simp only: span_add span_sub) ``` huffman@44133 ` 811` ``` apply (subgoal_tac "(x + y) - x \ span S", simp) ``` wenzelm@49522 ` 812` ``` apply (simp only: span_add span_sub) ``` wenzelm@49522 ` 813` ``` done ``` huffman@44133 ` 814` huffman@44133 ` 815` ```text {* Mapping under linear image. *} ``` huffman@44133 ` 816` huffman@44521 ` 817` ```lemma image_subset_iff_subset_vimage: "f ` A \ B \ A \ f -` B" ``` huffman@44521 ` 818` ``` by auto (* TODO: move *) ``` huffman@44521 ` 819` huffman@44521 ` 820` ```lemma span_linear_image: ``` huffman@44521 ` 821` ``` assumes lf: "linear f" ``` huffman@44133 ` 822` ``` shows "span (f ` S) = f ` (span S)" ``` huffman@44521 ` 823` ```proof (rule span_unique) ``` huffman@44521 ` 824` ``` show "f ` S \ f ` span S" ``` huffman@44521 ` 825` ``` by (intro image_mono span_inc) ``` huffman@44521 ` 826` ``` show "subspace (f ` span S)" ``` huffman@44521 ` 827` ``` using lf subspace_span by (rule subspace_linear_image) ``` huffman@44521 ` 828` ```next ``` wenzelm@49522 ` 829` ``` fix T assume "f ` S \ T" and "subspace T" ``` wenzelm@49522 ` 830` ``` then show "f ` span S \ T" ``` huffman@44521 ` 831` ``` unfolding image_subset_iff_subset_vimage ``` huffman@44521 ` 832` ``` by (intro span_minimal subspace_linear_vimage lf) ``` huffman@44521 ` 833` ```qed ``` huffman@44521 ` 834` huffman@44521 ` 835` ```lemma span_union: "span (A \ B) = (\(a, b). a + b) ` (span A \ span B)" ``` huffman@44521 ` 836` ```proof (rule span_unique) ``` huffman@44521 ` 837` ``` show "A \ B \ (\(a, b). a + b) ` (span A \ span B)" ``` huffman@44521 ` 838` ``` by safe (force intro: span_clauses)+ ``` huffman@44521 ` 839` ```next ``` huffman@44521 ` 840` ``` have "linear (\(a, b). a + b)" ``` huffman@44521 ` 841` ``` by (simp add: linear_def scaleR_add_right) ``` huffman@44521 ` 842` ``` moreover have "subspace (span A \ span B)" ``` huffman@44521 ` 843` ``` by (intro subspace_Times subspace_span) ``` huffman@44521 ` 844` ``` ultimately show "subspace ((\(a, b). a + b) ` (span A \ span B))" ``` huffman@44521 ` 845` ``` by (rule subspace_linear_image) ``` huffman@44521 ` 846` ```next ``` wenzelm@49711 ` 847` ``` fix T ``` wenzelm@49711 ` 848` ``` assume "A \ B \ T" and "subspace T" ``` wenzelm@49522 ` 849` ``` then show "(\(a, b). a + b) ` (span A \ span B) \ T" ``` huffman@44521 ` 850` ``` by (auto intro!: subspace_add elim: span_induct) ``` huffman@44133 ` 851` ```qed ``` huffman@44133 ` 852` huffman@44133 ` 853` ```text {* The key breakdown property. *} ``` huffman@44133 ` 854` huffman@44521 ` 855` ```lemma span_singleton: "span {x} = range (\k. k *\<^sub>R x)" ``` huffman@44521 ` 856` ```proof (rule span_unique) ``` huffman@44521 ` 857` ``` show "{x} \ range (\k. k *\<^sub>R x)" ``` huffman@44521 ` 858` ``` by (fast intro: scaleR_one [symmetric]) ``` huffman@44521 ` 859` ``` show "subspace (range (\k. k *\<^sub>R x))" ``` huffman@44521 ` 860` ``` unfolding subspace_def ``` huffman@44521 ` 861` ``` by (auto intro: scaleR_add_left [symmetric]) ``` wenzelm@49652 ` 862` ``` fix T assume "{x} \ T" and "subspace T" then show "range (\k. k *\<^sub>R x) \ T" ``` huffman@44521 ` 863` ``` unfolding subspace_def by auto ``` huffman@44521 ` 864` ```qed ``` huffman@44521 ` 865` wenzelm@49522 ` 866` ```lemma span_insert: "span (insert a S) = {x. \k. (x - k *\<^sub>R a) \ span S}" ``` huffman@44521 ` 867` ```proof - ``` huffman@44521 ` 868` ``` have "span ({a} \ S) = {x. \k. (x - k *\<^sub>R a) \ span S}" ``` huffman@44521 ` 869` ``` unfolding span_union span_singleton ``` huffman@44521 ` 870` ``` apply safe ``` huffman@44521 ` 871` ``` apply (rule_tac x=k in exI, simp) ``` huffman@44521 ` 872` ``` apply (erule rev_image_eqI [OF SigmaI [OF rangeI]]) ``` huffman@44521 ` 873` ``` apply simp ``` huffman@44521 ` 874` ``` apply (rule right_minus) ``` huffman@44521 ` 875` ``` done ``` wenzelm@49522 ` 876` ``` then show ?thesis by simp ``` huffman@44521 ` 877` ```qed ``` huffman@44521 ` 878` huffman@44133 ` 879` ```lemma span_breakdown: ``` huffman@44133 ` 880` ``` assumes bS: "b \ S" and aS: "a \ span S" ``` huffman@44521 ` 881` ``` shows "\k. a - k *\<^sub>R b \ span (S - {b})" ``` huffman@44521 ` 882` ``` using assms span_insert [of b "S - {b}"] ``` huffman@44521 ` 883` ``` by (simp add: insert_absorb) ``` huffman@44133 ` 884` wenzelm@49522 ` 885` ```lemma span_breakdown_eq: "x \ span (insert a S) \ (\k. (x - k *\<^sub>R a) \ span S)" ``` huffman@44521 ` 886` ``` by (simp add: span_insert) ``` huffman@44133 ` 887` huffman@44133 ` 888` ```text {* Hence some "reversal" results. *} ``` huffman@44133 ` 889` huffman@44133 ` 890` ```lemma in_span_insert: ``` wenzelm@49711 ` 891` ``` assumes a: "a \ span (insert b S)" ``` wenzelm@49711 ` 892` ``` and na: "a \ span S" ``` huffman@44133 ` 893` ``` shows "b \ span (insert a S)" ``` wenzelm@49663 ` 894` ```proof - ``` huffman@44133 ` 895` ``` from span_breakdown[of b "insert b S" a, OF insertI1 a] ``` huffman@44133 ` 896` ``` obtain k where k: "a - k*\<^sub>R b \ span (S - {b})" by auto ``` wenzelm@49522 ` 897` ``` { assume k0: "k = 0" ``` huffman@44133 ` 898` ``` with k have "a \ span S" ``` huffman@44133 ` 899` ``` apply (simp) ``` huffman@44133 ` 900` ``` apply (rule set_rev_mp) ``` huffman@44133 ` 901` ``` apply assumption ``` huffman@44133 ` 902` ``` apply (rule span_mono) ``` huffman@44133 ` 903` ``` apply blast ``` huffman@44133 ` 904` ``` done ``` wenzelm@49522 ` 905` ``` with na have ?thesis by blast } ``` huffman@44133 ` 906` ``` moreover ``` wenzelm@49522 ` 907` ``` { assume k0: "k \ 0" ``` huffman@44133 ` 908` ``` have eq: "b = (1/k) *\<^sub>R a - ((1/k) *\<^sub>R a - b)" by simp ``` huffman@44133 ` 909` ``` from k0 have eq': "(1/k) *\<^sub>R (a - k*\<^sub>R b) = (1/k) *\<^sub>R a - b" ``` huffman@44133 ` 910` ``` by (simp add: algebra_simps) ``` huffman@44133 ` 911` ``` from k have "(1/k) *\<^sub>R (a - k*\<^sub>R b) \ span (S - {b})" ``` huffman@44133 ` 912` ``` by (rule span_mul) ``` wenzelm@49652 ` 913` ``` then have th: "(1/k) *\<^sub>R a - b \ span (S - {b})" ``` huffman@44133 ` 914` ``` unfolding eq' . ``` huffman@44133 ` 915` huffman@44133 ` 916` ``` from k ``` huffman@44133 ` 917` ``` have ?thesis ``` huffman@44133 ` 918` ``` apply (subst eq) ``` huffman@44133 ` 919` ``` apply (rule span_sub) ``` huffman@44133 ` 920` ``` apply (rule span_mul) ``` huffman@44133 ` 921` ``` apply (rule span_superset) ``` huffman@44133 ` 922` ``` apply blast ``` huffman@44133 ` 923` ``` apply (rule set_rev_mp) ``` huffman@44133 ` 924` ``` apply (rule th) ``` huffman@44133 ` 925` ``` apply (rule span_mono) ``` wenzelm@49522 ` 926` ``` using na by blast } ``` huffman@44133 ` 927` ``` ultimately show ?thesis by blast ``` huffman@44133 ` 928` ```qed ``` huffman@44133 ` 929` huffman@44133 ` 930` ```lemma in_span_delete: ``` huffman@44133 ` 931` ``` assumes a: "a \ span S" ``` wenzelm@49522 ` 932` ``` and na: "a \ span (S-{b})" ``` huffman@44133 ` 933` ``` shows "b \ span (insert a (S - {b}))" ``` huffman@44133 ` 934` ``` apply (rule in_span_insert) ``` huffman@44133 ` 935` ``` apply (rule set_rev_mp) ``` huffman@44133 ` 936` ``` apply (rule a) ``` huffman@44133 ` 937` ``` apply (rule span_mono) ``` huffman@44133 ` 938` ``` apply blast ``` huffman@44133 ` 939` ``` apply (rule na) ``` huffman@44133 ` 940` ``` done ``` huffman@44133 ` 941` huffman@44133 ` 942` ```text {* Transitivity property. *} ``` huffman@44133 ` 943` huffman@44521 ` 944` ```lemma span_redundant: "x \ span S \ span (insert x S) = span S" ``` huffman@44521 ` 945` ``` unfolding span_def by (rule hull_redundant) ``` huffman@44521 ` 946` huffman@44133 ` 947` ```lemma span_trans: ``` huffman@44133 ` 948` ``` assumes x: "x \ span S" and y: "y \ span (insert x S)" ``` huffman@44133 ` 949` ``` shows "y \ span S" ``` huffman@44521 ` 950` ``` using assms by (simp only: span_redundant) ``` huffman@44133 ` 951` huffman@44133 ` 952` ```lemma span_insert_0[simp]: "span (insert 0 S) = span S" ``` huffman@44521 ` 953` ``` by (simp only: span_redundant span_0) ``` huffman@44133 ` 954` huffman@44133 ` 955` ```text {* An explicit expansion is sometimes needed. *} ``` huffman@44133 ` 956` huffman@44133 ` 957` ```lemma span_explicit: ``` huffman@44133 ` 958` ``` "span P = {y. \S u. finite S \ S \ P \ setsum (\v. u v *\<^sub>R v) S = y}" ``` huffman@44133 ` 959` ``` (is "_ = ?E" is "_ = {y. ?h y}" is "_ = {y. \S u. ?Q S u y}") ``` wenzelm@49663 ` 960` ```proof - ``` wenzelm@49522 ` 961` ``` { fix x assume x: "x \ ?E" ``` huffman@44133 ` 962` ``` then obtain S u where fS: "finite S" and SP: "S\P" and u: "setsum (\v. u v *\<^sub>R v) S = x" ``` huffman@44133 ` 963` ``` by blast ``` huffman@44133 ` 964` ``` have "x \ span P" ``` huffman@44133 ` 965` ``` unfolding u[symmetric] ``` huffman@44133 ` 966` ``` apply (rule span_setsum[OF fS]) ``` huffman@44133 ` 967` ``` using span_mono[OF SP] ``` wenzelm@49522 ` 968` ``` apply (auto intro: span_superset span_mul) ``` wenzelm@49522 ` 969` ``` done } ``` huffman@44133 ` 970` ``` moreover ``` huffman@44133 ` 971` ``` have "\x \ span P. x \ ?E" ``` wenzelm@49522 ` 972` ``` proof (rule span_induct_alt') ``` huffman@44170 ` 973` ``` show "0 \ Collect ?h" ``` huffman@44170 ` 974` ``` unfolding mem_Collect_eq ``` wenzelm@49522 ` 975` ``` apply (rule exI[where x="{}"]) ``` wenzelm@49522 ` 976` ``` apply simp ``` wenzelm@49522 ` 977` ``` done ``` huffman@44133 ` 978` ``` next ``` huffman@44133 ` 979` ``` fix c x y ``` huffman@44170 ` 980` ``` assume x: "x \ P" and hy: "y \ Collect ?h" ``` huffman@44133 ` 981` ``` from hy obtain S u where fS: "finite S" and SP: "S\P" ``` huffman@44133 ` 982` ``` and u: "setsum (\v. u v *\<^sub>R v) S = y" by blast ``` huffman@44133 ` 983` ``` let ?S = "insert x S" ``` wenzelm@49522 ` 984` ``` let ?u = "\y. if y = x then (if x \ S then u y + c else c) else u y" ``` huffman@44133 ` 985` ``` from fS SP x have th0: "finite (insert x S)" "insert x S \ P" by blast+ ``` wenzelm@49522 ` 986` ``` { assume xS: "x \ S" ``` huffman@44133 ` 987` ``` have S1: "S = (S - {x}) \ {x}" ``` huffman@44133 ` 988` ``` and Sss:"finite (S - {x})" "finite {x}" "(S -{x}) \ {x} = {}" using xS fS by auto ``` huffman@44133 ` 989` ``` have "setsum (\v. ?u v *\<^sub>R v) ?S =(\v\S - {x}. u v *\<^sub>R v) + (u x + c) *\<^sub>R x" ``` huffman@44133 ` 990` ``` using xS ``` huffman@44133 ` 991` ``` by (simp add: setsum_Un_disjoint[OF Sss, unfolded S1[symmetric]] ``` huffman@44133 ` 992` ``` setsum_clauses(2)[OF fS] cong del: if_weak_cong) ``` huffman@44133 ` 993` ``` also have "\ = (\v\S. u v *\<^sub>R v) + c *\<^sub>R x" ``` huffman@44133 ` 994` ``` apply (simp add: setsum_Un_disjoint[OF Sss, unfolded S1[symmetric]]) ``` wenzelm@49522 ` 995` ``` apply (simp add: algebra_simps) ``` wenzelm@49522 ` 996` ``` done ``` huffman@44133 ` 997` ``` also have "\ = c*\<^sub>R x + y" ``` huffman@44133 ` 998` ``` by (simp add: add_commute u) ``` huffman@44133 ` 999` ``` finally have "setsum (\v. ?u v *\<^sub>R v) ?S = c*\<^sub>R x + y" . ``` wenzelm@49522 ` 1000` ``` then have "?Q ?S ?u (c*\<^sub>R x + y)" using th0 by blast } ``` wenzelm@49522 ` 1001` ``` moreover ``` wenzelm@49522 ` 1002` ``` { assume xS: "x \ S" ``` wenzelm@49522 ` 1003` ``` have th00: "(\v\S. (if v = x then c else u v) *\<^sub>R v) = y" ``` wenzelm@49522 ` 1004` ``` unfolding u[symmetric] ``` wenzelm@49522 ` 1005` ``` apply (rule setsum_cong2) ``` wenzelm@49522 ` 1006` ``` using xS apply auto ``` wenzelm@49522 ` 1007` ``` done ``` wenzelm@49522 ` 1008` ``` have "?Q ?S ?u (c*\<^sub>R x + y)" using fS xS th0 ``` wenzelm@49522 ` 1009` ``` by (simp add: th00 setsum_clauses add_commute cong del: if_weak_cong) } ``` wenzelm@49522 ` 1010` ``` ultimately have "?Q ?S ?u (c*\<^sub>R x + y)" by (cases "x \ S") simp_all ``` huffman@44170 ` 1011` ``` then show "(c*\<^sub>R x + y) \ Collect ?h" ``` huffman@44170 ` 1012` ``` unfolding mem_Collect_eq ``` huffman@44133 ` 1013` ``` apply - ``` huffman@44133 ` 1014` ``` apply (rule exI[where x="?S"]) ``` wenzelm@49522 ` 1015` ``` apply (rule exI[where x="?u"]) ``` wenzelm@49522 ` 1016` ``` apply metis ``` wenzelm@49522 ` 1017` ``` done ``` huffman@44133 ` 1018` ``` qed ``` huffman@44133 ` 1019` ``` ultimately show ?thesis by blast ``` huffman@44133 ` 1020` ```qed ``` huffman@44133 ` 1021` huffman@44133 ` 1022` ```lemma dependent_explicit: ``` wenzelm@49522 ` 1023` ``` "dependent P \ (\S u. finite S \ S \ P \ (\v\S. u v \ 0 \ setsum (\v. u v *\<^sub>R v) S = 0))" ``` wenzelm@49522 ` 1024` ``` (is "?lhs = ?rhs") ``` wenzelm@49522 ` 1025` ```proof - ``` wenzelm@49522 ` 1026` ``` { assume dP: "dependent P" ``` huffman@44133 ` 1027` ``` then obtain a S u where aP: "a \ P" and fS: "finite S" ``` huffman@44133 ` 1028` ``` and SP: "S \ P - {a}" and ua: "setsum (\v. u v *\<^sub>R v) S = a" ``` huffman@44133 ` 1029` ``` unfolding dependent_def span_explicit by blast ``` huffman@44133 ` 1030` ``` let ?S = "insert a S" ``` huffman@44133 ` 1031` ``` let ?u = "\y. if y = a then - 1 else u y" ``` huffman@44133 ` 1032` ``` let ?v = a ``` huffman@44133 ` 1033` ``` from aP SP have aS: "a \ S" by blast ``` huffman@44133 ` 1034` ``` from fS SP aP have th0: "finite ?S" "?S \ P" "?v \ ?S" "?u ?v \ 0" by auto ``` huffman@44133 ` 1035` ``` have s0: "setsum (\v. ?u v *\<^sub>R v) ?S = 0" ``` huffman@44133 ` 1036` ``` using fS aS ``` huffman@44133 ` 1037` ``` apply (simp add: setsum_clauses field_simps) ``` huffman@44133 ` 1038` ``` apply (subst (2) ua[symmetric]) ``` huffman@44133 ` 1039` ``` apply (rule setsum_cong2) ``` wenzelm@49522 ` 1040` ``` apply auto ``` wenzelm@49522 ` 1041` ``` done ``` huffman@44133 ` 1042` ``` with th0 have ?rhs ``` huffman@44133 ` 1043` ``` apply - ``` huffman@44133 ` 1044` ``` apply (rule exI[where x= "?S"]) ``` huffman@44133 ` 1045` ``` apply (rule exI[where x= "?u"]) ``` wenzelm@49522 ` 1046` ``` apply auto ``` wenzelm@49522 ` 1047` ``` done ``` wenzelm@49522 ` 1048` ``` } ``` huffman@44133 ` 1049` ``` moreover ``` wenzelm@49522 ` 1050` ``` { fix S u v ``` wenzelm@49522 ` 1051` ``` assume fS: "finite S" ``` huffman@44133 ` 1052` ``` and SP: "S \ P" and vS: "v \ S" and uv: "u v \ 0" ``` wenzelm@49522 ` 1053` ``` and u: "setsum (\v. u v *\<^sub>R v) S = 0" ``` huffman@44133 ` 1054` ``` let ?a = v ``` huffman@44133 ` 1055` ``` let ?S = "S - {v}" ``` huffman@44133 ` 1056` ``` let ?u = "\i. (- u i) / u v" ``` wenzelm@49522 ` 1057` ``` have th0: "?a \ P" "finite ?S" "?S \ P" using fS SP vS by auto ``` huffman@44133 ` 1058` ``` have "setsum (\v. ?u v *\<^sub>R v) ?S = setsum (\v. (- (inverse (u ?a))) *\<^sub>R (u v *\<^sub>R v)) S - ?u v *\<^sub>R v" ``` wenzelm@49522 ` 1059` ``` using fS vS uv by (simp add: setsum_diff1 divide_inverse field_simps) ``` wenzelm@49522 ` 1060` ``` also have "\ = ?a" unfolding scaleR_right.setsum [symmetric] u using uv by simp ``` huffman@44133 ` 1061` ``` finally have "setsum (\v. ?u v *\<^sub>R v) ?S = ?a" . ``` huffman@44133 ` 1062` ``` with th0 have ?lhs ``` huffman@44133 ` 1063` ``` unfolding dependent_def span_explicit ``` huffman@44133 ` 1064` ``` apply - ``` huffman@44133 ` 1065` ``` apply (rule bexI[where x= "?a"]) ``` huffman@44133 ` 1066` ``` apply (simp_all del: scaleR_minus_left) ``` huffman@44133 ` 1067` ``` apply (rule exI[where x= "?S"]) ``` wenzelm@49522 ` 1068` ``` apply (auto simp del: scaleR_minus_left) ``` wenzelm@49522 ` 1069` ``` done ``` wenzelm@49522 ` 1070` ``` } ``` huffman@44133 ` 1071` ``` ultimately show ?thesis by blast ``` huffman@44133 ` 1072` ```qed ``` huffman@44133 ` 1073` huffman@44133 ` 1074` huffman@44133 ` 1075` ```lemma span_finite: ``` huffman@44133 ` 1076` ``` assumes fS: "finite S" ``` huffman@44133 ` 1077` ``` shows "span S = {y. \u. setsum (\v. u v *\<^sub>R v) S = y}" ``` huffman@44133 ` 1078` ``` (is "_ = ?rhs") ``` wenzelm@49522 ` 1079` ```proof - ``` wenzelm@49711 ` 1080` ``` { fix y ``` wenzelm@49711 ` 1081` ``` assume y: "y \ span S" ``` huffman@44133 ` 1082` ``` from y obtain S' u where fS': "finite S'" and SS': "S' \ S" and ``` huffman@44133 ` 1083` ``` u: "setsum (\v. u v *\<^sub>R v) S' = y" unfolding span_explicit by blast ``` huffman@44133 ` 1084` ``` let ?u = "\x. if x \ S' then u x else 0" ``` huffman@44133 ` 1085` ``` have "setsum (\v. ?u v *\<^sub>R v) S = setsum (\v. u v *\<^sub>R v) S'" ``` huffman@44133 ` 1086` ``` using SS' fS by (auto intro!: setsum_mono_zero_cong_right) ``` wenzelm@49522 ` 1087` ``` then have "setsum (\v. ?u v *\<^sub>R v) S = y" by (metis u) ``` wenzelm@49522 ` 1088` ``` then have "y \ ?rhs" by auto } ``` huffman@44133 ` 1089` ``` moreover ``` wenzelm@49522 ` 1090` ``` { fix y u ``` wenzelm@49522 ` 1091` ``` assume u: "setsum (\v. u v *\<^sub>R v) S = y" ``` wenzelm@49522 ` 1092` ``` then have "y \ span S" using fS unfolding span_explicit by auto } ``` huffman@44133 ` 1093` ``` ultimately show ?thesis by blast ``` huffman@44133 ` 1094` ```qed ``` huffman@44133 ` 1095` huffman@44133 ` 1096` ```text {* This is useful for building a basis step-by-step. *} ``` huffman@44133 ` 1097` huffman@44133 ` 1098` ```lemma independent_insert: ``` huffman@44133 ` 1099` ``` "independent(insert a S) \ ``` huffman@44133 ` 1100` ``` (if a \ S then independent S ``` huffman@44133 ` 1101` ``` else independent S \ a \ span S)" (is "?lhs \ ?rhs") ``` wenzelm@49522 ` 1102` ```proof - ``` wenzelm@49522 ` 1103` ``` { assume aS: "a \ S" ``` wenzelm@49522 ` 1104` ``` then have ?thesis using insert_absorb[OF aS] by simp } ``` huffman@44133 ` 1105` ``` moreover ``` wenzelm@49522 ` 1106` ``` { assume aS: "a \ S" ``` wenzelm@49522 ` 1107` ``` { assume i: ?lhs ``` huffman@44133 ` 1108` ``` then have ?rhs using aS ``` huffman@44133 ` 1109` ``` apply simp ``` huffman@44133 ` 1110` ``` apply (rule conjI) ``` huffman@44133 ` 1111` ``` apply (rule independent_mono) ``` huffman@44133 ` 1112` ``` apply assumption ``` huffman@44133 ` 1113` ``` apply blast ``` wenzelm@49522 ` 1114` ``` apply (simp add: dependent_def) ``` wenzelm@49522 ` 1115` ``` done } ``` huffman@44133 ` 1116` ``` moreover ``` wenzelm@49522 ` 1117` ``` { assume i: ?rhs ``` huffman@44133 ` 1118` ``` have ?lhs using i aS ``` huffman@44133 ` 1119` ``` apply simp ``` huffman@44133 ` 1120` ``` apply (auto simp add: dependent_def) ``` huffman@44133 ` 1121` ``` apply (case_tac "aa = a", auto) ``` huffman@44133 ` 1122` ``` apply (subgoal_tac "insert a S - {aa} = insert a (S - {aa})") ``` huffman@44133 ` 1123` ``` apply simp ``` huffman@44133 ` 1124` ``` apply (subgoal_tac "a \ span (insert aa (S - {aa}))") ``` huffman@44133 ` 1125` ``` apply (subgoal_tac "insert aa (S - {aa}) = S") ``` huffman@44133 ` 1126` ``` apply simp ``` huffman@44133 ` 1127` ``` apply blast ``` huffman@44133 ` 1128` ``` apply (rule in_span_insert) ``` huffman@44133 ` 1129` ``` apply assumption ``` huffman@44133 ` 1130` ``` apply blast ``` huffman@44133 ` 1131` ``` apply blast ``` wenzelm@49522 ` 1132` ``` done } ``` wenzelm@49522 ` 1133` ``` ultimately have ?thesis by blast } ``` huffman@44133 ` 1134` ``` ultimately show ?thesis by blast ``` huffman@44133 ` 1135` ```qed ``` huffman@44133 ` 1136` huffman@44133 ` 1137` ```text {* The degenerate case of the Exchange Lemma. *} ``` huffman@44133 ` 1138` huffman@44133 ` 1139` ```lemma mem_delete: "x \ (A - {a}) \ x \ a \ x \ A" ``` huffman@44133 ` 1140` ``` by blast ``` huffman@44133 ` 1141` huffman@44133 ` 1142` ```lemma spanning_subset_independent: ``` wenzelm@49711 ` 1143` ``` assumes BA: "B \ A" ``` wenzelm@49711 ` 1144` ``` and iA: "independent A" ``` wenzelm@49522 ` 1145` ``` and AsB: "A \ span B" ``` huffman@44133 ` 1146` ``` shows "A = B" ``` huffman@44133 ` 1147` ```proof ``` wenzelm@49663 ` 1148` ``` show "B \ A" by (rule BA) ``` wenzelm@49663 ` 1149` huffman@44133 ` 1150` ``` from span_mono[OF BA] span_mono[OF AsB] ``` huffman@44133 ` 1151` ``` have sAB: "span A = span B" unfolding span_span by blast ``` huffman@44133 ` 1152` wenzelm@49522 ` 1153` ``` { fix x assume x: "x \ A" ``` huffman@44133 ` 1154` ``` from iA have th0: "x \ span (A - {x})" ``` huffman@44133 ` 1155` ``` unfolding dependent_def using x by blast ``` huffman@44133 ` 1156` ``` from x have xsA: "x \ span A" by (blast intro: span_superset) ``` huffman@44133 ` 1157` ``` have "A - {x} \ A" by blast ``` wenzelm@49652 ` 1158` ``` then have th1:"span (A - {x}) \ span A" by (metis span_mono) ``` wenzelm@49522 ` 1159` ``` { assume xB: "x \ B" ``` huffman@44133 ` 1160` ``` from xB BA have "B \ A -{x}" by blast ``` wenzelm@49652 ` 1161` ``` then have "span B \ span (A - {x})" by (metis span_mono) ``` huffman@44133 ` 1162` ``` with th1 th0 sAB have "x \ span A" by blast ``` wenzelm@49522 ` 1163` ``` with x have False by (metis span_superset) } ``` wenzelm@49522 ` 1164` ``` then have "x \ B" by blast } ``` huffman@44133 ` 1165` ``` then show "A \ B" by blast ``` huffman@44133 ` 1166` ```qed ``` huffman@44133 ` 1167` huffman@44133 ` 1168` ```text {* The general case of the Exchange Lemma, the key to what follows. *} ``` huffman@44133 ` 1169` huffman@44133 ` 1170` ```lemma exchange_lemma: ``` wenzelm@49711 ` 1171` ``` assumes f:"finite t" ``` wenzelm@49711 ` 1172` ``` and i: "independent s" ``` wenzelm@49711 ` 1173` ``` and sp: "s \ span t" ``` huffman@44133 ` 1174` ``` shows "\t'. (card t' = card t) \ finite t' \ s \ t' \ t' \ s \ t \ s \ span t'" ``` wenzelm@49663 ` 1175` ``` using f i sp ``` wenzelm@49522 ` 1176` ```proof (induct "card (t - s)" arbitrary: s t rule: less_induct) ``` huffman@44133 ` 1177` ``` case less ``` huffman@44133 ` 1178` ``` note ft = `finite t` and s = `independent s` and sp = `s \ span t` ``` huffman@44133 ` 1179` ``` let ?P = "\t'. (card t' = card t) \ finite t' \ s \ t' \ t' \ s \ t \ s \ span t'" ``` huffman@44133 ` 1180` ``` let ?ths = "\t'. ?P t'" ``` wenzelm@49522 ` 1181` ``` { assume st: "s \ t" ``` huffman@44133 ` 1182` ``` from st ft span_mono[OF st] have ?ths apply - apply (rule exI[where x=t]) ``` wenzelm@49522 ` 1183` ``` apply (auto intro: span_superset) ``` wenzelm@49522 ` 1184` ``` done } ``` huffman@44133 ` 1185` ``` moreover ``` wenzelm@49522 ` 1186` ``` { assume st: "t \ s" ``` huffman@44133 ` 1187` ``` from spanning_subset_independent[OF st s sp] ``` wenzelm@49711 ` 1188` ``` st ft span_mono[OF st] have ?ths ``` wenzelm@49711 ` 1189` ``` apply - ``` wenzelm@49711 ` 1190` ``` apply (rule exI[where x=t]) ``` wenzelm@49711 ` 1191` ``` apply (auto intro: span_superset) ``` wenzelm@49711 ` 1192` ``` done } ``` huffman@44133 ` 1193` ``` moreover ``` wenzelm@49522 ` 1194` ``` { assume st: "\ s \ t" "\ t \ s" ``` huffman@44133 ` 1195` ``` from st(2) obtain b where b: "b \ t" "b \ s" by blast ``` huffman@44133 ` 1196` ``` from b have "t - {b} - s \ t - s" by blast ``` huffman@44133 ` 1197` ``` then have cardlt: "card (t - {b} - s) < card (t - s)" using ft ``` huffman@44133 ` 1198` ``` by (auto intro: psubset_card_mono) ``` huffman@44133 ` 1199` ``` from b ft have ct0: "card t \ 0" by auto ``` wenzelm@49522 ` 1200` ``` { assume stb: "s \ span(t -{b})" ``` huffman@44133 ` 1201` ``` from ft have ftb: "finite (t -{b})" by auto ``` huffman@44133 ` 1202` ``` from less(1)[OF cardlt ftb s stb] ``` wenzelm@49522 ` 1203` ``` obtain u where u: "card u = card (t-{b})" "s \ u" "u \ s \ (t - {b})" "s \ span u" ``` wenzelm@49522 ` 1204` ``` and fu: "finite u" by blast ``` huffman@44133 ` 1205` ``` let ?w = "insert b u" ``` huffman@44133 ` 1206` ``` have th0: "s \ insert b u" using u by blast ``` huffman@44133 ` 1207` ``` from u(3) b have "u \ s \ t" by blast ``` huffman@44133 ` 1208` ``` then have th1: "insert b u \ s \ t" using u b by blast ``` huffman@44133 ` 1209` ``` have bu: "b \ u" using b u by blast ``` huffman@44133 ` 1210` ``` from u(1) ft b have "card u = (card t - 1)" by auto ``` wenzelm@49522 ` 1211` ``` then have th2: "card (insert b u) = card t" ``` huffman@44133 ` 1212` ``` using card_insert_disjoint[OF fu bu] ct0 by auto ``` huffman@44133 ` 1213` ``` from u(4) have "s \ span u" . ``` huffman@44133 ` 1214` ``` also have "\ \ span (insert b u)" apply (rule span_mono) by blast ``` huffman@44133 ` 1215` ``` finally have th3: "s \ span (insert b u)" . ``` huffman@44133 ` 1216` ``` from th0 th1 th2 th3 fu have th: "?P ?w" by blast ``` wenzelm@49522 ` 1217` ``` from th have ?ths by blast } ``` huffman@44133 ` 1218` ``` moreover ``` wenzelm@49522 ` 1219` ``` { assume stb: "\ s \ span(t -{b})" ``` huffman@44133 ` 1220` ``` from stb obtain a where a: "a \ s" "a \ span (t - {b})" by blast ``` huffman@44133 ` 1221` ``` have ab: "a \ b" using a b by blast ``` huffman@44133 ` 1222` ``` have at: "a \ t" using a ab span_superset[of a "t- {b}"] by auto ``` huffman@44133 ` 1223` ``` have mlt: "card ((insert a (t - {b})) - s) < card (t - s)" ``` huffman@44133 ` 1224` ``` using cardlt ft a b by auto ``` huffman@44133 ` 1225` ``` have ft': "finite (insert a (t - {b}))" using ft by auto ``` wenzelm@49522 ` 1226` ``` { fix x assume xs: "x \ s" ``` huffman@44133 ` 1227` ``` have t: "t \ (insert b (insert a (t -{b})))" using b by auto ``` huffman@44133 ` 1228` ``` from b(1) have "b \ span t" by (simp add: span_superset) ``` huffman@44133 ` 1229` ``` have bs: "b \ span (insert a (t - {b}))" apply(rule in_span_delete) ``` wenzelm@49522 ` 1230` ``` using a sp unfolding subset_eq apply auto done ``` huffman@44133 ` 1231` ``` from xs sp have "x \ span t" by blast ``` huffman@44133 ` 1232` ``` with span_mono[OF t] ``` huffman@44133 ` 1233` ``` have x: "x \ span (insert b (insert a (t - {b})))" .. ``` wenzelm@49522 ` 1234` ``` from span_trans[OF bs x] have "x \ span (insert a (t - {b}))" . } ``` huffman@44133 ` 1235` ``` then have sp': "s \ span (insert a (t - {b}))" by blast ``` huffman@44133 ` 1236` huffman@44133 ` 1237` ``` from less(1)[OF mlt ft' s sp'] obtain u where ``` huffman@44133 ` 1238` ``` u: "card u = card (insert a (t -{b}))" "finite u" "s \ u" "u \ s \ insert a (t -{b})" ``` wenzelm@49522 ` 1239` ``` "s \ span u" by blast ``` huffman@44133 ` 1240` ``` from u a b ft at ct0 have "?P u" by auto ``` huffman@44133 ` 1241` ``` then have ?ths by blast } ``` huffman@44133 ` 1242` ``` ultimately have ?ths by blast ``` huffman@44133 ` 1243` ``` } ``` wenzelm@49522 ` 1244` ``` ultimately show ?ths by blast ``` huffman@44133 ` 1245` ```qed ``` huffman@44133 ` 1246` huffman@44133 ` 1247` ```text {* This implies corresponding size bounds. *} ``` huffman@44133 ` 1248` huffman@44133 ` 1249` ```lemma independent_span_bound: ``` huffman@44133 ` 1250` ``` assumes f: "finite t" and i: "independent s" and sp:"s \ span t" ``` huffman@44133 ` 1251` ``` shows "finite s \ card s \ card t" ``` huffman@44133 ` 1252` ``` by (metis exchange_lemma[OF f i sp] finite_subset card_mono) ``` huffman@44133 ` 1253` huffman@44133 ` 1254` huffman@44133 ` 1255` ```lemma finite_Atleast_Atmost_nat[simp]: "finite {f x |x. x\ (UNIV::'a::finite set)}" ``` wenzelm@49522 ` 1256` ```proof - ``` huffman@44133 ` 1257` ``` have eq: "{f x |x. x\ UNIV} = f ` UNIV" by auto ``` huffman@44133 ` 1258` ``` show ?thesis unfolding eq ``` huffman@44133 ` 1259` ``` apply (rule finite_imageI) ``` huffman@44133 ` 1260` ``` apply (rule finite) ``` huffman@44133 ` 1261` ``` done ``` huffman@44133 ` 1262` ```qed ``` huffman@44133 ` 1263` huffman@44133 ` 1264` ```subsection{* Euclidean Spaces as Typeclass*} ``` huffman@44133 ` 1265` huffman@44133 ` 1266` ```lemma independent_eq_inj_on: ``` wenzelm@49663 ` 1267` ``` fixes D :: nat ``` wenzelm@49663 ` 1268` ``` and f :: "nat \ 'c::real_vector" ``` wenzelm@49663 ` 1269` ``` assumes "inj_on f {.. (\a u. a < D \ (\i\{..R f i) \ f a)" ``` huffman@44133 ` 1271` ```proof - ``` wenzelm@49663 ` 1272` ``` from assms have eq: "\i. i < D \ f ` {..i. inj_on f ({..i. finite (f ` {.. {DIM('a)..}" by auto ``` huffman@44133 ` 1290` ``` show ?thesis unfolding * image_Un basis_finite by auto ``` huffman@44133 ` 1291` ```qed ``` huffman@44133 ` 1292` wenzelm@49663 ` 1293` ```lemma (in euclidean_space) range_basis_finite[intro]: "finite (range basis)" ``` huffman@44133 ` 1294` ``` unfolding range_basis by auto ``` huffman@44133 ` 1295` huffman@44133 ` 1296` ```lemma span_basis: "span (range basis) = (UNIV :: 'a::euclidean_space set)" ``` huffman@44133 ` 1297` ```proof - ``` huffman@44133 ` 1298` ``` { fix x :: 'a ``` huffman@44133 ` 1299` ``` have "(\iR basis i) \ span (range basis :: 'a set)" ``` huffman@44133 ` 1300` ``` by (simp add: span_setsum span_mul span_superset) ``` wenzelm@49522 ` 1301` ``` then have "x \ span (range basis)" ``` huffman@44133 ` 1302` ``` by (simp only: euclidean_representation [symmetric]) ``` wenzelm@49522 ` 1303` ``` } then show ?thesis by auto ``` huffman@44133 ` 1304` ```qed ``` huffman@44133 ` 1305` huffman@44133 ` 1306` ```lemma basis_representation: ``` huffman@44133 ` 1307` ``` "\u. x = (\v\basis ` {..R (v\'a\euclidean_space))" ``` huffman@44133 ` 1308` ```proof - ``` huffman@44133 ` 1309` ``` have "x\UNIV" by auto from this[unfolded span_basis[THEN sym]] ``` huffman@44133 ` 1310` ``` have "\u. (\v\basis ` {..R v) = x" ``` huffman@44133 ` 1311` ``` unfolding range_basis span_insert_0 apply(subst (asm) span_finite) by auto ``` wenzelm@49522 ` 1312` ``` then show ?thesis by fastforce ``` huffman@44133 ` 1313` ```qed ``` huffman@44133 ` 1314` huffman@44133 ` 1315` ```lemma span_basis'[simp]:"span ((basis::nat=>'a) ` {..'a) ` {.. span (basis ` {.. e \ \x\$\$i\ <= e" ``` huffman@44133 ` 1330` ``` by (metis component_le_norm order_trans) ``` huffman@44133 ` 1331` huffman@44133 ` 1332` ```lemma norm_bound_component_lt: "norm (x::'a::euclidean_space) < e \ \x\$\$i\ < e" ``` huffman@44133 ` 1333` ``` by (metis component_le_norm basic_trans_rules(21)) ``` huffman@44133 ` 1334` huffman@44133 ` 1335` ```lemma norm_le_l1: "norm (x::'a::euclidean_space) \ (\ix \$\$ i\)" ``` huffman@44133 ` 1336` ``` apply (subst euclidean_representation[of x]) ``` huffman@44176 ` 1337` ``` apply (rule order_trans[OF norm_setsum]) ``` wenzelm@49522 ` 1338` ``` apply (auto intro!: setsum_mono) ``` wenzelm@49522 ` 1339` ``` done ``` huffman@44133 ` 1340` huffman@44133 ` 1341` ```lemma setsum_norm_allsubsets_bound: ``` huffman@44133 ` 1342` ``` fixes f:: "'a \ 'n::euclidean_space" ``` huffman@44133 ` 1343` ``` assumes fP: "finite P" and fPs: "\Q. Q \ P \ norm (setsum f Q) \ e" ``` huffman@44133 ` 1344` ``` shows "setsum (\x. norm (f x)) P \ 2 * real DIM('n) * e" ``` wenzelm@49522 ` 1345` ```proof - ``` huffman@44133 ` 1346` ``` let ?d = "real DIM('n)" ``` huffman@44133 ` 1347` ``` let ?nf = "\x. norm (f x)" ``` huffman@44133 ` 1348` ``` let ?U = "{..x. setsum (\i. \f x \$\$ i\) ?U) P = setsum (\i. setsum (\x. \f x \$\$ i\) P) ?U" ``` huffman@44133 ` 1350` ``` by (rule setsum_commute) ``` huffman@44133 ` 1351` ``` have th1: "2 * ?d * e = of_nat (card ?U) * (2 * e)" by (simp add: real_of_nat_def) ``` huffman@44133 ` 1352` ``` have "setsum ?nf P \ setsum (\x. setsum (\i. \f x \$\$ i\) ?U) P" ``` wenzelm@49663 ` 1353` ``` by (rule setsum_mono) (rule norm_le_l1) ``` huffman@44133 ` 1354` ``` also have "\ \ 2 * ?d * e" ``` huffman@44133 ` 1355` ``` unfolding th0 th1 ``` wenzelm@49522 ` 1356` ``` proof (rule setsum_bounded) ``` huffman@44133 ` 1357` ``` fix i assume i: "i \ ?U" ``` huffman@44133 ` 1358` ``` let ?Pp = "{x. x\ P \ f x \$\$ i \ 0}" ``` huffman@44133 ` 1359` ``` let ?Pn = "{x. x \ P \ f x \$\$ i < 0}" ``` huffman@44133 ` 1360` ``` have thp: "P = ?Pp \ ?Pn" by auto ``` huffman@44133 ` 1361` ``` have thp0: "?Pp \ ?Pn ={}" by auto ``` huffman@44133 ` 1362` ``` have PpP: "?Pp \ P" and PnP: "?Pn \ P" by blast+ ``` huffman@44133 ` 1363` ``` have Ppe:"setsum (\x. \f x \$\$ i\) ?Pp \ e" ``` huffman@44133 ` 1364` ``` using component_le_norm[of "setsum (\x. f x) ?Pp" i] fPs[OF PpP] ``` huffman@44457 ` 1365` ``` by(auto intro: abs_le_D1) ``` huffman@44133 ` 1366` ``` have Pne: "setsum (\x. \f x \$\$ i\) ?Pn \ e" ``` huffman@44133 ` 1367` ``` using component_le_norm[of "setsum (\x. - f x) ?Pn" i] fPs[OF PnP] ``` huffman@44133 ` 1368` ``` by(auto simp add: setsum_negf intro: abs_le_D1) ``` huffman@44133 ` 1369` ``` have "setsum (\x. \f x \$\$ i\) P = setsum (\x. \f x \$\$ i\) ?Pp + setsum (\x. \f x \$\$ i\) ?Pn" ``` huffman@44133 ` 1370` ``` apply (subst thp) ``` huffman@44133 ` 1371` ``` apply (rule setsum_Un_zero) ``` wenzelm@49522 ` 1372` ``` using fP thp0 apply auto ``` wenzelm@49522 ` 1373` ``` done ``` huffman@44133 ` 1374` ``` also have "\ \ 2*e" using Pne Ppe by arith ``` huffman@44133 ` 1375` ``` finally show "setsum (\x. \f x \$\$ i\) P \ 2*e" . ``` huffman@44133 ` 1376` ``` qed ``` huffman@44133 ` 1377` ``` finally show ?thesis . ``` huffman@44133 ` 1378` ```qed ``` huffman@44133 ` 1379` huffman@44133 ` 1380` ```lemma choice_iff': "(\xy. P x y) \ (\f. \xix. P i x) \ ``` huffman@44133 ` 1383` ``` (\x::'a. \i ?rhs") ``` wenzelm@49663 ` 1384` ```proof - ``` huffman@44133 ` 1385` ``` let ?S = "{..ii 'b::real_normed_vector" ``` huffman@44133 ` 1405` ``` assumes lf: "linear f" ``` huffman@44133 ` 1406` ``` shows "\B. \x. norm (f x) \ B * norm x" ``` wenzelm@49522 ` 1407` ```proof - ``` huffman@44133 ` 1408` ``` let ?S = "{..i. (x\$\$i) *\<^sub>R (basis i)) ?S))" ``` wenzelm@49663 ` 1414` ``` apply (subst euclidean_representation[of x]) ``` wenzelm@49663 ` 1415` ``` apply rule ``` wenzelm@49663 ` 1416` ``` done ``` huffman@44133 ` 1417` ``` also have "\ = norm (setsum (\ i. (x\$\$i) *\<^sub>R f (basis i)) ?S)" ``` huffman@44133 ` 1418` ``` using linear_setsum[OF lf fS, of ?g, unfolded o_def] linear_cmul[OF lf] by auto ``` huffman@44133 ` 1419` ``` finally have th0: "norm (f x) = norm (setsum (\i. (x\$\$i) *\<^sub>R f (basis i))?S)" . ``` wenzelm@49522 ` 1420` ``` { fix i assume i: "i \ ?S" ``` huffman@44133 ` 1421` ``` from component_le_norm[of x i] ``` huffman@44133 ` 1422` ``` have "norm ((x\$\$i) *\<^sub>R f (basis i :: 'a)) \ norm (f (basis i)) * norm x" ``` wenzelm@49663 ` 1423` ``` unfolding norm_scaleR ``` wenzelm@49663 ` 1424` ``` apply (simp only: mult_commute) ``` wenzelm@49663 ` 1425` ``` apply (rule mult_mono) ``` wenzelm@49663 ` 1426` ``` apply (auto simp add: field_simps) ``` wenzelm@49663 ` 1427` ``` done } ``` wenzelm@49522 ` 1428` ``` then have th: "\i\ ?S. norm ((x\$\$i) *\<^sub>R f (basis i :: 'a)) \ norm (f (basis i)) * norm x" ``` wenzelm@49522 ` 1429` ``` by metis ``` huffman@44176 ` 1430` ``` from setsum_norm_le[of _ "\i. (x\$\$i) *\<^sub>R (f (basis i))", OF th] ``` huffman@44133 ` 1431` ``` have "norm (f x) \ ?B * norm x" unfolding th0 setsum_left_distrib by metis} ``` huffman@44133 ` 1432` ``` then show ?thesis by blast ``` huffman@44133 ` 1433` ```qed ``` huffman@44133 ` 1434` huffman@44133 ` 1435` ```lemma linear_bounded_pos: ``` huffman@44133 ` 1436` ``` fixes f:: "'a::euclidean_space \ 'b::real_normed_vector" ``` huffman@44133 ` 1437` ``` assumes lf: "linear f" ``` huffman@44133 ` 1438` ``` shows "\B > 0. \x. norm (f x) \ B * norm x" ``` wenzelm@49663 ` 1439` ```proof - ``` huffman@44133 ` 1440` ``` from linear_bounded[OF lf] obtain B where ``` huffman@44133 ` 1441` ``` B: "\x. norm (f x) \ B * norm x" by blast ``` huffman@44133 ` 1442` ``` let ?K = "\B\ + 1" ``` huffman@44133 ` 1443` ``` have Kp: "?K > 0" by arith ``` wenzelm@49663 ` 1444` ``` { assume C: "B < 0" ``` wenzelm@49663 ` 1445` ``` have "((\\ i. 1)::'a) \ 0" unfolding euclidean_eq[where 'a='a] ``` wenzelm@49663 ` 1446` ``` by(auto intro!:exI[where x=0]) ``` wenzelm@49663 ` 1447` ``` then have "norm ((\\ i. 1)::'a) > 0" by auto ``` wenzelm@49663 ` 1448` ``` with C have "B * norm ((\\ i. 1)::'a) < 0" ``` wenzelm@49663 ` 1449` ``` by (simp add: mult_less_0_iff) ``` wenzelm@49663 ` 1450` ``` with B[rule_format, of "(\\ i. 1)::'a"] norm_ge_zero[of "f ((\\ i. 1)::'a)"] have False by simp ``` wenzelm@49663 ` 1451` ``` } ``` wenzelm@49663 ` 1452` ``` then have Bp: "B \ 0" by (metis not_leE) ``` wenzelm@49663 ` 1453` ``` { fix x::"'a" ``` wenzelm@49663 ` 1454` ``` have "norm (f x) \ ?K * norm x" ``` huffman@44133 ` 1455` ``` using B[rule_format, of x] norm_ge_zero[of x] norm_ge_zero[of "f x"] Bp ``` huffman@44133 ` 1456` ``` apply (auto simp add: field_simps split add: abs_split) ``` huffman@44133 ` 1457` ``` apply (erule order_trans, simp) ``` huffman@44133 ` 1458` ``` done ``` wenzelm@49663 ` 1459` ``` } then show ?thesis using Kp by blast ``` huffman@44133 ` 1460` ```qed ``` huffman@44133 ` 1461` huffman@44133 ` 1462` ```lemma linear_conv_bounded_linear: ``` huffman@44133 ` 1463` ``` fixes f :: "'a::euclidean_space \ 'b::real_normed_vector" ``` huffman@44133 ` 1464` ``` shows "linear f \ bounded_linear f" ``` huffman@44133 ` 1465` ```proof ``` huffman@44133 ` 1466` ``` assume "linear f" ``` huffman@44133 ` 1467` ``` show "bounded_linear f" ``` huffman@44133 ` 1468` ``` proof ``` huffman@44133 ` 1469` ``` fix x y show "f (x + y) = f x + f y" ``` huffman@44133 ` 1470` ``` using `linear f` unfolding linear_def by simp ``` huffman@44133 ` 1471` ``` next ``` huffman@44133 ` 1472` ``` fix r x show "f (scaleR r x) = scaleR r (f x)" ``` huffman@44133 ` 1473` ``` using `linear f` unfolding linear_def by simp ``` huffman@44133 ` 1474` ``` next ``` huffman@44133 ` 1475` ``` have "\B. \x. norm (f x) \ B * norm x" ``` huffman@44133 ` 1476` ``` using `linear f` by (rule linear_bounded) ``` wenzelm@49522 ` 1477` ``` then show "\K. \x. norm (f x) \ norm x * K" ``` huffman@44133 ` 1478` ``` by (simp add: mult_commute) ``` huffman@44133 ` 1479` ``` qed ``` huffman@44133 ` 1480` ```next ``` huffman@44133 ` 1481` ``` assume "bounded_linear f" ``` huffman@44133 ` 1482` ``` then interpret f: bounded_linear f . ``` huffman@44133 ` 1483` ``` show "linear f" ``` huffman@44133 ` 1484` ``` by (simp add: f.add f.scaleR linear_def) ``` huffman@44133 ` 1485` ```qed ``` huffman@44133 ` 1486` wenzelm@49522 ` 1487` ```lemma bounded_linearI': ``` wenzelm@49522 ` 1488` ``` fixes f::"'a::euclidean_space \ 'b::real_normed_vector" ``` huffman@44133 ` 1489` ``` assumes "\x y. f (x + y) = f x + f y" "\c x. f (c *\<^sub>R x) = c *\<^sub>R f x" ``` wenzelm@49522 ` 1490` ``` shows "bounded_linear f" ``` wenzelm@49522 ` 1491` ``` unfolding linear_conv_bounded_linear[THEN sym] ``` wenzelm@49522 ` 1492` ``` by (rule linearI[OF assms]) ``` huffman@44133 ` 1493` huffman@44133 ` 1494` huffman@44133 ` 1495` ```lemma bilinear_bounded: ``` huffman@44133 ` 1496` ``` fixes h:: "'m::euclidean_space \ 'n::euclidean_space \ 'k::real_normed_vector" ``` huffman@44133 ` 1497` ``` assumes bh: "bilinear h" ``` huffman@44133 ` 1498` ``` shows "\B. \x y. norm (h x y) \ B * norm x * norm y" ``` wenzelm@49522 ` 1499` ```proof - ``` huffman@44133 ` 1500` ``` let ?M = "{..i. (x\$\$i) *\<^sub>R basis i) ?M) (setsum (\i. (y\$\$i) *\<^sub>R basis i) ?N))" ``` huffman@44133 ` 1506` ``` apply(subst euclidean_representation[where 'a='m]) ``` wenzelm@49522 ` 1507` ``` apply(subst euclidean_representation[where 'a='n]) ``` wenzelm@49522 ` 1508` ``` apply rule ``` wenzelm@49522 ` 1509` ``` done ``` huffman@44133 ` 1510` ``` also have "\ = norm (setsum (\ (i,j). h ((x\$\$i) *\<^sub>R basis i) ((y\$\$j) *\<^sub>R basis j)) (?M \ ?N))" ``` huffman@44133 ` 1511` ``` unfolding bilinear_setsum[OF bh fM fN] .. ``` huffman@44133 ` 1512` ``` finally have th: "norm (h x y) = \" . ``` huffman@44133 ` 1513` ``` have "norm (h x y) \ ?B * norm x * norm y" ``` huffman@44133 ` 1514` ``` apply (simp add: setsum_left_distrib th) ``` huffman@44133 ` 1515` ``` apply (rule setsum_norm_le) ``` huffman@44133 ` 1516` ``` using fN fM ``` huffman@44133 ` 1517` ``` apply simp ``` wenzelm@49711 ` 1518` ``` apply (auto simp add: bilinear_rmul[OF bh] bilinear_lmul[OF bh] ``` wenzelm@49711 ` 1519` ``` field_simps simp del: scaleR_scaleR) ``` huffman@44133 ` 1520` ``` apply (rule mult_mono) ``` huffman@44133 ` 1521` ``` apply (auto simp add: zero_le_mult_iff component_le_norm) ``` huffman@44133 ` 1522` ``` apply (rule mult_mono) ``` huffman@44133 ` 1523` ``` apply (auto simp add: zero_le_mult_iff component_le_norm) ``` wenzelm@49522 ` 1524` ``` done } ``` huffman@44133 ` 1525` ``` then show ?thesis by metis ``` huffman@44133 ` 1526` ```qed ``` huffman@44133 ` 1527` huffman@44133 ` 1528` ```lemma bilinear_bounded_pos: ``` huffman@44133 ` 1529` ``` fixes h:: "'a::euclidean_space \ 'b::euclidean_space \ 'c::real_normed_vector" ``` huffman@44133 ` 1530` ``` assumes bh: "bilinear h" ``` huffman@44133 ` 1531` ``` shows "\B > 0. \x y. norm (h x y) \ B * norm x * norm y" ``` wenzelm@49522 ` 1532` ```proof - ``` huffman@44133 ` 1533` ``` from bilinear_bounded[OF bh] obtain B where ``` huffman@44133 ` 1534` ``` B: "\x y. norm (h x y) \ B * norm x * norm y" by blast ``` huffman@44133 ` 1535` ``` let ?K = "\B\ + 1" ``` huffman@44133 ` 1536` ``` have Kp: "?K > 0" by arith ``` huffman@44133 ` 1537` ``` have KB: "B < ?K" by arith ``` wenzelm@49522 ` 1538` ``` { fix x::'a and y::'b ``` huffman@44133 ` 1539` ``` from KB Kp ``` huffman@44133 ` 1540` ``` have "B * norm x * norm y \ ?K * norm x * norm y" ``` huffman@44133 ` 1541` ``` apply - ``` huffman@44133 ` 1542` ``` apply (rule mult_right_mono, rule mult_right_mono) ``` wenzelm@49522 ` 1543` ``` apply auto ``` wenzelm@49522 ` 1544` ``` done ``` huffman@44133 ` 1545` ``` then have "norm (h x y) \ ?K * norm x * norm y" ``` wenzelm@49522 ` 1546` ``` using B[rule_format, of x y] by simp } ``` huffman@44133 ` 1547` ``` with Kp show ?thesis by blast ``` huffman@44133 ` 1548` ```qed ``` huffman@44133 ` 1549` huffman@44133 ` 1550` ```lemma bilinear_conv_bounded_bilinear: ``` huffman@44133 ` 1551` ``` fixes h :: "'a::euclidean_space \ 'b::euclidean_space \ 'c::real_normed_vector" ``` huffman@44133 ` 1552` ``` shows "bilinear h \ bounded_bilinear h" ``` huffman@44133 ` 1553` ```proof ``` huffman@44133 ` 1554` ``` assume "bilinear h" ``` huffman@44133 ` 1555` ``` show "bounded_bilinear h" ``` huffman@44133 ` 1556` ``` proof ``` huffman@44133 ` 1557` ``` fix x y z show "h (x + y) z = h x z + h y z" ``` huffman@44133 ` 1558` ``` using `bilinear h` unfolding bilinear_def linear_def by simp ``` huffman@44133 ` 1559` ``` next ``` huffman@44133 ` 1560` ``` fix x y z show "h x (y + z) = h x y + h x z" ``` huffman@44133 ` 1561` ``` using `bilinear h` unfolding bilinear_def linear_def by simp ``` huffman@44133 ` 1562` ``` next ``` huffman@44133 ` 1563` ``` fix r x y show "h (scaleR r x) y = scaleR r (h x y)" ``` huffman@44133 ` 1564` ``` using `bilinear h` unfolding bilinear_def linear_def ``` huffman@44133 ` 1565` ``` by simp ``` huffman@44133 ` 1566` ``` next ``` huffman@44133 ` 1567` ``` fix r x y show "h x (scaleR r y) = scaleR r (h x y)" ``` huffman@44133 ` 1568` ``` using `bilinear h` unfolding bilinear_def linear_def ``` huffman@44133 ` 1569` ``` by simp ``` huffman@44133 ` 1570` ``` next ``` huffman@44133 ` 1571` ``` have "\B. \x y. norm (h x y) \ B * norm x * norm y" ``` huffman@44133 ` 1572` ``` using `bilinear h` by (rule bilinear_bounded) ``` wenzelm@49522 ` 1573` ``` then show "\K. \x y. norm (h x y) \ norm x * norm y * K" ``` huffman@44133 ` 1574` ``` by (simp add: mult_ac) ``` huffman@44133 ` 1575` ``` qed ``` huffman@44133 ` 1576` ```next ``` huffman@44133 ` 1577` ``` assume "bounded_bilinear h" ``` huffman@44133 ` 1578` ``` then interpret h: bounded_bilinear h . ``` huffman@44133 ` 1579` ``` show "bilinear h" ``` huffman@44133 ` 1580` ``` unfolding bilinear_def linear_conv_bounded_linear ``` wenzelm@49522 ` 1581` ``` using h.bounded_linear_left h.bounded_linear_right by simp ``` huffman@44133 ` 1582` ```qed ``` huffman@44133 ` 1583` wenzelm@49522 ` 1584` huffman@44133 ` 1585` ```subsection {* We continue. *} ``` huffman@44133 ` 1586` huffman@44133 ` 1587` ```lemma independent_bound: ``` huffman@44133 ` 1588` ``` fixes S:: "('a::euclidean_space) set" ``` huffman@44133 ` 1589` ``` shows "independent S \ finite S \ card S <= DIM('a::euclidean_space)" ``` huffman@44133 ` 1590` ``` using independent_span_bound[of "(basis::nat=>'a) ` {.. card S > DIM('a)) ==> dependent S" ``` huffman@44133 ` 1594` ``` by (metis independent_bound not_less) ``` huffman@44133 ` 1595` huffman@44133 ` 1596` ```text {* Hence we can create a maximal independent subset. *} ``` huffman@44133 ` 1597` huffman@44133 ` 1598` ```lemma maximal_independent_subset_extend: ``` wenzelm@49663 ` 1599` ``` assumes sv: "(S::('a::euclidean_space) set) \ V" ``` wenzelm@49663 ` 1600` ``` and iS: "independent S" ``` huffman@44133 ` 1601` ``` shows "\B. S \ B \ B \ V \ independent B \ V \ span B" ``` huffman@44133 ` 1602` ``` using sv iS ``` wenzelm@49522 ` 1603` ```proof (induct "DIM('a) - card S" arbitrary: S rule: less_induct) ``` huffman@44133 ` 1604` ``` case less ``` huffman@44133 ` 1605` ``` note sv = `S \ V` and i = `independent S` ``` huffman@44133 ` 1606` ``` let ?P = "\B. S \ B \ B \ V \ independent B \ V \ span B" ``` huffman@44133 ` 1607` ``` let ?ths = "\x. ?P x" ``` huffman@44133 ` 1608` ``` let ?d = "DIM('a)" ``` wenzelm@49522 ` 1609` ``` { assume "V \ span S" ``` huffman@44133 ` 1610` ``` then have ?ths using sv i by blast } ``` huffman@44133 ` 1611` ``` moreover ``` wenzelm@49522 ` 1612` ``` { assume VS: "\ V \ span S" ``` huffman@44133 ` 1613` ``` from VS obtain a where a: "a \ V" "a \ span S" by blast ``` huffman@44133 ` 1614` ``` from a have aS: "a \ S" by (auto simp add: span_superset) ``` huffman@44133 ` 1615` ``` have th0: "insert a S \ V" using a sv by blast ``` huffman@44133 ` 1616` ``` from independent_insert[of a S] i a ``` huffman@44133 ` 1617` ``` have th1: "independent (insert a S)" by auto ``` huffman@44133 ` 1618` ``` have mlt: "?d - card (insert a S) < ?d - card S" ``` wenzelm@49522 ` 1619` ``` using aS a independent_bound[OF th1] by auto ``` huffman@44133 ` 1620` huffman@44133 ` 1621` ``` from less(1)[OF mlt th0 th1] ``` huffman@44133 ` 1622` ``` obtain B where B: "insert a S \ B" "B \ V" "independent B" " V \ span B" ``` huffman@44133 ` 1623` ``` by blast ``` huffman@44133 ` 1624` ``` from B have "?P B" by auto ``` wenzelm@49522 ` 1625` ``` then have ?ths by blast } ``` huffman@44133 ` 1626` ``` ultimately show ?ths by blast ``` huffman@44133 ` 1627` ```qed ``` huffman@44133 ` 1628` huffman@44133 ` 1629` ```lemma maximal_independent_subset: ``` huffman@44133 ` 1630` ``` "\(B:: ('a::euclidean_space) set). B\ V \ independent B \ V \ span B" ``` wenzelm@49522 ` 1631` ``` by (metis maximal_independent_subset_extend[of "{}:: ('a::euclidean_space) set"] ``` wenzelm@49522 ` 1632` ``` empty_subsetI independent_empty) ``` huffman@44133 ` 1633` huffman@44133 ` 1634` huffman@44133 ` 1635` ```text {* Notion of dimension. *} ``` huffman@44133 ` 1636` huffman@44133 ` 1637` ```definition "dim V = (SOME n. \B. B \ V \ independent B \ V \ span B \ (card B = n))" ``` huffman@44133 ` 1638` wenzelm@49522 ` 1639` ```lemma basis_exists: ``` wenzelm@49522 ` 1640` ``` "\B. (B :: ('a::euclidean_space) set) \ V \ independent B \ V \ span B \ (card B = dim V)" ``` wenzelm@49522 ` 1641` ``` unfolding dim_def some_eq_ex[of "\n. \B. B \ V \ independent B \ V \ span B \ (card B = n)"] ``` wenzelm@49522 ` 1642` ``` using maximal_independent_subset[of V] independent_bound ``` wenzelm@49522 ` 1643` ``` by auto ``` huffman@44133 ` 1644` huffman@44133 ` 1645` ```text {* Consequences of independence or spanning for cardinality. *} ``` huffman@44133 ` 1646` huffman@44133 ` 1647` ```lemma independent_card_le_dim: ``` wenzelm@49522 ` 1648` ``` assumes "(B::('a::euclidean_space) set) \ V" and "independent B" ``` wenzelm@49522 ` 1649` ``` shows "card B \ dim V" ``` huffman@44133 ` 1650` ```proof - ``` huffman@44133 ` 1651` ``` from basis_exists[of V] `B \ V` ``` huffman@44133 ` 1652` ``` obtain B' where "independent B'" and "B \ span B'" and "card B' = dim V" by blast ``` huffman@44133 ` 1653` ``` with independent_span_bound[OF _ `independent B` `B \ span B'`] independent_bound[of B'] ``` huffman@44133 ` 1654` ``` show ?thesis by auto ``` huffman@44133 ` 1655` ```qed ``` huffman@44133 ` 1656` wenzelm@49522 ` 1657` ```lemma span_card_ge_dim: ``` wenzelm@49522 ` 1658` ``` "(B::('a::euclidean_space) set) \ V \ V \ span B \ finite B \ dim V \ card B" ``` huffman@44133 ` 1659` ``` by (metis basis_exists[of V] independent_span_bound subset_trans) ``` huffman@44133 ` 1660` huffman@44133 ` 1661` ```lemma basis_card_eq_dim: ``` wenzelm@49522 ` 1662` ``` "B \ (V:: ('a::euclidean_space) set) \ V \ span B \ ``` wenzelm@49522 ` 1663` ``` independent B \ finite B \ card B = dim V" ``` huffman@44133 ` 1664` ``` by (metis order_eq_iff independent_card_le_dim span_card_ge_dim independent_bound) ``` huffman@44133 ` 1665` wenzelm@49522 ` 1666` ```lemma dim_unique: "(B::('a::euclidean_space) set) \ V \ V \ span B \ ``` wenzelm@49522 ` 1667` ``` independent B \ card B = n \ dim V = n" ``` huffman@44133 ` 1668` ``` by (metis basis_card_eq_dim) ``` huffman@44133 ` 1669` huffman@44133 ` 1670` ```text {* More lemmas about dimension. *} ``` huffman@44133 ` 1671` huffman@44133 ` 1672` ```lemma dim_UNIV: "dim (UNIV :: ('a::euclidean_space) set) = DIM('a)" ``` huffman@44133 ` 1673` ``` apply (rule dim_unique[of "(basis::nat=>'a) ` {.. T \ dim S \ dim T" ``` huffman@44133 ` 1679` ``` using basis_exists[of T] basis_exists[of S] ``` huffman@44133 ` 1680` ``` by (metis independent_card_le_dim subset_trans) ``` huffman@44133 ` 1681` huffman@44133 ` 1682` ```lemma dim_subset_UNIV: "dim (S:: ('a::euclidean_space) set) \ DIM('a)" ``` huffman@44133 ` 1683` ``` by (metis dim_subset subset_UNIV dim_UNIV) ``` huffman@44133 ` 1684` huffman@44133 ` 1685` ```text {* Converses to those. *} ``` huffman@44133 ` 1686` huffman@44133 ` 1687` ```lemma card_ge_dim_independent: ``` wenzelm@49522 ` 1688` ``` assumes BV:"(B::('a::euclidean_space) set) \ V" ``` wenzelm@49522 ` 1689` ``` and iB:"independent B" and dVB:"dim V \ card B" ``` huffman@44133 ` 1690` ``` shows "V \ span B" ``` wenzelm@49522 ` 1691` ```proof - ``` wenzelm@49522 ` 1692` ``` { fix a assume aV: "a \ V" ``` wenzelm@49522 ` 1693` ``` { assume aB: "a \ span B" ``` huffman@44133 ` 1694` ``` then have iaB: "independent (insert a B)" using iB aV BV by (simp add: independent_insert) ``` huffman@44133 ` 1695` ``` from aV BV have th0: "insert a B \ V" by blast ``` huffman@44133 ` 1696` ``` from aB have "a \B" by (auto simp add: span_superset) ``` huffman@44133 ` 1697` ``` with independent_card_le_dim[OF th0 iaB] dVB independent_bound[OF iB] have False by auto } ``` wenzelm@49522 ` 1698` ``` then have "a \ span B" by blast } ``` huffman@44133 ` 1699` ``` then show ?thesis by blast ``` huffman@44133 ` 1700` ```qed ``` huffman@44133 ` 1701` huffman@44133 ` 1702` ```lemma card_le_dim_spanning: ``` wenzelm@49663 ` 1703` ``` assumes BV: "(B:: ('a::euclidean_space) set) \ V" ``` wenzelm@49663 ` 1704` ``` and VB: "V \ span B" ``` wenzelm@49663 ` 1705` ``` and fB: "finite B" ``` wenzelm@49663 ` 1706` ``` and dVB: "dim V \ card B" ``` huffman@44133 ` 1707` ``` shows "independent B" ``` wenzelm@49522 ` 1708` ```proof - ``` wenzelm@49522 ` 1709` ``` { fix a assume a: "a \ B" "a \ span (B -{a})" ``` huffman@44133 ` 1710` ``` from a fB have c0: "card B \ 0" by auto ``` huffman@44133 ` 1711` ``` from a fB have cb: "card (B -{a}) = card B - 1" by auto ``` huffman@44133 ` 1712` ``` from BV a have th0: "B -{a} \ V" by blast ``` wenzelm@49522 ` 1713` ``` { fix x assume x: "x \ V" ``` huffman@44133 ` 1714` ``` from a have eq: "insert a (B -{a}) = B" by blast ``` huffman@44133 ` 1715` ``` from x VB have x': "x \ span B" by blast ``` huffman@44133 ` 1716` ``` from span_trans[OF a(2), unfolded eq, OF x'] ``` huffman@44133 ` 1717` ``` have "x \ span (B -{a})" . } ``` huffman@44133 ` 1718` ``` then have th1: "V \ span (B -{a})" by blast ``` huffman@44133 ` 1719` ``` have th2: "finite (B -{a})" using fB by auto ``` huffman@44133 ` 1720` ``` from span_card_ge_dim[OF th0 th1 th2] ``` huffman@44133 ` 1721` ``` have c: "dim V \ card (B -{a})" . ``` wenzelm@49522 ` 1722` ``` from c c0 dVB cb have False by simp } ``` huffman@44133 ` 1723` ``` then show ?thesis unfolding dependent_def by blast ``` huffman@44133 ` 1724` ```qed ``` huffman@44133 ` 1725` wenzelm@49522 ` 1726` ```lemma card_eq_dim: "(B:: ('a::euclidean_space) set) \ V \ ``` wenzelm@49522 ` 1727` ``` card B = dim V \ finite B \ independent B \ V \ span B" ``` wenzelm@49522 ` 1728` ``` by (metis order_eq_iff card_le_dim_spanning card_ge_dim_independent) ``` huffman@44133 ` 1729` huffman@44133 ` 1730` ```text {* More general size bound lemmas. *} ``` huffman@44133 ` 1731` huffman@44133 ` 1732` ```lemma independent_bound_general: ``` huffman@44133 ` 1733` ``` "independent (S:: ('a::euclidean_space) set) \ finite S \ card S \ dim S" ``` huffman@44133 ` 1734` ``` by (metis independent_card_le_dim independent_bound subset_refl) ``` huffman@44133 ` 1735` wenzelm@49522 ` 1736` ```lemma dependent_biggerset_general: ``` wenzelm@49522 ` 1737` ``` "(finite (S:: ('a::euclidean_space) set) \ card S > dim S) \ dependent S" ``` huffman@44133 ` 1738` ``` using independent_bound_general[of S] by (metis linorder_not_le) ``` huffman@44133 ` 1739` huffman@44133 ` 1740` ```lemma dim_span: "dim (span (S:: ('a::euclidean_space) set)) = dim S" ``` wenzelm@49522 ` 1741` ```proof - ``` huffman@44133 ` 1742` ``` have th0: "dim S \ dim (span S)" ``` huffman@44133 ` 1743` ``` by (auto simp add: subset_eq intro: dim_subset span_superset) ``` huffman@44133 ` 1744` ``` from basis_exists[of S] ``` huffman@44133 ` 1745` ``` obtain B where B: "B \ S" "independent B" "S \ span B" "card B = dim S" by blast ``` huffman@44133 ` 1746` ``` from B have fB: "finite B" "card B = dim S" using independent_bound by blast+ ``` huffman@44133 ` 1747` ``` have bSS: "B \ span S" using B(1) by (metis subset_eq span_inc) ``` huffman@44133 ` 1748` ``` have sssB: "span S \ span B" using span_mono[OF B(3)] by (simp add: span_span) ``` huffman@44133 ` 1749` ``` from span_card_ge_dim[OF bSS sssB fB(1)] th0 show ?thesis ``` wenzelm@49522 ` 1750` ``` using fB(2) by arith ``` huffman@44133 ` 1751` ```qed ``` huffman@44133 ` 1752` huffman@44133 ` 1753` ```lemma subset_le_dim: "(S:: ('a::euclidean_space) set) \ span T \ dim S \ dim T" ``` huffman@44133 ` 1754` ``` by (metis dim_span dim_subset) ``` huffman@44133 ` 1755` huffman@44133 ` 1756` ```lemma span_eq_dim: "span (S:: ('a::euclidean_space) set) = span T ==> dim S = dim T" ``` huffman@44133 ` 1757` ``` by (metis dim_span) ``` huffman@44133 ` 1758` huffman@44133 ` 1759` ```lemma spans_image: ``` wenzelm@49663 ` 1760` ``` assumes lf: "linear f" ``` wenzelm@49663 ` 1761` ``` and VB: "V \ span B" ``` huffman@44133 ` 1762` ``` shows "f ` V \ span (f ` B)" ``` wenzelm@49522 ` 1763` ``` unfolding span_linear_image[OF lf] by (metis VB image_mono) ``` huffman@44133 ` 1764` huffman@44133 ` 1765` ```lemma dim_image_le: ``` huffman@44133 ` 1766` ``` fixes f :: "'a::euclidean_space \ 'b::euclidean_space" ``` wenzelm@49663 ` 1767` ``` assumes lf: "linear f" ``` wenzelm@49663 ` 1768` ``` shows "dim (f ` S) \ dim (S)" ``` wenzelm@49522 ` 1769` ```proof - ``` huffman@44133 ` 1770` ``` from basis_exists[of S] obtain B where ``` huffman@44133 ` 1771` ``` B: "B \ S" "independent B" "S \ span B" "card B = dim S" by blast ``` huffman@44133 ` 1772` ``` from B have fB: "finite B" "card B = dim S" using independent_bound by blast+ ``` huffman@44133 ` 1773` ``` have "dim (f ` S) \ card (f ` B)" ``` huffman@44133 ` 1774` ``` apply (rule span_card_ge_dim) ``` wenzelm@49522 ` 1775` ``` using lf B fB apply (auto simp add: span_linear_image spans_image subset_image_iff) ``` wenzelm@49522 ` 1776` ``` done ``` huffman@44133 ` 1777` ``` also have "\ \ dim S" using card_image_le[OF fB(1)] fB by simp ``` huffman@44133 ` 1778` ``` finally show ?thesis . ``` huffman@44133 ` 1779` ```qed ``` huffman@44133 ` 1780` huffman@44133 ` 1781` ```text {* Relation between bases and injectivity/surjectivity of map. *} ``` huffman@44133 ` 1782` huffman@44133 ` 1783` ```lemma spanning_surjective_image: ``` huffman@44133 ` 1784` ``` assumes us: "UNIV \ span S" ``` wenzelm@49522 ` 1785` ``` and lf: "linear f" and sf: "surj f" ``` huffman@44133 ` 1786` ``` shows "UNIV \ span (f ` S)" ``` wenzelm@49663 ` 1787` ```proof - ``` huffman@44133 ` 1788` ``` have "UNIV \ f ` UNIV" using sf by (auto simp add: surj_def) ``` huffman@44133 ` 1789` ``` also have " \ \ span (f ` S)" using spans_image[OF lf us] . ``` huffman@44133 ` 1790` ```finally show ?thesis . ``` huffman@44133 ` 1791` ```qed ``` huffman@44133 ` 1792` huffman@44133 ` 1793` ```lemma independent_injective_image: ``` wenzelm@49663 ` 1794` ``` assumes iS: "independent S" ``` wenzelm@49663 ` 1795` ``` and lf: "linear f" ``` wenzelm@49663 ` 1796` ``` and fi: "inj f" ``` huffman@44133 ` 1797` ``` shows "independent (f ` S)" ``` wenzelm@49663 ` 1798` ```proof - ``` wenzelm@49663 ` 1799` ``` { fix a ``` wenzelm@49663 ` 1800` ``` assume a: "a \ S" "f a \ span (f ` S - {f a})" ``` huffman@44133 ` 1801` ``` have eq: "f ` S - {f a} = f ` (S - {a})" using fi ``` huffman@44133 ` 1802` ``` by (auto simp add: inj_on_def) ``` huffman@44133 ` 1803` ``` from a have "f a \ f ` span (S -{a})" ``` huffman@44133 ` 1804` ``` unfolding eq span_linear_image[OF lf, of "S - {a}"] by blast ``` wenzelm@49522 ` 1805` ``` then have "a \ span (S -{a})" using fi by (auto simp add: inj_on_def) ``` huffman@44133 ` 1806` ``` with a(1) iS have False by (simp add: dependent_def) } ``` huffman@44133 ` 1807` ``` then show ?thesis unfolding dependent_def by blast ``` huffman@44133 ` 1808` ```qed ``` huffman@44133 ` 1809` huffman@44133 ` 1810` ```text {* Picking an orthogonal replacement for a spanning set. *} ``` huffman@44133 ` 1811` huffman@44133 ` 1812` ``` (* FIXME : Move to some general theory ?*) ``` huffman@44133 ` 1813` ```definition "pairwise R S \ (\x \ S. \y\ S. x\y \ R x y)" ``` huffman@44133 ` 1814` huffman@44133 ` 1815` ```lemma vector_sub_project_orthogonal: "(b::'a::euclidean_space) \ (x - ((b \ x) / (b \ b)) *\<^sub>R b) = 0" ``` huffman@44133 ` 1816` ``` unfolding inner_simps by auto ``` huffman@44133 ` 1817` huffman@44528 ` 1818` ```lemma pairwise_orthogonal_insert: ``` huffman@44528 ` 1819` ``` assumes "pairwise orthogonal S" ``` wenzelm@49522 ` 1820` ``` and "\y. y \ S \ orthogonal x y" ``` huffman@44528 ` 1821` ``` shows "pairwise orthogonal (insert x S)" ``` huffman@44528 ` 1822` ``` using assms unfolding pairwise_def ``` huffman@44528 ` 1823` ``` by (auto simp add: orthogonal_commute) ``` huffman@44528 ` 1824` huffman@44133 ` 1825` ```lemma basis_orthogonal: ``` huffman@44528 ` 1826` ``` fixes B :: "('a::real_inner) set" ``` huffman@44133 ` 1827` ``` assumes fB: "finite B" ``` huffman@44133 ` 1828` ``` shows "\C. finite C \ card C \ card B \ span C = span B \ pairwise orthogonal C" ``` huffman@44133 ` 1829` ``` (is " \C. ?P B C") ``` wenzelm@49522 ` 1830` ``` using fB ``` wenzelm@49522 ` 1831` ```proof (induct rule: finite_induct) ``` wenzelm@49522 ` 1832` ``` case empty ``` wenzelm@49522 ` 1833` ``` then show ?case apply (rule exI[where x="{}"]) by (auto simp add: pairwise_def) ``` huffman@44133 ` 1834` ```next ``` wenzelm@49522 ` 1835` ``` case (insert a B) ``` huffman@44133 ` 1836` ``` note fB = `finite B` and aB = `a \ B` ``` huffman@44133 ` 1837` ``` from `\C. finite C \ card C \ card B \ span C = span B \ pairwise orthogonal C` ``` huffman@44133 ` 1838` ``` obtain C where C: "finite C" "card C \ card B" ``` huffman@44133 ` 1839` ``` "span C = span B" "pairwise orthogonal C" by blast ``` huffman@44133 ` 1840` ``` let ?a = "a - setsum (\x. (x \ a / (x \ x)) *\<^sub>R x) C" ``` huffman@44133 ` 1841` ``` let ?C = "insert ?a C" ``` huffman@44133 ` 1842` ``` from C(1) have fC: "finite ?C" by simp ``` wenzelm@49522 ` 1843` ``` from fB aB C(1,2) have cC: "card ?C \ card (insert a B)" ``` wenzelm@49522 ` 1844` ``` by (simp add: card_insert_if) ``` wenzelm@49522 ` 1845` ``` { fix x k ``` wenzelm@49522 ` 1846` ``` have th0: "\(a::'a) b c. a - (b - c) = c + (a - b)" ``` wenzelm@49522 ` 1847` ``` by (simp add: field_simps) ``` huffman@44133 ` 1848` ``` have "x - k *\<^sub>R (a - (\x\C. (x \ a / (x \ x)) *\<^sub>R x)) \ span C \ x - k *\<^sub>R a \ span C" ``` huffman@44133 ` 1849` ``` apply (simp only: scaleR_right_diff_distrib th0) ``` huffman@44133 ` 1850` ``` apply (rule span_add_eq) ``` huffman@44133 ` 1851` ``` apply (rule span_mul) ``` huffman@44133 ` 1852` ``` apply (rule span_setsum[OF C(1)]) ``` huffman@44133 ` 1853` ``` apply clarify ``` huffman@44133 ` 1854` ``` apply (rule span_mul) ``` wenzelm@49522 ` 1855` ``` apply (rule span_superset) ``` wenzelm@49522 ` 1856` ``` apply assumption ``` wenzelm@49522 ` 1857` ``` done } ``` huffman@44133 ` 1858` ``` then have SC: "span ?C = span (insert a B)" ``` huffman@44133 ` 1859` ``` unfolding set_eq_iff span_breakdown_eq C(3)[symmetric] by auto ``` huffman@44528 ` 1860` ``` { fix y assume yC: "y \ C" ``` wenzelm@49522 ` 1861` ``` then have Cy: "C = insert y (C - {y})" by blast ``` huffman@44528 ` 1862` ``` have fth: "finite (C - {y})" using C by simp ``` huffman@44528 ` 1863` ``` have "orthogonal ?a y" ``` huffman@44528 ` 1864` ``` unfolding orthogonal_def ``` huffman@44528 ` 1865` ``` unfolding inner_diff inner_setsum_left diff_eq_0_iff_eq ``` huffman@44528 ` 1866` ``` unfolding setsum_diff1' [OF `finite C` `y \ C`] ``` huffman@44528 ` 1867` ``` apply (clarsimp simp add: inner_commute[of y a]) ``` huffman@44528 ` 1868` ``` apply (rule setsum_0') ``` huffman@44528 ` 1869` ``` apply clarsimp ``` huffman@44528 ` 1870` ``` apply (rule C(4)[unfolded pairwise_def orthogonal_def, rule_format]) ``` huffman@44528 ` 1871` ``` using `y \ C` by auto } ``` huffman@44528 ` 1872` ``` with `pairwise orthogonal C` have CPO: "pairwise orthogonal ?C" ``` huffman@44528 ` 1873` ``` by (rule pairwise_orthogonal_insert) ``` huffman@44133 ` 1874` ``` from fC cC SC CPO have "?P (insert a B) ?C" by blast ``` huffman@44133 ` 1875` ``` then show ?case by blast ``` huffman@44133 ` 1876` ```qed ``` huffman@44133 ` 1877` huffman@44133 ` 1878` ```lemma orthogonal_basis_exists: ``` huffman@44133 ` 1879` ``` fixes V :: "('a::euclidean_space) set" ``` huffman@44133 ` 1880` ``` shows "\B. independent B \ B \ span V \ V \ span B \ (card B = dim V) \ pairwise orthogonal B" ``` wenzelm@49663 ` 1881` ```proof - ``` wenzelm@49522 ` 1882` ``` from basis_exists[of V] obtain B where ``` wenzelm@49522 ` 1883` ``` B: "B \ V" "independent B" "V \ span B" "card B = dim V" by blast ``` huffman@44133 ` 1884` ``` from B have fB: "finite B" "card B = dim V" using independent_bound by auto ``` huffman@44133 ` 1885` ``` from basis_orthogonal[OF fB(1)] obtain C where ``` huffman@44133 ` 1886` ``` C: "finite C" "card C \ card B" "span C = span B" "pairwise orthogonal C" by blast ``` wenzelm@49522 ` 1887` ``` from C B have CSV: "C \ span V" by (metis span_inc span_mono subset_trans) ``` huffman@44133 ` 1888` ``` from span_mono[OF B(3)] C have SVC: "span V \ span C" by (simp add: span_span) ``` huffman@44133 ` 1889` ``` from card_le_dim_spanning[OF CSV SVC C(1)] C(2,3) fB ``` huffman@44133 ` 1890` ``` have iC: "independent C" by (simp add: dim_span) ``` huffman@44133 ` 1891` ``` from C fB have "card C \ dim V" by simp ``` huffman@44133 ` 1892` ``` moreover have "dim V \ card C" using span_card_ge_dim[OF CSV SVC C(1)] ``` huffman@44133 ` 1893` ``` by (simp add: dim_span) ``` huffman@44133 ` 1894` ``` ultimately have CdV: "card C = dim V" using C(1) by simp ``` huffman@44133 ` 1895` ``` from C B CSV CdV iC show ?thesis by auto ``` huffman@44133 ` 1896` ```qed ``` huffman@44133 ` 1897` huffman@44133 ` 1898` ```lemma span_eq: "span S = span T \ S \ span T \ T \ span S" ``` huffman@44133 ` 1899` ``` using span_inc[unfolded subset_eq] using span_mono[of T "span S"] span_mono[of S "span T"] ``` wenzelm@49522 ` 1900` ``` by (auto simp add: span_span) ``` huffman@44133 ` 1901` huffman@44133 ` 1902` ```text {* Low-dimensional subset is in a hyperplane (weak orthogonal complement). *} ``` huffman@44133 ` 1903` wenzelm@49522 ` 1904` ```lemma span_not_univ_orthogonal: ``` wenzelm@49522 ` 1905` ``` fixes S::"('a::euclidean_space) set" ``` huffman@44133 ` 1906` ``` assumes sU: "span S \ UNIV" ``` huffman@44133 ` 1907` ``` shows "\(a::'a). a \0 \ (\x \ span S. a \ x = 0)" ``` wenzelm@49522 ` 1908` ```proof - ``` huffman@44133 ` 1909` ``` from sU obtain a where a: "a \ span S" by blast ``` huffman@44133 ` 1910` ``` from orthogonal_basis_exists obtain B where ``` huffman@44133 ` 1911` ``` B: "independent B" "B \ span S" "S \ span B" "card B = dim S" "pairwise orthogonal B" ``` huffman@44133 ` 1912` ``` by blast ``` huffman@44133 ` 1913` ``` from B have fB: "finite B" "card B = dim S" using independent_bound by auto ``` huffman@44133 ` 1914` ``` from span_mono[OF B(2)] span_mono[OF B(3)] ``` huffman@44133 ` 1915` ``` have sSB: "span S = span B" by (simp add: span_span) ``` huffman@44133 ` 1916` ``` let ?a = "a - setsum (\b. (a \ b / (b \ b)) *\<^sub>R b) B" ``` huffman@44133 ` 1917` ``` have "setsum (\b. (a \ b / (b \ b)) *\<^sub>R b) B \ span S" ``` huffman@44133 ` 1918` ``` unfolding sSB ``` huffman@44133 ` 1919` ``` apply (rule span_setsum[OF fB(1)]) ``` huffman@44133 ` 1920` ``` apply clarsimp ``` huffman@44133 ` 1921` ``` apply (rule span_mul) ``` wenzelm@49522 ` 1922` ``` apply (rule span_superset) ``` wenzelm@49522 ` 1923` ``` apply assumption ``` wenzelm@49522 ` 1924` ``` done ``` huffman@44133 ` 1925` ``` with a have a0:"?a \ 0" by auto ``` huffman@44133 ` 1926` ``` have "\x\span B. ?a \ x = 0" ``` wenzelm@49522 ` 1927` ``` proof (rule span_induct') ``` wenzelm@49522 ` 1928` ``` show "subspace {x. ?a \ x = 0}" ``` wenzelm@49522 ` 1929` ``` by (auto simp add: subspace_def inner_add) ``` wenzelm@49522 ` 1930` ``` next ``` wenzelm@49522 ` 1931` ``` { fix x assume x: "x \ B" ``` huffman@44133 ` 1932` ``` from x have B': "B = insert x (B - {x})" by blast ``` huffman@44133 ` 1933` ``` have fth: "finite (B - {x})" using fB by simp ``` huffman@44133 ` 1934` ``` have "?a \ x = 0" ``` huffman@44133 ` 1935` ``` apply (subst B') using fB fth ``` huffman@44133 ` 1936` ``` unfolding setsum_clauses(2)[OF fth] ``` huffman@44133 ` 1937` ``` apply simp unfolding inner_simps ``` huffman@44527 ` 1938` ``` apply (clarsimp simp add: inner_add inner_setsum_left) ``` huffman@44133 ` 1939` ``` apply (rule setsum_0', rule ballI) ``` huffman@44133 ` 1940` ``` unfolding inner_commute ``` wenzelm@49711 ` 1941` ``` apply (auto simp add: x field_simps ``` wenzelm@49711 ` 1942` ``` intro: B(5)[unfolded pairwise_def orthogonal_def, rule_format]) ``` wenzelm@49522 ` 1943` ``` done } ``` huffman@44133 ` 1944` ``` then show "\x \ B. ?a \ x = 0" by blast ``` huffman@44133 ` 1945` ``` qed ``` huffman@44133 ` 1946` ``` with a0 show ?thesis unfolding sSB by (auto intro: exI[where x="?a"]) ``` huffman@44133 ` 1947` ```qed ``` huffman@44133 ` 1948` huffman@44133 ` 1949` ```lemma span_not_univ_subset_hyperplane: ``` huffman@44133 ` 1950` ``` assumes SU: "span S \ (UNIV ::('a::euclidean_space) set)" ``` huffman@44133 ` 1951` ``` shows "\ a. a \0 \ span S \ {x. a \ x = 0}" ``` huffman@44133 ` 1952` ``` using span_not_univ_orthogonal[OF SU] by auto ``` huffman@44133 ` 1953` wenzelm@49663 ` 1954` ```lemma lowdim_subset_hyperplane: ``` wenzelm@49663 ` 1955` ``` fixes S::"('a::euclidean_space) set" ``` huffman@44133 ` 1956` ``` assumes d: "dim S < DIM('a)" ``` huffman@44133 ` 1957` ``` shows "\(a::'a). a \ 0 \ span S \ {x. a \ x = 0}" ``` wenzelm@49522 ` 1958` ```proof - ``` wenzelm@49522 ` 1959` ``` { assume "span S = UNIV" ``` wenzelm@49522 ` 1960` ``` then have "dim (span S) = dim (UNIV :: ('a) set)" by simp ``` wenzelm@49522 ` 1961` ``` then have "dim S = DIM('a)" by (simp add: dim_span dim_UNIV) ``` wenzelm@49522 ` 1962` ``` with d have False by arith } ``` wenzelm@49652 ` 1963` ``` then have th: "span S \ UNIV" by blast ``` huffman@44133 ` 1964` ``` from span_not_univ_subset_hyperplane[OF th] show ?thesis . ``` huffman@44133 ` 1965` ```qed ``` huffman@44133 ` 1966` huffman@44133 ` 1967` ```text {* We can extend a linear basis-basis injection to the whole set. *} ``` huffman@44133 ` 1968` huffman@44133 ` 1969` ```lemma linear_indep_image_lemma: ``` wenzelm@49663 ` 1970` ``` assumes lf: "linear f" ``` wenzelm@49663 ` 1971` ``` and fB: "finite B" ``` wenzelm@49522 ` 1972` ``` and ifB: "independent (f ` B)" ``` wenzelm@49663 ` 1973` ``` and fi: "inj_on f B" ``` wenzelm@49663 ` 1974` ``` and xsB: "x \ span B" ``` wenzelm@49522 ` 1975` ``` and fx: "f x = 0" ``` huffman@44133 ` 1976` ``` shows "x = 0" ``` huffman@44133 ` 1977` ``` using fB ifB fi xsB fx ``` wenzelm@49522 ` 1978` ```proof (induct arbitrary: x rule: finite_induct[OF fB]) ``` wenzelm@49663 ` 1979` ``` case 1 ``` wenzelm@49663 ` 1980` ``` then show ?case by auto ``` huffman@44133 ` 1981` ```next ``` huffman@44133 ` 1982` ``` case (2 a b x) ``` huffman@44133 ` 1983` ``` have fb: "finite b" using "2.prems" by simp ``` huffman@44133 ` 1984` ``` have th0: "f ` b \ f ` (insert a b)" ``` huffman@44133 ` 1985` ``` apply (rule image_mono) by blast ``` huffman@44133 ` 1986` ``` from independent_mono[ OF "2.prems"(2) th0] ``` huffman@44133 ` 1987` ``` have ifb: "independent (f ` b)" . ``` huffman@44133 ` 1988` ``` have fib: "inj_on f b" ``` huffman@44133 ` 1989` ``` apply (rule subset_inj_on [OF "2.prems"(3)]) ``` wenzelm@49522 ` 1990` ``` apply blast ``` wenzelm@49522 ` 1991` ``` done ``` huffman@44133 ` 1992` ``` from span_breakdown[of a "insert a b", simplified, OF "2.prems"(4)] ``` huffman@44133 ` 1993` ``` obtain k where k: "x - k*\<^sub>R a \ span (b -{a})" by blast ``` huffman@44133 ` 1994` ``` have "f (x - k*\<^sub>R a) \ span (f ` b)" ``` huffman@44133 ` 1995` ``` unfolding span_linear_image[OF lf] ``` huffman@44133 ` 1996` ``` apply (rule imageI) ``` wenzelm@49522 ` 1997` ``` using k span_mono[of "b-{a}" b] apply blast ``` wenzelm@49522 ` 1998` ``` done ``` wenzelm@49522 ` 1999` ``` then have "f x - k*\<^sub>R f a \ span (f ` b)" ``` huffman@44133 ` 2000` ``` by (simp add: linear_sub[OF lf] linear_cmul[OF lf]) ``` wenzelm@49522 ` 2001` ``` then have th: "-k *\<^sub>R f a \ span (f ` b)" ``` huffman@44133 ` 2002` ``` using "2.prems"(5) by simp ``` wenzelm@49522 ` 2003` ``` { assume k0: "k = 0" ``` huffman@44133 ` 2004` ``` from k0 k have "x \ span (b -{a})" by simp ``` huffman@44133 ` 2005` ``` then have "x \ span b" using span_mono[of "b-{a}" b] ``` wenzelm@49522 ` 2006` ``` by blast } ``` huffman@44133 ` 2007` ``` moreover ``` wenzelm@49522 ` 2008` ``` { assume k0: "k \ 0" ``` huffman@44133 ` 2009` ``` from span_mul[OF th, of "- 1/ k"] k0 ``` huffman@44133 ` 2010` ``` have th1: "f a \ span (f ` b)" ``` huffman@44133 ` 2011` ``` by auto ``` huffman@44133 ` 2012` ``` from inj_on_image_set_diff[OF "2.prems"(3), of "insert a b " "{a}", symmetric] ``` huffman@44133 ` 2013` ``` have tha: "f ` insert a b - f ` {a} = f ` (insert a b - {a})" by blast ``` huffman@44133 ` 2014` ``` from "2.prems"(2) [unfolded dependent_def bex_simps(8), rule_format, of "f a"] ``` huffman@44133 ` 2015` ``` have "f a \ span (f ` b)" using tha ``` huffman@44133 ` 2016` ``` using "2.hyps"(2) ``` huffman@44133 ` 2017` ``` "2.prems"(3) by auto ``` huffman@44133 ` 2018` ``` with th1 have False by blast ``` wenzelm@49522 ` 2019` ``` then have "x \ span b" by blast } ``` huffman@44133 ` 2020` ``` ultimately have xsb: "x \ span b" by blast ``` huffman@44133 ` 2021` ``` from "2.hyps"(3)[OF fb ifb fib xsb "2.prems"(5)] ``` huffman@44133 ` 2022` ``` show "x = 0" . ``` huffman@44133 ` 2023` ```qed ``` huffman@44133 ` 2024` huffman@44133 ` 2025` ```text {* We can extend a linear mapping from basis. *} ``` huffman@44133 ` 2026` huffman@44133 ` 2027` ```lemma linear_independent_extend_lemma: ``` huffman@44133 ` 2028` ``` fixes f :: "'a::real_vector \ 'b::real_vector" ``` huffman@44133 ` 2029` ``` assumes fi: "finite B" and ib: "independent B" ``` huffman@44133 ` 2030` ``` shows "\g. (\x\ span B. \y\ span B. g (x + y) = g x + g y) ``` huffman@44133 ` 2031` ``` \ (\x\ span B. \c. g (c*\<^sub>R x) = c *\<^sub>R g x) ``` huffman@44133 ` 2032` ``` \ (\x\ B. g x = f x)" ``` wenzelm@49663 ` 2033` ``` using ib fi ``` wenzelm@49522 ` 2034` ```proof (induct rule: finite_induct[OF fi]) ``` wenzelm@49663 ` 2035` ``` case 1 ``` wenzelm@49663 ` 2036` ``` then show ?case by auto ``` huffman@44133 ` 2037` ```next ``` huffman@44133 ` 2038` ``` case (2 a b) ``` huffman@44133 ` 2039` ``` from "2.prems" "2.hyps" have ibf: "independent b" "finite b" ``` huffman@44133 ` 2040` ``` by (simp_all add: independent_insert) ``` huffman@44133 ` 2041` ``` from "2.hyps"(3)[OF ibf] obtain g where ``` huffman@44133 ` 2042` ``` g: "\x\span b. \y\span b. g (x + y) = g x + g y" ``` huffman@44133 ` 2043` ``` "\x\span b. \c. g (c *\<^sub>R x) = c *\<^sub>R g x" "\x\b. g x = f x" by blast ``` huffman@44133 ` 2044` ``` let ?h = "\z. SOME k. (z - k *\<^sub>R a) \ span b" ``` wenzelm@49522 ` 2045` ``` { fix z assume z: "z \ span (insert a b)" ``` huffman@44133 ` 2046` ``` have th0: "z - ?h z *\<^sub>R a \ span b" ``` huffman@44133 ` 2047` ``` apply (rule someI_ex) ``` huffman@44133 ` 2048` ``` unfolding span_breakdown_eq[symmetric] ``` huffman@44133 ` 2049` ``` using z . ``` wenzelm@49522 ` 2050` ``` { fix k assume k: "z - k *\<^sub>R a \ span b" ``` huffman@44133 ` 2051` ``` have eq: "z - ?h z *\<^sub>R a - (z - k*\<^sub>R a) = (k - ?h z) *\<^sub>R a" ``` huffman@44133 ` 2052` ``` by (simp add: field_simps scaleR_left_distrib [symmetric]) ``` huffman@44133 ` 2053` ``` from span_sub[OF th0 k] ``` huffman@44133 ` 2054` ``` have khz: "(k - ?h z) *\<^sub>R a \ span b" by (simp add: eq) ``` wenzelm@49652 ` 2055` ``` { assume "k \ ?h z" then have k0: "k - ?h z \ 0" by simp ``` huffman@44133 ` 2056` ``` from k0 span_mul[OF khz, of "1 /(k - ?h z)"] ``` huffman@44133 ` 2057` ``` have "a \ span b" by simp ``` huffman@44133 ` 2058` ``` with "2.prems"(1) "2.hyps"(2) have False ``` huffman@44133 ` 2059` ``` by (auto simp add: dependent_def)} ``` huffman@44133 ` 2060` ``` then have "k = ?h z" by blast} ``` huffman@44133 ` 2061` ``` with th0 have "z - ?h z *\<^sub>R a \ span b \ (\k. z - k *\<^sub>R a \ span b \ k = ?h z)" by blast} ``` huffman@44133 ` 2062` ``` note h = this ``` huffman@44133 ` 2063` ``` let ?g = "\z. ?h z *\<^sub>R f a + g (z - ?h z *\<^sub>R a)" ``` wenzelm@49522 ` 2064` ``` { fix x y assume x: "x \ span (insert a b)" and y: "y \ span (insert a b)" ``` huffman@44133 ` 2065` ``` have tha: "\(x::'a) y a k l. (x + y) - (k + l) *\<^sub>R a = (x - k *\<^sub>R a) + (y - l *\<^sub>R a)" ``` huffman@44133 ` 2066` ``` by (simp add: algebra_simps) ``` huffman@44133 ` 2067` ``` have addh: "?h (x + y) = ?h x + ?h y" ``` huffman@44133 ` 2068` ``` apply (rule conjunct2[OF h, rule_format, symmetric]) ``` huffman@44133 ` 2069` ``` apply (rule span_add[OF x y]) ``` huffman@44133 ` 2070` ``` unfolding tha ``` huffman@44133 ` 2071` ``` by (metis span_add x y conjunct1[OF h, rule_format]) ``` huffman@44133 ` 2072` ``` have "?g (x + y) = ?g x + ?g y" ``` huffman@44133 ` 2073` ``` unfolding addh tha ``` huffman@44133 ` 2074` ``` g(1)[rule_format,OF conjunct1[OF h, OF x] conjunct1[OF h, OF y]] ``` huffman@44133 ` 2075` ``` by (simp add: scaleR_left_distrib)} ``` huffman@44133 ` 2076` ``` moreover ``` wenzelm@49522 ` 2077` ``` { fix x:: "'a" and c:: real ``` wenzelm@49522 ` 2078` ``` assume x: "x \ span (insert a b)" ``` huffman@44133 ` 2079` ``` have tha: "\(x::'a) c k a. c *\<^sub>R x - (c * k) *\<^sub>R a = c *\<^sub>R (x - k *\<^sub>R a)" ``` huffman@44133 ` 2080` ``` by (simp add: algebra_simps) ``` huffman@44133 ` 2081` ``` have hc: "?h (c *\<^sub>R x) = c * ?h x" ``` huffman@44133 ` 2082` ``` apply (rule conjunct2[OF h, rule_format, symmetric]) ``` huffman@44133 ` 2083` ``` apply (metis span_mul x) ``` wenzelm@49522 ` 2084` ``` apply (metis tha span_mul x conjunct1[OF h]) ``` wenzelm@49522 ` 2085` ``` done ``` huffman@44133 ` 2086` ``` have "?g (c *\<^sub>R x) = c*\<^sub>R ?g x" ``` huffman@44133 ` 2087` ``` unfolding hc tha g(2)[rule_format, OF conjunct1[OF h, OF x]] ``` wenzelm@49522 ` 2088` ``` by (simp add: algebra_simps) } ``` huffman@44133 ` 2089` ``` moreover ``` wenzelm@49522 ` 2090` ``` { fix x assume x: "x \ (insert a b)" ``` wenzelm@49522 ` 2091` ``` { assume xa: "x = a" ``` huffman@44133 ` 2092` ``` have ha1: "1 = ?h a" ``` huffman@44133 ` 2093` ``` apply (rule conjunct2[OF h, rule_format]) ``` huffman@44133 ` 2094` ``` apply (metis span_superset insertI1) ``` huffman@44133 ` 2095` ``` using conjunct1[OF h, OF span_superset, OF insertI1] ``` wenzelm@49522 ` 2096` ``` apply (auto simp add: span_0) ``` wenzelm@49522 ` 2097` ``` done ``` huffman@44133 ` 2098` huffman@44133 ` 2099` ``` from xa ha1[symmetric] have "?g x = f x" ``` huffman@44133 ` 2100` ``` apply simp ``` huffman@44133 ` 2101` ``` using g(2)[rule_format, OF span_0, of 0] ``` wenzelm@49522 ` 2102` ``` apply simp ``` wenzelm@49522 ` 2103` ``` done } ``` huffman@44133 ` 2104` ``` moreover ``` wenzelm@49522 ` 2105` ``` { assume xb: "x \ b" ``` huffman@44133 ` 2106` ``` have h0: "0 = ?h x" ``` huffman@44133 ` 2107` ``` apply (rule conjunct2[OF h, rule_format]) ``` huffman@44133 ` 2108` ``` apply (metis span_superset x) ``` huffman@44133 ` 2109` ``` apply simp ``` huffman@44133 ` 2110` ``` apply (metis span_superset xb) ``` huffman@44133 ` 2111` ``` done ``` huffman@44133 ` 2112` ``` have "?g x = f x" ``` wenzelm@49522 ` 2113` ``` by (simp add: h0[symmetric] g(3)[rule_format, OF xb]) } ``` huffman@44133 ` 2114` ``` ultimately have "?g x = f x" using x by blast } ``` wenzelm@49663 ` 2115` ``` ultimately show ?case ``` wenzelm@49663 ` 2116` ``` apply - ``` wenzelm@49663 ` 2117` ``` apply (rule exI[where x="?g"]) ``` wenzelm@49663 ` 2118` ``` apply blast ``` wenzelm@49663 ` 2119` ``` done ``` huffman@44133 ` 2120` ```qed ``` huffman@44133 ` 2121` huffman@44133 ` 2122` ```lemma linear_independent_extend: ``` huffman@44133 ` 2123` ``` assumes iB: "independent (B:: ('a::euclidean_space) set)" ``` huffman@44133 ` 2124` ``` shows "\g. linear g \ (\x\B. g x = f x)" ``` wenzelm@49522 ` 2125` ```proof - ``` huffman@44133 ` 2126` ``` from maximal_independent_subset_extend[of B UNIV] iB ``` huffman@44133 ` 2127` ``` obtain C where C: "B \ C" "independent C" "\x. x \ span C" by auto ``` huffman@44133 ` 2128` huffman@44133 ` 2129` ``` from C(2) independent_bound[of C] linear_independent_extend_lemma[of C f] ``` huffman@44133 ` 2130` ``` obtain g where g: "(\x\ span C. \y\ span C. g (x + y) = g x + g y) ``` huffman@44133 ` 2131` ``` \ (\x\ span C. \c. g (c*\<^sub>R x) = c *\<^sub>R g x) ``` huffman@44133 ` 2132` ``` \ (\x\ C. g x = f x)" by blast ``` huffman@44133 ` 2133` ``` from g show ?thesis unfolding linear_def using C ``` wenzelm@49663 ` 2134` ``` apply clarsimp ``` wenzelm@49663 ` 2135` ``` apply blast ``` wenzelm@49663 ` 2136` ``` done ``` huffman@44133 ` 2137` ```qed ``` huffman@44133 ` 2138` huffman@44133 ` 2139` ```text {* Can construct an isomorphism between spaces of same dimension. *} ``` huffman@44133 ` 2140` wenzelm@49522 ` 2141` ```lemma card_le_inj: ``` wenzelm@49663 ` 2142` ``` assumes fA: "finite A" ``` wenzelm@49663 ` 2143` ``` and fB: "finite B" ``` wenzelm@49522 ` 2144` ``` and c: "card A \ card B" ``` wenzelm@49663 ` 2145` ``` shows "\f. f ` A \ B \ inj_on f A" ``` wenzelm@49522 ` 2146` ``` using fA fB c ``` wenzelm@49522 ` 2147` ```proof (induct arbitrary: B rule: finite_induct) ``` wenzelm@49522 ` 2148` ``` case empty ``` wenzelm@49522 ` 2149` ``` then show ?case by simp ``` huffman@44133 ` 2150` ```next ``` wenzelm@49522 ` 2151` ``` case (insert x s t) ``` wenzelm@49522 ` 2152` ``` then show ?case ``` wenzelm@49522 ` 2153` ``` proof (induct rule: finite_induct[OF "insert.prems"(1)]) ``` wenzelm@49522 ` 2154` ``` case 1 ``` wenzelm@49522 ` 2155` ``` then show ?case by simp ``` huffman@44133 ` 2156` ``` next ``` huffman@44133 ` 2157` ``` case (2 y t) ``` huffman@44133 ` 2158` ``` from "2.prems"(1,2,5) "2.hyps"(1,2) have cst:"card s \ card t" by simp ``` huffman@44133 ` 2159` ``` from "2.prems"(3) [OF "2.hyps"(1) cst] obtain f where ``` huffman@44133 ` 2160` ``` f: "f ` s \ t \ inj_on f s" by blast ``` huffman@44133 ` 2161` ``` from f "2.prems"(2) "2.hyps"(2) show ?case ``` huffman@44133 ` 2162` ``` apply - ``` huffman@44133 ` 2163` ``` apply (rule exI[where x = "\z. if z = x then y else f z"]) ``` wenzelm@49522 ` 2164` ``` apply (auto simp add: inj_on_def) ``` wenzelm@49522 ` 2165` ``` done ``` huffman@44133 ` 2166` ``` qed ``` huffman@44133 ` 2167` ```qed ``` huffman@44133 ` 2168` wenzelm@49522 ` 2169` ```lemma card_subset_eq: ``` wenzelm@49663 ` 2170` ``` assumes fB: "finite B" ``` wenzelm@49663 ` 2171` ``` and AB: "A \ B" ``` wenzelm@49663 ` 2172` ``` and c: "card A = card B" ``` huffman@44133 ` 2173` ``` shows "A = B" ``` wenzelm@49522 ` 2174` ```proof - ``` huffman@44133 ` 2175` ``` from fB AB have fA: "finite A" by (auto intro: finite_subset) ``` huffman@44133 ` 2176` ``` from fA fB have fBA: "finite (B - A)" by auto ``` huffman@44133 ` 2177` ``` have e: "A \ (B - A) = {}" by blast ``` huffman@44133 ` 2178` ``` have eq: "A \ (B - A) = B" using AB by blast ``` huffman@44133 ` 2179` ``` from card_Un_disjoint[OF fA fBA e, unfolded eq c] ``` huffman@44133 ` 2180` ``` have "card (B - A) = 0" by arith ``` wenzelm@49522 ` 2181` ``` then have "B - A = {}" unfolding card_eq_0_iff using fA fB by simp ``` huffman@44133 ` 2182` ``` with AB show "A = B" by blast ``` huffman@44133 ` 2183` ```qed ``` huffman@44133 ` 2184` huffman@44133 ` 2185` ```lemma subspace_isomorphism: ``` huffman@44133 ` 2186` ``` assumes s: "subspace (S:: ('a::euclidean_space) set)" ``` wenzelm@49522 ` 2187` ``` and t: "subspace (T :: ('b::euclidean_space) set)" ``` wenzelm@49522 ` 2188` ``` and d: "dim S = dim T" ``` huffman@44133 ` 2189` ``` shows "\f. linear f \ f ` S = T \ inj_on f S" ``` wenzelm@49522 ` 2190` ```proof - ``` huffman@44133 ` 2191` ``` from basis_exists[of S] independent_bound obtain B where ``` huffman@44133 ` 2192` ``` B: "B \ S" "independent B" "S \ span B" "card B = dim S" and fB: "finite B" by blast ``` huffman@44133 ` 2193` ``` from basis_exists[of T] independent_bound obtain C where ``` huffman@44133 ` 2194` ``` C: "C \ T" "independent C" "T \ span C" "card C = dim T" and fC: "finite C" by blast ``` huffman@44133 ` 2195` ``` from B(4) C(4) card_le_inj[of B C] d obtain f where ``` huffman@44133 ` 2196` ``` f: "f ` B \ C" "inj_on f B" using `finite B` `finite C` by auto ``` huffman@44133 ` 2197` ``` from linear_independent_extend[OF B(2)] obtain g where ``` huffman@44133 ` 2198` ``` g: "linear g" "\x\ B. g x = f x" by blast ``` huffman@44133 ` 2199` ``` from inj_on_iff_eq_card[OF fB, of f] f(2) ``` huffman@44133 ` 2200` ``` have "card (f ` B) = card B" by simp ``` huffman@44133 ` 2201` ``` with B(4) C(4) have ceq: "card (f ` B) = card C" using d ``` huffman@44133 ` 2202` ``` by simp ``` huffman@44133 ` 2203` ``` have "g ` B = f ` B" using g(2) ``` huffman@44133 ` 2204` ``` by (auto simp add: image_iff) ``` huffman@44133 ` 2205` ``` also have "\ = C" using card_subset_eq[OF fC f(1) ceq] . ``` huffman@44133 ` 2206` ``` finally have gBC: "g ` B = C" . ``` huffman@44133 ` 2207` ``` have gi: "inj_on g B" using f(2) g(2) ``` huffman@44133 ` 2208` ``` by (auto simp add: inj_on_def) ``` huffman@44133 ` 2209` ``` note g0 = linear_indep_image_lemma[OF g(1) fB, unfolded gBC, OF C(2) gi] ``` wenzelm@49522 ` 2210` ``` { fix x y assume x: "x \ S" and y: "y \ S" and gxy: "g x = g y" ``` huffman@44133 ` 2211` ``` from B(3) x y have x': "x \ span B" and y': "y \ span B" by blast+ ``` huffman@44133 ` 2212` ``` from gxy have th0: "g (x - y) = 0" by (simp add: linear_sub[OF g(1)]) ``` huffman@44133 ` 2213` ``` have th1: "x - y \ span B" using x' y' by (metis span_sub) ``` huffman@44133 ` 2214` ``` have "x=y" using g0[OF th1 th0] by simp } ``` huffman@44133 ` 2215` ``` then have giS: "inj_on g S" ``` huffman@44133 ` 2216` ``` unfolding inj_on_def by blast ``` huffman@44133 ` 2217` ``` from span_subspace[OF B(1,3) s] ``` huffman@44133 ` 2218` ``` have "g ` S = span (g ` B)" by (simp add: span_linear_image[OF g(1)]) ``` huffman@44133 ` 2219` ``` also have "\ = span C" unfolding gBC .. ``` huffman@44133 ` 2220` ``` also have "\ = T" using span_subspace[OF C(1,3) t] . ``` huffman@44133 ` 2221` ``` finally have gS: "g ` S = T" . ``` huffman@44133 ` 2222` ``` from g(1) gS giS show ?thesis by blast ``` huffman@44133 ` 2223` ```qed ``` huffman@44133 ` 2224` huffman@44133 ` 2225` ```text {* Linear functions are equal on a subspace if they are on a spanning set. *} ``` huffman@44133 ` 2226` huffman@44133 ` 2227` ```lemma subspace_kernel: ``` huffman@44133 ` 2228` ``` assumes lf: "linear f" ``` huffman@44133 ` 2229` ``` shows "subspace {x. f x = 0}" ``` wenzelm@49522 ` 2230` ``` apply (simp add: subspace_def) ``` wenzelm@49522 ` 2231` ``` apply (simp add: linear_add[OF lf] linear_cmul[OF lf] linear_0[OF lf]) ``` wenzelm@49522 ` 2232` ``` done ``` huffman@44133 ` 2233` huffman@44133 ` 2234` ```lemma linear_eq_0_span: ``` huffman@44133 ` 2235` ``` assumes lf: "linear f" and f0: "\x\B. f x = 0" ``` huffman@44133 ` 2236` ``` shows "\x \ span B. f x = 0" ``` huffman@44170 ` 2237` ``` using f0 subspace_kernel[OF lf] ``` huffman@44170 ` 2238` ``` by (rule span_induct') ``` huffman@44133 ` 2239` huffman@44133 ` 2240` ```lemma linear_eq_0: ``` wenzelm@49663 ` 2241` ``` assumes lf: "linear f" ``` wenzelm@49663 ` 2242` ``` and SB: "S \ span B" ``` wenzelm@49663 ` 2243` ``` and f0: "\x\B. f x = 0" ``` huffman@44133 ` 2244` ``` shows "\x \ S. f x = 0" ``` huffman@44133 ` 2245` ``` by (metis linear_eq_0_span[OF lf] subset_eq SB f0) ``` huffman@44133 ` 2246` huffman@44133 ` 2247` ```lemma linear_eq: ``` wenzelm@49663 ` 2248` ``` assumes lf: "linear f" ``` wenzelm@49663 ` 2249` ``` and lg: "linear g" ``` wenzelm@49663 ` 2250` ``` and S: "S \ span B" ``` wenzelm@49522 ` 2251` ``` and fg: "\ x\ B. f x = g x" ``` huffman@44133 ` 2252` ``` shows "\x\ S. f x = g x" ``` wenzelm@49663 ` 2253` ```proof - ``` huffman@44133 ` 2254` ``` let ?h = "\x. f x - g x" ``` huffman@44133 ` 2255` ``` from fg have fg': "\x\ B. ?h x = 0" by simp ``` huffman@44133 ` 2256` ``` from linear_eq_0[OF linear_compose_sub[OF lf lg] S fg'] ``` huffman@44133 ` 2257` ``` show ?thesis by simp ``` huffman@44133 ` 2258` ```qed ``` huffman@44133 ` 2259` huffman@44133 ` 2260` ```lemma linear_eq_stdbasis: ``` wenzelm@49663 ` 2261` ``` assumes lf: "linear (f::'a::euclidean_space \ _)" ``` wenzelm@49663 ` 2262` ``` and lg: "linear g" ``` wenzelm@49522 ` 2263` ``` and fg: "\i (UNIV :: 'a set)" ``` huffman@44133 ` 2269` ``` from equalityD2[OF span_basis'[where 'a='a]] ``` huffman@44133 ` 2270` ``` have IU: " (UNIV :: 'a set) \ span ?I" by blast ``` wenzelm@49663 ` 2271` ``` have "f x = g x" ``` wenzelm@49663 ` 2272` ``` apply (rule linear_eq[OF lf lg IU,rule_format]) ``` wenzelm@49663 ` 2273` ``` using fg x apply auto ``` wenzelm@49663 ` 2274` ``` done ``` wenzelm@49663 ` 2275` ``` } then show ?thesis by auto ``` huffman@44133 ` 2276` ```qed ``` huffman@44133 ` 2277` huffman@44133 ` 2278` ```text {* Similar results for bilinear functions. *} ``` huffman@44133 ` 2279` huffman@44133 ` 2280` ```lemma bilinear_eq: ``` huffman@44133 ` 2281` ``` assumes bf: "bilinear f" ``` wenzelm@49522 ` 2282` ``` and bg: "bilinear g" ``` wenzelm@49522 ` 2283` ``` and SB: "S \ span B" and TC: "T \ span C" ``` wenzelm@49522 ` 2284` ``` and fg: "\x\ B. \y\ C. f x y = g x y" ``` huffman@44133 ` 2285` ``` shows "\x\S. \y\T. f x y = g x y " ``` wenzelm@49663 ` 2286` ```proof - ``` huffman@44170 ` 2287` ``` let ?P = "{x. \y\ span C. f x y = g x y}" ``` huffman@44133 ` 2288` ``` from bf bg have sp: "subspace ?P" ``` huffman@44133 ` 2289` ``` unfolding bilinear_def linear_def subspace_def bf bg ``` wenzelm@49663 ` 2290` ``` by (auto simp add: span_0 bilinear_lzero[OF bf] bilinear_lzero[OF bg] span_add Ball_def ``` wenzelm@49663 ` 2291` ``` intro: bilinear_ladd[OF bf]) ``` huffman@44133 ` 2292` huffman@44133 ` 2293` ``` have "\x \ span B. \y\ span C. f x y = g x y" ``` huffman@44170 ` 2294` ``` apply (rule span_induct' [OF _ sp]) ``` huffman@44133 ` 2295` ``` apply (rule ballI) ``` huffman@44170 ` 2296` ``` apply (rule span_induct') ``` huffman@44170 ` 2297` ``` apply (simp add: fg) ``` huffman@44133 ` 2298` ``` apply (auto simp add: subspace_def) ``` huffman@44133 ` 2299` ``` using bf bg unfolding bilinear_def linear_def ``` wenzelm@49522 ` 2300` ``` apply (auto simp add: span_0 bilinear_rzero[OF bf] bilinear_rzero[OF bg] span_add Ball_def ``` wenzelm@49663 ` 2301` ``` intro: bilinear_ladd[OF bf]) ``` wenzelm@49522 ` 2302` ``` done ``` huffman@44454 ` 2303` ``` then show ?thesis using SB TC by auto ``` huffman@44133 ` 2304` ```qed ``` huffman@44133 ` 2305` wenzelm@49522 ` 2306` ```lemma bilinear_eq_stdbasis: ``` wenzelm@49522 ` 2307` ``` fixes f::"'a::euclidean_space \ 'b::euclidean_space \ _" ``` huffman@44133 ` 2308` ``` assumes bf: "bilinear f" ``` wenzelm@49522 ` 2309` ``` and bg: "bilinear g" ``` wenzelm@49522 ` 2310` ``` and fg: "\ijx \ (basis ` {..y\ (basis ` {.. 'b::euclidean_space" ``` huffman@44133 ` 2323` ``` assumes lf: "linear f" and fi: "inj f" ``` huffman@44133 ` 2324` ``` shows "\g. linear g \ g o f = id" ``` wenzelm@49522 ` 2325` ```proof - ``` huffman@44133 ` 2326` ``` from linear_independent_extend[OF independent_injective_image, OF independent_basis, OF lf fi] ``` wenzelm@49663 ` 2327` ``` obtain h:: "'b => 'a" where ``` wenzelm@49663 ` 2328` ``` h: "linear h" "\x \ f ` basis ` {..i f) (basis i) = id (basis i)" ``` huffman@44133 ` 2330` ``` using inv_o_cancel[OF fi, unfolded fun_eq_iff id_def o_def] ``` huffman@44133 ` 2331` ``` by auto ``` huffman@44133 ` 2332` huffman@44133 ` 2333` ``` from linear_eq_stdbasis[OF linear_compose[OF lf h(1)] linear_id th] ``` huffman@44133 ` 2334` ``` have "h o f = id" . ``` huffman@44133 ` 2335` ``` then show ?thesis using h(1) by blast ``` huffman@44133 ` 2336` ```qed ``` huffman@44133 ` 2337` wenzelm@49522 ` 2338` ```lemma linear_surjective_right_inverse: ``` wenzelm@49522 ` 2339` ``` fixes f::"'a::euclidean_space => 'b::euclidean_space" ``` huffman@44133 ` 2340` ``` assumes lf: "linear f" and sf: "surj f" ``` huffman@44133 ` 2341` ``` shows "\g. linear g \ f o g = id" ``` wenzelm@49522 ` 2342` ```proof - ``` huffman@44133 ` 2343` ``` from linear_independent_extend[OF independent_basis[where 'a='b],of "inv f"] ``` huffman@44133 ` 2344` ``` obtain h:: "'b \ 'a" where ``` huffman@44133 ` 2345` ``` h: "linear h" "\ x\ basis ` {..i 'b::euclidean_space"} is also surjective. *} ``` huffman@44133 ` 2355` wenzelm@49522 ` 2356` ```lemma linear_injective_imp_surjective: ``` wenzelm@49522 ` 2357` ``` fixes f::"'a::euclidean_space => 'a::euclidean_space" ``` huffman@44133 ` 2358` ``` assumes lf: "linear f" and fi: "inj f" ``` huffman@44133 ` 2359` ``` shows "surj f" ``` wenzelm@49522 ` 2360` ```proof - ``` huffman@44133 ` 2361` ``` let ?U = "UNIV :: 'a set" ``` huffman@44133 ` 2362` ``` from basis_exists[of ?U] obtain B ``` huffman@44133 ` 2363` ``` where B: "B \ ?U" "independent B" "?U \ span B" "card B = dim ?U" ``` huffman@44133 ` 2364` ``` by blast ``` huffman@44133 ` 2365` ``` from B(4) have d: "dim ?U = card B" by simp ``` huffman@44133 ` 2366` ``` have th: "?U \ span (f ` B)" ``` huffman@44133 ` 2367` ``` apply (rule card_ge_dim_independent) ``` huffman@44133 ` 2368` ``` apply blast ``` huffman@44133 ` 2369` ``` apply (rule independent_injective_image[OF B(2) lf fi]) ``` huffman@44133 ` 2370` ``` apply (rule order_eq_refl) ``` huffman@44133 ` 2371` ``` apply (rule sym) ``` huffman@44133 ` 2372` ``` unfolding d ``` huffman@44133 ` 2373` ``` apply (rule card_image) ``` huffman@44133 ` 2374` ``` apply (rule subset_inj_on[OF fi]) ``` wenzelm@49522 ` 2375` ``` apply blast ``` wenzelm@49522 ` 2376` ``` done ``` huffman@44133 ` 2377` ``` from th show ?thesis ``` huffman@44133 ` 2378` ``` unfolding span_linear_image[OF lf] surj_def ``` huffman@44133 ` 2379` ``` using B(3) by blast ``` huffman@44133 ` 2380` ```qed ``` huffman@44133 ` 2381` huffman@44133 ` 2382` ```text {* And vice versa. *} ``` huffman@44133 ` 2383` huffman@44133 ` 2384` ```lemma surjective_iff_injective_gen: ``` wenzelm@49663 ` 2385` ``` assumes fS: "finite S" ``` wenzelm@49663 ` 2386` ``` and fT: "finite T" ``` wenzelm@49663 ` 2387` ``` and c: "card S = card T" ``` wenzelm@49522 ` 2388` ``` and ST: "f ` S \ T" ``` huffman@44133 ` 2389` ``` shows "(\y \ T. \x \ S. f x = y) \ inj_on f S" (is "?lhs \ ?rhs") ``` wenzelm@49522 ` 2390` ```proof - ``` wenzelm@49522 ` 2391` ``` { assume h: "?lhs" ``` wenzelm@49663 ` 2392` ``` { fix x y ``` wenzelm@49663 ` 2393` ``` assume x: "x \ S" and y: "y \ S" and f: "f x = f y" ``` huffman@44133 ` 2394` ``` from x fS have S0: "card S \ 0" by auto ``` wenzelm@49522 ` 2395` ``` { assume xy: "x \ y" ``` huffman@44133 ` 2396` ``` have th: "card S \ card (f ` (S - {y}))" ``` huffman@44133 ` 2397` ``` unfolding c ``` huffman@44133 ` 2398` ``` apply (rule card_mono) ``` huffman@44133 <