src/HOL/Multivariate_Analysis/Convex_Euclidean_Space.thy
author wenzelm
Sat Aug 31 00:39:59 2013 +0200 (2013-08-31)
changeset 53339 0dc28fd72c7d
parent 53333 e9dba6602a84
child 53347 547610c26257
permissions -rw-r--r--
tuned proofs;
wenzelm@41959
     1
(*  Title:      HOL/Multivariate_Analysis/Convex_Euclidean_Space.thy
himmelma@33175
     2
    Author:     Robert Himmelmann, TU Muenchen
hoelzl@40887
     3
    Author:     Bogdan Grechuk, University of Edinburgh
himmelma@33175
     4
*)
himmelma@33175
     5
himmelma@33175
     6
header {* Convex sets, functions and related things. *}
himmelma@33175
     7
himmelma@33175
     8
theory Convex_Euclidean_Space
huffman@44132
     9
imports
huffman@44132
    10
  Topology_Euclidean_Space
huffman@44132
    11
  "~~/src/HOL/Library/Convex"
huffman@44132
    12
  "~~/src/HOL/Library/Set_Algebras"
himmelma@33175
    13
begin
himmelma@33175
    14
himmelma@33175
    15
himmelma@33175
    16
(* ------------------------------------------------------------------------- *)
himmelma@33175
    17
(* To be moved elsewhere                                                     *)
himmelma@33175
    18
(* ------------------------------------------------------------------------- *)
himmelma@33175
    19
huffman@44361
    20
lemma linear_scaleR: "linear (\<lambda>x. scaleR c x)"
huffman@44361
    21
  by (simp add: linear_def scaleR_add_right)
huffman@44361
    22
wenzelm@53339
    23
lemma injective_scaleR: "c \<noteq> 0 \<Longrightarrow> inj (\<lambda>x::'a::real_vector. scaleR c x)"
huffman@44361
    24
  by (simp add: inj_on_def)
hoelzl@40377
    25
hoelzl@40377
    26
lemma linear_add_cmul:
wenzelm@49529
    27
  assumes "linear f"
wenzelm@53339
    28
  shows "f (a *\<^sub>R x + b *\<^sub>R y) = a *\<^sub>R f x +  b *\<^sub>R f y"
wenzelm@49529
    29
  using linear_add[of f] linear_cmul[of f] assms by simp
hoelzl@40377
    30
hoelzl@40377
    31
lemma mem_convex_2:
wenzelm@53339
    32
  assumes "convex S" "x \<in> S" "y \<in> S" "u \<ge> 0" "v \<ge> 0" "u + v = 1"
wenzelm@53339
    33
  shows "u *\<^sub>R x + v *\<^sub>R y \<in> S"
hoelzl@40377
    34
  using assms convex_def[of S] by auto
hoelzl@40377
    35
hoelzl@40377
    36
lemma mem_convex_alt:
hoelzl@40377
    37
  assumes "convex S" "x : S" "y : S" "u>=0" "v>=0" "u+v>0"
hoelzl@40377
    38
  shows "((u/(u+v)) *\<^sub>R x + (v/(u+v)) *\<^sub>R y) : S"
wenzelm@49531
    39
  apply (subst mem_convex_2)
wenzelm@53302
    40
  using assms
wenzelm@53302
    41
  apply (auto simp add: algebra_simps zero_le_divide_iff)
wenzelm@53302
    42
  using add_divide_distrib[of u v "u+v"]
wenzelm@53302
    43
  apply auto
wenzelm@49529
    44
  done
hoelzl@40377
    45
wenzelm@53302
    46
lemma inj_on_image_mem_iff: "inj_on f B \<Longrightarrow> A \<subseteq> B \<Longrightarrow> f a \<in> f`A \<Longrightarrow> a \<in> B \<Longrightarrow> a \<in> A"
wenzelm@49529
    47
  by (blast dest: inj_onD)
hoelzl@40377
    48
hoelzl@40377
    49
lemma independent_injective_on_span_image:
wenzelm@49531
    50
  assumes iS: "independent S"
wenzelm@53302
    51
    and lf: "linear f"
wenzelm@53302
    52
    and fi: "inj_on f (span S)"
hoelzl@40377
    53
  shows "independent (f ` S)"
wenzelm@49529
    54
proof -
wenzelm@49529
    55
  {
wenzelm@49529
    56
    fix a
wenzelm@53339
    57
    assume a: "a \<in> S" "f a \<in> span (f ` S - {f a})"
wenzelm@49529
    58
    have eq: "f ` S - {f a} = f ` (S - {a})"
wenzelm@49529
    59
      using fi a span_inc by (auto simp add: inj_on_def)
wenzelm@53339
    60
    from a have "f a \<in> f ` span (S -{a})"
wenzelm@53339
    61
      unfolding eq span_linear_image [OF lf, of "S - {a}"] by blast
wenzelm@53339
    62
    moreover have "span (S - {a}) \<subseteq> span S"
wenzelm@53339
    63
      using span_mono[of "S - {a}" S] by auto
wenzelm@53339
    64
    ultimately have "a \<in> span (S - {a})"
wenzelm@53333
    65
      using fi a span_inc by (auto simp add: inj_on_def)
wenzelm@53333
    66
    with a(1) iS have False
wenzelm@53333
    67
      by (simp add: dependent_def)
wenzelm@49529
    68
  }
wenzelm@53333
    69
  then show ?thesis
wenzelm@53333
    70
    unfolding dependent_def by blast
hoelzl@40377
    71
qed
hoelzl@40377
    72
hoelzl@40377
    73
lemma dim_image_eq:
wenzelm@53339
    74
  fixes f :: "'n::euclidean_space \<Rightarrow> 'm::euclidean_space"
wenzelm@53333
    75
  assumes lf: "linear f"
wenzelm@53333
    76
    and fi: "inj_on f (span S)"
wenzelm@53339
    77
  shows "dim (f ` S) = dim (S:: 'n::euclidean_space set)"
wenzelm@49529
    78
proof -
wenzelm@53339
    79
  obtain B where B_def: "B \<subseteq> S \<and> independent B \<and> S \<subseteq> span B \<and> card B = dim S"
wenzelm@49529
    80
    using basis_exists[of S] by auto
wenzelm@49529
    81
  then have "span S = span B"
wenzelm@49529
    82
    using span_mono[of B S] span_mono[of S "span B"] span_span[of B] by auto
wenzelm@49529
    83
  then have "independent (f ` B)"
wenzelm@49529
    84
    using independent_injective_on_span_image[of B f] B_def assms by auto
wenzelm@49529
    85
  moreover have "card (f ` B) = card B"
wenzelm@49529
    86
    using assms card_image[of f B] subset_inj_on[of f "span S" B] B_def span_inc by auto
wenzelm@53333
    87
  moreover have "(f ` B) \<subseteq> (f ` S)"
wenzelm@53333
    88
    using B_def by auto
wenzelm@53302
    89
  ultimately have "dim (f ` S) \<ge> dim S"
wenzelm@49529
    90
    using independent_card_le_dim[of "f ` B" "f ` S"] B_def by auto
wenzelm@53333
    91
  then show ?thesis
wenzelm@53333
    92
    using dim_image_le[of f S] assms by auto
hoelzl@40377
    93
qed
hoelzl@40377
    94
hoelzl@40377
    95
lemma linear_injective_on_subspace_0:
wenzelm@53302
    96
  assumes lf: "linear f"
wenzelm@53302
    97
    and "subspace S"
wenzelm@53302
    98
  shows "inj_on f S \<longleftrightarrow> (\<forall>x \<in> S. f x = 0 \<longrightarrow> x = 0)"
wenzelm@49529
    99
proof -
wenzelm@53302
   100
  have "inj_on f S \<longleftrightarrow> (\<forall>x \<in> S. \<forall>y \<in> S. f x = f y \<longrightarrow> x = y)"
wenzelm@53302
   101
    by (simp add: inj_on_def)
wenzelm@53302
   102
  also have "\<dots> \<longleftrightarrow> (\<forall>x \<in> S. \<forall>y \<in> S. f x - f y = 0 \<longrightarrow> x - y = 0)"
wenzelm@53302
   103
    by simp
wenzelm@53302
   104
  also have "\<dots> \<longleftrightarrow> (\<forall>x \<in> S. \<forall>y \<in> S. f (x - y) = 0 \<longrightarrow> x - y = 0)"
hoelzl@40377
   105
    by (simp add: linear_sub[OF lf])
wenzelm@53302
   106
  also have "\<dots> \<longleftrightarrow> (\<forall>x \<in> S. f x = 0 \<longrightarrow> x = 0)"
hoelzl@40377
   107
    using `subspace S` subspace_def[of S] subspace_sub[of S] by auto
hoelzl@40377
   108
  finally show ?thesis .
hoelzl@40377
   109
qed
hoelzl@40377
   110
wenzelm@53302
   111
lemma subspace_Inter: "\<forall>s \<in> f. subspace s \<Longrightarrow> subspace (Inter f)"
wenzelm@49531
   112
  unfolding subspace_def by auto
hoelzl@40377
   113
wenzelm@53302
   114
lemma span_eq[simp]: "span s = s \<longleftrightarrow> subspace s"
wenzelm@53302
   115
  unfolding span_def by (rule hull_eq) (rule subspace_Inter)
hoelzl@40377
   116
wenzelm@49529
   117
lemma substdbasis_expansion_unique:
hoelzl@50526
   118
  assumes d: "d \<subseteq> Basis"
wenzelm@53302
   119
  shows "(\<Sum>i\<in>d. f i *\<^sub>R i) = (x::'a::euclidean_space) \<longleftrightarrow>
wenzelm@53302
   120
    (\<forall>i\<in>Basis. (i \<in> d \<longrightarrow> f i = x \<bullet> i) \<and> (i \<notin> d \<longrightarrow> x \<bullet> i = 0))"
wenzelm@49529
   121
proof -
wenzelm@53339
   122
  have *: "\<And>x a b P. x * (if P then a else b) = (if P then x * a else x * b)"
wenzelm@53302
   123
    by auto
wenzelm@53302
   124
  have **: "finite d"
wenzelm@53302
   125
    by (auto intro: finite_subset[OF assms])
hoelzl@50526
   126
  have ***: "\<And>i. i \<in> Basis \<Longrightarrow> (\<Sum>i\<in>d. f i *\<^sub>R i) \<bullet> i = (\<Sum>x\<in>d. if x = i then f x else 0)"
hoelzl@50526
   127
    using d
hoelzl@50526
   128
    by (auto intro!: setsum_cong simp: inner_Basis inner_setsum_left)
wenzelm@49529
   129
  show ?thesis
hoelzl@50526
   130
    unfolding euclidean_eq_iff[where 'a='a] by (auto simp: setsum_delta[OF **] ***)
hoelzl@50526
   131
qed
hoelzl@50526
   132
hoelzl@50526
   133
lemma independent_substdbasis: "d \<subseteq> Basis \<Longrightarrow> independent d"
hoelzl@50526
   134
  by (rule independent_mono[OF independent_Basis])
hoelzl@40377
   135
wenzelm@49531
   136
lemma dim_cball:
wenzelm@53302
   137
  assumes "e > 0"
wenzelm@49529
   138
  shows "dim (cball (0 :: 'n::euclidean_space) e) = DIM('n)"
wenzelm@49529
   139
proof -
wenzelm@53302
   140
  {
wenzelm@53302
   141
    fix x :: "'n::euclidean_space"
wenzelm@53302
   142
    def y \<equiv> "(e / norm x) *\<^sub>R x"
wenzelm@53339
   143
    then have "y \<in> cball 0 e"
wenzelm@53302
   144
      using cball_def dist_norm[of 0 y] assms by auto
wenzelm@53339
   145
    moreover have *: "x = (norm x / e) *\<^sub>R y"
wenzelm@53302
   146
      using y_def assms by simp
wenzelm@53302
   147
    moreover from * have "x = (norm x/e) *\<^sub>R y"
wenzelm@53302
   148
      by auto
wenzelm@53339
   149
    ultimately have "x \<in> span (cball 0 e)"
wenzelm@49529
   150
      using span_mul[of y "cball 0 e" "norm x/e"] span_inc[of "cball 0 e"] by auto
wenzelm@53302
   151
  }
wenzelm@53339
   152
  then have "span (cball 0 e) = (UNIV :: 'n::euclidean_space set)"
wenzelm@53302
   153
    by auto
wenzelm@49529
   154
  then show ?thesis
wenzelm@49529
   155
    using dim_span[of "cball (0 :: 'n::euclidean_space) e"] by (auto simp add: dim_UNIV)
hoelzl@40377
   156
qed
hoelzl@40377
   157
hoelzl@40377
   158
lemma indep_card_eq_dim_span:
wenzelm@53339
   159
  fixes B :: "'n::euclidean_space set"
wenzelm@49529
   160
  assumes "independent B"
wenzelm@53339
   161
  shows "finite B \<and> card B = dim (span B)"
hoelzl@40377
   162
  using assms basis_card_eq_dim[of B "span B"] span_inc by auto
hoelzl@40377
   163
wenzelm@53339
   164
lemma setsum_not_0: "setsum f A \<noteq> 0 \<Longrightarrow> \<exists>a \<in> A. f a \<noteq> 0"
wenzelm@49529
   165
  by (rule ccontr) auto
hoelzl@40377
   166
wenzelm@49531
   167
lemma translate_inj_on:
wenzelm@53339
   168
  fixes A :: "'a::ab_group_add set"
wenzelm@53339
   169
  shows "inj_on (\<lambda>x. a + x) A"
wenzelm@49529
   170
  unfolding inj_on_def by auto
hoelzl@40377
   171
hoelzl@40377
   172
lemma translation_assoc:
hoelzl@40377
   173
  fixes a b :: "'a::ab_group_add"
wenzelm@53339
   174
  shows "(\<lambda>x. b + x) ` ((\<lambda>x. a + x) ` S) = (\<lambda>x. (a + b) + x) ` S"
wenzelm@49529
   175
  by auto
hoelzl@40377
   176
hoelzl@40377
   177
lemma translation_invert:
hoelzl@40377
   178
  fixes a :: "'a::ab_group_add"
wenzelm@53339
   179
  assumes "(\<lambda>x. a + x) ` A = (\<lambda>x. a + x) ` B"
wenzelm@49529
   180
  shows "A = B"
wenzelm@49529
   181
proof -
wenzelm@53339
   182
  have "(\<lambda>x. -a + x) ` ((\<lambda>x. a + x) ` A) = (\<lambda>x. - a + x) ` ((\<lambda>x. a + x) ` B)"
wenzelm@49529
   183
    using assms by auto
wenzelm@49529
   184
  then show ?thesis
wenzelm@49529
   185
    using translation_assoc[of "-a" a A] translation_assoc[of "-a" a B] by auto
hoelzl@40377
   186
qed
hoelzl@40377
   187
hoelzl@40377
   188
lemma translation_galois:
hoelzl@40377
   189
  fixes a :: "'a::ab_group_add"
wenzelm@53339
   190
  shows "T = ((\<lambda>x. a + x) ` S) \<longleftrightarrow> S = ((\<lambda>x. (- a) + x) ` T)"
wenzelm@53333
   191
  using translation_assoc[of "-a" a S]
wenzelm@53333
   192
  apply auto
wenzelm@53333
   193
  using translation_assoc[of a "-a" T]
wenzelm@53333
   194
  apply auto
wenzelm@49529
   195
  done
hoelzl@40377
   196
hoelzl@40377
   197
lemma translation_inverse_subset:
wenzelm@53339
   198
  assumes "((\<lambda>x. - a + x) ` V) \<le> (S :: 'n::ab_group_add set)"
wenzelm@53339
   199
  shows "V \<le> ((\<lambda>x. a + x) ` S)"
wenzelm@49529
   200
proof -
wenzelm@53333
   201
  {
wenzelm@53333
   202
    fix x
wenzelm@53333
   203
    assume "x \<in> V"
wenzelm@53333
   204
    then have "x-a \<in> S" using assms by auto
wenzelm@53333
   205
    then have "x \<in> {a + v |v. v \<in> S}"
wenzelm@49529
   206
      apply auto
wenzelm@49529
   207
      apply (rule exI[of _ "x-a"])
wenzelm@49529
   208
      apply simp
wenzelm@49529
   209
      done
wenzelm@53333
   210
    then have "x \<in> ((\<lambda>x. a+x) ` S)" by auto
wenzelm@53333
   211
  }
wenzelm@53333
   212
  then show ?thesis by auto
hoelzl@40377
   213
qed
hoelzl@40377
   214
hoelzl@40377
   215
lemma basis_to_basis_subspace_isomorphism:
hoelzl@40377
   216
  assumes s: "subspace (S:: ('n::euclidean_space) set)"
wenzelm@49529
   217
    and t: "subspace (T :: ('m::euclidean_space) set)"
wenzelm@49529
   218
    and d: "dim S = dim T"
wenzelm@53333
   219
    and B: "B \<subseteq> S" "independent B" "S \<subseteq> span B" "card B = dim S"
wenzelm@53333
   220
    and C: "C \<subseteq> T" "independent C" "T \<subseteq> span C" "card C = dim T"
wenzelm@53333
   221
  shows "\<exists>f. linear f \<and> f ` B = C \<and> f ` S = T \<and> inj_on f S"
wenzelm@49529
   222
proof -
hoelzl@40377
   223
(* Proof is a modified copy of the proof of similar lemma subspace_isomorphism
hoelzl@40377
   224
*)
wenzelm@53333
   225
  from B independent_bound have fB: "finite B"
wenzelm@53333
   226
    by blast
wenzelm@53333
   227
  from C independent_bound have fC: "finite C"
wenzelm@53333
   228
    by blast
hoelzl@40377
   229
  from B(4) C(4) card_le_inj[of B C] d obtain f where
hoelzl@40377
   230
    f: "f ` B \<subseteq> C" "inj_on f B" using `finite B` `finite C` by auto
hoelzl@40377
   231
  from linear_independent_extend[OF B(2)] obtain g where
wenzelm@53333
   232
    g: "linear g" "\<forall>x \<in> B. g x = f x" by blast
hoelzl@40377
   233
  from inj_on_iff_eq_card[OF fB, of f] f(2)
hoelzl@40377
   234
  have "card (f ` B) = card B" by simp
hoelzl@40377
   235
  with B(4) C(4) have ceq: "card (f ` B) = card C" using d
hoelzl@40377
   236
    by simp
hoelzl@40377
   237
  have "g ` B = f ` B" using g(2)
hoelzl@40377
   238
    by (auto simp add: image_iff)
hoelzl@40377
   239
  also have "\<dots> = C" using card_subset_eq[OF fC f(1) ceq] .
hoelzl@40377
   240
  finally have gBC: "g ` B = C" .
hoelzl@40377
   241
  have gi: "inj_on g B" using f(2) g(2)
hoelzl@40377
   242
    by (auto simp add: inj_on_def)
hoelzl@40377
   243
  note g0 = linear_indep_image_lemma[OF g(1) fB, unfolded gBC, OF C(2) gi]
wenzelm@53333
   244
  {
wenzelm@53333
   245
    fix x y
wenzelm@49529
   246
    assume x: "x \<in> S" and y: "y \<in> S" and gxy: "g x = g y"
wenzelm@53333
   247
    from B(3) x y have x': "x \<in> span B" and y': "y \<in> span B"
wenzelm@53333
   248
      by blast+
wenzelm@53333
   249
    from gxy have th0: "g (x - y) = 0"
wenzelm@53333
   250
      by (simp add: linear_sub[OF g(1)])
wenzelm@53333
   251
    have th1: "x - y \<in> span B" using x' y'
wenzelm@53333
   252
      by (metis span_sub)
wenzelm@53333
   253
    have "x = y" using g0[OF th1 th0] by simp
wenzelm@53333
   254
  }
wenzelm@53333
   255
  then have giS: "inj_on g S" unfolding inj_on_def by blast
hoelzl@40377
   256
  from span_subspace[OF B(1,3) s]
wenzelm@53333
   257
  have "g ` S = span (g ` B)"
wenzelm@53333
   258
    by (simp add: span_linear_image[OF g(1)])
wenzelm@53333
   259
  also have "\<dots> = span C"
wenzelm@53333
   260
    unfolding gBC ..
wenzelm@53333
   261
  also have "\<dots> = T"
wenzelm@53333
   262
    using span_subspace[OF C(1,3) t] .
hoelzl@40377
   263
  finally have gS: "g ` S = T" .
wenzelm@53333
   264
  from g(1) gS giS gBC show ?thesis
wenzelm@53333
   265
    by blast
hoelzl@40377
   266
qed
hoelzl@40377
   267
huffman@44524
   268
lemma closure_bounded_linear_image:
huffman@44524
   269
  assumes f: "bounded_linear f"
wenzelm@53333
   270
  shows "f ` closure S \<subseteq> closure (f ` S)"
huffman@44524
   271
  using linear_continuous_on [OF f] closed_closure closure_subset
huffman@44524
   272
  by (rule image_closure_subset)
huffman@44524
   273
hoelzl@40377
   274
lemma closure_linear_image:
wenzelm@53339
   275
  fixes f :: "'m::euclidean_space \<Rightarrow> 'n::real_normed_vector"
wenzelm@49529
   276
  assumes "linear f"
wenzelm@53333
   277
  shows "f ` (closure S) \<le> closure (f ` S)"
huffman@44524
   278
  using assms unfolding linear_conv_bounded_linear
huffman@44524
   279
  by (rule closure_bounded_linear_image)
hoelzl@40377
   280
hoelzl@40377
   281
lemma closure_injective_linear_image:
wenzelm@53339
   282
  fixes f :: "'n::euclidean_space \<Rightarrow> 'n::euclidean_space"
wenzelm@49529
   283
  assumes "linear f" "inj f"
wenzelm@49529
   284
  shows "f ` (closure S) = closure (f ` S)"
wenzelm@49529
   285
proof -
wenzelm@53339
   286
  obtain f' where f'_def: "linear f' \<and> f \<circ> f' = id \<and> f' \<circ> f = id"
wenzelm@49529
   287
    using assms linear_injective_isomorphism[of f] isomorphism_expand by auto
wenzelm@53333
   288
  then have "f' ` closure (f ` S) \<le> closure (S)"
wenzelm@49529
   289
    using closure_linear_image[of f' "f ` S"] image_compose[of f' f] by auto
wenzelm@53339
   290
  then have "f ` f' ` closure (f ` S) \<le> f ` closure S" by auto
wenzelm@53339
   291
  then have "closure (f ` S) \<le> f ` closure S"
wenzelm@49529
   292
    using image_compose[of f f' "closure (f ` S)"] f'_def by auto
wenzelm@49529
   293
  then show ?thesis using closure_linear_image[of f S] assms by auto
hoelzl@40377
   294
qed
hoelzl@40377
   295
wenzelm@53333
   296
lemma closure_direct_sum: "closure (S \<times> T) = closure S \<times> closure T"
huffman@44365
   297
  by (rule closure_Times)
hoelzl@40377
   298
huffman@44524
   299
lemma closure_scaleR:
wenzelm@53339
   300
  fixes S :: "'a::real_normed_vector set"
huffman@44524
   301
  shows "(op *\<^sub>R c) ` (closure S) = closure ((op *\<^sub>R c) ` S)"
huffman@44524
   302
proof
huffman@44524
   303
  show "(op *\<^sub>R c) ` (closure S) \<subseteq> closure ((op *\<^sub>R c) ` S)"
wenzelm@53333
   304
    using bounded_linear_scaleR_right
wenzelm@53333
   305
    by (rule closure_bounded_linear_image)
huffman@44524
   306
  show "closure ((op *\<^sub>R c) ` S) \<subseteq> (op *\<^sub>R c) ` (closure S)"
wenzelm@49529
   307
    by (intro closure_minimal image_mono closure_subset closed_scaling closed_closure)
wenzelm@49529
   308
qed
wenzelm@49529
   309
wenzelm@49529
   310
lemma fst_linear: "linear fst"
wenzelm@49529
   311
  unfolding linear_def by (simp add: algebra_simps)
wenzelm@49529
   312
wenzelm@49529
   313
lemma snd_linear: "linear snd"
wenzelm@49529
   314
  unfolding linear_def by (simp add: algebra_simps)
wenzelm@49529
   315
wenzelm@49529
   316
lemma fst_snd_linear: "linear (%(x,y). x + y)"
wenzelm@49529
   317
  unfolding linear_def by (simp add: algebra_simps)
hoelzl@40377
   318
hoelzl@37489
   319
lemma scaleR_2:
hoelzl@37489
   320
  fixes x :: "'a::real_vector"
hoelzl@37489
   321
  shows "scaleR 2 x = x + x"
wenzelm@49529
   322
  unfolding one_add_one [symmetric] scaleR_left_distrib by simp
wenzelm@49529
   323
wenzelm@49529
   324
lemma vector_choose_size:
wenzelm@53333
   325
  "0 \<le> c \<Longrightarrow> \<exists>x::'a::euclidean_space. norm x = c"
wenzelm@53333
   326
  apply (rule exI [where x="c *\<^sub>R (SOME i. i \<in> Basis)"])
hoelzl@50526
   327
  apply (auto simp: SOME_Basis)
wenzelm@49529
   328
  done
wenzelm@49529
   329
wenzelm@49529
   330
lemma setsum_delta_notmem:
wenzelm@49529
   331
  assumes "x \<notin> s"
himmelma@33175
   332
  shows "setsum (\<lambda>y. if (y = x) then P x else Q y) s = setsum Q s"
wenzelm@49529
   333
    and "setsum (\<lambda>y. if (x = y) then P x else Q y) s = setsum Q s"
wenzelm@49529
   334
    and "setsum (\<lambda>y. if (y = x) then P y else Q y) s = setsum Q s"
wenzelm@49529
   335
    and "setsum (\<lambda>y. if (x = y) then P y else Q y) s = setsum Q s"
wenzelm@50804
   336
  apply (rule_tac [!] setsum_cong2)
wenzelm@53333
   337
  using assms
wenzelm@53333
   338
  apply auto
wenzelm@49529
   339
  done
himmelma@33175
   340
himmelma@33175
   341
lemma setsum_delta'':
wenzelm@49529
   342
  fixes s::"'a::real_vector set"
wenzelm@49529
   343
  assumes "finite s"
himmelma@33175
   344
  shows "(\<Sum>x\<in>s. (if y = x then f x else 0) *\<^sub>R x) = (if y\<in>s then (f y) *\<^sub>R y else 0)"
wenzelm@49529
   345
proof -
wenzelm@49529
   346
  have *: "\<And>x y. (if y = x then f x else (0::real)) *\<^sub>R x = (if x=y then (f x) *\<^sub>R x else 0)"
wenzelm@49529
   347
    by auto
wenzelm@49529
   348
  show ?thesis
wenzelm@49529
   349
    unfolding * using setsum_delta[OF assms, of y "\<lambda>x. f x *\<^sub>R x"] by auto
himmelma@33175
   350
qed
himmelma@33175
   351
wenzelm@53333
   352
lemma if_smult: "(if P then x else (y::real)) *\<^sub>R v = (if P then x *\<^sub>R v else y *\<^sub>R v)"
wenzelm@53333
   353
  by auto
himmelma@33175
   354
wenzelm@49529
   355
lemma image_smult_interval:
wenzelm@49529
   356
  "(\<lambda>x. m *\<^sub>R (x::'a::ordered_euclidean_space)) ` {a..b} =
wenzelm@49529
   357
    (if {a..b} = {} then {} else if 0 \<le> m then {m *\<^sub>R a..m *\<^sub>R b} else {m *\<^sub>R b..m *\<^sub>R a})"
himmelma@33175
   358
  using image_affinity_interval[of m 0 a b] by auto
himmelma@33175
   359
himmelma@33175
   360
lemma dist_triangle_eq:
huffman@44361
   361
  fixes x y z :: "'a::real_inner"
wenzelm@53333
   362
  shows "dist x z = dist x y + dist y z \<longleftrightarrow>
wenzelm@53333
   363
    norm (x - y) *\<^sub>R (y - z) = norm (y - z) *\<^sub>R (x - y)"
wenzelm@49529
   364
proof -
wenzelm@49529
   365
  have *: "x - y + (y - z) = x - z" by auto
hoelzl@37489
   366
  show ?thesis unfolding dist_norm norm_triangle_eq[of "x - y" "y - z", unfolded *]
wenzelm@49529
   367
    by (auto simp add:norm_minus_commute)
wenzelm@49529
   368
qed
himmelma@33175
   369
hoelzl@37489
   370
lemma norm_minus_eqI:"x = - y \<Longrightarrow> norm x = norm y" by auto
himmelma@33175
   371
wenzelm@49529
   372
lemma Min_grI:
wenzelm@49529
   373
  assumes "finite A" "A \<noteq> {}" "\<forall>a\<in>A. x < a"
wenzelm@49529
   374
  shows "x < Min A"
himmelma@33175
   375
  unfolding Min_gr_iff[OF assms(1,2)] using assms(3) by auto
himmelma@33175
   376
hoelzl@37489
   377
lemma norm_lt: "norm x < norm y \<longleftrightarrow> inner x x < inner y y"
hoelzl@37489
   378
  unfolding norm_eq_sqrt_inner by simp
himmelma@33175
   379
hoelzl@37489
   380
lemma norm_le: "norm x \<le> norm y \<longleftrightarrow> inner x x \<le> inner y y"
hoelzl@37489
   381
  unfolding norm_eq_sqrt_inner by simp
hoelzl@37489
   382
hoelzl@37489
   383
huffman@44467
   384
subsection {* Affine set and affine hull *}
himmelma@33175
   385
wenzelm@49529
   386
definition affine :: "'a::real_vector set \<Rightarrow> bool"
wenzelm@49529
   387
  where "affine s \<longleftrightarrow> (\<forall>x\<in>s. \<forall>y\<in>s. \<forall>u v. u + v = 1 \<longrightarrow> u *\<^sub>R x + v *\<^sub>R y \<in> s)"
himmelma@33175
   388
himmelma@33175
   389
lemma affine_alt: "affine s \<longleftrightarrow> (\<forall>x\<in>s. \<forall>y\<in>s. \<forall>u::real. (1 - u) *\<^sub>R x + u *\<^sub>R y \<in> s)"
wenzelm@49529
   390
  unfolding affine_def by (metis eq_diff_eq')
himmelma@33175
   391
himmelma@33175
   392
lemma affine_empty[intro]: "affine {}"
himmelma@33175
   393
  unfolding affine_def by auto
himmelma@33175
   394
himmelma@33175
   395
lemma affine_sing[intro]: "affine {x}"
himmelma@33175
   396
  unfolding affine_alt by (auto simp add: scaleR_left_distrib [symmetric])
himmelma@33175
   397
himmelma@33175
   398
lemma affine_UNIV[intro]: "affine UNIV"
himmelma@33175
   399
  unfolding affine_def by auto
himmelma@33175
   400
himmelma@33175
   401
lemma affine_Inter: "(\<forall>s\<in>f. affine s) \<Longrightarrow> affine (\<Inter> f)"
wenzelm@49531
   402
  unfolding affine_def by auto
himmelma@33175
   403
himmelma@33175
   404
lemma affine_Int: "affine s \<Longrightarrow> affine t \<Longrightarrow> affine (s \<inter> t)"
himmelma@33175
   405
  unfolding affine_def by auto
himmelma@33175
   406
himmelma@33175
   407
lemma affine_affine_hull: "affine(affine hull s)"
wenzelm@49529
   408
  unfolding hull_def
wenzelm@49529
   409
  using affine_Inter[of "{t. affine t \<and> s \<subseteq> t}"] by auto
himmelma@33175
   410
himmelma@33175
   411
lemma affine_hull_eq[simp]: "(affine hull s = s) \<longleftrightarrow> affine s"
wenzelm@49529
   412
  by (metis affine_affine_hull hull_same)
wenzelm@49529
   413
himmelma@33175
   414
huffman@44467
   415
subsubsection {* Some explicit formulations (from Lars Schewe) *}
himmelma@33175
   416
wenzelm@49529
   417
lemma affine:
wenzelm@49529
   418
  fixes V::"'a::real_vector set"
wenzelm@49529
   419
  shows "affine V \<longleftrightarrow>
wenzelm@49529
   420
    (\<forall>s u. finite s \<and> s \<noteq> {} \<and> s \<subseteq> V \<and> setsum u s = 1 \<longrightarrow> (setsum (\<lambda>x. (u x) *\<^sub>R x)) s \<in> V)"
wenzelm@49529
   421
  unfolding affine_def
wenzelm@49529
   422
  apply rule
wenzelm@49529
   423
  apply(rule, rule, rule)
wenzelm@49531
   424
  apply(erule conjE)+
wenzelm@49529
   425
  defer
wenzelm@49529
   426
  apply (rule, rule, rule, rule, rule)
wenzelm@49529
   427
proof -
wenzelm@49529
   428
  fix x y u v
wenzelm@49529
   429
  assume as: "x \<in> V" "y \<in> V" "u + v = (1::real)"
himmelma@33175
   430
    "\<forall>s u. finite s \<and> s \<noteq> {} \<and> s \<subseteq> V \<and> setsum u s = 1 \<longrightarrow> (\<Sum>x\<in>s. u x *\<^sub>R x) \<in> V"
wenzelm@49529
   431
  then show "u *\<^sub>R x + v *\<^sub>R y \<in> V"
wenzelm@49529
   432
    apply (cases "x = y")
wenzelm@49529
   433
    using as(4)[THEN spec[where x="{x,y}"], THEN spec[where x="\<lambda>w. if w = x then u else v"]]
wenzelm@49529
   434
      and as(1-3)
wenzelm@53333
   435
    apply (auto simp add: scaleR_left_distrib[symmetric])
wenzelm@53333
   436
    done
himmelma@33175
   437
next
wenzelm@49529
   438
  fix s u
wenzelm@49529
   439
  assume as: "\<forall>x\<in>V. \<forall>y\<in>V. \<forall>u v. u + v = 1 \<longrightarrow> u *\<^sub>R x + v *\<^sub>R y \<in> V"
himmelma@33175
   440
    "finite s" "s \<noteq> {}" "s \<subseteq> V" "setsum u s = (1::real)"
himmelma@33175
   441
  def n \<equiv> "card s"
himmelma@33175
   442
  have "card s = 0 \<or> card s = 1 \<or> card s = 2 \<or> card s > 2" by auto
wenzelm@49529
   443
  then show "(\<Sum>x\<in>s. u x *\<^sub>R x) \<in> V"
wenzelm@49529
   444
  proof (auto simp only: disjE)
wenzelm@49529
   445
    assume "card s = 2"
wenzelm@53333
   446
    then have "card s = Suc (Suc 0)"
wenzelm@53333
   447
      by auto
wenzelm@53333
   448
    then obtain a b where "s = {a, b}"
wenzelm@53333
   449
      unfolding card_Suc_eq by auto
wenzelm@49529
   450
    then show ?thesis
wenzelm@49529
   451
      using as(1)[THEN bspec[where x=a], THEN bspec[where x=b]] using as(4,5)
wenzelm@49529
   452
      by (auto simp add: setsum_clauses(2))
wenzelm@49529
   453
  next
wenzelm@49529
   454
    assume "card s > 2"
wenzelm@49529
   455
    then show ?thesis using as and n_def
wenzelm@49529
   456
    proof (induct n arbitrary: u s)
wenzelm@49529
   457
      case 0
wenzelm@49529
   458
      then show ?case by auto
wenzelm@49529
   459
    next
wenzelm@49529
   460
      case (Suc n)
wenzelm@49529
   461
      fix s :: "'a set" and u :: "'a \<Rightarrow> real"
wenzelm@49529
   462
      assume IA:
wenzelm@49529
   463
        "\<And>u s.  \<lbrakk>2 < card s; \<forall>x\<in>V. \<forall>y\<in>V. \<forall>u v. u + v = 1 \<longrightarrow> u *\<^sub>R x + v *\<^sub>R y \<in> V; finite s;
wenzelm@49529
   464
          s \<noteq> {}; s \<subseteq> V; setsum u s = 1; n = card s \<rbrakk> \<Longrightarrow> (\<Sum>x\<in>s. u x *\<^sub>R x) \<in> V"
wenzelm@49529
   465
        and as:
wenzelm@49529
   466
          "Suc n = card s" "2 < card s" "\<forall>x\<in>V. \<forall>y\<in>V. \<forall>u v. u + v = 1 \<longrightarrow> u *\<^sub>R x + v *\<^sub>R y \<in> V"
himmelma@33175
   467
           "finite s" "s \<noteq> {}" "s \<subseteq> V" "setsum u s = 1"
wenzelm@49529
   468
      have "\<exists>x\<in>s. u x \<noteq> 1"
wenzelm@49529
   469
      proof (rule ccontr)
wenzelm@49529
   470
        assume "\<not> ?thesis"
wenzelm@53333
   471
        then have "setsum u s = real_of_nat (card s)"
wenzelm@53333
   472
          unfolding card_eq_setsum by auto
wenzelm@49529
   473
        then show False
wenzelm@49529
   474
          using as(7) and `card s > 2`
wenzelm@49529
   475
          by (metis One_nat_def less_Suc0 Zero_not_Suc of_nat_1 of_nat_eq_iff numeral_2_eq_2)
huffman@45498
   476
      qed
wenzelm@53339
   477
      then obtain x where x:"x \<in> s" "u x \<noteq> 1" by auto
himmelma@33175
   478
wenzelm@49529
   479
      have c: "card (s - {x}) = card s - 1"
wenzelm@53333
   480
        apply (rule card_Diff_singleton)
wenzelm@53333
   481
        using `x\<in>s` as(4)
wenzelm@53333
   482
        apply auto
wenzelm@53333
   483
        done
wenzelm@49529
   484
      have *: "s = insert x (s - {x})" "finite (s - {x})"
wenzelm@49529
   485
        using `x\<in>s` and as(4) by auto
wenzelm@49529
   486
      have **: "setsum u (s - {x}) = 1 - u x"
wenzelm@49530
   487
        using setsum_clauses(2)[OF *(2), of u x, unfolded *(1)[symmetric] as(7)] by auto
wenzelm@49529
   488
      have ***: "inverse (1 - u x) * setsum u (s - {x}) = 1"
wenzelm@49529
   489
        unfolding ** using `u x \<noteq> 1` by auto
wenzelm@49529
   490
      have "(\<Sum>xa\<in>s - {x}. (inverse (1 - u x) * u xa) *\<^sub>R xa) \<in> V"
wenzelm@49529
   491
      proof (cases "card (s - {x}) > 2")
wenzelm@49529
   492
        case True
wenzelm@49529
   493
        then have "s - {x} \<noteq> {}" "card (s - {x}) = n"
wenzelm@49529
   494
          unfolding c and as(1)[symmetric]
wenzelm@49531
   495
        proof (rule_tac ccontr)
wenzelm@49529
   496
          assume "\<not> s - {x} \<noteq> {}"
wenzelm@49531
   497
          then have "card (s - {x}) = 0" unfolding card_0_eq[OF *(2)] by simp
wenzelm@49529
   498
          then show False using True by auto
wenzelm@49529
   499
        qed auto
wenzelm@49529
   500
        then show ?thesis
wenzelm@49529
   501
          apply (rule_tac IA[of "s - {x}" "\<lambda>y. (inverse (1 - u x) * u y)"])
wenzelm@53333
   502
          unfolding setsum_right_distrib[symmetric]
wenzelm@53333
   503
          using as and *** and True
wenzelm@49529
   504
          apply auto
wenzelm@49529
   505
          done
wenzelm@49529
   506
      next
wenzelm@49529
   507
        case False
wenzelm@53333
   508
        then have "card (s - {x}) = Suc (Suc 0)"
wenzelm@53333
   509
          using as(2) and c by auto
wenzelm@53333
   510
        then obtain a b where "(s - {x}) = {a, b}" "a\<noteq>b"
wenzelm@53333
   511
          unfolding card_Suc_eq by auto
wenzelm@53333
   512
        then show ?thesis
wenzelm@53333
   513
          using as(3)[THEN bspec[where x=a], THEN bspec[where x=b]]
wenzelm@49529
   514
          using *** *(2) and `s \<subseteq> V`
wenzelm@53333
   515
          unfolding setsum_right_distrib
wenzelm@53333
   516
          by (auto simp add: setsum_clauses(2))
wenzelm@49529
   517
      qed
wenzelm@49529
   518
      then have "u x + (1 - u x) = 1 \<Longrightarrow>
wenzelm@49529
   519
          u x *\<^sub>R x + (1 - u x) *\<^sub>R ((\<Sum>xa\<in>s - {x}. u xa *\<^sub>R xa) /\<^sub>R (1 - u x)) \<in> V"
wenzelm@49529
   520
        apply -
wenzelm@49529
   521
        apply (rule as(3)[rule_format])
hoelzl@51524
   522
        unfolding  Real_Vector_Spaces.scaleR_right.setsum
wenzelm@53333
   523
        using x(1) as(6)
wenzelm@53333
   524
        apply auto
wenzelm@49529
   525
        done
wenzelm@49529
   526
      then show "(\<Sum>x\<in>s. u x *\<^sub>R x) \<in> V"
wenzelm@49530
   527
        unfolding scaleR_scaleR[symmetric] and scaleR_right.setsum [symmetric]
wenzelm@49529
   528
        apply (subst *)
wenzelm@49529
   529
        unfolding setsum_clauses(2)[OF *(2)]
wenzelm@53333
   530
        using `u x \<noteq> 1`
wenzelm@53333
   531
        apply auto
wenzelm@49529
   532
        done
wenzelm@49529
   533
    qed
wenzelm@49529
   534
  next
wenzelm@49529
   535
    assume "card s = 1"
wenzelm@53333
   536
    then obtain a where "s={a}"
wenzelm@53333
   537
      by (auto simp add: card_Suc_eq)
wenzelm@53333
   538
    then show ?thesis
wenzelm@53333
   539
      using as(4,5) by simp
wenzelm@49529
   540
  qed (insert `s\<noteq>{}` `finite s`, auto)
himmelma@33175
   541
qed
himmelma@33175
   542
himmelma@33175
   543
lemma affine_hull_explicit:
wenzelm@53333
   544
  "affine hull p =
wenzelm@53333
   545
    {y. \<exists>s u. finite s \<and> s \<noteq> {} \<and> s \<subseteq> p \<and> setsum u s = 1 \<and> setsum (\<lambda>v. (u v) *\<^sub>R v) s = y}"
wenzelm@49529
   546
  apply (rule hull_unique)
wenzelm@49529
   547
  apply (subst subset_eq)
wenzelm@49529
   548
  prefer 3
wenzelm@49529
   549
  apply rule
wenzelm@49529
   550
  unfolding mem_Collect_eq
wenzelm@49529
   551
  apply (erule exE)+
wenzelm@49529
   552
  apply (erule conjE)+
wenzelm@49529
   553
  prefer 2
wenzelm@49529
   554
  apply rule
wenzelm@49529
   555
proof -
wenzelm@49529
   556
  fix x
wenzelm@49529
   557
  assume "x\<in>p"
wenzelm@49529
   558
  then show "\<exists>s u. finite s \<and> s \<noteq> {} \<and> s \<subseteq> p \<and> setsum u s = 1 \<and> (\<Sum>v\<in>s. u v *\<^sub>R v) = x"
wenzelm@53333
   559
    apply (rule_tac x="{x}" in exI)
wenzelm@53333
   560
    apply (rule_tac x="\<lambda>x. 1" in exI)
wenzelm@49529
   561
    apply auto
wenzelm@49529
   562
    done
himmelma@33175
   563
next
wenzelm@49529
   564
  fix t x s u
wenzelm@53333
   565
  assume as: "p \<subseteq> t" "affine t" "finite s" "s \<noteq> {}"
wenzelm@53333
   566
    "s \<subseteq> p" "setsum u s = 1" "(\<Sum>v\<in>s. u v *\<^sub>R v) = x"
wenzelm@49529
   567
  then show "x \<in> t"
wenzelm@53333
   568
    using as(2)[unfolded affine, THEN spec[where x=s], THEN spec[where x=u]]
wenzelm@53333
   569
    by auto
himmelma@33175
   570
next
wenzelm@49529
   571
  show "affine {y. \<exists>s u. finite s \<and> s \<noteq> {} \<and> s \<subseteq> p \<and> setsum u s = 1 \<and> (\<Sum>v\<in>s. u v *\<^sub>R v) = y}"
wenzelm@49529
   572
    unfolding affine_def
wenzelm@49529
   573
    apply (rule, rule, rule, rule, rule)
wenzelm@49529
   574
    unfolding mem_Collect_eq
wenzelm@49529
   575
  proof -
wenzelm@49529
   576
    fix u v :: real
wenzelm@49529
   577
    assume uv: "u + v = 1"
wenzelm@49529
   578
    fix x
wenzelm@49529
   579
    assume "\<exists>s u. finite s \<and> s \<noteq> {} \<and> s \<subseteq> p \<and> setsum u s = 1 \<and> (\<Sum>v\<in>s. u v *\<^sub>R v) = x"
wenzelm@49529
   580
    then obtain sx ux where
wenzelm@53333
   581
      x: "finite sx" "sx \<noteq> {}" "sx \<subseteq> p" "setsum ux sx = 1" "(\<Sum>v\<in>sx. ux v *\<^sub>R v) = x"
wenzelm@53333
   582
      by auto
wenzelm@53333
   583
    fix y
wenzelm@53333
   584
    assume "\<exists>s u. finite s \<and> s \<noteq> {} \<and> s \<subseteq> p \<and> setsum u s = 1 \<and> (\<Sum>v\<in>s. u v *\<^sub>R v) = y"
wenzelm@49529
   585
    then obtain sy uy where
wenzelm@49529
   586
      y: "finite sy" "sy \<noteq> {}" "sy \<subseteq> p" "setsum uy sy = 1" "(\<Sum>v\<in>sy. uy v *\<^sub>R v) = y" by auto
wenzelm@53333
   587
    have xy: "finite (sx \<union> sy)"
wenzelm@53333
   588
      using x(1) y(1) by auto
wenzelm@53333
   589
    have **: "(sx \<union> sy) \<inter> sx = sx" "(sx \<union> sy) \<inter> sy = sy"
wenzelm@53333
   590
      by auto
wenzelm@49529
   591
    show "\<exists>s ua. finite s \<and> s \<noteq> {} \<and> s \<subseteq> p \<and>
wenzelm@49529
   592
        setsum ua s = 1 \<and> (\<Sum>v\<in>s. ua v *\<^sub>R v) = u *\<^sub>R x + v *\<^sub>R y"
wenzelm@49529
   593
      apply (rule_tac x="sx \<union> sy" in exI)
wenzelm@49529
   594
      apply (rule_tac x="\<lambda>a. (if a\<in>sx then u * ux a else 0) + (if a\<in>sy then v * uy a else 0)" in exI)
wenzelm@53333
   595
      unfolding scaleR_left_distrib setsum_addf if_smult scaleR_zero_left
wenzelm@53333
   596
        ** setsum_restrict_set[OF xy, symmetric]
wenzelm@53333
   597
      unfolding scaleR_scaleR[symmetric] Real_Vector_Spaces.scaleR_right.setsum [symmetric]
wenzelm@53333
   598
        and setsum_right_distrib[symmetric]
wenzelm@49529
   599
      unfolding x y
wenzelm@53333
   600
      using x(1-3) y(1-3) uv
wenzelm@53333
   601
      apply simp
wenzelm@49529
   602
      done
wenzelm@49529
   603
  qed
wenzelm@49529
   604
qed
himmelma@33175
   605
himmelma@33175
   606
lemma affine_hull_finite:
himmelma@33175
   607
  assumes "finite s"
himmelma@33175
   608
  shows "affine hull s = {y. \<exists>u. setsum u s = 1 \<and> setsum (\<lambda>v. u v *\<^sub>R v) s = y}"
wenzelm@53333
   609
  unfolding affine_hull_explicit and set_eq_iff and mem_Collect_eq
wenzelm@53333
   610
  apply (rule, rule)
wenzelm@53333
   611
  apply (erule exE)+
wenzelm@53333
   612
  apply (erule conjE)+
wenzelm@49529
   613
  defer
wenzelm@49529
   614
  apply (erule exE)
wenzelm@49529
   615
  apply (erule conjE)
wenzelm@49529
   616
proof -
wenzelm@49529
   617
  fix x u
wenzelm@49529
   618
  assume "setsum u s = 1" "(\<Sum>v\<in>s. u v *\<^sub>R v) = x"
wenzelm@49529
   619
  then show "\<exists>sa u. finite sa \<and>
wenzelm@49529
   620
      \<not> (\<forall>x. (x \<in> sa) = (x \<in> {})) \<and> sa \<subseteq> s \<and> setsum u sa = 1 \<and> (\<Sum>v\<in>sa. u v *\<^sub>R v) = x"
wenzelm@49529
   621
    apply (rule_tac x=s in exI, rule_tac x=u in exI)
wenzelm@53333
   622
    using assms
wenzelm@53333
   623
    apply auto
wenzelm@49529
   624
    done
himmelma@33175
   625
next
wenzelm@49529
   626
  fix x t u
wenzelm@49529
   627
  assume "t \<subseteq> s"
wenzelm@53333
   628
  then have *: "s \<inter> t = t"
wenzelm@53333
   629
    by auto
himmelma@33175
   630
  assume "finite t" "\<not> (\<forall>x. (x \<in> t) = (x \<in> {}))" "setsum u t = 1" "(\<Sum>v\<in>t. u v *\<^sub>R v) = x"
wenzelm@49529
   631
  then show "\<exists>u. setsum u s = 1 \<and> (\<Sum>v\<in>s. u v *\<^sub>R v) = x"
wenzelm@49529
   632
    apply (rule_tac x="\<lambda>x. if x\<in>t then u x else 0" in exI)
wenzelm@49530
   633
    unfolding if_smult scaleR_zero_left and setsum_restrict_set[OF assms, symmetric] and *
wenzelm@49529
   634
    apply auto
wenzelm@49529
   635
    done
wenzelm@49529
   636
qed
wenzelm@49529
   637
himmelma@33175
   638
huffman@44467
   639
subsubsection {* Stepping theorems and hence small special cases *}
himmelma@33175
   640
himmelma@33175
   641
lemma affine_hull_empty[simp]: "affine hull {} = {}"
wenzelm@49529
   642
  by (rule hull_unique) auto
himmelma@33175
   643
himmelma@33175
   644
lemma affine_hull_finite_step:
himmelma@33175
   645
  fixes y :: "'a::real_vector"
wenzelm@49529
   646
  shows
wenzelm@49529
   647
    "(\<exists>u. setsum u {} = w \<and> setsum (\<lambda>x. u x *\<^sub>R x) {} = y) \<longleftrightarrow> w = 0 \<and> y = 0" (is ?th1)
wenzelm@49529
   648
    "finite s \<Longrightarrow>
wenzelm@49529
   649
      (\<exists>u. setsum u (insert a s) = w \<and> setsum (\<lambda>x. u x *\<^sub>R x) (insert a s) = y) \<longleftrightarrow>
wenzelm@49529
   650
      (\<exists>v u. setsum u s = w - v \<and> setsum (\<lambda>x. u x *\<^sub>R x) s = y - v *\<^sub>R a)" (is "?as \<Longrightarrow> (?lhs = ?rhs)")
wenzelm@49529
   651
proof -
himmelma@33175
   652
  show ?th1 by simp
wenzelm@49529
   653
  assume ?as
wenzelm@53302
   654
  {
wenzelm@53302
   655
    assume ?lhs
wenzelm@53302
   656
    then obtain u where u: "setsum u (insert a s) = w \<and> (\<Sum>x\<in>insert a s. u x *\<^sub>R x) = y"
wenzelm@53302
   657
      by auto
wenzelm@49529
   658
    have ?rhs
wenzelm@49529
   659
    proof (cases "a \<in> s")
wenzelm@49529
   660
      case True
wenzelm@49529
   661
      then have *: "insert a s = s" by auto
wenzelm@53302
   662
      show ?thesis
wenzelm@53302
   663
        using u[unfolded *]
wenzelm@53302
   664
        apply(rule_tac x=0 in exI)
wenzelm@53302
   665
        apply auto
wenzelm@53302
   666
        done
himmelma@33175
   667
    next
wenzelm@49529
   668
      case False
wenzelm@49529
   669
      then show ?thesis
wenzelm@49529
   670
        apply (rule_tac x="u a" in exI)
wenzelm@53302
   671
        using u and `?as`
wenzelm@53302
   672
        apply auto
wenzelm@49529
   673
        done
wenzelm@53302
   674
    qed
wenzelm@53302
   675
  }
wenzelm@49529
   676
  moreover
wenzelm@53302
   677
  {
wenzelm@53302
   678
    assume ?rhs
wenzelm@53302
   679
    then obtain v u where vu: "setsum u s = w - v"  "(\<Sum>x\<in>s. u x *\<^sub>R x) = y - v *\<^sub>R a"
wenzelm@53302
   680
      by auto
wenzelm@53302
   681
    have *: "\<And>x M. (if x = a then v else M) *\<^sub>R x = (if x = a then v *\<^sub>R x else M *\<^sub>R x)"
wenzelm@53302
   682
      by auto
wenzelm@49529
   683
    have ?lhs
wenzelm@49529
   684
    proof (cases "a \<in> s")
wenzelm@49529
   685
      case True
wenzelm@49529
   686
      then show ?thesis
wenzelm@49529
   687
        apply (rule_tac x="\<lambda>x. (if x=a then v else 0) + u x" in exI)
wenzelm@53333
   688
        unfolding setsum_clauses(2)[OF `?as`]
wenzelm@53333
   689
        apply simp
wenzelm@49531
   690
        unfolding scaleR_left_distrib and setsum_addf
himmelma@33175
   691
        unfolding vu and * and scaleR_zero_left
wenzelm@49529
   692
        apply (auto simp add: setsum_delta[OF `?as`])
wenzelm@49529
   693
        done
himmelma@33175
   694
    next
wenzelm@49531
   695
      case False
wenzelm@49529
   696
      then have **:
wenzelm@49529
   697
        "\<And>x. x \<in> s \<Longrightarrow> u x = (if x = a then v else u x)"
wenzelm@49529
   698
        "\<And>x. x \<in> s \<Longrightarrow> u x *\<^sub>R x = (if x = a then v *\<^sub>R x else u x *\<^sub>R x)" by auto
himmelma@33175
   699
      from False show ?thesis
wenzelm@49529
   700
        apply (rule_tac x="\<lambda>x. if x=a then v else u x" in exI)
himmelma@33175
   701
        unfolding setsum_clauses(2)[OF `?as`] and * using vu
himmelma@33175
   702
        using setsum_cong2[of s "\<lambda>x. u x *\<^sub>R x" "\<lambda>x. if x = a then v *\<^sub>R x else u x *\<^sub>R x", OF **(2)]
wenzelm@49529
   703
        using setsum_cong2[of s u "\<lambda>x. if x = a then v else u x", OF **(1)]
wenzelm@49529
   704
        apply auto
wenzelm@49529
   705
        done
wenzelm@49529
   706
    qed
wenzelm@49529
   707
  }
himmelma@33175
   708
  ultimately show "?lhs = ?rhs" by blast
himmelma@33175
   709
qed
himmelma@33175
   710
himmelma@33175
   711
lemma affine_hull_2:
himmelma@33175
   712
  fixes a b :: "'a::real_vector"
wenzelm@53302
   713
  shows "affine hull {a,b} = {u *\<^sub>R a + v *\<^sub>R b| u v. (u + v = 1)}"
wenzelm@53302
   714
  (is "?lhs = ?rhs")
wenzelm@49529
   715
proof -
wenzelm@49529
   716
  have *:
wenzelm@49531
   717
    "\<And>x y z. z = x - y \<longleftrightarrow> y + z = (x::real)"
wenzelm@49529
   718
    "\<And>x y z. z = x - y \<longleftrightarrow> y + z = (x::'a)" by auto
himmelma@33175
   719
  have "?lhs = {y. \<exists>u. setsum u {a, b} = 1 \<and> (\<Sum>v\<in>{a, b}. u v *\<^sub>R v) = y}"
himmelma@33175
   720
    using affine_hull_finite[of "{a,b}"] by auto
himmelma@33175
   721
  also have "\<dots> = {y. \<exists>v u. u b = 1 - v \<and> u b *\<^sub>R b = y - v *\<^sub>R a}"
wenzelm@49529
   722
    by (simp add: affine_hull_finite_step(2)[of "{b}" a])
himmelma@33175
   723
  also have "\<dots> = ?rhs" unfolding * by auto
himmelma@33175
   724
  finally show ?thesis by auto
himmelma@33175
   725
qed
himmelma@33175
   726
himmelma@33175
   727
lemma affine_hull_3:
himmelma@33175
   728
  fixes a b c :: "'a::real_vector"
wenzelm@53302
   729
  shows "affine hull {a,b,c} = { u *\<^sub>R a + v *\<^sub>R b + w *\<^sub>R c| u v w. u + v + w = 1}"
wenzelm@49529
   730
proof -
wenzelm@49529
   731
  have *:
wenzelm@49531
   732
    "\<And>x y z. z = x - y \<longleftrightarrow> y + z = (x::real)"
wenzelm@49529
   733
    "\<And>x y z. z = x - y \<longleftrightarrow> y + z = (x::'a)" by auto
wenzelm@49529
   734
  show ?thesis
wenzelm@49529
   735
    apply (simp add: affine_hull_finite affine_hull_finite_step)
wenzelm@49529
   736
    unfolding *
wenzelm@49529
   737
    apply auto
wenzelm@53302
   738
    apply (rule_tac x=v in exI)
wenzelm@53302
   739
    apply (rule_tac x=va in exI)
wenzelm@53302
   740
    apply auto
wenzelm@53302
   741
    apply (rule_tac x=u in exI)
wenzelm@53302
   742
    apply force
wenzelm@49529
   743
    done
himmelma@33175
   744
qed
himmelma@33175
   745
hoelzl@40377
   746
lemma mem_affine:
wenzelm@53333
   747
  assumes "affine S" "x \<in> S" "y \<in> S" "u + v = 1"
wenzelm@53333
   748
  shows "(u *\<^sub>R x + v *\<^sub>R y) \<in> S"
hoelzl@40377
   749
  using assms affine_def[of S] by auto
hoelzl@40377
   750
hoelzl@40377
   751
lemma mem_affine_3:
wenzelm@53333
   752
  assumes "affine S" "x \<in> S" "y \<in> S" "z \<in> S" "u + v + w = 1"
wenzelm@53333
   753
  shows "(u *\<^sub>R x + v *\<^sub>R y + w *\<^sub>R z) \<in> S"
wenzelm@49529
   754
proof -
wenzelm@53333
   755
  have "(u *\<^sub>R x + v *\<^sub>R y + w *\<^sub>R z) \<in> affine hull {x, y, z}"
wenzelm@49529
   756
    using affine_hull_3[of x y z] assms by auto
wenzelm@49529
   757
  moreover
wenzelm@49529
   758
  have "affine hull {x, y, z} <= affine hull S"
wenzelm@49529
   759
    using hull_mono[of "{x, y, z}" "S"] assms by auto
wenzelm@49529
   760
  moreover
wenzelm@49529
   761
  have "affine hull S = S" using assms affine_hull_eq[of S] by auto
wenzelm@49531
   762
  ultimately show ?thesis by auto
hoelzl@40377
   763
qed
hoelzl@40377
   764
hoelzl@40377
   765
lemma mem_affine_3_minus:
wenzelm@53333
   766
  assumes "affine S" "x \<in> S" "y \<in> S" "z \<in> S"
wenzelm@53333
   767
  shows "x + v *\<^sub>R (y-z) \<in> S"
wenzelm@53333
   768
  using mem_affine_3[of S x y z 1 v "-v"] assms
wenzelm@53333
   769
  by (simp add: algebra_simps)
hoelzl@40377
   770
hoelzl@40377
   771
huffman@44467
   772
subsubsection {* Some relations between affine hull and subspaces *}
himmelma@33175
   773
himmelma@33175
   774
lemma affine_hull_insert_subset_span:
wenzelm@49529
   775
  "affine hull (insert a s) \<subseteq> {a + v| v . v \<in> span {x - a | x . x \<in> s}}"
wenzelm@49529
   776
  unfolding subset_eq Ball_def
wenzelm@49529
   777
  unfolding affine_hull_explicit span_explicit mem_Collect_eq
wenzelm@50804
   778
  apply (rule, rule)
wenzelm@50804
   779
  apply (erule exE)+
wenzelm@50804
   780
  apply (erule conjE)+
wenzelm@49529
   781
proof -
wenzelm@49529
   782
  fix x t u
wenzelm@49529
   783
  assume as: "finite t" "t \<noteq> {}" "t \<subseteq> insert a s" "setsum u t = 1" "(\<Sum>v\<in>t. u v *\<^sub>R v) = x"
wenzelm@53333
   784
  have "(\<lambda>x. x - a) ` (t - {a}) \<subseteq> {x - a |x. x \<in> s}"
wenzelm@53333
   785
    using as(3) by auto
wenzelm@49529
   786
  then show "\<exists>v. x = a + v \<and> (\<exists>S u. finite S \<and> S \<subseteq> {x - a |x. x \<in> s} \<and> (\<Sum>v\<in>S. u v *\<^sub>R v) = v)"
wenzelm@49529
   787
    apply (rule_tac x="x - a" in exI)
himmelma@33175
   788
    apply (rule conjI, simp)
wenzelm@49529
   789
    apply (rule_tac x="(\<lambda>x. x - a) ` (t - {a})" in exI)
wenzelm@49529
   790
    apply (rule_tac x="\<lambda>x. u (x + a)" in exI)
himmelma@33175
   791
    apply (rule conjI) using as(1) apply simp
himmelma@33175
   792
    apply (erule conjI)
himmelma@33175
   793
    using as(1)
wenzelm@49529
   794
    apply (simp add: setsum_reindex[unfolded inj_on_def] scaleR_right_diff_distrib
wenzelm@49530
   795
      setsum_subtractf scaleR_left.setsum[symmetric] setsum_diff1 scaleR_left_diff_distrib)
wenzelm@49529
   796
    unfolding as
wenzelm@49529
   797
    apply simp
wenzelm@49529
   798
    done
wenzelm@49529
   799
qed
himmelma@33175
   800
himmelma@33175
   801
lemma affine_hull_insert_span:
himmelma@33175
   802
  assumes "a \<notin> s"
wenzelm@49529
   803
  shows "affine hull (insert a s) = {a + v | v . v \<in> span {x - a | x.  x \<in> s}}"
wenzelm@49529
   804
  apply (rule, rule affine_hull_insert_subset_span)
wenzelm@49529
   805
  unfolding subset_eq Ball_def
wenzelm@49529
   806
  unfolding affine_hull_explicit and mem_Collect_eq
wenzelm@49529
   807
proof (rule, rule, erule exE, erule conjE)
wenzelm@49531
   808
  fix y v
wenzelm@49529
   809
  assume "y = a + v" "v \<in> span {x - a |x. x \<in> s}"
wenzelm@53339
   810
  then obtain t u where obt: "finite t" "t \<subseteq> {x - a |x. x \<in> s}" "a + (\<Sum>v\<in>t. u v *\<^sub>R v) = y"
wenzelm@49529
   811
    unfolding span_explicit by auto
himmelma@33175
   812
  def f \<equiv> "(\<lambda>x. x + a) ` t"
wenzelm@53333
   813
  have f: "finite f" "f \<subseteq> s" "(\<Sum>v\<in>f. u (v - a) *\<^sub>R (v - a)) = y - a"
wenzelm@49529
   814
    unfolding f_def using obt by (auto simp add: setsum_reindex[unfolded inj_on_def])
wenzelm@53333
   815
  have *: "f \<inter> {a} = {}" "f \<inter> - {a} = f"
wenzelm@53333
   816
    using f(2) assms by auto
himmelma@33175
   817
  show "\<exists>sa u. finite sa \<and> sa \<noteq> {} \<and> sa \<subseteq> insert a s \<and> setsum u sa = 1 \<and> (\<Sum>v\<in>sa. u v *\<^sub>R v) = y"
wenzelm@49529
   818
    apply (rule_tac x = "insert a f" in exI)
wenzelm@49529
   819
    apply (rule_tac x = "\<lambda>x. if x=a then 1 - setsum (\<lambda>x. u (x - a)) f else u (x - a)" in exI)
wenzelm@53339
   820
    using assms and f
wenzelm@53339
   821
    unfolding setsum_clauses(2)[OF f(1)] and if_smult
hoelzl@35577
   822
    unfolding setsum_cases[OF f(1), of "\<lambda>x. x = a"]
wenzelm@49529
   823
    apply (auto simp add: setsum_subtractf scaleR_left.setsum algebra_simps *)
wenzelm@49529
   824
    done
wenzelm@49529
   825
qed
himmelma@33175
   826
himmelma@33175
   827
lemma affine_hull_span:
himmelma@33175
   828
  assumes "a \<in> s"
himmelma@33175
   829
  shows "affine hull s = {a + v | v. v \<in> span {x - a | x. x \<in> s - {a}}}"
himmelma@33175
   830
  using affine_hull_insert_span[of a "s - {a}", unfolded insert_Diff[OF assms]] by auto
himmelma@33175
   831
wenzelm@49529
   832
huffman@44467
   833
subsubsection {* Parallel affine sets *}
hoelzl@40377
   834
hoelzl@40377
   835
definition affine_parallel :: "'a::real_vector set => 'a::real_vector set => bool"
wenzelm@53339
   836
  where "affine_parallel S T \<longleftrightarrow> (\<exists>a. T = (\<lambda>x. a + x) ` S)"
hoelzl@40377
   837
hoelzl@40377
   838
lemma affine_parallel_expl_aux:
wenzelm@49529
   839
  fixes S T :: "'a::real_vector set"
wenzelm@53339
   840
  assumes "\<forall>x. x \<in> S \<longleftrightarrow> a + x \<in> T"
wenzelm@53339
   841
  shows "T = (\<lambda>x. a + x) ` S"
wenzelm@49529
   842
proof -
wenzelm@53302
   843
  {
wenzelm@53302
   844
    fix x
wenzelm@53339
   845
    assume "x \<in> T"
wenzelm@53339
   846
    then have "( - a) + x \<in> S"
wenzelm@53339
   847
      using assms by auto
wenzelm@53339
   848
    then have "x \<in> ((\<lambda>x. a + x) ` S)"
wenzelm@53333
   849
      using imageI[of "-a+x" S "(\<lambda>x. a+x)"] by auto
wenzelm@53302
   850
  }
wenzelm@53339
   851
  moreover have "T \<ge> (\<lambda>x. a + x) ` S"
wenzelm@53333
   852
    using assms by auto
wenzelm@49529
   853
  ultimately show ?thesis by auto
wenzelm@49529
   854
qed
wenzelm@49529
   855
wenzelm@53339
   856
lemma affine_parallel_expl: "affine_parallel S T \<longleftrightarrow> (\<exists>a. \<forall>x. x \<in> S \<longleftrightarrow> a + x \<in> T)"
wenzelm@49529
   857
  unfolding affine_parallel_def
wenzelm@49529
   858
  using affine_parallel_expl_aux[of S _ T] by auto
wenzelm@49529
   859
wenzelm@49529
   860
lemma affine_parallel_reflex: "affine_parallel S S"
wenzelm@53302
   861
  unfolding affine_parallel_def
wenzelm@53302
   862
  apply (rule exI[of _ "0"])
wenzelm@53302
   863
  apply auto
wenzelm@53302
   864
  done
hoelzl@40377
   865
hoelzl@40377
   866
lemma affine_parallel_commut:
wenzelm@49529
   867
  assumes "affine_parallel A B"
wenzelm@49529
   868
  shows "affine_parallel B A"
wenzelm@49529
   869
proof -
wenzelm@53333
   870
  from assms obtain a where "B = (\<lambda>x. a + x) ` A"
wenzelm@49529
   871
    unfolding affine_parallel_def by auto
wenzelm@49529
   872
  then show ?thesis
wenzelm@53333
   873
    using translation_galois [of B a A]
wenzelm@53333
   874
    unfolding affine_parallel_def by auto
hoelzl@40377
   875
qed
hoelzl@40377
   876
hoelzl@40377
   877
lemma affine_parallel_assoc:
wenzelm@53339
   878
  assumes "affine_parallel A B"
wenzelm@53339
   879
    and "affine_parallel B C"
wenzelm@49531
   880
  shows "affine_parallel A C"
wenzelm@49529
   881
proof -
wenzelm@53333
   882
  from assms obtain ab where "B = (\<lambda>x. ab + x) ` A"
wenzelm@49531
   883
    unfolding affine_parallel_def by auto
wenzelm@49531
   884
  moreover
wenzelm@53333
   885
  from assms obtain bc where "C = (\<lambda>x. bc + x) ` B"
wenzelm@49529
   886
    unfolding affine_parallel_def by auto
wenzelm@49529
   887
  ultimately show ?thesis
wenzelm@49529
   888
    using translation_assoc[of bc ab A] unfolding affine_parallel_def by auto
hoelzl@40377
   889
qed
hoelzl@40377
   890
hoelzl@40377
   891
lemma affine_translation_aux:
hoelzl@40377
   892
  fixes a :: "'a::real_vector"
wenzelm@53333
   893
  assumes "affine ((\<lambda>x. a + x) ` S)"
wenzelm@53333
   894
  shows "affine S"
wenzelm@53302
   895
proof -
wenzelm@53302
   896
  {
wenzelm@53302
   897
    fix x y u v
wenzelm@53333
   898
    assume xy: "x \<in> S" "y \<in> S" "(u :: real) + v = 1"
wenzelm@53333
   899
    then have "(a + x) \<in> ((\<lambda>x. a + x) ` S)" "(a + y) \<in> ((\<lambda>x. a + x) ` S)"
wenzelm@53333
   900
      by auto
wenzelm@53339
   901
    then have h1: "u *\<^sub>R  (a + x) + v *\<^sub>R (a + y) \<in> (\<lambda>x. a + x) ` S"
wenzelm@49529
   902
      using xy assms unfolding affine_def by auto
wenzelm@53339
   903
    have "u *\<^sub>R (a + x) + v *\<^sub>R (a + y) = (u + v) *\<^sub>R a + (u *\<^sub>R x + v *\<^sub>R y)"
wenzelm@49529
   904
      by (simp add: algebra_simps)
wenzelm@53339
   905
    also have "\<dots> = a + (u *\<^sub>R x + v *\<^sub>R y)"
wenzelm@53339
   906
      using `u + v = 1` by auto
wenzelm@53339
   907
    ultimately have "a + (u *\<^sub>R x + v *\<^sub>R y) \<in> (\<lambda>x. a + x) ` S"
wenzelm@53333
   908
      using h1 by auto
wenzelm@49529
   909
    then have "u *\<^sub>R x + v *\<^sub>R y : S" by auto
wenzelm@49529
   910
  }
wenzelm@49529
   911
  then show ?thesis unfolding affine_def by auto
hoelzl@40377
   912
qed
hoelzl@40377
   913
hoelzl@40377
   914
lemma affine_translation:
hoelzl@40377
   915
  fixes a :: "'a::real_vector"
wenzelm@53339
   916
  shows "affine S \<longleftrightarrow> affine ((\<lambda>x. a + x) ` S)"
wenzelm@49529
   917
proof -
wenzelm@53339
   918
  have "affine S \<Longrightarrow> affine ((\<lambda>x. a + x) ` S)"
wenzelm@53339
   919
    using affine_translation_aux[of "-a" "((\<lambda>x. a + x) ` S)"]
wenzelm@49529
   920
    using translation_assoc[of "-a" a S] by auto
wenzelm@49529
   921
  then show ?thesis using affine_translation_aux by auto
hoelzl@40377
   922
qed
hoelzl@40377
   923
hoelzl@40377
   924
lemma parallel_is_affine:
wenzelm@49529
   925
  fixes S T :: "'a::real_vector set"
wenzelm@49529
   926
  assumes "affine S" "affine_parallel S T"
wenzelm@49529
   927
  shows "affine T"
wenzelm@49529
   928
proof -
wenzelm@53339
   929
  from assms obtain a where "T = (\<lambda>x. a + x) ` S"
wenzelm@49531
   930
    unfolding affine_parallel_def by auto
wenzelm@53339
   931
  then show ?thesis
wenzelm@53339
   932
    using affine_translation assms by auto
hoelzl@40377
   933
qed
hoelzl@40377
   934
huffman@44361
   935
lemma subspace_imp_affine: "subspace s \<Longrightarrow> affine s"
hoelzl@40377
   936
  unfolding subspace_def affine_def by auto
hoelzl@40377
   937
wenzelm@49529
   938
huffman@44467
   939
subsubsection {* Subspace parallel to an affine set *}
hoelzl@40377
   940
wenzelm@53339
   941
lemma subspace_affine: "subspace S \<longleftrightarrow> affine S \<and> 0 \<in> S"
wenzelm@49529
   942
proof -
wenzelm@53333
   943
  have h0: "subspace S \<Longrightarrow> affine S \<and> 0 \<in> S"
wenzelm@49529
   944
    using subspace_imp_affine[of S] subspace_0 by auto
wenzelm@53302
   945
  {
wenzelm@53333
   946
    assume assm: "affine S \<and> 0 \<in> S"
wenzelm@53302
   947
    {
wenzelm@53302
   948
      fix c :: real
wenzelm@53333
   949
      fix x assume x_def: "x \<in> S"
wenzelm@49529
   950
      have "c *\<^sub>R x = (1-c) *\<^sub>R 0 + c *\<^sub>R x" by auto
wenzelm@49529
   951
      moreover
wenzelm@53339
   952
      have "(1 - c) *\<^sub>R 0 + c *\<^sub>R x \<in> S"
wenzelm@53302
   953
        using affine_alt[of S] assm x_def by auto
wenzelm@53333
   954
      ultimately have "c *\<^sub>R x \<in> S" by auto
wenzelm@49529
   955
    }
wenzelm@53333
   956
    then have h1: "\<forall>c. \<forall>x \<in> S. c *\<^sub>R x \<in> S" by auto
wenzelm@49529
   957
wenzelm@53302
   958
    {
wenzelm@53302
   959
      fix x y
wenzelm@53302
   960
      assume xy_def: "x \<in> S" "y \<in> S"
wenzelm@49529
   961
      def u == "(1 :: real)/2"
wenzelm@53302
   962
      have "(1/2) *\<^sub>R (x+y) = (1/2) *\<^sub>R (x+y)"
wenzelm@53302
   963
        by auto
wenzelm@49529
   964
      moreover
wenzelm@53302
   965
      have "(1/2) *\<^sub>R (x+y)=(1/2) *\<^sub>R x + (1-(1/2)) *\<^sub>R y"
wenzelm@53302
   966
        by (simp add: algebra_simps)
wenzelm@49529
   967
      moreover
wenzelm@53333
   968
      have "(1-u) *\<^sub>R x + u *\<^sub>R y \<in> S"
wenzelm@53302
   969
        using affine_alt[of S] assm xy_def by auto
wenzelm@49529
   970
      ultimately
wenzelm@53333
   971
      have "(1/2) *\<^sub>R (x+y) \<in> S"
wenzelm@53302
   972
        using u_def by auto
wenzelm@49529
   973
      moreover
wenzelm@53302
   974
      have "(x+y) = 2 *\<^sub>R ((1/2) *\<^sub>R (x+y))"
wenzelm@53302
   975
        by auto
wenzelm@49529
   976
      ultimately
wenzelm@53333
   977
      have "(x+y) \<in> S"
wenzelm@53302
   978
        using h1[rule_format, of "(1/2) *\<^sub>R (x+y)" "2"] by auto
wenzelm@49529
   979
    }
wenzelm@53302
   980
    then have "\<forall>x \<in> S. \<forall>y \<in> S. x + y \<in> S"
wenzelm@53302
   981
      by auto
wenzelm@53302
   982
    then have "subspace S"
wenzelm@53302
   983
      using h1 assm unfolding subspace_def by auto
wenzelm@49529
   984
  }
wenzelm@49529
   985
  then show ?thesis using h0 by metis
hoelzl@40377
   986
qed
hoelzl@40377
   987
hoelzl@40377
   988
lemma affine_diffs_subspace:
wenzelm@53333
   989
  assumes "affine S" "a \<in> S"
wenzelm@53302
   990
  shows "subspace ((\<lambda>x. (-a)+x) ` S)"
wenzelm@49529
   991
proof -
wenzelm@53302
   992
  have "affine ((\<lambda>x. (-a)+x) ` S)"
wenzelm@49531
   993
    using  affine_translation assms by auto
wenzelm@53302
   994
  moreover have "0 : ((\<lambda>x. (-a)+x) ` S)"
wenzelm@53333
   995
    using assms exI[of "(\<lambda>x. x\<in>S \<and> -a+x = 0)" a] by auto
wenzelm@49531
   996
  ultimately show ?thesis using subspace_affine by auto
hoelzl@40377
   997
qed
hoelzl@40377
   998
hoelzl@40377
   999
lemma parallel_subspace_explicit:
wenzelm@49529
  1000
  assumes "affine S" "a : S"
wenzelm@53302
  1001
  assumes "L \<equiv> {y. \<exists>x \<in> S. (-a)+x=y}"
wenzelm@49531
  1002
  shows "subspace L & affine_parallel S L"
wenzelm@49529
  1003
proof -
wenzelm@49529
  1004
  have par: "affine_parallel S L"
wenzelm@49529
  1005
    unfolding affine_parallel_def using assms by auto
wenzelm@49531
  1006
  then have "affine L" using assms parallel_is_affine by auto
wenzelm@53302
  1007
  moreover have "0 \<in> L"
wenzelm@53302
  1008
    using assms
wenzelm@53302
  1009
    apply auto
wenzelm@53339
  1010
    using exI[of "(\<lambda>x. x:S \<and> -a+x=0)" a]
wenzelm@53302
  1011
    apply auto
wenzelm@49529
  1012
    done
wenzelm@53302
  1013
  ultimately show ?thesis
wenzelm@53302
  1014
    using subspace_affine par by auto
hoelzl@40377
  1015
qed
hoelzl@40377
  1016
hoelzl@40377
  1017
lemma parallel_subspace_aux:
wenzelm@53302
  1018
  assumes "subspace A"
wenzelm@53302
  1019
    and "subspace B"
wenzelm@53302
  1020
    and "affine_parallel A B"
wenzelm@53302
  1021
  shows "A \<supseteq> B"
wenzelm@49529
  1022
proof -
wenzelm@53339
  1023
  from assms obtain a where a_def: "\<forall>x. x \<in> A \<longleftrightarrow> a + x \<in> B"
wenzelm@49529
  1024
    using affine_parallel_expl[of A B] by auto
wenzelm@53302
  1025
  then have "-a \<in> A"
wenzelm@53302
  1026
    using assms subspace_0[of B] by auto
wenzelm@53302
  1027
  then have "a \<in> A"
wenzelm@53302
  1028
    using assms subspace_neg[of A "-a"] by auto
wenzelm@53302
  1029
  then show ?thesis
wenzelm@53302
  1030
    using assms a_def unfolding subspace_def by auto
hoelzl@40377
  1031
qed
hoelzl@40377
  1032
hoelzl@40377
  1033
lemma parallel_subspace:
wenzelm@53302
  1034
  assumes "subspace A"
wenzelm@53302
  1035
    and "subspace B"
wenzelm@53302
  1036
    and "affine_parallel A B"
wenzelm@49529
  1037
  shows "A = B"
wenzelm@49529
  1038
proof
wenzelm@53302
  1039
  show "A \<supseteq> B"
wenzelm@49529
  1040
    using assms parallel_subspace_aux by auto
wenzelm@53302
  1041
  show "A \<subseteq> B"
wenzelm@49529
  1042
    using assms parallel_subspace_aux[of B A] affine_parallel_commut by auto
hoelzl@40377
  1043
qed
hoelzl@40377
  1044
hoelzl@40377
  1045
lemma affine_parallel_subspace:
wenzelm@53302
  1046
  assumes "affine S" "S \<noteq> {}"
wenzelm@53339
  1047
  shows "\<exists>!L. subspace L \<and> affine_parallel S L"
wenzelm@49529
  1048
proof -
wenzelm@53339
  1049
  have ex: "\<exists>L. subspace L \<and> affine_parallel S L"
wenzelm@49531
  1050
    using assms parallel_subspace_explicit by auto
wenzelm@53302
  1051
  {
wenzelm@53302
  1052
    fix L1 L2
wenzelm@53339
  1053
    assume ass: "subspace L1 \<and> affine_parallel S L1" "subspace L2 \<and> affine_parallel S L2"
wenzelm@49529
  1054
    then have "affine_parallel L1 L2"
wenzelm@49529
  1055
      using affine_parallel_commut[of S L1] affine_parallel_assoc[of L1 S L2] by auto
wenzelm@49529
  1056
    then have "L1 = L2"
wenzelm@49529
  1057
      using ass parallel_subspace by auto
wenzelm@49529
  1058
  }
wenzelm@49529
  1059
  then show ?thesis using ex by auto
wenzelm@49529
  1060
qed
wenzelm@49529
  1061
hoelzl@40377
  1062
huffman@44467
  1063
subsection {* Cones *}
himmelma@33175
  1064
wenzelm@49529
  1065
definition cone :: "'a::real_vector set \<Rightarrow> bool"
wenzelm@53339
  1066
  where "cone s \<longleftrightarrow> (\<forall>x\<in>s. \<forall>c\<ge>0. c *\<^sub>R x \<in> s)"
himmelma@33175
  1067
himmelma@33175
  1068
lemma cone_empty[intro, simp]: "cone {}"
himmelma@33175
  1069
  unfolding cone_def by auto
himmelma@33175
  1070
himmelma@33175
  1071
lemma cone_univ[intro, simp]: "cone UNIV"
himmelma@33175
  1072
  unfolding cone_def by auto
himmelma@33175
  1073
wenzelm@53339
  1074
lemma cone_Inter[intro]: "\<forall>s\<in>f. cone s \<Longrightarrow> cone (\<Inter>f)"
himmelma@33175
  1075
  unfolding cone_def by auto
himmelma@33175
  1076
wenzelm@49529
  1077
huffman@44467
  1078
subsubsection {* Conic hull *}
himmelma@33175
  1079
himmelma@33175
  1080
lemma cone_cone_hull: "cone (cone hull s)"
huffman@44170
  1081
  unfolding hull_def by auto
himmelma@33175
  1082
wenzelm@53302
  1083
lemma cone_hull_eq: "cone hull s = s \<longleftrightarrow> cone s"
wenzelm@49529
  1084
  apply (rule hull_eq)
wenzelm@53302
  1085
  using cone_Inter
wenzelm@53302
  1086
  unfolding subset_eq
wenzelm@53302
  1087
  apply auto
wenzelm@49529
  1088
  done
himmelma@33175
  1089
hoelzl@40377
  1090
lemma mem_cone:
wenzelm@53302
  1091
  assumes "cone S" "x \<in> S" "c \<ge> 0"
hoelzl@40377
  1092
  shows "c *\<^sub>R x : S"
hoelzl@40377
  1093
  using assms cone_def[of S] by auto
hoelzl@40377
  1094
hoelzl@40377
  1095
lemma cone_contains_0:
wenzelm@49529
  1096
  assumes "cone S"
wenzelm@53302
  1097
  shows "S \<noteq> {} \<longleftrightarrow> 0 \<in> S"
wenzelm@49529
  1098
proof -
wenzelm@53302
  1099
  {
wenzelm@53302
  1100
    assume "S \<noteq> {}"
wenzelm@53302
  1101
    then obtain a where "a \<in> S" by auto
wenzelm@53302
  1102
    then have "0 \<in> S"
wenzelm@53302
  1103
      using assms mem_cone[of S a 0] by auto
wenzelm@49529
  1104
  }
wenzelm@49529
  1105
  then show ?thesis by auto
hoelzl@40377
  1106
qed
hoelzl@40377
  1107
huffman@44361
  1108
lemma cone_0: "cone {0}"
wenzelm@49529
  1109
  unfolding cone_def by auto
hoelzl@40377
  1110
wenzelm@53302
  1111
lemma cone_Union[intro]: "(\<forall>s\<in>f. cone s) \<longrightarrow> cone (Union f)"
hoelzl@40377
  1112
  unfolding cone_def by blast
hoelzl@40377
  1113
hoelzl@40377
  1114
lemma cone_iff:
wenzelm@49529
  1115
  assumes "S ~= {}"
wenzelm@53339
  1116
  shows "cone S \<longleftrightarrow> 0 \<in> S & (\<forall>c. c > 0 \<longrightarrow> (op *\<^sub>R c) ` S = S)"
wenzelm@49529
  1117
proof -
wenzelm@53302
  1118
  {
wenzelm@53302
  1119
    assume "cone S"
wenzelm@53302
  1120
    {
wenzelm@53302
  1121
      fix c
wenzelm@49529
  1122
      assume "(c :: real) > 0"
wenzelm@53302
  1123
      {
wenzelm@53302
  1124
        fix x
wenzelm@49529
  1125
        assume "x : S"
wenzelm@49529
  1126
        then have "x : (op *\<^sub>R c) ` S"
wenzelm@49529
  1127
          unfolding image_def
wenzelm@49529
  1128
          using `cone S` `c>0` mem_cone[of S x "1/c"]
wenzelm@53302
  1129
            exI[of "(%t. t:S & x = c *\<^sub>R t)" "(1 / c) *\<^sub>R x"]
wenzelm@53302
  1130
          apply auto
wenzelm@49529
  1131
          done
wenzelm@49529
  1132
      }
wenzelm@49529
  1133
      moreover
wenzelm@53302
  1134
      {
wenzelm@53302
  1135
        fix x
wenzelm@53302
  1136
        assume "x : (op *\<^sub>R c) ` S"
wenzelm@49529
  1137
        (*from this obtain t where "t:S & x = c *\<^sub>R t" by auto*)
wenzelm@49529
  1138
        then have "x:S"
wenzelm@49529
  1139
          using `cone S` `c>0` unfolding cone_def image_def `c>0` by auto
wenzelm@49529
  1140
      }
wenzelm@53302
  1141
      ultimately have "(op *\<^sub>R c) ` S = S" by auto
hoelzl@40377
  1142
    }
wenzelm@53339
  1143
    then have "0 \<in> S \<and> (\<forall>c. c > 0 \<longrightarrow> (op *\<^sub>R c) ` S = S)"
wenzelm@49529
  1144
      using `cone S` cone_contains_0[of S] assms by auto
wenzelm@49529
  1145
  }
wenzelm@49529
  1146
  moreover
wenzelm@53302
  1147
  {
wenzelm@53339
  1148
    assume a: "0 \<in> S \<and> (\<forall>c. c > 0 \<longrightarrow> (op *\<^sub>R c) ` S = S)"
wenzelm@53302
  1149
    {
wenzelm@53302
  1150
      fix x
wenzelm@53302
  1151
      assume "x \<in> S"
wenzelm@49529
  1152
      fix c1
wenzelm@53302
  1153
      assume "(c1 :: real) \<ge> 0"
wenzelm@53302
  1154
      then have "c1 = 0 | c1 > 0" by auto
wenzelm@53302
  1155
      then have "c1 *\<^sub>R x : S" using a `x \<in> S` by auto
wenzelm@49529
  1156
    }
wenzelm@49529
  1157
    then have "cone S" unfolding cone_def by auto
hoelzl@40377
  1158
  }
wenzelm@49529
  1159
  ultimately show ?thesis by blast
wenzelm@49529
  1160
qed
wenzelm@49529
  1161
wenzelm@49529
  1162
lemma cone_hull_empty: "cone hull {} = {}"
wenzelm@49529
  1163
  by (metis cone_empty cone_hull_eq)
wenzelm@49529
  1164
wenzelm@53302
  1165
lemma cone_hull_empty_iff: "S = {} \<longleftrightarrow> cone hull S = {}"
wenzelm@49529
  1166
  by (metis bot_least cone_hull_empty hull_subset xtrans(5))
wenzelm@49529
  1167
wenzelm@53302
  1168
lemma cone_hull_contains_0: "S \<noteq> {} \<longleftrightarrow> 0 \<in> cone hull S"
wenzelm@49529
  1169
  using cone_cone_hull[of S] cone_contains_0[of "cone hull S"] cone_hull_empty_iff[of S]
wenzelm@49529
  1170
  by auto
hoelzl@40377
  1171
hoelzl@40377
  1172
lemma mem_cone_hull:
wenzelm@53302
  1173
  assumes "x : S" "c \<ge> 0"
wenzelm@53302
  1174
  shows "c *\<^sub>R x \<in> cone hull S"
wenzelm@49529
  1175
  by (metis assms cone_cone_hull hull_inc mem_cone)
wenzelm@49529
  1176
wenzelm@53339
  1177
lemma cone_hull_expl: "cone hull S = {c *\<^sub>R x | c x. c \<ge> 0 \<and> x \<in> S}"
wenzelm@53339
  1178
  (is "?lhs = ?rhs")
wenzelm@49529
  1179
proof -
wenzelm@53302
  1180
  {
wenzelm@53302
  1181
    fix x
wenzelm@53302
  1182
    assume "x \<in> ?rhs"
wenzelm@53339
  1183
    then obtain cx xx where x_def: "x = cx *\<^sub>R xx" "(cx :: real) \<ge> 0" "xx \<in> S"
wenzelm@49529
  1184
      by auto
wenzelm@49529
  1185
    fix c
wenzelm@53302
  1186
    assume c_def: "(c :: real) \<ge> 0"
wenzelm@53339
  1187
    then have "c *\<^sub>R x = (c * cx) *\<^sub>R xx"
wenzelm@49529
  1188
      using x_def by (simp add: algebra_simps)
wenzelm@49529
  1189
    moreover
wenzelm@53302
  1190
    have "c * cx \<ge> 0"
wenzelm@49529
  1191
      using c_def x_def using mult_nonneg_nonneg by auto
wenzelm@49529
  1192
    ultimately
wenzelm@53302
  1193
    have "c *\<^sub>R x \<in> ?rhs" using x_def by auto
wenzelm@53302
  1194
  }
wenzelm@53302
  1195
  then have "cone ?rhs" unfolding cone_def by auto
wenzelm@49529
  1196
  then have "?rhs : Collect cone" unfolding mem_Collect_eq by auto
wenzelm@53302
  1197
  {
wenzelm@53302
  1198
    fix x
wenzelm@53302
  1199
    assume "x \<in> S"
wenzelm@53302
  1200
    then have "1 *\<^sub>R x \<in> ?rhs"
wenzelm@49531
  1201
      apply auto
wenzelm@49529
  1202
      apply (rule_tac x="1" in exI)
wenzelm@49529
  1203
      apply auto
wenzelm@49529
  1204
      done
wenzelm@53302
  1205
    then have "x \<in> ?rhs" by auto
wenzelm@53302
  1206
  } then have "S \<subseteq> ?rhs" by auto
wenzelm@53302
  1207
  then have "?lhs \<subseteq> ?rhs"
wenzelm@53302
  1208
    using `?rhs \<in> Collect cone` hull_minimal[of S "?rhs" "cone"] by auto
wenzelm@49529
  1209
  moreover
wenzelm@53302
  1210
  {
wenzelm@53302
  1211
    fix x
wenzelm@53302
  1212
    assume "x \<in> ?rhs"
wenzelm@53339
  1213
    then obtain cx xx where x_def: "x = cx *\<^sub>R xx" "(cx :: real) \<ge> 0" "xx \<in> S"
wenzelm@53339
  1214
      by auto
wenzelm@53339
  1215
    then have "xx \<in> cone hull S"
wenzelm@53339
  1216
      using hull_subset[of S] by auto
wenzelm@53302
  1217
    then have "x \<in> ?lhs"
wenzelm@49529
  1218
      using x_def cone_cone_hull[of S] cone_def[of "cone hull S"] by auto
wenzelm@49529
  1219
  }
wenzelm@49529
  1220
  ultimately show ?thesis by auto
hoelzl@40377
  1221
qed
hoelzl@40377
  1222
hoelzl@40377
  1223
lemma cone_closure:
huffman@44524
  1224
  fixes S :: "('a::real_normed_vector) set"
wenzelm@49529
  1225
  assumes "cone S"
wenzelm@49529
  1226
  shows "cone (closure S)"
wenzelm@49529
  1227
proof (cases "S = {}")
wenzelm@49529
  1228
  case True
wenzelm@49529
  1229
  then show ?thesis by auto
wenzelm@49529
  1230
next
wenzelm@49529
  1231
  case False
wenzelm@53339
  1232
  then have "0 \<in> S \<and> (\<forall>c. c > 0 \<longrightarrow> op *\<^sub>R c ` S = S)"
wenzelm@49529
  1233
    using cone_iff[of S] assms by auto
wenzelm@53339
  1234
  then have "0 \<in> closure S \<and> (\<forall>c. c > 0 \<longrightarrow> op *\<^sub>R c ` closure S = closure S)"
wenzelm@49529
  1235
    using closure_subset by (auto simp add: closure_scaleR)
wenzelm@53339
  1236
  then show ?thesis
wenzelm@53339
  1237
    using cone_iff[of "closure S"] by auto
wenzelm@49529
  1238
qed
wenzelm@49529
  1239
hoelzl@40377
  1240
huffman@44467
  1241
subsection {* Affine dependence and consequential theorems (from Lars Schewe) *}
himmelma@33175
  1242
wenzelm@49529
  1243
definition affine_dependent :: "'a::real_vector set \<Rightarrow> bool"
wenzelm@53339
  1244
  where "affine_dependent s \<longleftrightarrow> (\<exists>x\<in>s. x \<in> affine hull (s - {x}))"
himmelma@33175
  1245
himmelma@33175
  1246
lemma affine_dependent_explicit:
himmelma@33175
  1247
  "affine_dependent p \<longleftrightarrow>
himmelma@33175
  1248
    (\<exists>s u. finite s \<and> s \<subseteq> p \<and> setsum u s = 0 \<and>
himmelma@33175
  1249
    (\<exists>v\<in>s. u v \<noteq> 0) \<and> setsum (\<lambda>v. u v *\<^sub>R v) s = 0)"
wenzelm@49529
  1250
  unfolding affine_dependent_def affine_hull_explicit mem_Collect_eq
wenzelm@49529
  1251
  apply rule
wenzelm@49529
  1252
  apply (erule bexE, erule exE, erule exE)
wenzelm@49529
  1253
  apply (erule conjE)+
wenzelm@49529
  1254
  defer
wenzelm@49529
  1255
  apply (erule exE, erule exE)
wenzelm@49529
  1256
  apply (erule conjE)+
wenzelm@49529
  1257
  apply (erule bexE)
wenzelm@49529
  1258
proof -
wenzelm@49529
  1259
  fix x s u
wenzelm@49529
  1260
  assume as: "x \<in> p" "finite s" "s \<noteq> {}" "s \<subseteq> p - {x}" "setsum u s = 1" "(\<Sum>v\<in>s. u v *\<^sub>R v) = x"
wenzelm@53302
  1261
  have "x \<notin> s" using as(1,4) by auto
himmelma@33175
  1262
  show "\<exists>s u. finite s \<and> s \<subseteq> p \<and> setsum u s = 0 \<and> (\<exists>v\<in>s. u v \<noteq> 0) \<and> (\<Sum>v\<in>s. u v *\<^sub>R v) = 0"
wenzelm@49529
  1263
    apply (rule_tac x="insert x s" in exI, rule_tac x="\<lambda>v. if v = x then - 1 else u v" in exI)
wenzelm@49529
  1264
    unfolding if_smult and setsum_clauses(2)[OF as(2)] and setsum_delta_notmem[OF `x\<notin>s`] and as
wenzelm@53339
  1265
    using as
wenzelm@53339
  1266
    apply auto
wenzelm@49529
  1267
    done
himmelma@33175
  1268
next
wenzelm@49529
  1269
  fix s u v
wenzelm@53302
  1270
  assume as: "finite s" "s \<subseteq> p" "setsum u s = 0" "(\<Sum>v\<in>s. u v *\<^sub>R v) = 0" "v \<in> s" "u v \<noteq> 0"
wenzelm@53339
  1271
  have "s \<noteq> {v}"
wenzelm@53339
  1272
    using as(3,6) by auto
wenzelm@49529
  1273
  then show "\<exists>x\<in>p. \<exists>s u. finite s \<and> s \<noteq> {} \<and> s \<subseteq> p - {x} \<and> setsum u s = 1 \<and> (\<Sum>v\<in>s. u v *\<^sub>R v) = x"
wenzelm@53302
  1274
    apply (rule_tac x=v in bexI)
wenzelm@53302
  1275
    apply (rule_tac x="s - {v}" in exI)
wenzelm@53302
  1276
    apply (rule_tac x="\<lambda>x. - (1 / u v) * u x" in exI)
wenzelm@49530
  1277
    unfolding scaleR_scaleR[symmetric] and scaleR_right.setsum [symmetric]
wenzelm@49530
  1278
    unfolding setsum_right_distrib[symmetric] and setsum_diff1[OF as(1)]
wenzelm@53302
  1279
    using as
wenzelm@53302
  1280
    apply auto
wenzelm@49529
  1281
    done
himmelma@33175
  1282
qed
himmelma@33175
  1283
himmelma@33175
  1284
lemma affine_dependent_explicit_finite:
wenzelm@49529
  1285
  fixes s :: "'a::real_vector set"
wenzelm@49529
  1286
  assumes "finite s"
wenzelm@53302
  1287
  shows "affine_dependent s \<longleftrightarrow>
wenzelm@53302
  1288
    (\<exists>u. setsum u s = 0 \<and> (\<exists>v\<in>s. u v \<noteq> 0) \<and> setsum (\<lambda>v. u v *\<^sub>R v) s = 0)"
himmelma@33175
  1289
  (is "?lhs = ?rhs")
himmelma@33175
  1290
proof
wenzelm@49529
  1291
  have *: "\<And>vt u v. (if vt then u v else 0) *\<^sub>R v = (if vt then (u v) *\<^sub>R v else (0::'a))"
wenzelm@49529
  1292
    by auto
himmelma@33175
  1293
  assume ?lhs
wenzelm@49529
  1294
  then obtain t u v where
wenzelm@53339
  1295
    "finite t" "t \<subseteq> s" "setsum u t = 0" "v\<in>t" "u v \<noteq> 0"  "(\<Sum>v\<in>t. u v *\<^sub>R v) = 0"
himmelma@33175
  1296
    unfolding affine_dependent_explicit by auto
wenzelm@49529
  1297
  then show ?rhs
wenzelm@49529
  1298
    apply (rule_tac x="\<lambda>x. if x\<in>t then u x else 0" in exI)
wenzelm@49530
  1299
    apply auto unfolding * and setsum_restrict_set[OF assms, symmetric]
wenzelm@49529
  1300
    unfolding Int_absorb1[OF `t\<subseteq>s`]
wenzelm@49529
  1301
    apply auto
wenzelm@49529
  1302
    done
himmelma@33175
  1303
next
himmelma@33175
  1304
  assume ?rhs
wenzelm@53339
  1305
  then obtain u v where "setsum u s = 0"  "v\<in>s" "u v \<noteq> 0" "(\<Sum>v\<in>s. u v *\<^sub>R v) = 0"
wenzelm@53339
  1306
    by auto
wenzelm@49529
  1307
  then show ?lhs unfolding affine_dependent_explicit
wenzelm@49529
  1308
    using assms by auto
wenzelm@49529
  1309
qed
wenzelm@49529
  1310
himmelma@33175
  1311
huffman@44465
  1312
subsection {* Connectedness of convex sets *}
huffman@44465
  1313
hoelzl@51480
  1314
lemma connectedD:
hoelzl@51480
  1315
  "connected S \<Longrightarrow> open A \<Longrightarrow> open B \<Longrightarrow> S \<subseteq> A \<union> B \<Longrightarrow> A \<inter> B \<inter> S = {} \<Longrightarrow> A \<inter> S = {} \<or> B \<inter> S = {}"
hoelzl@51480
  1316
  by (metis connected_def)
himmelma@33175
  1317
himmelma@33175
  1318
lemma convex_connected:
himmelma@33175
  1319
  fixes s :: "'a::real_normed_vector set"
wenzelm@53302
  1320
  assumes "convex s"
wenzelm@53302
  1321
  shows "connected s"
hoelzl@51480
  1322
proof (rule connectedI)
hoelzl@51480
  1323
  fix A B
hoelzl@51480
  1324
  assume "open A" "open B" "A \<inter> B \<inter> s = {}" "s \<subseteq> A \<union> B"
hoelzl@51480
  1325
  moreover
hoelzl@51480
  1326
  assume "A \<inter> s \<noteq> {}" "B \<inter> s \<noteq> {}"
hoelzl@51480
  1327
  then obtain a b where a: "a \<in> A" "a \<in> s" and b: "b \<in> B" "b \<in> s" by auto
hoelzl@51480
  1328
  def f \<equiv> "\<lambda>u. u *\<^sub>R a + (1 - u) *\<^sub>R b"
hoelzl@51480
  1329
  then have "continuous_on {0 .. 1} f"
hoelzl@51480
  1330
    by (auto intro!: continuous_on_intros)
hoelzl@51480
  1331
  then have "connected (f ` {0 .. 1})"
hoelzl@51480
  1332
    by (auto intro!: connected_continuous_image)
hoelzl@51480
  1333
  note connectedD[OF this, of A B]
hoelzl@51480
  1334
  moreover have "a \<in> A \<inter> f ` {0 .. 1}"
hoelzl@51480
  1335
    using a by (auto intro!: image_eqI[of _ _ 1] simp: f_def)
hoelzl@51480
  1336
  moreover have "b \<in> B \<inter> f ` {0 .. 1}"
hoelzl@51480
  1337
    using b by (auto intro!: image_eqI[of _ _ 0] simp: f_def)
hoelzl@51480
  1338
  moreover have "f ` {0 .. 1} \<subseteq> s"
hoelzl@51480
  1339
    using `convex s` a b unfolding convex_def f_def by auto
hoelzl@51480
  1340
  ultimately show False by auto
himmelma@33175
  1341
qed
himmelma@33175
  1342
huffman@44467
  1343
text {* One rather trivial consequence. *}
himmelma@33175
  1344
hoelzl@34964
  1345
lemma connected_UNIV[intro]: "connected (UNIV :: 'a::real_normed_vector set)"
himmelma@33175
  1346
  by(simp add: convex_connected convex_UNIV)
himmelma@33175
  1347
huffman@44467
  1348
text {* Balls, being convex, are connected. *}
himmelma@33175
  1349
wenzelm@53302
  1350
lemma convex_box:
wenzelm@53302
  1351
  fixes a::"'a::euclidean_space"
hoelzl@50526
  1352
  assumes "\<And>i. i\<in>Basis \<Longrightarrow> convex {x. P i x}"
hoelzl@50526
  1353
  shows "convex {x. \<forall>i\<in>Basis. P i (x\<bullet>i)}"
hoelzl@50526
  1354
  using assms unfolding convex_def
hoelzl@50526
  1355
  by (auto simp: inner_add_left)
hoelzl@50526
  1356
hoelzl@50526
  1357
lemma convex_positive_orthant: "convex {x::'a::euclidean_space. (\<forall>i\<in>Basis. 0 \<le> x\<bullet>i)}"
hoelzl@36623
  1358
  by (rule convex_box) (simp add: atLeast_def[symmetric] convex_real_interval)
himmelma@33175
  1359
himmelma@33175
  1360
lemma convex_local_global_minimum:
himmelma@33175
  1361
  fixes s :: "'a::real_normed_vector set"
himmelma@33175
  1362
  assumes "0<e" "convex_on s f" "ball x e \<subseteq> s" "\<forall>y\<in>ball x e. f x \<le> f y"
himmelma@33175
  1363
  shows "\<forall>y\<in>s. f x \<le> f y"
wenzelm@53302
  1364
proof (rule ccontr)
wenzelm@53302
  1365
  have "x \<in> s" using assms(1,3) by auto
wenzelm@53302
  1366
  assume "\<not> ?thesis"
wenzelm@53302
  1367
  then obtain y where "y\<in>s" and y: "f x > f y" by auto
wenzelm@53302
  1368
  hence xy: "0 < dist x y" by (auto simp add: dist_nz[symmetric])
himmelma@33175
  1369
himmelma@33175
  1370
  then obtain u where "0 < u" "u \<le> 1" and u:"u < e / dist x y"
wenzelm@50804
  1371
    using real_lbound_gt_zero[of 1 "e / dist x y"]
wenzelm@50804
  1372
    using xy `e>0` and divide_pos_pos[of e "dist x y"] by auto
wenzelm@53302
  1373
  then have "f ((1-u) *\<^sub>R x + u *\<^sub>R y) \<le> (1-u) * f x + u * f y"
wenzelm@53302
  1374
    using `x\<in>s` `y\<in>s`
wenzelm@53302
  1375
    using assms(2)[unfolded convex_on_def,
wenzelm@53302
  1376
      THEN bspec[where x=x], THEN bspec[where x=y], THEN spec[where x="1-u"]]
wenzelm@50804
  1377
    by auto
himmelma@33175
  1378
  moreover
wenzelm@50804
  1379
  have *: "x - ((1 - u) *\<^sub>R x + u *\<^sub>R y) = u *\<^sub>R (x - y)"
wenzelm@50804
  1380
    by (simp add: algebra_simps)
wenzelm@50804
  1381
  have "(1 - u) *\<^sub>R x + u *\<^sub>R y \<in> ball x e"
wenzelm@53302
  1382
    unfolding mem_ball dist_norm
wenzelm@53302
  1383
    unfolding * and norm_scaleR and abs_of_pos[OF `0<u`]
wenzelm@50804
  1384
    unfolding dist_norm[symmetric]
wenzelm@53302
  1385
    using u
wenzelm@53302
  1386
    unfolding pos_less_divide_eq[OF xy]
wenzelm@53302
  1387
    by auto
wenzelm@53302
  1388
  then have "f x \<le> f ((1 - u) *\<^sub>R x + u *\<^sub>R y)"
wenzelm@53302
  1389
    using assms(4) by auto
wenzelm@50804
  1390
  ultimately show False
wenzelm@53302
  1391
    using mult_strict_left_mono[OF y `u>0`]
wenzelm@53302
  1392
    unfolding left_diff_distrib
wenzelm@53302
  1393
    by auto
himmelma@33175
  1394
qed
himmelma@33175
  1395
himmelma@33175
  1396
lemma convex_ball:
himmelma@33175
  1397
  fixes x :: "'a::real_normed_vector"
wenzelm@49531
  1398
  shows "convex (ball x e)"
wenzelm@50804
  1399
proof (auto simp add: convex_def)
wenzelm@50804
  1400
  fix y z
wenzelm@50804
  1401
  assume yz: "dist x y < e" "dist x z < e"
wenzelm@50804
  1402
  fix u v :: real
wenzelm@50804
  1403
  assume uv: "0 \<le> u" "0 \<le> v" "u + v = 1"
wenzelm@50804
  1404
  have "dist x (u *\<^sub>R y + v *\<^sub>R z) \<le> u * dist x y + v * dist x z"
wenzelm@50804
  1405
    using uv yz
wenzelm@53302
  1406
    using convex_distance[of "ball x e" x, unfolded convex_on_def,
wenzelm@53302
  1407
      THEN bspec[where x=y], THEN bspec[where x=z]]
wenzelm@50804
  1408
    by auto
wenzelm@50804
  1409
  then show "dist x (u *\<^sub>R y + v *\<^sub>R z) < e"
wenzelm@50804
  1410
    using convex_bound_lt[OF yz uv] by auto
himmelma@33175
  1411
qed
himmelma@33175
  1412
himmelma@33175
  1413
lemma convex_cball:
himmelma@33175
  1414
  fixes x :: "'a::real_normed_vector"
himmelma@33175
  1415
  shows "convex(cball x e)"
wenzelm@50804
  1416
proof (auto simp add: convex_def Ball_def)
wenzelm@50804
  1417
  fix y z
wenzelm@50804
  1418
  assume yz: "dist x y \<le> e" "dist x z \<le> e"
wenzelm@50804
  1419
  fix u v :: real
wenzelm@50804
  1420
  assume uv: "0 \<le> u" "0 \<le> v" "u + v = 1"
wenzelm@50804
  1421
  have "dist x (u *\<^sub>R y + v *\<^sub>R z) \<le> u * dist x y + v * dist x z"
wenzelm@50804
  1422
    using uv yz
wenzelm@53302
  1423
    using convex_distance[of "cball x e" x, unfolded convex_on_def,
wenzelm@53302
  1424
      THEN bspec[where x=y], THEN bspec[where x=z]]
wenzelm@50804
  1425
    by auto
wenzelm@50804
  1426
  then show "dist x (u *\<^sub>R y + v *\<^sub>R z) \<le> e"
wenzelm@50804
  1427
    using convex_bound_le[OF yz uv] by auto
himmelma@33175
  1428
qed
himmelma@33175
  1429
himmelma@33175
  1430
lemma connected_ball:
himmelma@33175
  1431
  fixes x :: "'a::real_normed_vector"
himmelma@33175
  1432
  shows "connected (ball x e)"
himmelma@33175
  1433
  using convex_connected convex_ball by auto
himmelma@33175
  1434
himmelma@33175
  1435
lemma connected_cball:
himmelma@33175
  1436
  fixes x :: "'a::real_normed_vector"
wenzelm@53302
  1437
  shows "connected (cball x e)"
himmelma@33175
  1438
  using convex_connected convex_cball by auto
himmelma@33175
  1439
wenzelm@50804
  1440
huffman@44467
  1441
subsection {* Convex hull *}
himmelma@33175
  1442
wenzelm@53302
  1443
lemma convex_convex_hull: "convex (convex hull s)"
wenzelm@53302
  1444
  unfolding hull_def
wenzelm@53302
  1445
  using convex_Inter[of "{t. convex t \<and> s \<subseteq> t}"]
huffman@44170
  1446
  by auto
himmelma@33175
  1447
haftmann@34064
  1448
lemma convex_hull_eq: "convex hull s = s \<longleftrightarrow> convex s"
wenzelm@50804
  1449
  by (metis convex_convex_hull hull_same)
himmelma@33175
  1450
himmelma@33175
  1451
lemma bounded_convex_hull:
himmelma@33175
  1452
  fixes s :: "'a::real_normed_vector set"
himmelma@33175
  1453
  assumes "bounded s" shows "bounded(convex hull s)"
wenzelm@50804
  1454
proof -
wenzelm@50804
  1455
  from assms obtain B where B: "\<forall>x\<in>s. norm x \<le> B"
wenzelm@50804
  1456
    unfolding bounded_iff by auto
wenzelm@50804
  1457
  show ?thesis
wenzelm@50804
  1458
    apply (rule bounded_subset[OF bounded_cball, of _ 0 B])
huffman@44170
  1459
    unfolding subset_hull[of convex, OF convex_cball]
wenzelm@53302
  1460
    unfolding subset_eq mem_cball dist_norm using B
wenzelm@53302
  1461
    apply auto
wenzelm@50804
  1462
    done
wenzelm@50804
  1463
qed
himmelma@33175
  1464
himmelma@33175
  1465
lemma finite_imp_bounded_convex_hull:
himmelma@33175
  1466
  fixes s :: "'a::real_normed_vector set"
wenzelm@53302
  1467
  shows "finite s \<Longrightarrow> bounded (convex hull s)"
wenzelm@53302
  1468
  using bounded_convex_hull finite_imp_bounded
wenzelm@53302
  1469
  by auto
himmelma@33175
  1470
wenzelm@50804
  1471
huffman@44467
  1472
subsubsection {* Convex hull is "preserved" by a linear function *}
hoelzl@40377
  1473
hoelzl@40377
  1474
lemma convex_hull_linear_image:
hoelzl@40377
  1475
  assumes "bounded_linear f"
hoelzl@40377
  1476
  shows "f ` (convex hull s) = convex hull (f ` s)"
wenzelm@50804
  1477
  apply rule
wenzelm@50804
  1478
  unfolding subset_eq ball_simps
wenzelm@50804
  1479
  apply (rule_tac[!] hull_induct, rule hull_inc)
wenzelm@50804
  1480
  prefer 3
wenzelm@50804
  1481
  apply (erule imageE)
wenzelm@50804
  1482
  apply (rule_tac x=xa in image_eqI)
wenzelm@50804
  1483
  apply assumption
wenzelm@50804
  1484
  apply (rule hull_subset[unfolded subset_eq, rule_format])
wenzelm@50804
  1485
  apply assumption
wenzelm@50804
  1486
proof -
hoelzl@40377
  1487
  interpret f: bounded_linear f by fact
wenzelm@49531
  1488
  show "convex {x. f x \<in> convex hull f ` s}"
wenzelm@50804
  1489
    unfolding convex_def
wenzelm@50804
  1490
    by (auto simp add: f.scaleR f.add convex_convex_hull[unfolded convex_def, rule_format])
wenzelm@50804
  1491
  show "convex {x. x \<in> f ` (convex hull s)}"
wenzelm@50804
  1492
    using  convex_convex_hull[unfolded convex_def, of s]
hoelzl@40377
  1493
    unfolding convex_def by (auto simp add: f.scaleR [symmetric] f.add [symmetric])
hoelzl@40377
  1494
qed auto
hoelzl@40377
  1495
hoelzl@40377
  1496
lemma in_convex_hull_linear_image:
hoelzl@40377
  1497
  assumes "bounded_linear f" "x \<in> convex hull s"
wenzelm@53339
  1498
  shows "f x \<in> convex hull (f ` s)"
wenzelm@50804
  1499
  using convex_hull_linear_image[OF assms(1)] assms(2) by auto
wenzelm@50804
  1500
hoelzl@40377
  1501
huffman@44467
  1502
subsubsection {* Stepping theorems for convex hulls of finite sets *}
himmelma@33175
  1503
himmelma@33175
  1504
lemma convex_hull_empty[simp]: "convex hull {} = {}"
wenzelm@50804
  1505
  by (rule hull_unique) auto
himmelma@33175
  1506
himmelma@33175
  1507
lemma convex_hull_singleton[simp]: "convex hull {a} = {a}"
wenzelm@50804
  1508
  by (rule hull_unique) auto
himmelma@33175
  1509
himmelma@33175
  1510
lemma convex_hull_insert:
himmelma@33175
  1511
  fixes s :: "'a::real_vector set"
himmelma@33175
  1512
  assumes "s \<noteq> {}"
wenzelm@50804
  1513
  shows "convex hull (insert a s) =
wenzelm@50804
  1514
    {x. \<exists>u\<ge>0. \<exists>v\<ge>0. \<exists>b. (u + v = 1) \<and> b \<in> (convex hull s) \<and> (x = u *\<^sub>R a + v *\<^sub>R b)}"
wenzelm@50804
  1515
  (is "?xyz = ?hull")
wenzelm@50804
  1516
  apply (rule, rule hull_minimal, rule)
wenzelm@50804
  1517
  unfolding insert_iff
wenzelm@50804
  1518
  prefer 3
wenzelm@50804
  1519
  apply rule
wenzelm@50804
  1520
proof -
wenzelm@50804
  1521
  fix x
wenzelm@50804
  1522
  assume x: "x = a \<or> x \<in> s"
wenzelm@50804
  1523
  then show "x \<in> ?hull"
wenzelm@50804
  1524
    apply rule
wenzelm@50804
  1525
    unfolding mem_Collect_eq
wenzelm@50804
  1526
    apply (rule_tac x=1 in exI)
wenzelm@50804
  1527
    defer
wenzelm@50804
  1528
    apply (rule_tac x=0 in exI)
wenzelm@50804
  1529
    using assms hull_subset[of s convex]
wenzelm@50804
  1530
    apply auto
wenzelm@50804
  1531
    done
himmelma@33175
  1532
next
wenzelm@50804
  1533
  fix x
wenzelm@50804
  1534
  assume "x \<in> ?hull"
wenzelm@50804
  1535
  then obtain u v b where obt: "u\<ge>0" "v\<ge>0" "u + v = 1" "b \<in> convex hull s" "x = u *\<^sub>R a + v *\<^sub>R b"
wenzelm@50804
  1536
    by auto
wenzelm@53339
  1537
  have "a \<in> convex hull insert a s" "b \<in> convex hull insert a s"
wenzelm@50804
  1538
    using hull_mono[of s "insert a s" convex] hull_mono[of "{a}" "insert a s" convex] and obt(4)
wenzelm@50804
  1539
    by auto
wenzelm@50804
  1540
  then show "x \<in> convex hull insert a s"
wenzelm@50804
  1541
    unfolding obt(5)
wenzelm@50804
  1542
    using convex_convex_hull[of "insert a s", unfolded convex_def]
wenzelm@50804
  1543
    apply (erule_tac x = a in ballE)
wenzelm@50804
  1544
    apply (erule_tac x = b in ballE)
wenzelm@50804
  1545
    apply (erule_tac x = u in allE)
wenzelm@53302
  1546
    using obt
wenzelm@53302
  1547
    apply auto
wenzelm@50804
  1548
    done
himmelma@33175
  1549
next
wenzelm@50804
  1550
  show "convex ?hull"
wenzelm@50804
  1551
    unfolding convex_def
wenzelm@50804
  1552
    apply (rule, rule, rule, rule, rule, rule, rule)
wenzelm@50804
  1553
  proof -
wenzelm@50804
  1554
    fix x y u v
wenzelm@50804
  1555
    assume as: "(0::real) \<le> u" "0 \<le> v" "u + v = 1" "x\<in>?hull" "y\<in>?hull"
wenzelm@53339
  1556
    from as(4) obtain u1 v1 b1 where
wenzelm@53339
  1557
      obt1: "u1\<ge>0" "v1\<ge>0" "u1 + v1 = 1" "b1 \<in> convex hull s" "x = u1 *\<^sub>R a + v1 *\<^sub>R b1"
wenzelm@53339
  1558
      by auto
wenzelm@53339
  1559
    from as(5) obtain u2 v2 b2 where
wenzelm@53339
  1560
      obt2: "u2\<ge>0" "v2\<ge>0" "u2 + v2 = 1" "b2 \<in> convex hull s" "y = u2 *\<^sub>R a + v2 *\<^sub>R b2"
wenzelm@53339
  1561
      by auto
wenzelm@50804
  1562
    have *: "\<And>(x::'a) s1 s2. x - s1 *\<^sub>R x - s2 *\<^sub>R x = ((1::real) - (s1 + s2)) *\<^sub>R x"
wenzelm@50804
  1563
      by (auto simp add: algebra_simps)
wenzelm@50804
  1564
    have **: "\<exists>b \<in> convex hull s. u *\<^sub>R x + v *\<^sub>R y =
wenzelm@50804
  1565
      (u * u1) *\<^sub>R a + (v * u2) *\<^sub>R a + (b - (u * u1) *\<^sub>R b - (v * u2) *\<^sub>R b)"
wenzelm@50804
  1566
    proof (cases "u * v1 + v * v2 = 0")
wenzelm@50804
  1567
      case True
wenzelm@50804
  1568
      have *: "\<And>(x::'a) s1 s2. x - s1 *\<^sub>R x - s2 *\<^sub>R x = ((1::real) - (s1 + s2)) *\<^sub>R x"
wenzelm@50804
  1569
        by (auto simp add: algebra_simps)
wenzelm@50804
  1570
      from True have ***: "u * v1 = 0" "v * v2 = 0"
wenzelm@53302
  1571
        using mult_nonneg_nonneg[OF `u\<ge>0` `v1\<ge>0`] mult_nonneg_nonneg[OF `v\<ge>0` `v2\<ge>0`]
wenzelm@53302
  1572
        by arith+
wenzelm@50804
  1573
      then have "u * u1 + v * u2 = 1"
wenzelm@50804
  1574
        using as(3) obt1(3) obt2(3) by auto
wenzelm@50804
  1575
      then show ?thesis
wenzelm@50804
  1576
        unfolding obt1(5) obt2(5) *
wenzelm@50804
  1577
        using assms hull_subset[of s convex]
wenzelm@50804
  1578
        by (auto simp add: *** scaleR_right_distrib)
himmelma@33175
  1579
    next
wenzelm@50804
  1580
      case False
wenzelm@50804
  1581
      have "1 - (u * u1 + v * u2) = (u + v) - (u * u1 + v * u2)"
wenzelm@50804
  1582
        using as(3) obt1(3) obt2(3) by (auto simp add: field_simps)
wenzelm@50804
  1583
      also have "\<dots> = u * (v1 + u1 - u1) + v * (v2 + u2 - u2)"
wenzelm@50804
  1584
        using as(3) obt1(3) obt2(3) by (auto simp add: field_simps)
wenzelm@50804
  1585
      also have "\<dots> = u * v1 + v * v2"
wenzelm@50804
  1586
        by simp
wenzelm@50804
  1587
      finally have **:"1 - (u * u1 + v * u2) = u * v1 + v * v2" by auto
wenzelm@50804
  1588
      have "0 \<le> u * v1 + v * v2" "0 \<le> u * v1" "0 \<le> u * v1 + v * v2" "0 \<le> v * v2"
wenzelm@50804
  1589
        apply (rule add_nonneg_nonneg)
wenzelm@50804
  1590
        prefer 4
wenzelm@50804
  1591
        apply (rule add_nonneg_nonneg)
wenzelm@50804
  1592
        apply (rule_tac [!] mult_nonneg_nonneg)
wenzelm@53302
  1593
        using as(1,2) obt1(1,2) obt2(1,2)
wenzelm@53302
  1594
        apply auto
wenzelm@50804
  1595
        done
wenzelm@50804
  1596
      then show ?thesis
wenzelm@50804
  1597
        unfolding obt1(5) obt2(5)
wenzelm@50804
  1598
        unfolding * and **
wenzelm@50804
  1599
        using False
wenzelm@53339
  1600
        apply (rule_tac
wenzelm@53339
  1601
          x = "((u * v1) / (u * v1 + v * v2)) *\<^sub>R b1 + ((v * v2) / (u * v1 + v * v2)) *\<^sub>R b2" in bexI)
wenzelm@50804
  1602
        defer
wenzelm@50804
  1603
        apply (rule convex_convex_hull[of s, unfolded convex_def, rule_format])
wenzelm@50804
  1604
        using obt1(4) obt2(4)
wenzelm@49530
  1605
        unfolding add_divide_distrib[symmetric] and zero_le_divide_iff
wenzelm@50804
  1606
        apply (auto simp add: scaleR_left_distrib scaleR_right_distrib)
wenzelm@50804
  1607
        done
wenzelm@50804
  1608
    qed
wenzelm@50804
  1609
    have u1: "u1 \<le> 1"
wenzelm@50804
  1610
      unfolding obt1(3)[symmetric] and not_le using obt1(2) by auto
wenzelm@50804
  1611
    have u2: "u2 \<le> 1"
wenzelm@50804
  1612
      unfolding obt2(3)[symmetric] and not_le using obt2(2) by auto
wenzelm@53339
  1613
    have "u1 * u + u2 * v \<le> max u1 u2 * u + max u1 u2 * v"
wenzelm@50804
  1614
      apply (rule add_mono)
wenzelm@50804
  1615
      apply (rule_tac [!] mult_right_mono)
wenzelm@50804
  1616
      using as(1,2) obt1(1,2) obt2(1,2)
wenzelm@50804
  1617
      apply auto
wenzelm@50804
  1618
      done
wenzelm@50804
  1619
    also have "\<dots> \<le> 1"
wenzelm@50804
  1620
      unfolding distrib_left[symmetric] and as(3) using u1 u2 by auto
wenzelm@50804
  1621
    finally show "u *\<^sub>R x + v *\<^sub>R y \<in> ?hull"
wenzelm@50804
  1622
      unfolding mem_Collect_eq
wenzelm@50804
  1623
      apply (rule_tac x="u * u1 + v * u2" in exI)
wenzelm@50804
  1624
      apply (rule conjI)
wenzelm@50804
  1625
      defer
wenzelm@50804
  1626
      apply (rule_tac x="1 - u * u1 - v * u2" in exI)
wenzelm@50804
  1627
      unfolding Bex_def
wenzelm@50804
  1628
      using as(1,2) obt1(1,2) obt2(1,2) **
wenzelm@50804
  1629
      apply (auto intro!: mult_nonneg_nonneg add_nonneg_nonneg simp add: algebra_simps)
wenzelm@50804
  1630
      done
himmelma@33175
  1631
  qed
himmelma@33175
  1632
qed
himmelma@33175
  1633
himmelma@33175
  1634
huffman@44467
  1635
subsubsection {* Explicit expression for convex hull *}
himmelma@33175
  1636
himmelma@33175
  1637
lemma convex_hull_indexed:
himmelma@33175
  1638
  fixes s :: "'a::real_vector set"
wenzelm@50804
  1639
  shows "convex hull s =
wenzelm@50804
  1640
    {y. \<exists>k u x. (\<forall>i\<in>{1::nat .. k}. 0 \<le> u i \<and> x i \<in> s) \<and>
wenzelm@50804
  1641
        (setsum u {1..k} = 1) \<and>
wenzelm@53339
  1642
        (setsum (\<lambda>i. u i *\<^sub>R x i) {1..k} = y)}"
wenzelm@53339
  1643
  (is "?xyz = ?hull")
wenzelm@50804
  1644
  apply (rule hull_unique)
wenzelm@50804
  1645
  apply rule
wenzelm@50804
  1646
  defer
wenzelm@50804
  1647
  apply (subst convex_def)
wenzelm@50804
  1648
  apply (rule, rule, rule, rule, rule, rule, rule)
wenzelm@50804
  1649
proof -
wenzelm@50804
  1650
  fix x
wenzelm@50804
  1651
  assume "x\<in>s"
wenzelm@50804
  1652
  then show "x \<in> ?hull"
wenzelm@50804
  1653
    unfolding mem_Collect_eq
wenzelm@50804
  1654
    apply (rule_tac x=1 in exI, rule_tac x="\<lambda>x. 1" in exI)
wenzelm@50804
  1655
    apply auto
wenzelm@50804
  1656
    done
himmelma@33175
  1657
next
wenzelm@50804
  1658
  fix t
wenzelm@50804
  1659
  assume as: "s \<subseteq> t" "convex t"
wenzelm@50804
  1660
  show "?hull \<subseteq> t"
wenzelm@50804
  1661
    apply rule
wenzelm@50804
  1662
    unfolding mem_Collect_eq
wenzelm@53302
  1663
    apply (elim exE conjE)
wenzelm@50804
  1664
  proof -
wenzelm@50804
  1665
    fix x k u y
wenzelm@50804
  1666
    assume assm:
wenzelm@50804
  1667
      "\<forall>i\<in>{1::nat..k}. 0 \<le> u i \<and> y i \<in> s"
wenzelm@50804
  1668
      "setsum u {1..k} = 1" "(\<Sum>i = 1..k. u i *\<^sub>R y i) = x"
wenzelm@50804
  1669
    show "x\<in>t"
wenzelm@50804
  1670
      unfolding assm(3) [symmetric]
wenzelm@50804
  1671
      apply (rule as(2)[unfolded convex, rule_format])
wenzelm@50804
  1672
      using assm(1,2) as(1) apply auto
wenzelm@50804
  1673
      done
wenzelm@50804
  1674
  qed
himmelma@33175
  1675
next
wenzelm@50804
  1676
  fix x y u v
wenzelm@53302
  1677
  assume uv: "0 \<le> u" "0 \<le> v" "u + v = (1::real)" and xy: "x \<in> ?hull" "y \<in> ?hull"
wenzelm@50804
  1678
  from xy obtain k1 u1 x1 where
wenzelm@53339
  1679
    x: "\<forall>i\<in>{1::nat..k1}. 0\<le>u1 i \<and> x1 i \<in> s" "setsum u1 {Suc 0..k1} = 1" "(\<Sum>i = Suc 0..k1. u1 i *\<^sub>R x1 i) = x"
wenzelm@50804
  1680
    by auto
wenzelm@50804
  1681
  from xy obtain k2 u2 x2 where
wenzelm@53339
  1682
    y: "\<forall>i\<in>{1::nat..k2}. 0\<le>u2 i \<and> x2 i \<in> s" "setsum u2 {Suc 0..k2} = 1" "(\<Sum>i = Suc 0..k2. u2 i *\<^sub>R x2 i) = y"
wenzelm@50804
  1683
    by auto
wenzelm@50804
  1684
  have *: "\<And>P (x1::'a) x2 s1 s2 i.
wenzelm@50804
  1685
    (if P i then s1 else s2) *\<^sub>R (if P i then x1 else x2) = (if P i then s1 *\<^sub>R x1 else s2 *\<^sub>R x2)"
himmelma@33175
  1686
    "{1..k1 + k2} \<inter> {1..k1} = {1..k1}" "{1..k1 + k2} \<inter> - {1..k1} = (\<lambda>i. i + k1) ` {1..k2}"
wenzelm@50804
  1687
    prefer 3
wenzelm@50804
  1688
    apply (rule, rule)
wenzelm@50804
  1689
    unfolding image_iff
wenzelm@50804
  1690
    apply (rule_tac x = "x - k1" in bexI)
wenzelm@50804
  1691
    apply (auto simp add: not_le)
wenzelm@50804
  1692
    done
wenzelm@50804
  1693
  have inj: "inj_on (\<lambda>i. i + k1) {1..k2}"
wenzelm@50804
  1694
    unfolding inj_on_def by auto
wenzelm@50804
  1695
  show "u *\<^sub>R x + v *\<^sub>R y \<in> ?hull"
wenzelm@50804
  1696
    apply rule
wenzelm@50804
  1697
    apply (rule_tac x="k1 + k2" in exI)
wenzelm@50804
  1698
    apply (rule_tac x="\<lambda>i. if i \<in> {1..k1} then u * u1 i else v * u2 (i - k1)" in exI)
wenzelm@50804
  1699
    apply (rule_tac x="\<lambda>i. if i \<in> {1..k1} then x1 i else x2 (i - k1)" in exI)
wenzelm@50804
  1700
    apply (rule, rule)
wenzelm@50804
  1701
    defer
wenzelm@50804
  1702
    apply rule
wenzelm@50804
  1703
    unfolding * and setsum_cases[OF finite_atLeastAtMost[of 1 "k1 + k2"]] and
wenzelm@50804
  1704
      setsum_reindex[OF inj] and o_def Collect_mem_eq
wenzelm@50804
  1705
    unfolding scaleR_scaleR[symmetric] scaleR_right.setsum [symmetric] setsum_right_distrib[symmetric]
wenzelm@50804
  1706
  proof -
wenzelm@50804
  1707
    fix i
wenzelm@50804
  1708
    assume i: "i \<in> {1..k1+k2}"
wenzelm@50804
  1709
    show "0 \<le> (if i \<in> {1..k1} then u * u1 i else v * u2 (i - k1)) \<and>
wenzelm@50804
  1710
      (if i \<in> {1..k1} then x1 i else x2 (i - k1)) \<in> s"
wenzelm@50804
  1711
    proof (cases "i\<in>{1..k1}")
wenzelm@50804
  1712
      case True
wenzelm@50804
  1713
      then show ?thesis
wenzelm@50804
  1714
        using mult_nonneg_nonneg[of u "u1 i"] and uv(1) x(1)[THEN bspec[where x=i]] by auto
wenzelm@50804
  1715
    next
wenzelm@50804
  1716
      case False
wenzelm@50804
  1717
      def j \<equiv> "i - k1"
wenzelm@50804
  1718
      from i False have "j \<in> {1..k2}" unfolding j_def by auto
wenzelm@50804
  1719
      then show ?thesis
wenzelm@50804
  1720
        unfolding j_def[symmetric]
wenzelm@50804
  1721
        using False
wenzelm@50804
  1722
        using mult_nonneg_nonneg[of v "u2 j"] and uv(2) y(1)[THEN bspec[where x=j]]
wenzelm@50804
  1723
        apply auto
wenzelm@50804
  1724
        done
wenzelm@50804
  1725
    qed
wenzelm@50804
  1726
  qed (auto simp add: not_le x(2,3) y(2,3) uv(3))
himmelma@33175
  1727
qed
himmelma@33175
  1728
himmelma@33175
  1729
lemma convex_hull_finite:
himmelma@33175
  1730
  fixes s :: "'a::real_vector set"
himmelma@33175
  1731
  assumes "finite s"
himmelma@33175
  1732
  shows "convex hull s = {y. \<exists>u. (\<forall>x\<in>s. 0 \<le> u x) \<and>
wenzelm@53339
  1733
    setsum u s = 1 \<and> setsum (\<lambda>x. u x *\<^sub>R x) s = y}"
wenzelm@53339
  1734
  (is "?HULL = ?set")
wenzelm@50804
  1735
proof (rule hull_unique, auto simp add: convex_def[of ?set])
wenzelm@50804
  1736
  fix x
wenzelm@50804
  1737
  assume "x \<in> s"
wenzelm@50804
  1738
  then show "\<exists>u. (\<forall>x\<in>s. 0 \<le> u x) \<and> setsum u s = 1 \<and> (\<Sum>x\<in>s. u x *\<^sub>R x) = x"
wenzelm@50804
  1739
    apply (rule_tac x="\<lambda>y. if x=y then 1 else 0" in exI)
wenzelm@50804
  1740
    apply auto
wenzelm@50804
  1741
    unfolding setsum_delta'[OF assms] and setsum_delta''[OF assms]
wenzelm@50804
  1742
    apply auto
wenzelm@50804
  1743
    done
himmelma@33175
  1744
next
wenzelm@50804
  1745
  fix u v :: real
wenzelm@50804
  1746
  assume uv: "0 \<le> u" "0 \<le> v" "u + v = 1"
wenzelm@50804
  1747
  fix ux assume ux: "\<forall>x\<in>s. 0 \<le> ux x" "setsum ux s = (1::real)"
wenzelm@50804
  1748
  fix uy assume uy: "\<forall>x\<in>s. 0 \<le> uy x" "setsum uy s = (1::real)"
wenzelm@53339
  1749
  {
wenzelm@53339
  1750
    fix x
wenzelm@50804
  1751
    assume "x\<in>s"
wenzelm@50804
  1752
    then have "0 \<le> u * ux x + v * uy x"
wenzelm@50804
  1753
      using ux(1)[THEN bspec[where x=x]] uy(1)[THEN bspec[where x=x]] and uv(1,2)
wenzelm@50804
  1754
      apply auto
wenzelm@50804
  1755
      apply (metis add_nonneg_nonneg mult_nonneg_nonneg uv(1) uv(2))
wenzelm@50804
  1756
      done
wenzelm@50804
  1757
  }
wenzelm@50804
  1758
  moreover
wenzelm@50804
  1759
  have "(\<Sum>x\<in>s. u * ux x + v * uy x) = 1"
wenzelm@53302
  1760
    unfolding setsum_addf and setsum_right_distrib[symmetric] and ux(2) uy(2)
wenzelm@53302
  1761
    using uv(3) by auto
wenzelm@50804
  1762
  moreover
wenzelm@50804
  1763
  have "(\<Sum>x\<in>s. (u * ux x + v * uy x) *\<^sub>R x) = u *\<^sub>R (\<Sum>x\<in>s. ux x *\<^sub>R x) + v *\<^sub>R (\<Sum>x\<in>s. uy x *\<^sub>R x)"
wenzelm@53339
  1764
    unfolding scaleR_left_distrib and setsum_addf and scaleR_scaleR[symmetric]
wenzelm@53339
  1765
      and scaleR_right.setsum [symmetric]
wenzelm@50804
  1766
    by auto
wenzelm@50804
  1767
  ultimately
wenzelm@50804
  1768
  show "\<exists>uc. (\<forall>x\<in>s. 0 \<le> uc x) \<and> setsum uc s = 1 \<and>
wenzelm@50804
  1769
      (\<Sum>x\<in>s. uc x *\<^sub>R x) = u *\<^sub>R (\<Sum>x\<in>s. ux x *\<^sub>R x) + v *\<^sub>R (\<Sum>x\<in>s. uy x *\<^sub>R x)"
wenzelm@50804
  1770
    apply (rule_tac x="\<lambda>x. u * ux x + v * uy x" in exI)
wenzelm@50804
  1771
    apply auto
wenzelm@50804
  1772
    done
himmelma@33175
  1773
next
wenzelm@50804
  1774
  fix t
wenzelm@50804
  1775
  assume t: "s \<subseteq> t" "convex t"
wenzelm@50804
  1776
  fix u
wenzelm@50804
  1777
  assume u: "\<forall>x\<in>s. 0 \<le> u x" "setsum u s = (1::real)"
wenzelm@50804
  1778
  then show "(\<Sum>x\<in>s. u x *\<^sub>R x) \<in> t"
wenzelm@50804
  1779
    using t(2)[unfolded convex_explicit, THEN spec[where x=s], THEN spec[where x=u]]
himmelma@33175
  1780
    using assms and t(1) by auto
himmelma@33175
  1781
qed
himmelma@33175
  1782
wenzelm@50804
  1783
huffman@44467
  1784
subsubsection {* Another formulation from Lars Schewe *}
himmelma@33175
  1785
himmelma@33175
  1786
lemma setsum_constant_scaleR:
himmelma@33175
  1787
  fixes y :: "'a::real_vector"
himmelma@33175
  1788
  shows "(\<Sum>x\<in>A. y) = of_nat (card A) *\<^sub>R y"
wenzelm@50804
  1789
  apply (cases "finite A")
wenzelm@50804
  1790
  apply (induct set: finite)
wenzelm@50804
  1791
  apply (simp_all add: algebra_simps)
wenzelm@50804
  1792
  done
himmelma@33175
  1793
himmelma@33175
  1794
lemma convex_hull_explicit:
himmelma@33175
  1795
  fixes p :: "'a::real_vector set"
himmelma@33175
  1796
  shows "convex hull p = {y. \<exists>s u. finite s \<and> s \<subseteq> p \<and>
wenzelm@53339
  1797
    (\<forall>x\<in>s. 0 \<le> u x) \<and> setsum u s = 1 \<and> setsum (\<lambda>v. u v *\<^sub>R v) s = y}"
wenzelm@53339
  1798
  (is "?lhs = ?rhs")
wenzelm@50804
  1799
proof -
wenzelm@53302
  1800
  {
wenzelm@53302
  1801
    fix x
wenzelm@53302
  1802
    assume "x\<in>?lhs"
wenzelm@50804
  1803
    then obtain k u y where
wenzelm@50804
  1804
        obt: "\<forall>i\<in>{1::nat..k}. 0 \<le> u i \<and> y i \<in> p" "setsum u {1..k} = 1" "(\<Sum>i = 1..k. u i *\<^sub>R y i) = x"
himmelma@33175
  1805
      unfolding convex_hull_indexed by auto
himmelma@33175
  1806
wenzelm@50804
  1807
    have fin: "finite {1..k}" by auto
wenzelm@50804
  1808
    have fin': "\<And>v. finite {i \<in> {1..k}. y i = v}" by auto
wenzelm@53302
  1809
    {
wenzelm@53302
  1810
      fix j
wenzelm@50804
  1811
      assume "j\<in>{1..k}"
wenzelm@50804
  1812
      then have "y j \<in> p" "0 \<le> setsum u {i. Suc 0 \<le> i \<and> i \<le> k \<and> y i = y j}"
wenzelm@50804
  1813
        using obt(1)[THEN bspec[where x=j]] and obt(2)
wenzelm@50804
  1814
        apply simp
wenzelm@50804
  1815
        apply (rule setsum_nonneg)
wenzelm@50804
  1816
        using obt(1)
wenzelm@50804
  1817
        apply auto
wenzelm@50804
  1818
        done
wenzelm@50804
  1819
    }
himmelma@33175
  1820
    moreover
wenzelm@49531
  1821
    have "(\<Sum>v\<in>y ` {1..k}. setsum u {i \<in> {1..k}. y i = v}) = 1"
wenzelm@49530
  1822
      unfolding setsum_image_gen[OF fin, symmetric] using obt(2) by auto
himmelma@33175
  1823
    moreover have "(\<Sum>v\<in>y ` {1..k}. setsum u {i \<in> {1..k}. y i = v} *\<^sub>R v) = x"
wenzelm@49530
  1824
      using setsum_image_gen[OF fin, of "\<lambda>i. u i *\<^sub>R y i" y, symmetric]
himmelma@33175
  1825
      unfolding scaleR_left.setsum using obt(3) by auto
wenzelm@50804
  1826
    ultimately
wenzelm@50804
  1827
    have "\<exists>s u. finite s \<and> s \<subseteq> p \<and> (\<forall>x\<in>s. 0 \<le> u x) \<and> setsum u s = 1 \<and> (\<Sum>v\<in>s. u v *\<^sub>R v) = x"
wenzelm@50804
  1828
      apply (rule_tac x="y ` {1..k}" in exI)
wenzelm@50804
  1829
      apply (rule_tac x="\<lambda>v. setsum u {i\<in>{1..k}. y i = v}" in exI)
wenzelm@50804
  1830
      apply auto
wenzelm@50804
  1831
      done
wenzelm@50804
  1832
    then have "x\<in>?rhs" by auto
wenzelm@50804
  1833
  }
himmelma@33175
  1834
  moreover
wenzelm@53302
  1835
  {
wenzelm@53302
  1836
    fix y
wenzelm@53302
  1837
    assume "y\<in>?rhs"
wenzelm@50804
  1838
    then obtain s u where
wenzelm@53339
  1839
      obt: "finite s" "s \<subseteq> p" "\<forall>x\<in>s. 0 \<le> u x" "setsum u s = 1" "(\<Sum>v\<in>s. u v *\<^sub>R v) = y"
wenzelm@53339
  1840
      by auto
wenzelm@50804
  1841
wenzelm@50804
  1842
    obtain f where f: "inj_on f {1..card s}" "f ` {1..card s} = s"
wenzelm@50804
  1843
      using ex_bij_betw_nat_finite_1[OF obt(1)] unfolding bij_betw_def by auto
wenzelm@50804
  1844
wenzelm@53302
  1845
    {
wenzelm@53302
  1846
      fix i :: nat
wenzelm@50804
  1847
      assume "i\<in>{1..card s}"
wenzelm@50804
  1848
      then have "f i \<in> s"
wenzelm@50804
  1849
        apply (subst f(2)[symmetric])
wenzelm@50804
  1850
        apply auto
wenzelm@50804
  1851
        done
wenzelm@50804
  1852
      then have "0 \<le> u (f i)" "f i \<in> p" using obt(2,3) by auto
wenzelm@50804
  1853
    }
himmelma@33175
  1854
    moreover have *:"finite {1..card s}" by auto
wenzelm@53302
  1855
    {
wenzelm@53302
  1856
      fix y
wenzelm@50804
  1857
      assume "y\<in>s"
wenzelm@53302
  1858
      then obtain i where "i\<in>{1..card s}" "f i = y"
wenzelm@53302
  1859
        using f using image_iff[of y f "{1..card s}"]
wenzelm@50804
  1860
        by auto
wenzelm@50804
  1861
      then have "{x. Suc 0 \<le> x \<and> x \<le> card s \<and> f x = y} = {i}"
wenzelm@50804
  1862
        apply auto
wenzelm@50804
  1863
        using f(1)[unfolded inj_on_def]
wenzelm@50804
  1864
        apply(erule_tac x=x in ballE)
wenzelm@50804
  1865
        apply auto
wenzelm@50804
  1866
        done
wenzelm@50804
  1867
      then have "card {x. Suc 0 \<le> x \<and> x \<le> card s \<and> f x = y} = 1" by auto
wenzelm@50804
  1868
      then have "(\<Sum>x\<in>{x \<in> {1..card s}. f x = y}. u (f x)) = u y"
wenzelm@50804
  1869
          "(\<Sum>x\<in>{x \<in> {1..card s}. f x = y}. u (f x) *\<^sub>R f x) = u y *\<^sub>R y"
wenzelm@50804
  1870
        by (auto simp add: setsum_constant_scaleR)
wenzelm@50804
  1871
    }
wenzelm@50804
  1872
    then have "(\<Sum>x = 1..card s. u (f x)) = 1" "(\<Sum>i = 1..card s. u (f i) *\<^sub>R f i) = y"
wenzelm@53339
  1873
      unfolding setsum_image_gen[OF *(1), of "\<lambda>x. u (f x) *\<^sub>R f x" f]
wenzelm@53339
  1874
        and setsum_image_gen[OF *(1), of "\<lambda>x. u (f x)" f]
wenzelm@53339
  1875
      unfolding f
wenzelm@53339
  1876
      using setsum_cong2[of s "\<lambda>y. (\<Sum>x\<in>{x \<in> {1..card s}. f x = y}. u (f x) *\<^sub>R f x)" "\<lambda>v. u v *\<^sub>R v"]
wenzelm@50804
  1877
      using setsum_cong2 [of s "\<lambda>y. (\<Sum>x\<in>{x \<in> {1..card s}. f x = y}. u (f x))" u]
wenzelm@53302
  1878
      unfolding obt(4,5)
wenzelm@53302
  1879
      by auto
wenzelm@50804
  1880
    ultimately
wenzelm@50804
  1881
    have "\<exists>k u x. (\<forall>i\<in>{1..k}. 0 \<le> u i \<and> x i \<in> p) \<and> setsum u {1..k} = 1 \<and>
wenzelm@50804
  1882
        (\<Sum>i::nat = 1..k. u i *\<^sub>R x i) = y"
wenzelm@50804
  1883
      apply (rule_tac x="card s" in exI)
wenzelm@50804
  1884
      apply (rule_tac x="u \<circ> f" in exI)
wenzelm@50804
  1885
      apply (rule_tac x=f in exI)
wenzelm@50804
  1886
      apply fastforce
wenzelm@50804
  1887
      done
wenzelm@53302
  1888
    then have "y \<in> ?lhs"
wenzelm@53302
  1889
      unfolding convex_hull_indexed by auto
wenzelm@50804
  1890
  }
wenzelm@53302
  1891
  ultimately show ?thesis
wenzelm@53302
  1892
    unfolding set_eq_iff by blast
himmelma@33175
  1893
qed
himmelma@33175
  1894
wenzelm@50804
  1895
huffman@44467
  1896
subsubsection {* A stepping theorem for that expansion *}
himmelma@33175
  1897
himmelma@33175
  1898
lemma convex_hull_finite_step:
wenzelm@50804
  1899
  fixes s :: "'a::real_vector set"
wenzelm@50804
  1900
  assumes "finite s"
wenzelm@53302
  1901
  shows
wenzelm@53302
  1902
    "(\<exists>u. (\<forall>x\<in>insert a s. 0 \<le> u x) \<and> setsum u (insert a s) = w \<and> setsum (\<lambda>x. u x *\<^sub>R x) (insert a s) = y)
wenzelm@53302
  1903
      \<longleftrightarrow> (\<exists>v\<ge>0. \<exists>u. (\<forall>x\<in>s. 0 \<le> u x) \<and> setsum u s = w - v \<and> setsum (\<lambda>x. u x *\<^sub>R x) s = y - v *\<^sub>R a)"
wenzelm@53302
  1904
  (is "?lhs = ?rhs")
wenzelm@50804
  1905
proof (rule, case_tac[!] "a\<in>s")
wenzelm@53302
  1906
  assume "a \<in> s"
wenzelm@53339
  1907
  then have *: "insert a s = s" by auto
wenzelm@50804
  1908
  assume ?lhs
wenzelm@50804
  1909
  then show ?rhs
wenzelm@50804
  1910
    unfolding *
wenzelm@50804
  1911
    apply (rule_tac x=0 in exI)
wenzelm@50804
  1912
    apply auto
wenzelm@50804
  1913
    done
himmelma@33175
  1914
next
wenzelm@50804
  1915
  assume ?lhs
wenzelm@53302
  1916
  then obtain u where
wenzelm@53302
  1917
      u: "\<forall>x\<in>insert a s. 0 \<le> u x" "setsum u (insert a s) = w" "(\<Sum>x\<in>insert a s. u x *\<^sub>R x) = y"
wenzelm@50804
  1918
    by auto
wenzelm@50804
  1919
  assume "a \<notin> s"
wenzelm@50804
  1920
  then show ?rhs
wenzelm@50804
  1921
    apply (rule_tac x="u a" in exI)
wenzelm@50804
  1922
    using u(1)[THEN bspec[where x=a]]
wenzelm@50804
  1923
    apply simp
wenzelm@50804
  1924
    apply (rule_tac x=u in exI)
wenzelm@50804
  1925
    using u[unfolded setsum_clauses(2)[OF assms]] and `a\<notin>s`
wenzelm@50804
  1926
    apply auto
wenzelm@50804
  1927
    done
himmelma@33175
  1928
next
wenzelm@50804
  1929
  assume "a \<in> s"
wenzelm@50804
  1930
  then have *: "insert a s = s" by auto
wenzelm@50804
  1931
  have fin: "finite (insert a s)" using assms by auto
wenzelm@50804
  1932
  assume ?rhs
wenzelm@50804
  1933
  then obtain v u where uv: "v\<ge>0" "\<forall>x\<in>s. 0 \<le> u x" "setsum u s = w - v" "(\<Sum>x\<in>s. u x *\<^sub>R x) = y - v *\<^sub>R a"
wenzelm@50804
  1934
    by auto
wenzelm@50804
  1935
  show ?lhs
wenzelm@50804
  1936
    apply (rule_tac x = "\<lambda>x. (if a = x then v else 0) + u x" in exI)
wenzelm@50804
  1937
    unfolding scaleR_left_distrib and setsum_addf and setsum_delta''[OF fin] and setsum_delta'[OF fin]
wenzelm@50804
  1938
    unfolding setsum_clauses(2)[OF assms]
wenzelm@50804
  1939
    using uv and uv(2)[THEN bspec[where x=a]] and `a\<in>s`
wenzelm@50804
  1940
    apply auto
wenzelm@50804
  1941
    done
himmelma@33175
  1942
next
wenzelm@50804
  1943
  assume ?rhs
wenzelm@53339
  1944
  then obtain v u where
wenzelm@53339
  1945
    uv: "v\<ge>0" "\<forall>x\<in>s. 0 \<le> u x" "setsum u s = w - v" "(\<Sum>x\<in>s. u x *\<^sub>R x) = y - v *\<^sub>R a"
wenzelm@50804
  1946
    by auto
wenzelm@50804
  1947
  moreover
wenzelm@50804
  1948
  assume "a \<notin> s"
wenzelm@50804
  1949
  moreover
wenzelm@53302
  1950
  have "(\<Sum>x\<in>s. if a = x then v else u x) = setsum u s"
wenzelm@53302
  1951
    and "(\<Sum>x\<in>s. (if a = x then v else u x) *\<^sub>R x) = (\<Sum>x\<in>s. u x *\<^sub>R x)"
wenzelm@50804
  1952
    apply (rule_tac setsum_cong2)
wenzelm@50804
  1953
    defer
wenzelm@50804
  1954
    apply (rule_tac setsum_cong2)
wenzelm@50804
  1955
    using `a \<notin> s`
wenzelm@50804
  1956
    apply auto
wenzelm@50804
  1957
    done
wenzelm@50804
  1958
  ultimately show ?lhs
wenzelm@50804
  1959
    apply (rule_tac x="\<lambda>x. if a = x then v else u x" in exI)
wenzelm@50804
  1960
    unfolding setsum_clauses(2)[OF assms]
wenzelm@50804
  1961
    apply auto
wenzelm@50804
  1962
    done
wenzelm@50804
  1963
qed
wenzelm@50804
  1964
himmelma@33175
  1965
huffman@44467
  1966
subsubsection {* Hence some special cases *}
himmelma@33175
  1967
himmelma@33175
  1968
lemma convex_hull_2:
himmelma@33175
  1969
  "convex hull {a,b} = {u *\<^sub>R a + v *\<^sub>R b | u v. 0 \<le> u \<and> 0 \<le> v \<and> u + v = 1}"
wenzelm@53302
  1970
proof -
wenzelm@53302
  1971
  have *: "\<And>u. (\<forall>x\<in>{a, b}. 0 \<le> u x) \<longleftrightarrow> 0 \<le> u a \<and> 0 \<le> u b"
wenzelm@53302
  1972
    by auto
wenzelm@53302
  1973
  have **: "finite {b}" by auto
wenzelm@53302
  1974
  show ?thesis
wenzelm@53302
  1975
    apply (simp add: convex_hull_finite)
wenzelm@53302
  1976
    unfolding convex_hull_finite_step[OF **, of a 1, unfolded * conj_assoc]
wenzelm@53302
  1977
    apply auto
wenzelm@53302
  1978
    apply (rule_tac x=v in exI)
wenzelm@53302
  1979
    apply (rule_tac x="1 - v" in exI)
wenzelm@53302
  1980
    apply simp
wenzelm@53302
  1981
    apply (rule_tac x=u in exI)
wenzelm@53302
  1982
    apply simp
wenzelm@53302
  1983
    apply (rule_tac x="\<lambda>x. v" in exI)
wenzelm@53302
  1984
    apply simp
wenzelm@53302
  1985
    done
wenzelm@53302
  1986
qed
himmelma@33175
  1987
himmelma@33175
  1988
lemma convex_hull_2_alt: "convex hull {a,b} = {a + u *\<^sub>R (b - a) | u.  0 \<le> u \<and> u \<le> 1}"
huffman@44170
  1989
  unfolding convex_hull_2
wenzelm@53302
  1990
proof (rule Collect_cong)
wenzelm@53302
  1991
  have *: "\<And>x y ::real. x + y = 1 \<longleftrightarrow> x = 1 - y"
wenzelm@53302
  1992
    by auto
wenzelm@53302
  1993
  fix x
wenzelm@53302
  1994
  show "(\<exists>v u. x = v *\<^sub>R a + u *\<^sub>R b \<and> 0 \<le> v \<and> 0 \<le> u \<and> v + u = 1) \<longleftrightarrow>
wenzelm@53302
  1995
    (\<exists>u. x = a + u *\<^sub>R (b - a) \<and> 0 \<le> u \<and> u \<le> 1)"
wenzelm@53302
  1996
    unfolding *
wenzelm@53302
  1997
    apply auto
wenzelm@53302
  1998
    apply (rule_tac[!] x=u in exI)
wenzelm@53302
  1999
    apply (auto simp add: algebra_simps)
wenzelm@53302
  2000
    done
wenzelm@53302
  2001
qed
himmelma@33175
  2002
himmelma@33175
  2003
lemma convex_hull_3:
himmelma@33175
  2004
  "convex hull {a,b,c} = { u *\<^sub>R a + v *\<^sub>R b + w *\<^sub>R c | u v w. 0 \<le> u \<and> 0 \<le> v \<and> 0 \<le> w \<and> u + v + w = 1}"
wenzelm@53302
  2005
proof -
wenzelm@53302
  2006
  have fin: "finite {a,b,c}" "finite {b,c}" "finite {c}"
wenzelm@53302
  2007
    by auto
wenzelm@53302
  2008
  have *: "\<And>x y z ::real. x + y + z = 1 \<longleftrightarrow> x = 1 - y - z"
huffman@44361
  2009
    by (auto simp add: field_simps)
wenzelm@53302
  2010
  show ?thesis
wenzelm@53302
  2011
    unfolding convex_hull_finite[OF fin(1)] and convex_hull_finite_step[OF fin(2)] and *
wenzelm@53302
  2012
    unfolding convex_hull_finite_step[OF fin(3)]
wenzelm@53302
  2013
    apply (rule Collect_cong)
wenzelm@53302
  2014
    apply simp
wenzelm@53302
  2015
    apply auto
wenzelm@53302
  2016
    apply (rule_tac x=va in exI)
wenzelm@53302
  2017
    apply (rule_tac x="u c" in exI)
wenzelm@53302
  2018
    apply simp
wenzelm@53302
  2019
    apply (rule_tac x="1 - v - w" in exI)
wenzelm@53302
  2020
    apply simp
wenzelm@53302
  2021
    apply (rule_tac x=v in exI)
wenzelm@53302
  2022
    apply simp
wenzelm@53302
  2023
    apply (rule_tac x="\<lambda>x. w" in exI)
wenzelm@53302
  2024
    apply simp
wenzelm@53302
  2025
    done
wenzelm@53302
  2026
qed
himmelma@33175
  2027
himmelma@33175
  2028
lemma convex_hull_3_alt:
himmelma@33175
  2029
  "convex hull {a,b,c} = {a + u *\<^sub>R (b - a) + v *\<^sub>R (c - a) | u v.  0 \<le> u \<and> 0 \<le> v \<and> u + v \<le> 1}"
wenzelm@53302
  2030
proof -
wenzelm@53302
  2031
  have *: "\<And>x y z ::real. x + y + z = 1 \<longleftrightarrow> x = 1 - y - z"
wenzelm@53302
  2032
    by auto
wenzelm@53302
  2033
  show ?thesis
wenzelm@53302
  2034
    unfolding convex_hull_3
wenzelm@53302
  2035
    apply (auto simp add: *)
wenzelm@53302
  2036
    apply (rule_tac x=v in exI)
wenzelm@53302
  2037
    apply (rule_tac x=w in exI)
wenzelm@53302
  2038
    apply (simp add: algebra_simps)
wenzelm@53302
  2039
    apply (rule_tac x=u in exI)
wenzelm@53302
  2040
    apply (rule_tac x=v in exI)
wenzelm@53302
  2041
    apply (simp add: algebra_simps)
wenzelm@53302
  2042
    done
wenzelm@53302
  2043
qed
wenzelm@53302
  2044
himmelma@33175
  2045
huffman@44467
  2046
subsection {* Relations among closure notions and corresponding hulls *}
himmelma@33175
  2047
himmelma@33175
  2048
lemma affine_imp_convex: "affine s \<Longrightarrow> convex s"
himmelma@33175
  2049
  unfolding affine_def convex_def by auto
himmelma@33175
  2050
huffman@44361
  2051
lemma subspace_imp_convex: "subspace s \<Longrightarrow> convex s"
himmelma@33175
  2052
  using subspace_imp_affine affine_imp_convex by auto
himmelma@33175
  2053
huffman@44361
  2054
lemma affine_hull_subset_span: "(affine hull s) \<subseteq> (span s)"
wenzelm@53302
  2055
  by (metis hull_minimal span_inc subspace_imp_affine subspace_span)
himmelma@33175
  2056
huffman@44361
  2057
lemma convex_hull_subset_span: "(convex hull s) \<subseteq> (span s)"
wenzelm@53302
  2058
  by (metis hull_minimal span_inc subspace_imp_convex subspace_span)
himmelma@33175
  2059
himmelma@33175
  2060
lemma convex_hull_subset_affine_hull: "(convex hull s) \<subseteq> (affine hull s)"
wenzelm@53302
  2061
  by (metis affine_affine_hull affine_imp_convex hull_minimal hull_subset)
wenzelm@53302
  2062
wenzelm@53302
  2063
wenzelm@53302
  2064
lemma affine_dependent_imp_dependent: "affine_dependent s \<Longrightarrow> dependent s"
wenzelm@49531
  2065
  unfolding affine_dependent_def dependent_def
himmelma@33175
  2066
  using affine_hull_subset_span by auto
himmelma@33175
  2067
himmelma@33175
  2068
lemma dependent_imp_affine_dependent:
wenzelm@53302
  2069
  assumes "dependent {x - a| x . x \<in> s}"
wenzelm@53302
  2070
    and "a \<notin> s"
himmelma@33175
  2071
  shows "affine_dependent (insert a s)"
wenzelm@53302
  2072
proof -
wenzelm@49531
  2073
  from assms(1)[unfolded dependent_explicit] obtain S u v
himmelma@33175
  2074
    where obt:"finite S" "S \<subseteq> {x - a |x. x \<in> s}" "v\<in>S" "u v  \<noteq> 0" "(\<Sum>v\<in>S. u v *\<^sub>R v) = 0" by auto
himmelma@33175
  2075
  def t \<equiv> "(\<lambda>x. x + a) ` S"
himmelma@33175
  2076
wenzelm@53302
  2077
  have inj:"inj_on (\<lambda>x. x + a) S"
wenzelm@53302
  2078
    unfolding inj_on_def by auto
wenzelm@53302
  2079
  have "0 \<notin> S"
wenzelm@53302
  2080
    using obt(2) assms(2) unfolding subset_eq by auto
wenzelm@53302
  2081
  have fin: "finite t" and  "t \<subseteq> s"
wenzelm@53302
  2082
    unfolding t_def using obt(1,2) by auto
wenzelm@53302
  2083
  then have "finite (insert a t)" and "insert a t \<subseteq> insert a s"
wenzelm@53302
  2084
    by auto
wenzelm@53302
  2085
  moreover have *: "\<And>P Q. (\<Sum>x\<in>t. (if x = a then P x else Q x)) = (\<Sum>x\<in>t. Q x)"
wenzelm@53302
  2086
    apply (rule setsum_cong2)
wenzelm@53302
  2087
    using `a\<notin>s` `t\<subseteq>s`
wenzelm@53302
  2088
    apply auto
wenzelm@53302
  2089
    done
himmelma@33175
  2090
  have "(\<Sum>x\<in>insert a t. if x = a then - (\<Sum>x\<in>t. u (x - a)) else u (x - a)) = 0"
wenzelm@53302
  2091
    unfolding setsum_clauses(2)[OF fin]
wenzelm@53302
  2092
    using `a\<notin>s` `t\<subseteq>s`
wenzelm@53302
  2093
    apply auto
wenzelm@53302
  2094
    unfolding *
wenzelm@53302
  2095
    apply auto
wenzelm@53302
  2096
    done
himmelma@33175
  2097
  moreover have "\<exists>v\<in>insert a t. (if v = a then - (\<Sum>x\<in>t. u (x - a)) else u (v - a)) \<noteq> 0"
wenzelm@53302
  2098
    apply (rule_tac x="v + a" in bexI)
wenzelm@53302
  2099
    using obt(3,4) and `0\<notin>S`
wenzelm@53302
  2100
    unfolding t_def
wenzelm@53302
  2101
    apply auto
wenzelm@53302
  2102
    done
wenzelm@53302
  2103
  moreover have *: "\<And>P Q. (\<Sum>x\<in>t. (if x = a then P x else Q x) *\<^sub>R x) = (\<Sum>x\<in>t. Q x *\<^sub>R x)"
wenzelm@53302
  2104
    apply (rule setsum_cong2)
wenzelm@53302
  2105
    using `a\<notin>s` `t\<subseteq>s`
wenzelm@53302
  2106
    apply auto
wenzelm@53302
  2107
    done
wenzelm@49531
  2108
  have "(\<Sum>x\<in>t. u (x - a)) *\<^sub>R a = (\<Sum>v\<in>t. u (v - a) *\<^sub>R v)"
wenzelm@53302
  2109
    unfolding scaleR_left.setsum
wenzelm@53302
  2110
    unfolding t_def and setsum_reindex[OF inj] and o_def
wenzelm@53302
  2111
    using obt(5)
wenzelm@53302
  2112
    by (auto simp add: setsum_addf scaleR_right_distrib)
wenzelm@53302
  2113
  then have "(\<Sum>v\<in>insert a t. (if v = a then - (\<Sum>x\<in>t. u (x - a)) else u (v - a)) *\<^sub>R v) = 0"
wenzelm@53302
  2114
    unfolding setsum_clauses(2)[OF fin]
wenzelm@53302
  2115
    using `a\<notin>s` `t\<subseteq>s`
wenzelm@53302
  2116
    by (auto simp add: *)
wenzelm@53302
  2117
  ultimately show ?thesis
wenzelm@53302
  2118
    unfolding affine_dependent_explicit
wenzelm@53302
  2119
    apply (rule_tac x="insert a t" in exI)
wenzelm@53302
  2120
    apply auto
wenzelm@53302
  2121
    done
himmelma@33175
  2122
qed
himmelma@33175
  2123
himmelma@33175
  2124
lemma convex_cone:
wenzelm@53302
  2125
  "convex s \<and> cone s \<longleftrightarrow> (\<forall>x\<in>s. \<forall>y\<in>s. (x + y) \<in> s) \<and> (\<forall>x\<in>s. \<forall>c\<ge>0. (c *\<^sub>R x) \<in> s)"
wenzelm@53302
  2126
  (is "?lhs = ?rhs")
wenzelm@53302
  2127
proof -
wenzelm@53302
  2128
  {
wenzelm@53302
  2129
    fix x y
wenzelm@53302
  2130
    assume "x\<in>s" "y\<in>s" and ?lhs
wenzelm@53302
  2131
    then have "2 *\<^sub>R x \<in>s" "2 *\<^sub>R y \<in> s"
wenzelm@53302
  2132
      unfolding cone_def by auto
wenzelm@53302
  2133
    then have "x + y \<in> s"
wenzelm@53302
  2134
      using `?lhs`[unfolded convex_def, THEN conjunct1]
wenzelm@53302
  2135
      apply (erule_tac x="2*\<^sub>R x" in ballE)
wenzelm@53302
  2136
      apply (erule_tac x="2*\<^sub>R y" in ballE)
wenzelm@53302
  2137
      apply (erule_tac x="1/2" in allE)
wenzelm@53302
  2138
      apply simp
wenzelm@53302
  2139
      apply (erule_tac x="1/2" in allE)
wenzelm@53302
  2140
      apply auto
wenzelm@53302
  2141
      done
wenzelm@53302
  2142
  }
wenzelm@53302
  2143
  then show ?thesis
wenzelm@53302
  2144
    unfolding convex_def cone_def by blast
wenzelm@53302
  2145
qed
wenzelm@53302
  2146
wenzelm@53302
  2147
lemma affine_dependent_biggerset:
wenzelm@53302
  2148
  fixes s::"('a::euclidean_space) set"
hoelzl@37489
  2149
  assumes "finite s" "card s \<ge> DIM('a) + 2"
himmelma@33175
  2150
  shows "affine_dependent s"
wenzelm@53302
  2151
proof -
wenzelm@53302
  2152
  have "s \<noteq> {}" using assms by auto
wenzelm@53302
  2153
  then obtain a where "a\<in>s" by auto
wenzelm@53302
  2154
  have *: "{x - a |x. x \<in> s - {a}} = (\<lambda>x. x - a) ` (s - {a})"
wenzelm@53302
  2155
    by auto
wenzelm@53302
  2156
  have "card {x - a |x. x \<in> s - {a}} = card (s - {a})"
wenzelm@53302
  2157
    unfolding *
wenzelm@53302
  2158
    apply (rule card_image)
wenzelm@53302
  2159
    unfolding inj_on_def
wenzelm@53302
  2160
    apply auto
wenzelm@53302
  2161
    done
hoelzl@37489
  2162
  also have "\<dots> > DIM('a)" using assms(2)
himmelma@33175
  2163
    unfolding card_Diff_singleton[OF assms(1) `a\<in>s`] by auto
wenzelm@53302
  2164
  finally show ?thesis
wenzelm@53302
  2165
    apply (subst insert_Diff[OF `a\<in>s`, symmetric])
wenzelm@53302
  2166
    apply (rule dependent_imp_affine_dependent)
wenzelm@53302
  2167
    apply (rule dependent_biggerset)
wenzelm@53302
  2168
    apply auto
wenzelm@53302
  2169
    done
wenzelm@53302
  2170
qed
himmelma@33175
  2171
himmelma@33175
  2172
lemma affine_dependent_biggerset_general:
hoelzl@37489
  2173
  assumes "finite (s::('a::euclidean_space) set)" "card s \<ge> dim s + 2"
himmelma@33175
  2174
  shows "affine_dependent s"
wenzelm@53302
  2175
proof -
himmelma@33175
  2176
  from assms(2) have "s \<noteq> {}" by auto
himmelma@33175
  2177
  then obtain a where "a\<in>s" by auto
wenzelm@53302
  2178
  have *: "{x - a |x. x \<in> s - {a}} = (\<lambda>x. x - a) ` (s - {a})"
wenzelm@53302
  2179
    by auto
wenzelm@53302
  2180
  have **: "card {x - a |x. x \<in> s - {a}} = card (s - {a})"
wenzelm@53302
  2181
    unfolding *
wenzelm@53302
  2182
    apply (rule card_image)
wenzelm@53302
  2183
    unfolding inj_on_def
wenzelm@53302
  2184
    apply auto
wenzelm@53302
  2185
    done
himmelma@33175
  2186
  have "dim {x - a |x. x \<in> s - {a}} \<le> dim s"
wenzelm@53302
  2187
    apply (rule subset_le_dim)
wenzelm@53302
  2188
    unfolding subset_eq
wenzelm@53302
  2189
    using `a\<in>s`
wenzelm@53302
  2190
    apply (auto simp add:span_superset span_sub)
wenzelm@53302
  2191
    done
himmelma@33175
  2192
  also have "\<dots> < dim s + 1" by auto
wenzelm@53302
  2193
  also have "\<dots> \<le> card (s - {a})"
wenzelm@53302
  2194
    using assms
wenzelm@53302
  2195
    using card_Diff_singleton[OF assms(1) `a\<in>s`]
wenzelm@53302
  2196
    by auto
wenzelm@53302
  2197
  finally show ?thesis
wenzelm@53302
  2198
    apply (subst insert_Diff[OF `a\<in>s`, symmetric])
wenzelm@53302
  2199
    apply (rule dependent_imp_affine_dependent)
wenzelm@53302
  2200
    apply (rule dependent_biggerset_general)
wenzelm@53302
  2201
    unfolding **
wenzelm@53302
  2202
    apply auto
wenzelm@53302
  2203
    done
wenzelm@53302
  2204
qed
wenzelm@53302
  2205
himmelma@33175
  2206
himmelma@33175
  2207
subsection {* Caratheodory's theorem. *}
himmelma@33175
  2208
wenzelm@53302
  2209
lemma convex_hull_caratheodory:
wenzelm@53302
  2210
  fixes p :: "('a::euclidean_space) set"
wenzelm@53302
  2211
  shows "convex hull p =
wenzelm@53302
  2212
    {y. \<exists>s u. finite s \<and> s \<subseteq> p \<and> card s \<le> DIM('a) + 1 \<and>
wenzelm@53302
  2213
      (\<forall>x\<in>s. 0 \<le> u x) \<and> setsum u s = 1 \<and> setsum (\<lambda>v. u v *\<^sub>R v) s = y}"
nipkow@39302
  2214
  unfolding convex_hull_explicit set_eq_iff mem_Collect_eq
wenzelm@53302
  2215
proof (rule, rule)
wenzelm@53302
  2216
  fix y
wenzelm@53302
  2217
  let ?P = "\<lambda>n. \<exists>s u. finite s \<and> card s = n \<and> s \<subseteq> p \<and> (\<forall>x\<in>s. 0 \<le> u x) \<and>
wenzelm@53302
  2218
    setsum u s = 1 \<and> (\<Sum>v\<in>s. u v *\<^sub>R v) = y"
himmelma@33175
  2219
  assume "\<exists>s u. finite s \<and> s \<subseteq> p \<and> (\<forall>x\<in>s. 0 \<le> u x) \<and> setsum u s = 1 \<and> (\<Sum>v\<in>s. u v *\<^sub>R v) = y"
himmelma@33175
  2220
  then obtain N where "?P N" by auto
wenzelm@53302
  2221
  then have "\<exists>n\<le>N. (\<forall>k<n. \<not> ?P k) \<and> ?P n"
wenzelm@53302
  2222
    apply (rule_tac ex_least_nat_le)
wenzelm@53302
  2223
    apply auto
wenzelm@53302
  2224
    done
wenzelm@53302
  2225
  then obtain n where "?P n" and smallest: "\<forall>k<n. \<not> ?P k"
wenzelm@53302
  2226
    by blast
wenzelm@53302
  2227
  then obtain s u where obt: "finite s" "card s = n" "s\<subseteq>p" "\<forall>x\<in>s. 0 \<le> u x"
wenzelm@53302
  2228
    "setsum u s = 1"  "(\<Sum>v\<in>s. u v *\<^sub>R v) = y" by auto
wenzelm@53302
  2229
wenzelm@53302
  2230
  have "card s \<le> DIM('a) + 1"
wenzelm@53302
  2231
  proof (rule ccontr, simp only: not_le)
hoelzl@37489
  2232
    assume "DIM('a) + 1 < card s"
wenzelm@53302
  2233
    then have "affine_dependent s"
wenzelm@53302
  2234
      using affine_dependent_biggerset[OF obt(1)] by auto
wenzelm@53302
  2235
    then obtain w v where wv: "setsum w s = 0" "v\<in>s" "w v \<noteq> 0" "(\<Sum>v\<in>s. w v *\<^sub>R v) = 0"
himmelma@33175
  2236
      using affine_dependent_explicit_finite[OF obt(1)] by auto
wenzelm@53302
  2237
    def i \<equiv> "(\<lambda>v. (u v) / (- w v)) ` {v\<in>s. w v < 0}"
wenzelm@53302
  2238
    def t \<equiv> "Min i"
wenzelm@53302
  2239
    have "\<exists>x\<in>s. w x < 0"
wenzelm@53302
  2240
    proof (rule ccontr, simp add: not_less)
himmelma@33175
  2241
      assume as:"\<forall>x\<in>s. 0 \<le> w x"
wenzelm@53302
  2242
      then have "setsum w (s - {v}) \<ge> 0"
wenzelm@53302
  2243
        apply (rule_tac setsum_nonneg)
wenzelm@53302
  2244
        apply auto
wenzelm@53302
  2245
        done
wenzelm@53302
  2246
      then have "setsum w s > 0"
wenzelm@53302
  2247
        unfolding setsum_diff1'[OF obt(1) `v\<in>s`]
wenzelm@53302
  2248
        using as[THEN bspec[where x=v]] and `v\<in>s`
wenzelm@53302
  2249
        using `w v \<noteq> 0`
wenzelm@53302
  2250
        by auto
wenzelm@53302
  2251
      then show False using wv(1) by auto
wenzelm@53302
  2252
    qed
wenzelm@53302
  2253
    then have "i \<noteq> {}" unfolding i_def by auto
wenzelm@53302
  2254
wenzelm@53302
  2255
    then have "t \<ge> 0"
wenzelm@53302
  2256
      using Min_ge_iff[of i 0 ] and obt(1)
wenzelm@53302
  2257
      unfolding t_def i_def
wenzelm@53302
  2258
      using obt(4)[unfolded le_less]
wenzelm@53302
  2259
      apply auto
wenzelm@53302
  2260
      unfolding divide_le_0_iff
wenzelm@53302
  2261
      apply auto
wenzelm@53302
  2262
      done
wenzelm@53302
  2263
    have t: "\<forall>v\<in>s. u v + t * w v \<ge> 0"
wenzelm@53302
  2264
    proof
wenzelm@53302
  2265
      fix v
wenzelm@53302
  2266
      assume "v \<in> s"
wenzelm@53302
  2267
      then have v: "0 \<le> u v"
wenzelm@53302
  2268
        using obt(4)[THEN bspec[where x=v]] by auto
wenzelm@53302
  2269
      show "0 \<le> u v + t * w v"
wenzelm@53302
  2270
      proof (cases "w v < 0")
wenzelm@53302
  2271
        case False
wenzelm@53302
  2272
        then show ?thesis
wenzelm@53302
  2273
          apply (rule_tac add_nonneg_nonneg)
wenzelm@53302
  2274
          using v
wenzelm@53302
  2275
          apply simp
wenzelm@53302
  2276
          apply (rule mult_nonneg_nonneg)
wenzelm@53302
  2277
          using `t\<ge>0`
wenzelm@53302
  2278
          apply auto
wenzelm@53302
  2279
          done
wenzelm@53302
  2280
      next
wenzelm@53302
  2281
        case True
wenzelm@53302
  2282
        then have "t \<le> u v / (- w v)"
wenzelm@53302
  2283
          using `v\<in>s`
wenzelm@53302
  2284
          unfolding t_def i_def
wenzelm@53302
  2285
          apply (rule_tac Min_le)
wenzelm@53302
  2286
          using obt(1)
wenzelm@53302
  2287
          apply auto
wenzelm@53302
  2288
          done
wenzelm@53302
  2289
        then show ?thesis
wenzelm@53302
  2290
          unfolding real_0_le_add_iff
wenzelm@53302
  2291
          using pos_le_divide_eq[OF True[unfolded neg_0_less_iff_less[symmetric]]]
wenzelm@53302
  2292
          by auto
wenzelm@53302
  2293
      qed
wenzelm@53302
  2294
    qed
wenzelm@53302
  2295
wenzelm@53302
  2296
    obtain a where "a \<in> s" and "t = (\<lambda>v. (u v) / (- w v)) a" and "w a < 0"
himmelma@33175
  2297
      using Min_in[OF _ `i\<noteq>{}`] and obt(1) unfolding i_def t_def by auto
wenzelm@53302
  2298
    then have a: "a \<in> s" "u a + t * w a = 0" by auto
wenzelm@53302
  2299
    have *: "\<And>f. setsum f (s - {a}) = setsum f s - ((f a)::'b::ab_group_add)"
wenzelm@49531
  2300
      unfolding setsum_diff1'[OF obt(1) `a\<in>s`] by auto
himmelma@33175
  2301
    have "(\<Sum>v\<in>s. u v + t * w v) = 1"
wenzelm@49530
  2302
      unfolding setsum_addf wv(1) setsum_right_distrib[symmetric] obt(5) by auto
wenzelm@49531
  2303
    moreover have "(\<Sum>v\<in>s. u v *\<^sub>R v + (t * w v) *\<^sub>R v) - (u a *\<^sub>R a + (t * w a) *\<^sub>R a) = y"
wenzelm@49530
  2304
      unfolding setsum_addf obt(6) scaleR_scaleR[symmetric] scaleR_right.setsum [symmetric] wv(4)
hoelzl@37489
  2305
      using a(2) [THEN eq_neg_iff_add_eq_0 [THEN iffD2]] by simp
wenzelm@53302
  2306
    ultimately have "?P (n - 1)"
wenzelm@53302
  2307
      apply (rule_tac x="(s - {a})" in exI)
wenzelm@53302
  2308
      apply (rule_tac x="\<lambda>v. u v + t * w v" in exI)
wenzelm@53302
  2309
      using obt(1-3) and t and a
wenzelm@53302
  2310
      apply (auto simp add: * scaleR_left_distrib)
wenzelm@53302
  2311
      done
wenzelm@53302
  2312
    then show False
wenzelm@53302
  2313
      using smallest[THEN spec[where x="n - 1"]] by auto
wenzelm@53302
  2314
  qed
wenzelm@53302
  2315
  then show "\<exists>s u. finite s \<and> s \<subseteq> p \<and> card s \<le> DIM('a) + 1 \<and>
wenzelm@53302
  2316
    (\<forall>x\<in>s. 0 \<le> u x) \<and> setsum u s = 1 \<and> (\<Sum>v\<in>s. u v *\<^sub>R v) = y" using obt by auto
himmelma@33175
  2317
qed auto
himmelma@33175
  2318
himmelma@33175
  2319
lemma caratheodory:
wenzelm@53302
  2320
  "convex hull p =
wenzelm@53302
  2321
    {x::'a::euclidean_space. \<exists>s. finite s \<and> s \<subseteq> p \<and>
hoelzl@37489
  2322
      card s \<le> DIM('a) + 1 \<and> x \<in> convex hull s}"
wenzelm@53302
  2323
  unfolding set_eq_iff
wenzelm@53302
  2324
  apply rule
wenzelm@53302
  2325
  apply rule
wenzelm@53302
  2326
  unfolding mem_Collect_eq
wenzelm@53302
  2327
proof -
wenzelm@53302
  2328
  fix x
wenzelm@53302
  2329
  assume "x \<in> convex hull p"
hoelzl@37489
  2330
  then obtain s u where "finite s" "s \<subseteq> p" "card s \<le> DIM('a) + 1"
wenzelm@53302
  2331
    "\<forall>x\<in>s. 0 \<le> u x" "setsum u s = 1" "(\<Sum>v\<in>s. u v *\<^sub>R v) = x"
wenzelm@53302
  2332
    unfolding convex_hull_caratheodory by auto
wenzelm@53302
  2333
  then show "\<exists>s. finite s \<and> s \<subseteq> p \<and> card s \<le> DIM('a) + 1 \<and> x \<in> convex hull s"
wenzelm@53302
  2334
    apply (rule_tac x=s in exI)
wenzelm@53302
  2335
    using hull_subset[of s convex]
wenzelm@53302
  2336
    using convex_convex_hull[unfolded convex_explicit, of s, THEN spec[where x=s], THEN spec[where x=u]]
wenzelm@53302
  2337
    apply auto
wenzelm@53302
  2338
    done
himmelma@33175
  2339
next
wenzelm@53302
  2340
  fix x
wenzelm@53302
  2341
  assume "\<exists>s. finite s \<and> s \<subseteq> p \<and> card s \<le> DIM('a) + 1 \<and> x \<in> convex hull s"
wenzelm@53302
  2342
  then obtain s where "finite s" "s \<subseteq> p" "card s \<le> DIM('a) + 1" "x \<in> convex hull s"
wenzelm@53302
  2343
    by auto
wenzelm@53302
  2344
  then show "x \<in> convex hull p"
wenzelm@53302
  2345
    using hull_mono[OF `s\<subseteq>p`] by auto
himmelma@33175
  2346
qed
himmelma@33175
  2347
hoelzl@40377
  2348
hoelzl@40377
  2349
subsection {* Some Properties of Affine Dependent Sets *}
hoelzl@40377
  2350
hoelzl@40377
  2351
lemma affine_independent_empty: "~(affine_dependent {})"
hoelzl@40377
  2352
  by (simp add: affine_dependent_def)
hoelzl@40377
  2353
wenzelm@53302
  2354
lemma affine_independent_sing: "\<not> affine_dependent {a}"
wenzelm@53302
  2355
  by (simp add: affine_dependent_def)
wenzelm@53302
  2356
wenzelm@53302
  2357
lemma affine_hull_translation: "affine hull ((\<lambda>x. a + x) `  S) = (\<lambda>x. a + x) ` (affine hull S)"
wenzelm@53302
  2358
proof -
wenzelm@53302
  2359
  have "affine ((\<lambda>x. a + x) ` (affine hull S))"
wenzelm@53302
  2360
    using affine_translation affine_affine_hull by auto
wenzelm@53302
  2361
  moreover have "(\<lambda>x. a + x) `  S <= (\<lambda>x. a + x) ` (affine hull S)"
wenzelm@53302
  2362
    using hull_subset[of S] by auto
wenzelm@53302
  2363
  ultimately have h1: "affine hull ((\<lambda>x. a + x) `  S) <= (\<lambda>x. a + x) ` (affine hull S)"
wenzelm@53302
  2364
    by (metis hull_minimal)
wenzelm@53302
  2365
  have "affine((\<lambda>x. -a + x) ` (affine hull ((\<lambda>x. a + x) `  S)))"
wenzelm@53302
  2366
    using affine_translation affine_affine_hull by auto
wenzelm@53302
  2367
  moreover have "(\<lambda>x. -a + x) ` (%x. a + x) `  S <= (\<lambda>x. -a + x) ` (affine hull ((%x. a + x) `  S))"
wenzelm@53302
  2368
    using hull_subset[of "(\<lambda>x. a + x) `  S"] by auto
wenzelm@53302
  2369
  moreover have "S = (\<lambda>x. -a + x) ` (%x. a + x) `  S"
wenzelm@53302
  2370
    using translation_assoc[of "-a" a] by auto
wenzelm@53302
  2371
  ultimately have "(\<lambda>x. -a + x) ` (affine hull ((\<lambda>x. a + x) `  S)) >= (affine hull S)"
wenzelm@53302
  2372
    by (metis hull_minimal)
wenzelm@53302
  2373
  then have "affine hull ((\<lambda>x. a + x) ` S) >= (\<lambda>x. a + x) ` (affine hull S)"
wenzelm@53302
  2374
    by auto
wenzelm@53302
  2375
  from this show ?thesis using h1 by auto
hoelzl@40377
  2376
qed
hoelzl@40377
  2377
hoelzl@40377
  2378
lemma affine_dependent_translation:
hoelzl@40377
  2379
  assumes "affine_dependent S"
wenzelm@53339
  2380
  shows "affine_dependent ((\<lambda>x. a + x) ` S)"
wenzelm@53302
  2381
proof -
wenzelm@53339
  2382
  obtain x where x_def: "x \<in> S \<and> x \<in> affine hull (S - {x})"
wenzelm@53302
  2383
    using assms affine_dependent_def by auto
wenzelm@53302
  2384
  have "op + a ` (S - {x}) = op + a ` S - {a + x}"
wenzelm@53302
  2385
    by auto
wenzelm@53339
  2386
  then have "a+x \<in> affine hull ((\<lambda>x. a + x) ` S - {a+x})"
wenzelm@53302
  2387
    using affine_hull_translation[of a "S-{x}"] x_def by auto
wenzelm@53339
  2388
  moreover have "a+x \<in> (\<lambda>x. a + x) ` S"
wenzelm@53302
  2389
    using x_def by auto
wenzelm@53302
  2390
  ultimately show ?thesis
wenzelm@53302
  2391
    unfolding affine_dependent_def by auto
hoelzl@40377
  2392
qed
hoelzl@40377
  2393
hoelzl@40377
  2394
lemma affine_dependent_translation_eq:
wenzelm@53339
  2395
  "affine_dependent S <-> affine_dependent ((\<lambda>x. a + x) ` S)"
wenzelm@53302
  2396
proof -
wenzelm@53302
  2397
  {
wenzelm@53339
  2398
    assume "affine_dependent ((\<lambda>x. a + x) ` S)"
wenzelm@53302
  2399
    then have "affine_dependent S"
wenzelm@53339
  2400
      using affine_dependent_translation[of "((\<lambda>x. a + x) ` S)" "-a"] translation_assoc[of "-a" a]
wenzelm@53302
  2401
      by auto
wenzelm@53302
  2402
  }
wenzelm@53302
  2403
  then show ?thesis
wenzelm@53302
  2404
    using affine_dependent_translation by auto
hoelzl@40377
  2405
qed
hoelzl@40377
  2406
hoelzl@40377
  2407
lemma affine_hull_0_dependent:
wenzelm@53339
  2408
  assumes "0 \<in> affine hull S"
hoelzl@40377
  2409
  shows "dependent S"
wenzelm@53302
  2410
proof -
wenzelm@53339
  2411
  obtain s u where s_u_def: "finite s \<and> s \<noteq> {} \<and> s \<subseteq> S \<and> setsum u s = 1 \<and> (\<Sum>v\<in>s. u v *\<^sub>R v) = 0"
wenzelm@53302
  2412
    using assms affine_hull_explicit[of S] by auto
wenzelm@53339
  2413
  then have "\<exists>v\<in>s. u v \<noteq> 0"
wenzelm@53302
  2414
    using setsum_not_0[of "u" "s"] by auto
wenzelm@53339
  2415
  then have "finite s \<and> s \<subseteq> S \<and> (\<exists>v\<in>s. u v \<noteq> 0 \<and> (\<Sum>v\<in>s. u v *\<^sub>R v) = 0)"
wenzelm@53302
  2416
    using s_u_def by auto
wenzelm@53302
  2417
  then show ?thesis
wenzelm@53302
  2418
    unfolding dependent_explicit[of S] by auto
hoelzl@40377
  2419
qed
hoelzl@40377
  2420
hoelzl@40377
  2421
lemma affine_dependent_imp_dependent2:
hoelzl@40377
  2422
  assumes "affine_dependent (insert 0 S)"
hoelzl@40377
  2423
  shows "dependent S"
wenzelm@53302
  2424
proof -
wenzelm@53339
  2425
  obtain x where x_def: "x \<in> insert 0 S \<and> x \<in> affine hull (insert 0 S - {x})"
wenzelm@53302
  2426
    using affine_dependent_def[of "(insert 0 S)"] assms by blast
wenzelm@53302
  2427
  then have "x \<in> span (insert 0 S - {x})"
wenzelm@53302
  2428
    using affine_hull_subset_span by auto
wenzelm@53302
  2429
  moreover have "span (insert 0 S - {x}) = span (S - {x})"
wenzelm@53302
  2430
    using insert_Diff_if[of "0" S "{x}"] span_insert_0[of "S-{x}"] by auto
wenzelm@53302
  2431
  ultimately have "x \<in> span (S - {x})" by auto
wenzelm@53302
  2432
  then have "x \<noteq> 0 \<Longrightarrow> dependent S"
wenzelm@53302
  2433
    using x_def dependent_def by auto
wenzelm@53302
  2434
  moreover
wenzelm@53302
  2435
  {
wenzelm@53302
  2436
    assume "x = 0"
wenzelm@53302
  2437
    then have "0 \<in> affine hull S"
wenzelm@53302
  2438
      using x_def hull_mono[of "S - {0}" S] by auto
wenzelm@53302
  2439
    then have "dependent S"
wenzelm@53302
  2440
      using affine_hull_0_dependent by auto
wenzelm@53302
  2441
  }
wenzelm@53302
  2442
  ultimately show ?thesis by auto
hoelzl@40377
  2443
qed
hoelzl@40377
  2444
hoelzl@40377
  2445
lemma affine_dependent_iff_dependent:
wenzelm@53302
  2446
  assumes "a \<notin> S"
wenzelm@53302
  2447
  shows "affine_dependent (insert a S) \<longleftrightarrow> dependent ((\<lambda>x. -a + x) ` S)"
wenzelm@53302
  2448
proof -
wenzelm@53302
  2449
  have "(op + (- a) ` S) = {x - a| x . x : S}" by auto
wenzelm@53302
  2450
  then show ?thesis
wenzelm@53302
  2451
    using affine_dependent_translation_eq[of "(insert a S)" "-a"]
wenzelm@49531
  2452
      affine_dependent_imp_dependent2 assms
wenzelm@53302
  2453
      dependent_imp_affine_dependent[of a S]
wenzelm@53302
  2454
    by auto
hoelzl@40377
  2455
qed
hoelzl@40377
  2456
hoelzl@40377
  2457
lemma affine_dependent_iff_dependent2:
wenzelm@53339
  2458
  assumes "a \<in> S"
wenzelm@53339
  2459
  shows "affine_dependent S \<longleftrightarrow> dependent ((\<lambda>x. -a + x) ` (S-{a}))"
wenzelm@53302
  2460
proof -
wenzelm@53339
  2461
  have "insert a (S - {a}) = S"
wenzelm@53302
  2462
    using assms by auto
wenzelm@53302
  2463
  then show ?thesis
wenzelm@53302
  2464
    using assms affine_dependent_iff_dependent[of a "S-{a}"] by auto
hoelzl@40377
  2465
qed
hoelzl@40377
  2466
hoelzl@40377
  2467
lemma affine_hull_insert_span_gen:
wenzelm@53339
  2468
  "affine hull (insert a s) = (\<lambda>x. a + x) ` span ((\<lambda>x. - a + x) ` s)"
wenzelm@5