src/HOL/Multivariate_Analysis/Topology_Euclidean_Space.thy
author hoelzl
Mon Dec 03 18:19:02 2012 +0100 (2012-12-03)
changeset 50324 0a1242d5e7d4
parent 50245 dea9363887a6
child 50526 899c9c4e4a4c
permissions -rw-r--r--
add filterlim rules for diverging multiplication and addition; move at_infinity to the HOL image
hoelzl@33714
     1
(*  title:      HOL/Library/Topology_Euclidian_Space.thy
himmelma@33175
     2
    Author:     Amine Chaieb, University of Cambridge
himmelma@33175
     3
    Author:     Robert Himmelmann, TU Muenchen
huffman@44075
     4
    Author:     Brian Huffman, Portland State University
himmelma@33175
     5
*)
himmelma@33175
     6
himmelma@33175
     7
header {* Elementary topology in Euclidean space. *}
himmelma@33175
     8
himmelma@33175
     9
theory Topology_Euclidean_Space
immler@50087
    10
imports
immler@50087
    11
  SEQ
immler@50087
    12
  "~~/src/HOL/Library/Diagonal_Subsequence"
immler@50245
    13
  "~~/src/HOL/Library/Countable_Set"
immler@50087
    14
  Linear_Algebra
immler@50087
    15
  "~~/src/HOL/Library/Glbs"
immler@50087
    16
  Norm_Arith
immler@50087
    17
begin
immler@50087
    18
immler@50087
    19
subsection {* Topological Basis *}
immler@50087
    20
immler@50087
    21
context topological_space
immler@50087
    22
begin
immler@50087
    23
immler@50087
    24
definition "topological_basis B =
immler@50087
    25
  ((\<forall>b\<in>B. open b) \<and> (\<forall>x. open x \<longrightarrow> (\<exists>B'. B' \<subseteq> B \<and> Union B' = x)))"
immler@50087
    26
immler@50087
    27
lemma topological_basis_iff:
immler@50087
    28
  assumes "\<And>B'. B' \<in> B \<Longrightarrow> open B'"
immler@50087
    29
  shows "topological_basis B \<longleftrightarrow> (\<forall>O'. open O' \<longrightarrow> (\<forall>x\<in>O'. \<exists>B'\<in>B. x \<in> B' \<and> B' \<subseteq> O'))"
immler@50087
    30
    (is "_ \<longleftrightarrow> ?rhs")
immler@50087
    31
proof safe
immler@50087
    32
  fix O' and x::'a
immler@50087
    33
  assume H: "topological_basis B" "open O'" "x \<in> O'"
immler@50087
    34
  hence "(\<exists>B'\<subseteq>B. \<Union>B' = O')" by (simp add: topological_basis_def)
immler@50087
    35
  then obtain B' where "B' \<subseteq> B" "O' = \<Union>B'" by auto
immler@50087
    36
  thus "\<exists>B'\<in>B. x \<in> B' \<and> B' \<subseteq> O'" using H by auto
immler@50087
    37
next
immler@50087
    38
  assume H: ?rhs
immler@50087
    39
  show "topological_basis B" using assms unfolding topological_basis_def
immler@50087
    40
  proof safe
immler@50087
    41
    fix O'::"'a set" assume "open O'"
immler@50087
    42
    with H obtain f where "\<forall>x\<in>O'. f x \<in> B \<and> x \<in> f x \<and> f x \<subseteq> O'"
immler@50087
    43
      by (force intro: bchoice simp: Bex_def)
immler@50087
    44
    thus "\<exists>B'\<subseteq>B. \<Union>B' = O'"
immler@50087
    45
      by (auto intro: exI[where x="{f x |x. x \<in> O'}"])
immler@50087
    46
  qed
immler@50087
    47
qed
immler@50087
    48
immler@50087
    49
lemma topological_basisI:
immler@50087
    50
  assumes "\<And>B'. B' \<in> B \<Longrightarrow> open B'"
immler@50087
    51
  assumes "\<And>O' x. open O' \<Longrightarrow> x \<in> O' \<Longrightarrow> \<exists>B'\<in>B. x \<in> B' \<and> B' \<subseteq> O'"
immler@50087
    52
  shows "topological_basis B"
immler@50087
    53
  using assms by (subst topological_basis_iff) auto
immler@50087
    54
immler@50087
    55
lemma topological_basisE:
immler@50087
    56
  fixes O'
immler@50087
    57
  assumes "topological_basis B"
immler@50087
    58
  assumes "open O'"
immler@50087
    59
  assumes "x \<in> O'"
immler@50087
    60
  obtains B' where "B' \<in> B" "x \<in> B'" "B' \<subseteq> O'"
immler@50087
    61
proof atomize_elim
immler@50087
    62
  from assms have "\<And>B'. B'\<in>B \<Longrightarrow> open B'" by (simp add: topological_basis_def)
immler@50087
    63
  with topological_basis_iff assms
immler@50087
    64
  show  "\<exists>B'. B' \<in> B \<and> x \<in> B' \<and> B' \<subseteq> O'" using assms by (simp add: Bex_def)
immler@50087
    65
qed
immler@50087
    66
immler@50094
    67
lemma topological_basis_open:
immler@50094
    68
  assumes "topological_basis B"
immler@50094
    69
  assumes "X \<in> B"
immler@50094
    70
  shows "open X"
immler@50094
    71
  using assms
immler@50094
    72
  by (simp add: topological_basis_def)
immler@50094
    73
immler@50245
    74
lemma basis_dense:
immler@50245
    75
  fixes B::"'a set set" and f::"'a set \<Rightarrow> 'a"
immler@50245
    76
  assumes "topological_basis B"
immler@50245
    77
  assumes choosefrom_basis: "\<And>B'. B' \<noteq> {} \<Longrightarrow> f B' \<in> B'"
immler@50245
    78
  shows "(\<forall>X. open X \<longrightarrow> X \<noteq> {} \<longrightarrow> (\<exists>B' \<in> B. f B' \<in> X))"
immler@50245
    79
proof (intro allI impI)
immler@50245
    80
  fix X::"'a set" assume "open X" "X \<noteq> {}"
immler@50245
    81
  from topological_basisE[OF `topological_basis B` `open X` choosefrom_basis[OF `X \<noteq> {}`]]
immler@50245
    82
  guess B' . note B' = this
immler@50245
    83
  thus "\<exists>B'\<in>B. f B' \<in> X" by (auto intro!: choosefrom_basis)
immler@50245
    84
qed
immler@50245
    85
immler@50087
    86
end
immler@50087
    87
immler@50245
    88
subsection {* Countable Basis *}
immler@50245
    89
immler@50245
    90
locale countable_basis =
immler@50245
    91
  fixes B::"'a::topological_space set set"
immler@50245
    92
  assumes is_basis: "topological_basis B"
immler@50245
    93
  assumes countable_basis: "countable B"
himmelma@33175
    94
begin
himmelma@33175
    95
immler@50245
    96
lemma open_countable_basis_ex:
immler@50087
    97
  assumes "open X"
immler@50245
    98
  shows "\<exists>B' \<subseteq> B. X = Union B'"
immler@50245
    99
  using assms countable_basis is_basis unfolding topological_basis_def by blast
immler@50245
   100
immler@50245
   101
lemma open_countable_basisE:
immler@50245
   102
  assumes "open X"
immler@50245
   103
  obtains B' where "B' \<subseteq> B" "X = Union B'"
immler@50245
   104
  using assms open_countable_basis_ex by (atomize_elim) simp
immler@50245
   105
immler@50245
   106
lemma countable_dense_exists:
immler@50245
   107
  shows "\<exists>D::'a set. countable D \<and> (\<forall>X. open X \<longrightarrow> X \<noteq> {} \<longrightarrow> (\<exists>d \<in> D. d \<in> X))"
immler@50087
   108
proof -
immler@50245
   109
  let ?f = "(\<lambda>B'. SOME x. x \<in> B')"
immler@50245
   110
  have "countable (?f ` B)" using countable_basis by simp
immler@50245
   111
  with basis_dense[OF is_basis, of ?f] show ?thesis
immler@50245
   112
    by (intro exI[where x="?f ` B"]) (metis (mono_tags) all_not_in_conv imageI someI)
immler@50087
   113
qed
immler@50087
   114
immler@50087
   115
lemma countable_dense_setE:
immler@50245
   116
  obtains D :: "'a set"
immler@50245
   117
  where "countable D" "\<And>X. open X \<Longrightarrow> X \<noteq> {} \<Longrightarrow> \<exists>d \<in> D. d \<in> X"
immler@50245
   118
  using countable_dense_exists by blast
immler@50245
   119
immler@50245
   120
text {* Construction of an increasing sequence approximating open sets,
immler@50245
   121
  therefore basis which is closed under union. *}
immler@50245
   122
immler@50245
   123
definition union_closed_basis::"'a set set" where
immler@50245
   124
  "union_closed_basis = (\<lambda>l. \<Union>set l) ` lists B"
immler@50245
   125
immler@50245
   126
lemma basis_union_closed_basis: "topological_basis union_closed_basis"
immler@50094
   127
proof (rule topological_basisI)
immler@50094
   128
  fix O' and x::'a assume "open O'" "x \<in> O'"
immler@50245
   129
  from topological_basisE[OF is_basis this] guess B' . note B' = this
immler@50245
   130
  thus "\<exists>B'\<in>union_closed_basis. x \<in> B' \<and> B' \<subseteq> O'" unfolding union_closed_basis_def
immler@50245
   131
    by (auto intro!: bexI[where x="[B']"])
immler@50094
   132
next
immler@50245
   133
  fix B' assume "B' \<in> union_closed_basis"
immler@50245
   134
  thus "open B'"
immler@50245
   135
    using topological_basis_open[OF is_basis]
immler@50245
   136
    by (auto simp: union_closed_basis_def)
immler@50245
   137
qed
immler@50245
   138
immler@50245
   139
lemma countable_union_closed_basis: "countable union_closed_basis"
immler@50245
   140
  unfolding union_closed_basis_def using countable_basis by simp
immler@50245
   141
immler@50245
   142
lemmas open_union_closed_basis = topological_basis_open[OF basis_union_closed_basis]
immler@50245
   143
immler@50245
   144
lemma union_closed_basis_ex:
immler@50245
   145
 assumes X: "X \<in> union_closed_basis"
immler@50245
   146
 shows "\<exists>B'. finite B' \<and> X = \<Union>B' \<and> B' \<subseteq> B"
immler@50245
   147
proof -
immler@50245
   148
  from X obtain l where "\<And>x. x\<in>set l \<Longrightarrow> x\<in>B" "X = \<Union>set l" by (auto simp: union_closed_basis_def)
immler@50245
   149
  thus ?thesis by auto
immler@50245
   150
qed
immler@50245
   151
immler@50245
   152
lemma union_closed_basisE:
immler@50245
   153
  assumes "X \<in> union_closed_basis"
immler@50245
   154
  obtains B' where "finite B'" "X = \<Union>B'" "B' \<subseteq> B" using union_closed_basis_ex[OF assms] by blast
immler@50245
   155
immler@50245
   156
lemma union_closed_basisI:
immler@50245
   157
  assumes "finite B'" "X = \<Union>B'" "B' \<subseteq> B"
immler@50245
   158
  shows "X \<in> union_closed_basis"
immler@50245
   159
proof -
immler@50245
   160
  from finite_list[OF `finite B'`] guess l ..
immler@50245
   161
  thus ?thesis using assms unfolding union_closed_basis_def by (auto intro!: image_eqI[where x=l])
immler@50245
   162
qed
immler@50245
   163
immler@50245
   164
lemma empty_basisI[intro]: "{} \<in> union_closed_basis"
immler@50245
   165
  by (rule union_closed_basisI[of "{}"]) auto
immler@50087
   166
immler@50087
   167
lemma union_basisI[intro]:
immler@50245
   168
  assumes "X \<in> union_closed_basis" "Y \<in> union_closed_basis"
immler@50245
   169
  shows "X \<union> Y \<in> union_closed_basis"
immler@50245
   170
  using assms by (auto intro: union_closed_basisI elim!:union_closed_basisE)
immler@50087
   171
immler@50087
   172
lemma open_imp_Union_of_incseq:
immler@50087
   173
  assumes "open X"
immler@50245
   174
  shows "\<exists>S. incseq S \<and> (\<Union>j. S j) = X \<and> range S \<subseteq> union_closed_basis"
immler@50087
   175
proof -
immler@50245
   176
  from open_countable_basis_ex[OF `open X`]
immler@50245
   177
  obtain B' where B': "B'\<subseteq>B" "X = \<Union>B'" by auto
immler@50245
   178
  from this(1) countable_basis have "countable B'" by (rule countable_subset)
immler@50245
   179
  show ?thesis
immler@50245
   180
  proof cases
immler@50245
   181
    assume "B' \<noteq> {}"
immler@50245
   182
    def S \<equiv> "\<lambda>n. \<Union>i\<in>{0..n}. from_nat_into B' i"
immler@50245
   183
    have S:"\<And>n. S n = \<Union>{from_nat_into B' i|i. i\<in>{0..n}}" unfolding S_def by force
immler@50245
   184
    have "incseq S" by (force simp: S_def incseq_Suc_iff)
immler@50245
   185
    moreover
immler@50245
   186
    have "(\<Union>j. S j) = X" unfolding B'
immler@50245
   187
    proof safe
immler@50245
   188
      fix x X assume "X \<in> B'" "x \<in> X"
immler@50245
   189
      then obtain n where "X = from_nat_into B' n"
immler@50245
   190
        by (metis `countable B'` from_nat_into_surj)
immler@50245
   191
      also have "\<dots> \<subseteq> S n" by (auto simp: S_def)
immler@50245
   192
      finally show "x \<in> (\<Union>j. S j)" using `x \<in> X` by auto
immler@50245
   193
    next
immler@50245
   194
      fix x n
immler@50245
   195
      assume "x \<in> S n"
immler@50245
   196
      also have "\<dots> = (\<Union>i\<in>{0..n}. from_nat_into B' i)"
immler@50245
   197
        by (simp add: S_def)
immler@50245
   198
      also have "\<dots> \<subseteq> (\<Union>i. from_nat_into B' i)" by auto
immler@50245
   199
      also have "\<dots> \<subseteq> \<Union>B'" using `B' \<noteq> {}` by (auto intro: from_nat_into)
immler@50245
   200
      finally show "x \<in> \<Union>B'" .
immler@50245
   201
    qed
immler@50245
   202
    moreover have "range S \<subseteq> union_closed_basis" using B'
immler@50245
   203
      by (auto intro!: union_closed_basisI[OF _ S] simp: from_nat_into `B' \<noteq> {}`)
immler@50245
   204
    ultimately show ?thesis by auto
immler@50245
   205
  qed (auto simp: B')
immler@50087
   206
qed
immler@50087
   207
immler@50087
   208
lemma open_incseqE:
immler@50087
   209
  assumes "open X"
immler@50245
   210
  obtains S where "incseq S" "(\<Union>j. S j) = X" "range S \<subseteq> union_closed_basis"
immler@50087
   211
  using open_imp_Union_of_incseq assms by atomize_elim
immler@50087
   212
immler@50087
   213
end
immler@50087
   214
immler@50245
   215
class countable_basis_space = topological_space +
immler@50245
   216
  assumes ex_countable_basis:
immler@50245
   217
    "\<exists>B::'a::topological_space set set. countable B \<and> topological_basis B"
immler@50245
   218
immler@50245
   219
sublocale countable_basis_space < countable_basis "SOME B. countable B \<and> topological_basis B"
immler@50245
   220
  using someI_ex[OF ex_countable_basis] by unfold_locales safe
immler@50094
   221
immler@50087
   222
subsection {* Polish spaces *}
immler@50087
   223
immler@50087
   224
text {* Textbooks define Polish spaces as completely metrizable.
immler@50087
   225
  We assume the topology to be complete for a given metric. *}
immler@50087
   226
immler@50245
   227
class polish_space = complete_space + countable_basis_space
immler@50087
   228
huffman@44517
   229
subsection {* General notion of a topology as a value *}
himmelma@33175
   230
huffman@44170
   231
definition "istopology L \<longleftrightarrow> L {} \<and> (\<forall>S T. L S \<longrightarrow> L T \<longrightarrow> L (S \<inter> T)) \<and> (\<forall>K. Ball K L \<longrightarrow> L (\<Union> K))"
wenzelm@49834
   232
typedef 'a topology = "{L::('a set) \<Rightarrow> bool. istopology L}"
himmelma@33175
   233
  morphisms "openin" "topology"
himmelma@33175
   234
  unfolding istopology_def by blast
himmelma@33175
   235
himmelma@33175
   236
lemma istopology_open_in[intro]: "istopology(openin U)"
himmelma@33175
   237
  using openin[of U] by blast
himmelma@33175
   238
himmelma@33175
   239
lemma topology_inverse': "istopology U \<Longrightarrow> openin (topology U) = U"
huffman@44170
   240
  using topology_inverse[unfolded mem_Collect_eq] .
himmelma@33175
   241
himmelma@33175
   242
lemma topology_inverse_iff: "istopology U \<longleftrightarrow> openin (topology U) = U"
himmelma@33175
   243
  using topology_inverse[of U] istopology_open_in[of "topology U"] by auto
himmelma@33175
   244
himmelma@33175
   245
lemma topology_eq: "T1 = T2 \<longleftrightarrow> (\<forall>S. openin T1 S \<longleftrightarrow> openin T2 S)"
himmelma@33175
   246
proof-
wenzelm@49711
   247
  { assume "T1=T2"
wenzelm@49711
   248
    hence "\<forall>S. openin T1 S \<longleftrightarrow> openin T2 S" by simp }
himmelma@33175
   249
  moreover
wenzelm@49711
   250
  { assume H: "\<forall>S. openin T1 S \<longleftrightarrow> openin T2 S"
huffman@44170
   251
    hence "openin T1 = openin T2" by (simp add: fun_eq_iff)
himmelma@33175
   252
    hence "topology (openin T1) = topology (openin T2)" by simp
wenzelm@49711
   253
    hence "T1 = T2" unfolding openin_inverse .
wenzelm@49711
   254
  }
himmelma@33175
   255
  ultimately show ?thesis by blast
himmelma@33175
   256
qed
himmelma@33175
   257
himmelma@33175
   258
text{* Infer the "universe" from union of all sets in the topology. *}
himmelma@33175
   259
himmelma@33175
   260
definition "topspace T =  \<Union>{S. openin T S}"
himmelma@33175
   261
huffman@44210
   262
subsubsection {* Main properties of open sets *}
himmelma@33175
   263
himmelma@33175
   264
lemma openin_clauses:
himmelma@33175
   265
  fixes U :: "'a topology"
himmelma@33175
   266
  shows "openin U {}"
himmelma@33175
   267
  "\<And>S T. openin U S \<Longrightarrow> openin U T \<Longrightarrow> openin U (S\<inter>T)"
himmelma@33175
   268
  "\<And>K. (\<forall>S \<in> K. openin U S) \<Longrightarrow> openin U (\<Union>K)"
huffman@44170
   269
  using openin[of U] unfolding istopology_def mem_Collect_eq
huffman@44170
   270
  by fast+
himmelma@33175
   271
himmelma@33175
   272
lemma openin_subset[intro]: "openin U S \<Longrightarrow> S \<subseteq> topspace U"
himmelma@33175
   273
  unfolding topspace_def by blast
himmelma@33175
   274
lemma openin_empty[simp]: "openin U {}" by (simp add: openin_clauses)
himmelma@33175
   275
himmelma@33175
   276
lemma openin_Int[intro]: "openin U S \<Longrightarrow> openin U T \<Longrightarrow> openin U (S \<inter> T)"
huffman@36362
   277
  using openin_clauses by simp
huffman@36362
   278
huffman@36362
   279
lemma openin_Union[intro]: "(\<forall>S \<in>K. openin U S) \<Longrightarrow> openin U (\<Union> K)"
huffman@36362
   280
  using openin_clauses by simp
himmelma@33175
   281
himmelma@33175
   282
lemma openin_Un[intro]: "openin U S \<Longrightarrow> openin U T \<Longrightarrow> openin U (S \<union> T)"
himmelma@33175
   283
  using openin_Union[of "{S,T}" U] by auto
himmelma@33175
   284
himmelma@33175
   285
lemma openin_topspace[intro, simp]: "openin U (topspace U)" by (simp add: openin_Union topspace_def)
himmelma@33175
   286
wenzelm@49711
   287
lemma openin_subopen: "openin U S \<longleftrightarrow> (\<forall>x \<in> S. \<exists>T. openin U T \<and> x \<in> T \<and> T \<subseteq> S)"
wenzelm@49711
   288
  (is "?lhs \<longleftrightarrow> ?rhs")
huffman@36584
   289
proof
wenzelm@49711
   290
  assume ?lhs
wenzelm@49711
   291
  then show ?rhs by auto
huffman@36584
   292
next
huffman@36584
   293
  assume H: ?rhs
huffman@36584
   294
  let ?t = "\<Union>{T. openin U T \<and> T \<subseteq> S}"
huffman@36584
   295
  have "openin U ?t" by (simp add: openin_Union)
huffman@36584
   296
  also have "?t = S" using H by auto
huffman@36584
   297
  finally show "openin U S" .
himmelma@33175
   298
qed
himmelma@33175
   299
wenzelm@49711
   300
huffman@44210
   301
subsubsection {* Closed sets *}
himmelma@33175
   302
himmelma@33175
   303
definition "closedin U S \<longleftrightarrow> S \<subseteq> topspace U \<and> openin U (topspace U - S)"
himmelma@33175
   304
himmelma@33175
   305
lemma closedin_subset: "closedin U S \<Longrightarrow> S \<subseteq> topspace U" by (metis closedin_def)
himmelma@33175
   306
lemma closedin_empty[simp]: "closedin U {}" by (simp add: closedin_def)
himmelma@33175
   307
lemma closedin_topspace[intro,simp]:
himmelma@33175
   308
  "closedin U (topspace U)" by (simp add: closedin_def)
himmelma@33175
   309
lemma closedin_Un[intro]: "closedin U S \<Longrightarrow> closedin U T \<Longrightarrow> closedin U (S \<union> T)"
himmelma@33175
   310
  by (auto simp add: Diff_Un closedin_def)
himmelma@33175
   311
himmelma@33175
   312
lemma Diff_Inter[intro]: "A - \<Inter>S = \<Union> {A - s|s. s\<in>S}" by auto
himmelma@33175
   313
lemma closedin_Inter[intro]: assumes Ke: "K \<noteq> {}" and Kc: "\<forall>S \<in>K. closedin U S"
himmelma@33175
   314
  shows "closedin U (\<Inter> K)"  using Ke Kc unfolding closedin_def Diff_Inter by auto
himmelma@33175
   315
himmelma@33175
   316
lemma closedin_Int[intro]: "closedin U S \<Longrightarrow> closedin U T \<Longrightarrow> closedin U (S \<inter> T)"
himmelma@33175
   317
  using closedin_Inter[of "{S,T}" U] by auto
himmelma@33175
   318
himmelma@33175
   319
lemma Diff_Diff_Int: "A - (A - B) = A \<inter> B" by blast
himmelma@33175
   320
lemma openin_closedin_eq: "openin U S \<longleftrightarrow> S \<subseteq> topspace U \<and> closedin U (topspace U - S)"
himmelma@33175
   321
  apply (auto simp add: closedin_def Diff_Diff_Int inf_absorb2)
himmelma@33175
   322
  apply (metis openin_subset subset_eq)
himmelma@33175
   323
  done
himmelma@33175
   324
himmelma@33175
   325
lemma openin_closedin:  "S \<subseteq> topspace U \<Longrightarrow> (openin U S \<longleftrightarrow> closedin U (topspace U - S))"
himmelma@33175
   326
  by (simp add: openin_closedin_eq)
himmelma@33175
   327
himmelma@33175
   328
lemma openin_diff[intro]: assumes oS: "openin U S" and cT: "closedin U T" shows "openin U (S - T)"
himmelma@33175
   329
proof-
himmelma@33175
   330
  have "S - T = S \<inter> (topspace U - T)" using openin_subset[of U S]  oS cT
himmelma@33175
   331
    by (auto simp add: topspace_def openin_subset)
himmelma@33175
   332
  then show ?thesis using oS cT by (auto simp add: closedin_def)
himmelma@33175
   333
qed
himmelma@33175
   334
himmelma@33175
   335
lemma closedin_diff[intro]: assumes oS: "closedin U S" and cT: "openin U T" shows "closedin U (S - T)"
himmelma@33175
   336
proof-
himmelma@33175
   337
  have "S - T = S \<inter> (topspace U - T)" using closedin_subset[of U S]  oS cT
himmelma@33175
   338
    by (auto simp add: topspace_def )
himmelma@33175
   339
  then show ?thesis using oS cT by (auto simp add: openin_closedin_eq)
himmelma@33175
   340
qed
himmelma@33175
   341
huffman@44210
   342
subsubsection {* Subspace topology *}
huffman@44170
   343
huffman@44170
   344
definition "subtopology U V = topology (\<lambda>T. \<exists>S. T = S \<inter> V \<and> openin U S)"
huffman@44170
   345
huffman@44170
   346
lemma istopology_subtopology: "istopology (\<lambda>T. \<exists>S. T = S \<inter> V \<and> openin U S)"
huffman@44170
   347
  (is "istopology ?L")
himmelma@33175
   348
proof-
huffman@44170
   349
  have "?L {}" by blast
huffman@44170
   350
  {fix A B assume A: "?L A" and B: "?L B"
himmelma@33175
   351
    from A B obtain Sa and Sb where Sa: "openin U Sa" "A = Sa \<inter> V" and Sb: "openin U Sb" "B = Sb \<inter> V" by blast
himmelma@33175
   352
    have "A\<inter>B = (Sa \<inter> Sb) \<inter> V" "openin U (Sa \<inter> Sb)"  using Sa Sb by blast+
huffman@44170
   353
    then have "?L (A \<inter> B)" by blast}
himmelma@33175
   354
  moreover
huffman@44170
   355
  {fix K assume K: "K \<subseteq> Collect ?L"
huffman@44170
   356
    have th0: "Collect ?L = (\<lambda>S. S \<inter> V) ` Collect (openin U)"
nipkow@39302
   357
      apply (rule set_eqI)
himmelma@33175
   358
      apply (simp add: Ball_def image_iff)
huffman@44170
   359
      by metis
himmelma@33175
   360
    from K[unfolded th0 subset_image_iff]
huffman@44170
   361
    obtain Sk where Sk: "Sk \<subseteq> Collect (openin U)" "K = (\<lambda>S. S \<inter> V) ` Sk" by blast
himmelma@33175
   362
    have "\<Union>K = (\<Union>Sk) \<inter> V" using Sk by auto
huffman@44170
   363
    moreover have "openin U (\<Union> Sk)" using Sk by (auto simp add: subset_eq)
huffman@44170
   364
    ultimately have "?L (\<Union>K)" by blast}
huffman@44170
   365
  ultimately show ?thesis
huffman@44170
   366
    unfolding subset_eq mem_Collect_eq istopology_def by blast
himmelma@33175
   367
qed
himmelma@33175
   368
himmelma@33175
   369
lemma openin_subtopology:
himmelma@33175
   370
  "openin (subtopology U V) S \<longleftrightarrow> (\<exists> T. (openin U T) \<and> (S = T \<inter> V))"
himmelma@33175
   371
  unfolding subtopology_def topology_inverse'[OF istopology_subtopology]
huffman@44170
   372
  by auto
himmelma@33175
   373
himmelma@33175
   374
lemma topspace_subtopology: "topspace(subtopology U V) = topspace U \<inter> V"
himmelma@33175
   375
  by (auto simp add: topspace_def openin_subtopology)
himmelma@33175
   376
himmelma@33175
   377
lemma closedin_subtopology:
himmelma@33175
   378
  "closedin (subtopology U V) S \<longleftrightarrow> (\<exists>T. closedin U T \<and> S = T \<inter> V)"
himmelma@33175
   379
  unfolding closedin_def topspace_subtopology
himmelma@33175
   380
  apply (simp add: openin_subtopology)
himmelma@33175
   381
  apply (rule iffI)
himmelma@33175
   382
  apply clarify
himmelma@33175
   383
  apply (rule_tac x="topspace U - T" in exI)
himmelma@33175
   384
  by auto
himmelma@33175
   385
himmelma@33175
   386
lemma openin_subtopology_refl: "openin (subtopology U V) V \<longleftrightarrow> V \<subseteq> topspace U"
himmelma@33175
   387
  unfolding openin_subtopology
himmelma@33175
   388
  apply (rule iffI, clarify)
himmelma@33175
   389
  apply (frule openin_subset[of U])  apply blast
himmelma@33175
   390
  apply (rule exI[where x="topspace U"])
wenzelm@49711
   391
  apply auto
wenzelm@49711
   392
  done
wenzelm@49711
   393
wenzelm@49711
   394
lemma subtopology_superset:
wenzelm@49711
   395
  assumes UV: "topspace U \<subseteq> V"
himmelma@33175
   396
  shows "subtopology U V = U"
himmelma@33175
   397
proof-
himmelma@33175
   398
  {fix S
himmelma@33175
   399
    {fix T assume T: "openin U T" "S = T \<inter> V"
himmelma@33175
   400
      from T openin_subset[OF T(1)] UV have eq: "S = T" by blast
himmelma@33175
   401
      have "openin U S" unfolding eq using T by blast}
himmelma@33175
   402
    moreover
himmelma@33175
   403
    {assume S: "openin U S"
himmelma@33175
   404
      hence "\<exists>T. openin U T \<and> S = T \<inter> V"
himmelma@33175
   405
        using openin_subset[OF S] UV by auto}
himmelma@33175
   406
    ultimately have "(\<exists>T. openin U T \<and> S = T \<inter> V) \<longleftrightarrow> openin U S" by blast}
himmelma@33175
   407
  then show ?thesis unfolding topology_eq openin_subtopology by blast
himmelma@33175
   408
qed
himmelma@33175
   409
himmelma@33175
   410
lemma subtopology_topspace[simp]: "subtopology U (topspace U) = U"
himmelma@33175
   411
  by (simp add: subtopology_superset)
himmelma@33175
   412
himmelma@33175
   413
lemma subtopology_UNIV[simp]: "subtopology U UNIV = U"
himmelma@33175
   414
  by (simp add: subtopology_superset)
himmelma@33175
   415
huffman@44210
   416
subsubsection {* The standard Euclidean topology *}
himmelma@33175
   417
himmelma@33175
   418
definition
himmelma@33175
   419
  euclidean :: "'a::topological_space topology" where
himmelma@33175
   420
  "euclidean = topology open"
himmelma@33175
   421
himmelma@33175
   422
lemma open_openin: "open S \<longleftrightarrow> openin euclidean S"
himmelma@33175
   423
  unfolding euclidean_def
himmelma@33175
   424
  apply (rule cong[where x=S and y=S])
himmelma@33175
   425
  apply (rule topology_inverse[symmetric])
himmelma@33175
   426
  apply (auto simp add: istopology_def)
huffman@44170
   427
  done
himmelma@33175
   428
himmelma@33175
   429
lemma topspace_euclidean: "topspace euclidean = UNIV"
himmelma@33175
   430
  apply (simp add: topspace_def)
nipkow@39302
   431
  apply (rule set_eqI)
himmelma@33175
   432
  by (auto simp add: open_openin[symmetric])
himmelma@33175
   433
himmelma@33175
   434
lemma topspace_euclidean_subtopology[simp]: "topspace (subtopology euclidean S) = S"
himmelma@33175
   435
  by (simp add: topspace_euclidean topspace_subtopology)
himmelma@33175
   436
himmelma@33175
   437
lemma closed_closedin: "closed S \<longleftrightarrow> closedin euclidean S"
himmelma@33175
   438
  by (simp add: closed_def closedin_def topspace_euclidean open_openin Compl_eq_Diff_UNIV)
himmelma@33175
   439
himmelma@33175
   440
lemma open_subopen: "open S \<longleftrightarrow> (\<forall>x\<in>S. \<exists>T. open T \<and> x \<in> T \<and> T \<subseteq> S)"
himmelma@33175
   441
  by (simp add: open_openin openin_subopen[symmetric])
himmelma@33175
   442
huffman@44210
   443
text {* Basic "localization" results are handy for connectedness. *}
huffman@44210
   444
huffman@44210
   445
lemma openin_open: "openin (subtopology euclidean U) S \<longleftrightarrow> (\<exists>T. open T \<and> (S = U \<inter> T))"
huffman@44210
   446
  by (auto simp add: openin_subtopology open_openin[symmetric])
huffman@44210
   447
huffman@44210
   448
lemma openin_open_Int[intro]: "open S \<Longrightarrow> openin (subtopology euclidean U) (U \<inter> S)"
huffman@44210
   449
  by (auto simp add: openin_open)
huffman@44210
   450
huffman@44210
   451
lemma open_openin_trans[trans]:
huffman@44210
   452
 "open S \<Longrightarrow> open T \<Longrightarrow> T \<subseteq> S \<Longrightarrow> openin (subtopology euclidean S) T"
huffman@44210
   453
  by (metis Int_absorb1  openin_open_Int)
huffman@44210
   454
huffman@44210
   455
lemma open_subset:  "S \<subseteq> T \<Longrightarrow> open S \<Longrightarrow> openin (subtopology euclidean T) S"
huffman@44210
   456
  by (auto simp add: openin_open)
huffman@44210
   457
huffman@44210
   458
lemma closedin_closed: "closedin (subtopology euclidean U) S \<longleftrightarrow> (\<exists>T. closed T \<and> S = U \<inter> T)"
huffman@44210
   459
  by (simp add: closedin_subtopology closed_closedin Int_ac)
huffman@44210
   460
huffman@44210
   461
lemma closedin_closed_Int: "closed S ==> closedin (subtopology euclidean U) (U \<inter> S)"
huffman@44210
   462
  by (metis closedin_closed)
huffman@44210
   463
huffman@44210
   464
lemma closed_closedin_trans: "closed S \<Longrightarrow> closed T \<Longrightarrow> T \<subseteq> S \<Longrightarrow> closedin (subtopology euclidean S) T"
huffman@44210
   465
  apply (subgoal_tac "S \<inter> T = T" )
huffman@44210
   466
  apply auto
huffman@44210
   467
  apply (frule closedin_closed_Int[of T S])
huffman@44210
   468
  by simp
huffman@44210
   469
huffman@44210
   470
lemma closed_subset: "S \<subseteq> T \<Longrightarrow> closed S \<Longrightarrow> closedin (subtopology euclidean T) S"
huffman@44210
   471
  by (auto simp add: closedin_closed)
huffman@44210
   472
huffman@44210
   473
lemma openin_euclidean_subtopology_iff:
huffman@44210
   474
  fixes S U :: "'a::metric_space set"
huffman@44210
   475
  shows "openin (subtopology euclidean U) S
huffman@44210
   476
  \<longleftrightarrow> S \<subseteq> U \<and> (\<forall>x\<in>S. \<exists>e>0. \<forall>x'\<in>U. dist x' x < e \<longrightarrow> x'\<in> S)" (is "?lhs \<longleftrightarrow> ?rhs")
huffman@44210
   477
proof
huffman@44210
   478
  assume ?lhs thus ?rhs unfolding openin_open open_dist by blast
huffman@44210
   479
next
huffman@44210
   480
  def T \<equiv> "{x. \<exists>a\<in>S. \<exists>d>0. (\<forall>y\<in>U. dist y a < d \<longrightarrow> y \<in> S) \<and> dist x a < d}"
huffman@44210
   481
  have 1: "\<forall>x\<in>T. \<exists>e>0. \<forall>y. dist y x < e \<longrightarrow> y \<in> T"
huffman@44210
   482
    unfolding T_def
huffman@44210
   483
    apply clarsimp
huffman@44210
   484
    apply (rule_tac x="d - dist x a" in exI)
huffman@44210
   485
    apply (clarsimp simp add: less_diff_eq)
huffman@44210
   486
    apply (erule rev_bexI)
huffman@44210
   487
    apply (rule_tac x=d in exI, clarify)
huffman@44210
   488
    apply (erule le_less_trans [OF dist_triangle])
huffman@44210
   489
    done
huffman@44210
   490
  assume ?rhs hence 2: "S = U \<inter> T"
huffman@44210
   491
    unfolding T_def
huffman@44210
   492
    apply auto
huffman@44210
   493
    apply (drule (1) bspec, erule rev_bexI)
huffman@44210
   494
    apply auto
huffman@44210
   495
    done
huffman@44210
   496
  from 1 2 show ?lhs
huffman@44210
   497
    unfolding openin_open open_dist by fast
huffman@44210
   498
qed
huffman@44210
   499
huffman@44210
   500
text {* These "transitivity" results are handy too *}
huffman@44210
   501
huffman@44210
   502
lemma openin_trans[trans]: "openin (subtopology euclidean T) S \<Longrightarrow> openin (subtopology euclidean U) T
huffman@44210
   503
  \<Longrightarrow> openin (subtopology euclidean U) S"
huffman@44210
   504
  unfolding open_openin openin_open by blast
huffman@44210
   505
huffman@44210
   506
lemma openin_open_trans: "openin (subtopology euclidean T) S \<Longrightarrow> open T \<Longrightarrow> open S"
huffman@44210
   507
  by (auto simp add: openin_open intro: openin_trans)
huffman@44210
   508
huffman@44210
   509
lemma closedin_trans[trans]:
huffman@44210
   510
 "closedin (subtopology euclidean T) S \<Longrightarrow>
huffman@44210
   511
           closedin (subtopology euclidean U) T
huffman@44210
   512
           ==> closedin (subtopology euclidean U) S"
huffman@44210
   513
  by (auto simp add: closedin_closed closed_closedin closed_Inter Int_assoc)
huffman@44210
   514
huffman@44210
   515
lemma closedin_closed_trans: "closedin (subtopology euclidean T) S \<Longrightarrow> closed T \<Longrightarrow> closed S"
huffman@44210
   516
  by (auto simp add: closedin_closed intro: closedin_trans)
huffman@44210
   517
huffman@44210
   518
huffman@44210
   519
subsection {* Open and closed balls *}
himmelma@33175
   520
himmelma@33175
   521
definition
himmelma@33175
   522
  ball :: "'a::metric_space \<Rightarrow> real \<Rightarrow> 'a set" where
himmelma@33175
   523
  "ball x e = {y. dist x y < e}"
himmelma@33175
   524
himmelma@33175
   525
definition
himmelma@33175
   526
  cball :: "'a::metric_space \<Rightarrow> real \<Rightarrow> 'a set" where
himmelma@33175
   527
  "cball x e = {y. dist x y \<le> e}"
himmelma@33175
   528
huffman@45776
   529
lemma mem_ball [simp]: "y \<in> ball x e \<longleftrightarrow> dist x y < e"
huffman@45776
   530
  by (simp add: ball_def)
huffman@45776
   531
huffman@45776
   532
lemma mem_cball [simp]: "y \<in> cball x e \<longleftrightarrow> dist x y \<le> e"
huffman@45776
   533
  by (simp add: cball_def)
huffman@45776
   534
huffman@45776
   535
lemma mem_ball_0:
himmelma@33175
   536
  fixes x :: "'a::real_normed_vector"
himmelma@33175
   537
  shows "x \<in> ball 0 e \<longleftrightarrow> norm x < e"
himmelma@33175
   538
  by (simp add: dist_norm)
himmelma@33175
   539
huffman@45776
   540
lemma mem_cball_0:
himmelma@33175
   541
  fixes x :: "'a::real_normed_vector"
himmelma@33175
   542
  shows "x \<in> cball 0 e \<longleftrightarrow> norm x \<le> e"
himmelma@33175
   543
  by (simp add: dist_norm)
himmelma@33175
   544
huffman@45776
   545
lemma centre_in_ball: "x \<in> ball x e \<longleftrightarrow> 0 < e"
huffman@45776
   546
  by simp
huffman@45776
   547
huffman@45776
   548
lemma centre_in_cball: "x \<in> cball x e \<longleftrightarrow> 0 \<le> e"
huffman@45776
   549
  by simp
huffman@45776
   550
himmelma@33175
   551
lemma ball_subset_cball[simp,intro]: "ball x e \<subseteq> cball x e" by (simp add: subset_eq)
himmelma@33175
   552
lemma subset_ball[intro]: "d <= e ==> ball x d \<subseteq> ball x e" by (simp add: subset_eq)
himmelma@33175
   553
lemma subset_cball[intro]: "d <= e ==> cball x d \<subseteq> cball x e" by (simp add: subset_eq)
himmelma@33175
   554
lemma ball_max_Un: "ball a (max r s) = ball a r \<union> ball a s"
nipkow@39302
   555
  by (simp add: set_eq_iff) arith
himmelma@33175
   556
himmelma@33175
   557
lemma ball_min_Int: "ball a (min r s) = ball a r \<inter> ball a s"
nipkow@39302
   558
  by (simp add: set_eq_iff)
himmelma@33175
   559
himmelma@33175
   560
lemma diff_less_iff: "(a::real) - b > 0 \<longleftrightarrow> a > b"
himmelma@33175
   561
  "(a::real) - b < 0 \<longleftrightarrow> a < b"
himmelma@33175
   562
  "a - b < c \<longleftrightarrow> a < c +b" "a - b > c \<longleftrightarrow> a > c +b" by arith+
himmelma@33175
   563
lemma diff_le_iff: "(a::real) - b \<ge> 0 \<longleftrightarrow> a \<ge> b" "(a::real) - b \<le> 0 \<longleftrightarrow> a \<le> b"
himmelma@33175
   564
  "a - b \<le> c \<longleftrightarrow> a \<le> c +b" "a - b \<ge> c \<longleftrightarrow> a \<ge> c +b"  by arith+
himmelma@33175
   565
himmelma@33175
   566
lemma open_ball[intro, simp]: "open (ball x e)"
huffman@44170
   567
  unfolding open_dist ball_def mem_Collect_eq Ball_def
himmelma@33175
   568
  unfolding dist_commute
himmelma@33175
   569
  apply clarify
himmelma@33175
   570
  apply (rule_tac x="e - dist xa x" in exI)
himmelma@33175
   571
  using dist_triangle_alt[where z=x]
himmelma@33175
   572
  apply (clarsimp simp add: diff_less_iff)
himmelma@33175
   573
  apply atomize
himmelma@33175
   574
  apply (erule_tac x="y" in allE)
himmelma@33175
   575
  apply (erule_tac x="xa" in allE)
himmelma@33175
   576
  by arith
himmelma@33175
   577
himmelma@33175
   578
lemma open_contains_ball: "open S \<longleftrightarrow> (\<forall>x\<in>S. \<exists>e>0. ball x e \<subseteq> S)"
himmelma@33175
   579
  unfolding open_dist subset_eq mem_ball Ball_def dist_commute ..
himmelma@33175
   580
hoelzl@33714
   581
lemma openE[elim?]:
hoelzl@33714
   582
  assumes "open S" "x\<in>S" 
hoelzl@33714
   583
  obtains e where "e>0" "ball x e \<subseteq> S"
hoelzl@33714
   584
  using assms unfolding open_contains_ball by auto
hoelzl@33714
   585
himmelma@33175
   586
lemma open_contains_ball_eq: "open S \<Longrightarrow> \<forall>x. x\<in>S \<longleftrightarrow> (\<exists>e>0. ball x e \<subseteq> S)"
himmelma@33175
   587
  by (metis open_contains_ball subset_eq centre_in_ball)
himmelma@33175
   588
himmelma@33175
   589
lemma ball_eq_empty[simp]: "ball x e = {} \<longleftrightarrow> e \<le> 0"
nipkow@39302
   590
  unfolding mem_ball set_eq_iff
himmelma@33175
   591
  apply (simp add: not_less)
himmelma@33175
   592
  by (metis zero_le_dist order_trans dist_self)
himmelma@33175
   593
himmelma@33175
   594
lemma ball_empty[intro]: "e \<le> 0 ==> ball x e = {}" by simp
himmelma@33175
   595
immler@50087
   596
lemma rational_boxes:
immler@50087
   597
  fixes x :: "'a\<Colon>ordered_euclidean_space"
immler@50087
   598
  assumes "0 < e"
immler@50087
   599
  shows "\<exists>a b. (\<forall>i. a $$ i \<in> \<rat>) \<and> (\<forall>i. b $$ i \<in> \<rat>) \<and> x \<in> {a <..< b} \<and> {a <..< b} \<subseteq> ball x e"
immler@50087
   600
proof -
immler@50087
   601
  def e' \<equiv> "e / (2 * sqrt (real (DIM ('a))))"
immler@50087
   602
  then have e: "0 < e'" using assms by (auto intro!: divide_pos_pos)
immler@50087
   603
  have "\<forall>i. \<exists>y. y \<in> \<rat> \<and> y < x $$ i \<and> x $$ i - y < e'" (is "\<forall>i. ?th i")
immler@50087
   604
  proof
immler@50087
   605
    fix i from Rats_dense_in_real[of "x $$ i - e'" "x $$ i"] e
immler@50087
   606
    show "?th i" by auto
immler@50087
   607
  qed
immler@50087
   608
  from choice[OF this] guess a .. note a = this
immler@50087
   609
  have "\<forall>i. \<exists>y. y \<in> \<rat> \<and> x $$ i < y \<and> y - x $$ i < e'" (is "\<forall>i. ?th i")
immler@50087
   610
  proof
immler@50087
   611
    fix i from Rats_dense_in_real[of "x $$ i" "x $$ i + e'"] e
immler@50087
   612
    show "?th i" by auto
immler@50087
   613
  qed
immler@50087
   614
  from choice[OF this] guess b .. note b = this
immler@50087
   615
  { fix y :: 'a assume *: "Chi a < y" "y < Chi b"
immler@50087
   616
    have "dist x y = sqrt (\<Sum>i<DIM('a). (dist (x $$ i) (y $$ i))\<twosuperior>)"
immler@50087
   617
      unfolding setL2_def[symmetric] by (rule euclidean_dist_l2)
immler@50087
   618
    also have "\<dots> < sqrt (\<Sum>i<DIM('a). e^2 / real (DIM('a)))"
immler@50087
   619
    proof (rule real_sqrt_less_mono, rule setsum_strict_mono)
immler@50087
   620
      fix i assume i: "i \<in> {..<DIM('a)}"
immler@50087
   621
      have "a i < y$$i \<and> y$$i < b i" using * i eucl_less[where 'a='a] by auto
immler@50087
   622
      moreover have "a i < x$$i" "x$$i - a i < e'" using a by auto
immler@50087
   623
      moreover have "x$$i < b i" "b i - x$$i < e'" using b by auto
immler@50087
   624
      ultimately have "\<bar>x$$i - y$$i\<bar> < 2 * e'" by auto
immler@50087
   625
      then have "dist (x $$ i) (y $$ i) < e/sqrt (real (DIM('a)))"
immler@50087
   626
        unfolding e'_def by (auto simp: dist_real_def)
immler@50087
   627
      then have "(dist (x $$ i) (y $$ i))\<twosuperior> < (e/sqrt (real (DIM('a))))\<twosuperior>"
immler@50087
   628
        by (rule power_strict_mono) auto
immler@50087
   629
      then show "(dist (x $$ i) (y $$ i))\<twosuperior> < e\<twosuperior> / real DIM('a)"
immler@50087
   630
        by (simp add: power_divide)
immler@50087
   631
    qed auto
immler@50087
   632
    also have "\<dots> = e" using `0 < e` by (simp add: real_eq_of_nat DIM_positive)
immler@50087
   633
    finally have "dist x y < e" . }
immler@50087
   634
  with a b show ?thesis
immler@50087
   635
    apply (rule_tac exI[of _ "Chi a"])
immler@50087
   636
    apply (rule_tac exI[of _ "Chi b"])
immler@50087
   637
    using eucl_less[where 'a='a] by auto
immler@50087
   638
qed
immler@50087
   639
immler@50087
   640
lemma ex_rat_list:
immler@50087
   641
  fixes x :: "'a\<Colon>ordered_euclidean_space"
immler@50087
   642
  assumes "\<And> i. x $$ i \<in> \<rat>"
immler@50087
   643
  shows "\<exists> r. length r = DIM('a) \<and> (\<forall> i < DIM('a). of_rat (r ! i) = x $$ i)"
immler@50087
   644
proof -
immler@50087
   645
  have "\<forall>i. \<exists>r. x $$ i = of_rat r" using assms unfolding Rats_def by blast
immler@50087
   646
  from choice[OF this] guess r ..
immler@50087
   647
  then show ?thesis by (auto intro!: exI[of _ "map r [0 ..< DIM('a)]"])
immler@50087
   648
qed
immler@50087
   649
immler@50087
   650
lemma open_UNION:
immler@50087
   651
  fixes M :: "'a\<Colon>ordered_euclidean_space set"
immler@50087
   652
  assumes "open M"
immler@50087
   653
  shows "M = UNION {(a, b) | a b. {Chi (of_rat \<circ> op ! a) <..< Chi (of_rat \<circ> op ! b)} \<subseteq> M}
immler@50087
   654
                   (\<lambda> (a, b). {Chi (of_rat \<circ> op ! a) <..< Chi (of_rat \<circ> op ! b)})"
immler@50087
   655
    (is "M = UNION ?idx ?box")
immler@50087
   656
proof safe
immler@50087
   657
  fix x assume "x \<in> M"
immler@50087
   658
  obtain e where e: "e > 0" "ball x e \<subseteq> M"
immler@50087
   659
    using openE[OF assms `x \<in> M`] by auto
immler@50087
   660
  then obtain a b where ab: "x \<in> {a <..< b}" "\<And>i. a $$ i \<in> \<rat>" "\<And>i. b $$ i \<in> \<rat>" "{a <..< b} \<subseteq> ball x e"
immler@50087
   661
    using rational_boxes[OF e(1)] by blast
immler@50087
   662
  then obtain p q where pq: "length p = DIM ('a)"
immler@50087
   663
                            "length q = DIM ('a)"
immler@50087
   664
                            "\<forall> i < DIM ('a). of_rat (p ! i) = a $$ i \<and> of_rat (q ! i) = b $$ i"
immler@50087
   665
    using ex_rat_list[OF ab(2)] ex_rat_list[OF ab(3)] by blast
immler@50087
   666
  hence p: "Chi (of_rat \<circ> op ! p) = a"
immler@50087
   667
    using euclidean_eq[of "Chi (of_rat \<circ> op ! p)" a]
immler@50087
   668
    unfolding o_def by auto
immler@50087
   669
  from pq have q: "Chi (of_rat \<circ> op ! q) = b"
immler@50087
   670
    using euclidean_eq[of "Chi (of_rat \<circ> op ! q)" b]
immler@50087
   671
    unfolding o_def by auto
immler@50087
   672
  have "x \<in> ?box (p, q)"
immler@50087
   673
    using p q ab by auto
immler@50087
   674
  thus "x \<in> UNION ?idx ?box" using ab e p q exI[of _ p] exI[of _ q] by auto
immler@50087
   675
qed auto
himmelma@33175
   676
himmelma@33175
   677
subsection{* Connectedness *}
himmelma@33175
   678
himmelma@33175
   679
definition "connected S \<longleftrightarrow>
himmelma@33175
   680
  ~(\<exists>e1 e2. open e1 \<and> open e2 \<and> S \<subseteq> (e1 \<union> e2) \<and> (e1 \<inter> e2 \<inter> S = {})
himmelma@33175
   681
  \<and> ~(e1 \<inter> S = {}) \<and> ~(e2 \<inter> S = {}))"
himmelma@33175
   682
himmelma@33175
   683
lemma connected_local:
himmelma@33175
   684
 "connected S \<longleftrightarrow> ~(\<exists>e1 e2.
himmelma@33175
   685
                 openin (subtopology euclidean S) e1 \<and>
himmelma@33175
   686
                 openin (subtopology euclidean S) e2 \<and>
himmelma@33175
   687
                 S \<subseteq> e1 \<union> e2 \<and>
himmelma@33175
   688
                 e1 \<inter> e2 = {} \<and>
himmelma@33175
   689
                 ~(e1 = {}) \<and>
himmelma@33175
   690
                 ~(e2 = {}))"
himmelma@33175
   691
unfolding connected_def openin_open by (safe, blast+)
himmelma@33175
   692
huffman@34105
   693
lemma exists_diff:
huffman@34105
   694
  fixes P :: "'a set \<Rightarrow> bool"
huffman@34105
   695
  shows "(\<exists>S. P(- S)) \<longleftrightarrow> (\<exists>S. P S)" (is "?lhs \<longleftrightarrow> ?rhs")
himmelma@33175
   696
proof-
himmelma@33175
   697
  {assume "?lhs" hence ?rhs by blast }
himmelma@33175
   698
  moreover
himmelma@33175
   699
  {fix S assume H: "P S"
huffman@34105
   700
    have "S = - (- S)" by auto
huffman@34105
   701
    with H have "P (- (- S))" by metis }
himmelma@33175
   702
  ultimately show ?thesis by metis
himmelma@33175
   703
qed
himmelma@33175
   704
himmelma@33175
   705
lemma connected_clopen: "connected S \<longleftrightarrow>
himmelma@33175
   706
        (\<forall>T. openin (subtopology euclidean S) T \<and>
himmelma@33175
   707
            closedin (subtopology euclidean S) T \<longrightarrow> T = {} \<or> T = S)" (is "?lhs \<longleftrightarrow> ?rhs")
himmelma@33175
   708
proof-
huffman@34105
   709
  have " \<not> connected S \<longleftrightarrow> (\<exists>e1 e2. open e1 \<and> open (- e2) \<and> S \<subseteq> e1 \<union> (- e2) \<and> e1 \<inter> (- e2) \<inter> S = {} \<and> e1 \<inter> S \<noteq> {} \<and> (- e2) \<inter> S \<noteq> {})"
himmelma@33175
   710
    unfolding connected_def openin_open closedin_closed
himmelma@33175
   711
    apply (subst exists_diff) by blast
huffman@34105
   712
  hence th0: "connected S \<longleftrightarrow> \<not> (\<exists>e2 e1. closed e2 \<and> open e1 \<and> S \<subseteq> e1 \<union> (- e2) \<and> e1 \<inter> (- e2) \<inter> S = {} \<and> e1 \<inter> S \<noteq> {} \<and> (- e2) \<inter> S \<noteq> {})"
huffman@34105
   713
    (is " _ \<longleftrightarrow> \<not> (\<exists>e2 e1. ?P e2 e1)") apply (simp add: closed_def) by metis
himmelma@33175
   714
himmelma@33175
   715
  have th1: "?rhs \<longleftrightarrow> \<not> (\<exists>t' t. closed t'\<and>t = S\<inter>t' \<and> t\<noteq>{} \<and> t\<noteq>S \<and> (\<exists>t'. open t' \<and> t = S \<inter> t'))"
himmelma@33175
   716
    (is "_ \<longleftrightarrow> \<not> (\<exists>t' t. ?Q t' t)")
himmelma@33175
   717
    unfolding connected_def openin_open closedin_closed by auto
himmelma@33175
   718
  {fix e2
himmelma@33175
   719
    {fix e1 have "?P e2 e1 \<longleftrightarrow> (\<exists>t.  closed e2 \<and> t = S\<inter>e2 \<and> open e1 \<and> t = S\<inter>e1 \<and> t\<noteq>{} \<and> t\<noteq>S)"
himmelma@33175
   720
        by auto}
himmelma@33175
   721
    then have "(\<exists>e1. ?P e2 e1) \<longleftrightarrow> (\<exists>t. ?Q e2 t)" by metis}
himmelma@33175
   722
  then have "\<forall>e2. (\<exists>e1. ?P e2 e1) \<longleftrightarrow> (\<exists>t. ?Q e2 t)" by blast
himmelma@33175
   723
  then show ?thesis unfolding th0 th1 by simp
himmelma@33175
   724
qed
himmelma@33175
   725
himmelma@33175
   726
lemma connected_empty[simp, intro]: "connected {}"
himmelma@33175
   727
  by (simp add: connected_def)
himmelma@33175
   728
huffman@44210
   729
himmelma@33175
   730
subsection{* Limit points *}
himmelma@33175
   731
huffman@44207
   732
definition (in topological_space)
huffman@44207
   733
  islimpt:: "'a \<Rightarrow> 'a set \<Rightarrow> bool" (infixr "islimpt" 60) where
himmelma@33175
   734
  "x islimpt S \<longleftrightarrow> (\<forall>T. x\<in>T \<longrightarrow> open T \<longrightarrow> (\<exists>y\<in>S. y\<in>T \<and> y\<noteq>x))"
himmelma@33175
   735
himmelma@33175
   736
lemma islimptI:
himmelma@33175
   737
  assumes "\<And>T. x \<in> T \<Longrightarrow> open T \<Longrightarrow> \<exists>y\<in>S. y \<in> T \<and> y \<noteq> x"
himmelma@33175
   738
  shows "x islimpt S"
himmelma@33175
   739
  using assms unfolding islimpt_def by auto
himmelma@33175
   740
himmelma@33175
   741
lemma islimptE:
himmelma@33175
   742
  assumes "x islimpt S" and "x \<in> T" and "open T"
himmelma@33175
   743
  obtains y where "y \<in> S" and "y \<in> T" and "y \<noteq> x"
himmelma@33175
   744
  using assms unfolding islimpt_def by auto
himmelma@33175
   745
huffman@44584
   746
lemma islimpt_iff_eventually: "x islimpt S \<longleftrightarrow> \<not> eventually (\<lambda>y. y \<notin> S) (at x)"
huffman@44584
   747
  unfolding islimpt_def eventually_at_topological by auto
huffman@44584
   748
huffman@44584
   749
lemma islimpt_subset: "\<lbrakk>x islimpt S; S \<subseteq> T\<rbrakk> \<Longrightarrow> x islimpt T"
huffman@44584
   750
  unfolding islimpt_def by fast
himmelma@33175
   751
himmelma@33175
   752
lemma islimpt_approachable:
himmelma@33175
   753
  fixes x :: "'a::metric_space"
himmelma@33175
   754
  shows "x islimpt S \<longleftrightarrow> (\<forall>e>0. \<exists>x'\<in>S. x' \<noteq> x \<and> dist x' x < e)"
huffman@44584
   755
  unfolding islimpt_iff_eventually eventually_at by fast
himmelma@33175
   756
himmelma@33175
   757
lemma islimpt_approachable_le:
himmelma@33175
   758
  fixes x :: "'a::metric_space"
himmelma@33175
   759
  shows "x islimpt S \<longleftrightarrow> (\<forall>e>0. \<exists>x'\<in> S. x' \<noteq> x \<and> dist x' x <= e)"
himmelma@33175
   760
  unfolding islimpt_approachable
huffman@44584
   761
  using approachable_lt_le [where f="\<lambda>y. dist y x" and P="\<lambda>y. y \<notin> S \<or> y = x",
huffman@44584
   762
    THEN arg_cong [where f=Not]]
huffman@44584
   763
  by (simp add: Bex_def conj_commute conj_left_commute)
himmelma@33175
   764
huffman@44571
   765
lemma islimpt_UNIV_iff: "x islimpt UNIV \<longleftrightarrow> \<not> open {x}"
huffman@44571
   766
  unfolding islimpt_def by (safe, fast, case_tac "T = {x}", fast, fast)
huffman@44571
   767
huffman@44210
   768
text {* A perfect space has no isolated points. *}
huffman@44210
   769
huffman@44571
   770
lemma islimpt_UNIV [simp, intro]: "(x::'a::perfect_space) islimpt UNIV"
huffman@44571
   771
  unfolding islimpt_UNIV_iff by (rule not_open_singleton)
himmelma@33175
   772
himmelma@33175
   773
lemma perfect_choose_dist:
huffman@44072
   774
  fixes x :: "'a::{perfect_space, metric_space}"
himmelma@33175
   775
  shows "0 < r \<Longrightarrow> \<exists>a. a \<noteq> x \<and> dist a x < r"
himmelma@33175
   776
using islimpt_UNIV [of x]
himmelma@33175
   777
by (simp add: islimpt_approachable)
himmelma@33175
   778
himmelma@33175
   779
lemma closed_limpt: "closed S \<longleftrightarrow> (\<forall>x. x islimpt S \<longrightarrow> x \<in> S)"
himmelma@33175
   780
  unfolding closed_def
himmelma@33175
   781
  apply (subst open_subopen)
huffman@34105
   782
  apply (simp add: islimpt_def subset_eq)
huffman@44170
   783
  by (metis ComplE ComplI)
himmelma@33175
   784
himmelma@33175
   785
lemma islimpt_EMPTY[simp]: "\<not> x islimpt {}"
himmelma@33175
   786
  unfolding islimpt_def by auto
himmelma@33175
   787
himmelma@33175
   788
lemma finite_set_avoid:
himmelma@33175
   789
  fixes a :: "'a::metric_space"
himmelma@33175
   790
  assumes fS: "finite S" shows  "\<exists>d>0. \<forall>x\<in>S. x \<noteq> a \<longrightarrow> d <= dist a x"
himmelma@33175
   791
proof(induct rule: finite_induct[OF fS])
boehmes@41863
   792
  case 1 thus ?case by (auto intro: zero_less_one)
himmelma@33175
   793
next
himmelma@33175
   794
  case (2 x F)
himmelma@33175
   795
  from 2 obtain d where d: "d >0" "\<forall>x\<in>F. x\<noteq>a \<longrightarrow> d \<le> dist a x" by blast
himmelma@33175
   796
  {assume "x = a" hence ?case using d by auto  }
himmelma@33175
   797
  moreover
himmelma@33175
   798
  {assume xa: "x\<noteq>a"
himmelma@33175
   799
    let ?d = "min d (dist a x)"
himmelma@33175
   800
    have dp: "?d > 0" using xa d(1) using dist_nz by auto
himmelma@33175
   801
    from d have d': "\<forall>x\<in>F. x\<noteq>a \<longrightarrow> ?d \<le> dist a x" by auto
himmelma@33175
   802
    with dp xa have ?case by(auto intro!: exI[where x="?d"]) }
himmelma@33175
   803
  ultimately show ?case by blast
himmelma@33175
   804
qed
himmelma@33175
   805
himmelma@33175
   806
lemma islimpt_finite:
himmelma@33175
   807
  fixes S :: "'a::metric_space set"
himmelma@33175
   808
  assumes fS: "finite S" shows "\<not> a islimpt S"
himmelma@33175
   809
  unfolding islimpt_approachable
himmelma@33175
   810
  using finite_set_avoid[OF fS, of a] by (metis dist_commute  not_le)
himmelma@33175
   811
himmelma@33175
   812
lemma islimpt_Un: "x islimpt (S \<union> T) \<longleftrightarrow> x islimpt S \<or> x islimpt T"
himmelma@33175
   813
  apply (rule iffI)
himmelma@33175
   814
  defer
himmelma@33175
   815
  apply (metis Un_upper1 Un_upper2 islimpt_subset)
himmelma@33175
   816
  unfolding islimpt_def
himmelma@33175
   817
  apply (rule ccontr, clarsimp, rename_tac A B)
himmelma@33175
   818
  apply (drule_tac x="A \<inter> B" in spec)
himmelma@33175
   819
  apply (auto simp add: open_Int)
himmelma@33175
   820
  done
himmelma@33175
   821
himmelma@33175
   822
lemma discrete_imp_closed:
himmelma@33175
   823
  fixes S :: "'a::metric_space set"
himmelma@33175
   824
  assumes e: "0 < e" and d: "\<forall>x \<in> S. \<forall>y \<in> S. dist y x < e \<longrightarrow> y = x"
himmelma@33175
   825
  shows "closed S"
himmelma@33175
   826
proof-
himmelma@33175
   827
  {fix x assume C: "\<forall>e>0. \<exists>x'\<in>S. x' \<noteq> x \<and> dist x' x < e"
himmelma@33175
   828
    from e have e2: "e/2 > 0" by arith
himmelma@33175
   829
    from C[rule_format, OF e2] obtain y where y: "y \<in> S" "y\<noteq>x" "dist y x < e/2" by blast
himmelma@33175
   830
    let ?m = "min (e/2) (dist x y) "
himmelma@33175
   831
    from e2 y(2) have mp: "?m > 0" by (simp add: dist_nz[THEN sym])
himmelma@33175
   832
    from C[rule_format, OF mp] obtain z where z: "z \<in> S" "z\<noteq>x" "dist z x < ?m" by blast
himmelma@33175
   833
    have th: "dist z y < e" using z y
himmelma@33175
   834
      by (intro dist_triangle_lt [where z=x], simp)
himmelma@33175
   835
    from d[rule_format, OF y(1) z(1) th] y z
himmelma@33175
   836
    have False by (auto simp add: dist_commute)}
himmelma@33175
   837
  then show ?thesis by (metis islimpt_approachable closed_limpt [where 'a='a])
himmelma@33175
   838
qed
himmelma@33175
   839
huffman@44210
   840
huffman@44210
   841
subsection {* Interior of a Set *}
huffman@44210
   842
huffman@44519
   843
definition "interior S = \<Union>{T. open T \<and> T \<subseteq> S}"
huffman@44519
   844
huffman@44519
   845
lemma interiorI [intro?]:
huffman@44519
   846
  assumes "open T" and "x \<in> T" and "T \<subseteq> S"
huffman@44519
   847
  shows "x \<in> interior S"
huffman@44519
   848
  using assms unfolding interior_def by fast
huffman@44519
   849
huffman@44519
   850
lemma interiorE [elim?]:
huffman@44519
   851
  assumes "x \<in> interior S"
huffman@44519
   852
  obtains T where "open T" and "x \<in> T" and "T \<subseteq> S"
huffman@44519
   853
  using assms unfolding interior_def by fast
huffman@44519
   854
huffman@44519
   855
lemma open_interior [simp, intro]: "open (interior S)"
huffman@44519
   856
  by (simp add: interior_def open_Union)
huffman@44519
   857
huffman@44519
   858
lemma interior_subset: "interior S \<subseteq> S"
huffman@44519
   859
  by (auto simp add: interior_def)
huffman@44519
   860
huffman@44519
   861
lemma interior_maximal: "T \<subseteq> S \<Longrightarrow> open T \<Longrightarrow> T \<subseteq> interior S"
huffman@44519
   862
  by (auto simp add: interior_def)
huffman@44519
   863
huffman@44519
   864
lemma interior_open: "open S \<Longrightarrow> interior S = S"
huffman@44519
   865
  by (intro equalityI interior_subset interior_maximal subset_refl)
himmelma@33175
   866
himmelma@33175
   867
lemma interior_eq: "interior S = S \<longleftrightarrow> open S"
huffman@44519
   868
  by (metis open_interior interior_open)
huffman@44519
   869
huffman@44519
   870
lemma open_subset_interior: "open S \<Longrightarrow> S \<subseteq> interior T \<longleftrightarrow> S \<subseteq> T"
himmelma@33175
   871
  by (metis interior_maximal interior_subset subset_trans)
himmelma@33175
   872
huffman@44519
   873
lemma interior_empty [simp]: "interior {} = {}"
huffman@44519
   874
  using open_empty by (rule interior_open)
huffman@44519
   875
huffman@44522
   876
lemma interior_UNIV [simp]: "interior UNIV = UNIV"
huffman@44522
   877
  using open_UNIV by (rule interior_open)
huffman@44522
   878
huffman@44519
   879
lemma interior_interior [simp]: "interior (interior S) = interior S"
huffman@44519
   880
  using open_interior by (rule interior_open)
huffman@44519
   881
huffman@44522
   882
lemma interior_mono: "S \<subseteq> T \<Longrightarrow> interior S \<subseteq> interior T"
huffman@44522
   883
  by (auto simp add: interior_def)
huffman@44519
   884
huffman@44519
   885
lemma interior_unique:
huffman@44519
   886
  assumes "T \<subseteq> S" and "open T"
huffman@44519
   887
  assumes "\<And>T'. T' \<subseteq> S \<Longrightarrow> open T' \<Longrightarrow> T' \<subseteq> T"
huffman@44519
   888
  shows "interior S = T"
huffman@44519
   889
  by (intro equalityI assms interior_subset open_interior interior_maximal)
huffman@44519
   890
huffman@44519
   891
lemma interior_inter [simp]: "interior (S \<inter> T) = interior S \<inter> interior T"
huffman@44522
   892
  by (intro equalityI Int_mono Int_greatest interior_mono Int_lower1
huffman@44519
   893
    Int_lower2 interior_maximal interior_subset open_Int open_interior)
huffman@44519
   894
huffman@44519
   895
lemma mem_interior: "x \<in> interior S \<longleftrightarrow> (\<exists>e>0. ball x e \<subseteq> S)"
huffman@44519
   896
  using open_contains_ball_eq [where S="interior S"]
huffman@44519
   897
  by (simp add: open_subset_interior)
himmelma@33175
   898
himmelma@33175
   899
lemma interior_limit_point [intro]:
himmelma@33175
   900
  fixes x :: "'a::perfect_space"
himmelma@33175
   901
  assumes x: "x \<in> interior S" shows "x islimpt S"
huffman@44072
   902
  using x islimpt_UNIV [of x]
huffman@44072
   903
  unfolding interior_def islimpt_def
huffman@44072
   904
  apply (clarsimp, rename_tac T T')
huffman@44072
   905
  apply (drule_tac x="T \<inter> T'" in spec)
huffman@44072
   906
  apply (auto simp add: open_Int)
huffman@44072
   907
  done
himmelma@33175
   908
himmelma@33175
   909
lemma interior_closed_Un_empty_interior:
himmelma@33175
   910
  assumes cS: "closed S" and iT: "interior T = {}"
huffman@44519
   911
  shows "interior (S \<union> T) = interior S"
himmelma@33175
   912
proof
huffman@44519
   913
  show "interior S \<subseteq> interior (S \<union> T)"
huffman@44522
   914
    by (rule interior_mono, rule Un_upper1)
himmelma@33175
   915
next
himmelma@33175
   916
  show "interior (S \<union> T) \<subseteq> interior S"
himmelma@33175
   917
  proof
himmelma@33175
   918
    fix x assume "x \<in> interior (S \<union> T)"
huffman@44519
   919
    then obtain R where "open R" "x \<in> R" "R \<subseteq> S \<union> T" ..
himmelma@33175
   920
    show "x \<in> interior S"
himmelma@33175
   921
    proof (rule ccontr)
himmelma@33175
   922
      assume "x \<notin> interior S"
himmelma@33175
   923
      with `x \<in> R` `open R` obtain y where "y \<in> R - S"
huffman@44519
   924
        unfolding interior_def by fast
himmelma@33175
   925
      from `open R` `closed S` have "open (R - S)" by (rule open_Diff)
himmelma@33175
   926
      from `R \<subseteq> S \<union> T` have "R - S \<subseteq> T" by fast
himmelma@33175
   927
      from `y \<in> R - S` `open (R - S)` `R - S \<subseteq> T` `interior T = {}`
himmelma@33175
   928
      show "False" unfolding interior_def by fast
himmelma@33175
   929
    qed
himmelma@33175
   930
  qed
himmelma@33175
   931
qed
himmelma@33175
   932
huffman@44365
   933
lemma interior_Times: "interior (A \<times> B) = interior A \<times> interior B"
huffman@44365
   934
proof (rule interior_unique)
huffman@44365
   935
  show "interior A \<times> interior B \<subseteq> A \<times> B"
huffman@44365
   936
    by (intro Sigma_mono interior_subset)
huffman@44365
   937
  show "open (interior A \<times> interior B)"
huffman@44365
   938
    by (intro open_Times open_interior)
huffman@44519
   939
  fix T assume "T \<subseteq> A \<times> B" and "open T" thus "T \<subseteq> interior A \<times> interior B"
huffman@44519
   940
  proof (safe)
huffman@44519
   941
    fix x y assume "(x, y) \<in> T"
huffman@44519
   942
    then obtain C D where "open C" "open D" "C \<times> D \<subseteq> T" "x \<in> C" "y \<in> D"
huffman@44519
   943
      using `open T` unfolding open_prod_def by fast
huffman@44519
   944
    hence "open C" "open D" "C \<subseteq> A" "D \<subseteq> B" "x \<in> C" "y \<in> D"
huffman@44519
   945
      using `T \<subseteq> A \<times> B` by auto
huffman@44519
   946
    thus "x \<in> interior A" and "y \<in> interior B"
huffman@44519
   947
      by (auto intro: interiorI)
huffman@44519
   948
  qed
huffman@44365
   949
qed
huffman@44365
   950
himmelma@33175
   951
huffman@44210
   952
subsection {* Closure of a Set *}
himmelma@33175
   953
himmelma@33175
   954
definition "closure S = S \<union> {x | x. x islimpt S}"
himmelma@33175
   955
huffman@44518
   956
lemma interior_closure: "interior S = - (closure (- S))"
huffman@44518
   957
  unfolding interior_def closure_def islimpt_def by auto
huffman@44518
   958
huffman@34105
   959
lemma closure_interior: "closure S = - interior (- S)"
huffman@44518
   960
  unfolding interior_closure by simp
himmelma@33175
   961
himmelma@33175
   962
lemma closed_closure[simp, intro]: "closed (closure S)"
huffman@44518
   963
  unfolding closure_interior by (simp add: closed_Compl)
huffman@44518
   964
huffman@44518
   965
lemma closure_subset: "S \<subseteq> closure S"
huffman@44518
   966
  unfolding closure_def by simp
himmelma@33175
   967
himmelma@33175
   968
lemma closure_hull: "closure S = closed hull S"
huffman@44519
   969
  unfolding hull_def closure_interior interior_def by auto
himmelma@33175
   970
himmelma@33175
   971
lemma closure_eq: "closure S = S \<longleftrightarrow> closed S"
huffman@44519
   972
  unfolding closure_hull using closed_Inter by (rule hull_eq)
huffman@44519
   973
huffman@44519
   974
lemma closure_closed [simp]: "closed S \<Longrightarrow> closure S = S"
huffman@44519
   975
  unfolding closure_eq .
huffman@44519
   976
huffman@44519
   977
lemma closure_closure [simp]: "closure (closure S) = closure S"
huffman@44518
   978
  unfolding closure_hull by (rule hull_hull)
himmelma@33175
   979
huffman@44522
   980
lemma closure_mono: "S \<subseteq> T \<Longrightarrow> closure S \<subseteq> closure T"
huffman@44518
   981
  unfolding closure_hull by (rule hull_mono)
himmelma@33175
   982
huffman@44519
   983
lemma closure_minimal: "S \<subseteq> T \<Longrightarrow> closed T \<Longrightarrow> closure S \<subseteq> T"
huffman@44518
   984
  unfolding closure_hull by (rule hull_minimal)
himmelma@33175
   985
huffman@44519
   986
lemma closure_unique:
huffman@44519
   987
  assumes "S \<subseteq> T" and "closed T"
huffman@44519
   988
  assumes "\<And>T'. S \<subseteq> T' \<Longrightarrow> closed T' \<Longrightarrow> T \<subseteq> T'"
huffman@44519
   989
  shows "closure S = T"
huffman@44519
   990
  using assms unfolding closure_hull by (rule hull_unique)
huffman@44519
   991
huffman@44519
   992
lemma closure_empty [simp]: "closure {} = {}"
huffman@44518
   993
  using closed_empty by (rule closure_closed)
himmelma@33175
   994
huffman@44522
   995
lemma closure_UNIV [simp]: "closure UNIV = UNIV"
huffman@44518
   996
  using closed_UNIV by (rule closure_closed)
huffman@44518
   997
huffman@44518
   998
lemma closure_union [simp]: "closure (S \<union> T) = closure S \<union> closure T"
huffman@44518
   999
  unfolding closure_interior by simp
himmelma@33175
  1000
himmelma@33175
  1001
lemma closure_eq_empty: "closure S = {} \<longleftrightarrow> S = {}"
himmelma@33175
  1002
  using closure_empty closure_subset[of S]
himmelma@33175
  1003
  by blast
himmelma@33175
  1004
himmelma@33175
  1005
lemma closure_subset_eq: "closure S \<subseteq> S \<longleftrightarrow> closed S"
himmelma@33175
  1006
  using closure_eq[of S] closure_subset[of S]
himmelma@33175
  1007
  by simp
himmelma@33175
  1008
himmelma@33175
  1009
lemma open_inter_closure_eq_empty:
himmelma@33175
  1010
  "open S \<Longrightarrow> (S \<inter> closure T) = {} \<longleftrightarrow> S \<inter> T = {}"
huffman@34105
  1011
  using open_subset_interior[of S "- T"]
huffman@34105
  1012
  using interior_subset[of "- T"]
himmelma@33175
  1013
  unfolding closure_interior
himmelma@33175
  1014
  by auto
himmelma@33175
  1015
himmelma@33175
  1016
lemma open_inter_closure_subset:
himmelma@33175
  1017
  "open S \<Longrightarrow> (S \<inter> (closure T)) \<subseteq> closure(S \<inter> T)"
himmelma@33175
  1018
proof
himmelma@33175
  1019
  fix x
himmelma@33175
  1020
  assume as: "open S" "x \<in> S \<inter> closure T"
himmelma@33175
  1021
  { assume *:"x islimpt T"
himmelma@33175
  1022
    have "x islimpt (S \<inter> T)"
himmelma@33175
  1023
    proof (rule islimptI)
himmelma@33175
  1024
      fix A
himmelma@33175
  1025
      assume "x \<in> A" "open A"
himmelma@33175
  1026
      with as have "x \<in> A \<inter> S" "open (A \<inter> S)"
himmelma@33175
  1027
        by (simp_all add: open_Int)
himmelma@33175
  1028
      with * obtain y where "y \<in> T" "y \<in> A \<inter> S" "y \<noteq> x"
himmelma@33175
  1029
        by (rule islimptE)
himmelma@33175
  1030
      hence "y \<in> S \<inter> T" "y \<in> A \<and> y \<noteq> x"
himmelma@33175
  1031
        by simp_all
himmelma@33175
  1032
      thus "\<exists>y\<in>(S \<inter> T). y \<in> A \<and> y \<noteq> x" ..
himmelma@33175
  1033
    qed
himmelma@33175
  1034
  }
himmelma@33175
  1035
  then show "x \<in> closure (S \<inter> T)" using as
himmelma@33175
  1036
    unfolding closure_def
himmelma@33175
  1037
    by blast
himmelma@33175
  1038
qed
himmelma@33175
  1039
huffman@44519
  1040
lemma closure_complement: "closure (- S) = - interior S"
huffman@44518
  1041
  unfolding closure_interior by simp
himmelma@33175
  1042
huffman@44519
  1043
lemma interior_complement: "interior (- S) = - closure S"
huffman@44518
  1044
  unfolding closure_interior by simp
himmelma@33175
  1045
huffman@44365
  1046
lemma closure_Times: "closure (A \<times> B) = closure A \<times> closure B"
huffman@44519
  1047
proof (rule closure_unique)
huffman@44365
  1048
  show "A \<times> B \<subseteq> closure A \<times> closure B"
huffman@44365
  1049
    by (intro Sigma_mono closure_subset)
huffman@44365
  1050
  show "closed (closure A \<times> closure B)"
huffman@44365
  1051
    by (intro closed_Times closed_closure)
huffman@44519
  1052
  fix T assume "A \<times> B \<subseteq> T" and "closed T" thus "closure A \<times> closure B \<subseteq> T"
huffman@44365
  1053
    apply (simp add: closed_def open_prod_def, clarify)
huffman@44365
  1054
    apply (rule ccontr)
huffman@44365
  1055
    apply (drule_tac x="(a, b)" in bspec, simp, clarify, rename_tac C D)
huffman@44365
  1056
    apply (simp add: closure_interior interior_def)
huffman@44365
  1057
    apply (drule_tac x=C in spec)
huffman@44365
  1058
    apply (drule_tac x=D in spec)
huffman@44365
  1059
    apply auto
huffman@44365
  1060
    done
huffman@44365
  1061
qed
huffman@44365
  1062
huffman@44210
  1063
huffman@44210
  1064
subsection {* Frontier (aka boundary) *}
himmelma@33175
  1065
himmelma@33175
  1066
definition "frontier S = closure S - interior S"
himmelma@33175
  1067
himmelma@33175
  1068
lemma frontier_closed: "closed(frontier S)"
himmelma@33175
  1069
  by (simp add: frontier_def closed_Diff)
himmelma@33175
  1070
huffman@34105
  1071
lemma frontier_closures: "frontier S = (closure S) \<inter> (closure(- S))"
himmelma@33175
  1072
  by (auto simp add: frontier_def interior_closure)
himmelma@33175
  1073
himmelma@33175
  1074
lemma frontier_straddle:
himmelma@33175
  1075
  fixes a :: "'a::metric_space"
huffman@44909
  1076
  shows "a \<in> frontier S \<longleftrightarrow> (\<forall>e>0. (\<exists>x\<in>S. dist a x < e) \<and> (\<exists>x. x \<notin> S \<and> dist a x < e))"
huffman@44909
  1077
  unfolding frontier_def closure_interior
huffman@44909
  1078
  by (auto simp add: mem_interior subset_eq ball_def)
himmelma@33175
  1079
himmelma@33175
  1080
lemma frontier_subset_closed: "closed S \<Longrightarrow> frontier S \<subseteq> S"
himmelma@33175
  1081
  by (metis frontier_def closure_closed Diff_subset)
himmelma@33175
  1082
hoelzl@34964
  1083
lemma frontier_empty[simp]: "frontier {} = {}"
huffman@36362
  1084
  by (simp add: frontier_def)
himmelma@33175
  1085
himmelma@33175
  1086
lemma frontier_subset_eq: "frontier S \<subseteq> S \<longleftrightarrow> closed S"
himmelma@33175
  1087
proof-
himmelma@33175
  1088
  { assume "frontier S \<subseteq> S"
himmelma@33175
  1089
    hence "closure S \<subseteq> S" using interior_subset unfolding frontier_def by auto
himmelma@33175
  1090
    hence "closed S" using closure_subset_eq by auto
himmelma@33175
  1091
  }
huffman@36362
  1092
  thus ?thesis using frontier_subset_closed[of S] ..
himmelma@33175
  1093
qed
himmelma@33175
  1094
huffman@34105
  1095
lemma frontier_complement: "frontier(- S) = frontier S"
himmelma@33175
  1096
  by (auto simp add: frontier_def closure_complement interior_complement)
himmelma@33175
  1097
himmelma@33175
  1098
lemma frontier_disjoint_eq: "frontier S \<inter> S = {} \<longleftrightarrow> open S"
huffman@34105
  1099
  using frontier_complement frontier_subset_eq[of "- S"]
huffman@34105
  1100
  unfolding open_closed by auto
himmelma@33175
  1101
huffman@44081
  1102
subsection {* Filters and the ``eventually true'' quantifier *}
huffman@44081
  1103
himmelma@33175
  1104
definition
huffman@44081
  1105
  indirection :: "'a::real_normed_vector \<Rightarrow> 'a \<Rightarrow> 'a filter"
huffman@44081
  1106
    (infixr "indirection" 70) where
himmelma@33175
  1107
  "a indirection v = (at a) within {b. \<exists>c\<ge>0. b - a = scaleR c v}"
himmelma@33175
  1108
huffman@36437
  1109
text {* Identify Trivial limits, where we can't approach arbitrarily closely. *}
himmelma@33175
  1110
himmelma@33175
  1111
lemma trivial_limit_within:
himmelma@33175
  1112
  shows "trivial_limit (at a within S) \<longleftrightarrow> \<not> a islimpt S"
himmelma@33175
  1113
proof
himmelma@33175
  1114
  assume "trivial_limit (at a within S)"
himmelma@33175
  1115
  thus "\<not> a islimpt S"
himmelma@33175
  1116
    unfolding trivial_limit_def
huffman@36358
  1117
    unfolding eventually_within eventually_at_topological
himmelma@33175
  1118
    unfolding islimpt_def
nipkow@39302
  1119
    apply (clarsimp simp add: set_eq_iff)
himmelma@33175
  1120
    apply (rename_tac T, rule_tac x=T in exI)
huffman@36358
  1121
    apply (clarsimp, drule_tac x=y in bspec, simp_all)
himmelma@33175
  1122
    done
himmelma@33175
  1123
next
himmelma@33175
  1124
  assume "\<not> a islimpt S"
himmelma@33175
  1125
  thus "trivial_limit (at a within S)"
himmelma@33175
  1126
    unfolding trivial_limit_def
huffman@36358
  1127
    unfolding eventually_within eventually_at_topological
himmelma@33175
  1128
    unfolding islimpt_def
huffman@36358
  1129
    apply clarsimp
huffman@36358
  1130
    apply (rule_tac x=T in exI)
huffman@36358
  1131
    apply auto
himmelma@33175
  1132
    done
himmelma@33175
  1133
qed
himmelma@33175
  1134
himmelma@33175
  1135
lemma trivial_limit_at_iff: "trivial_limit (at a) \<longleftrightarrow> \<not> a islimpt UNIV"
huffman@45031
  1136
  using trivial_limit_within [of a UNIV] by simp
himmelma@33175
  1137
himmelma@33175
  1138
lemma trivial_limit_at:
himmelma@33175
  1139
  fixes a :: "'a::perfect_space"
himmelma@33175
  1140
  shows "\<not> trivial_limit (at a)"
huffman@44571
  1141
  by (rule at_neq_bot)
himmelma@33175
  1142
himmelma@33175
  1143
lemma trivial_limit_at_infinity:
huffman@44081
  1144
  "\<not> trivial_limit (at_infinity :: ('a::{real_normed_vector,perfect_space}) filter)"
huffman@36358
  1145
  unfolding trivial_limit_def eventually_at_infinity
huffman@36358
  1146
  apply clarsimp
huffman@44072
  1147
  apply (subgoal_tac "\<exists>x::'a. x \<noteq> 0", clarify)
huffman@44072
  1148
   apply (rule_tac x="scaleR (b / norm x) x" in exI, simp)
huffman@44072
  1149
  apply (cut_tac islimpt_UNIV [of "0::'a", unfolded islimpt_def])
huffman@44072
  1150
  apply (drule_tac x=UNIV in spec, simp)
himmelma@33175
  1151
  done
himmelma@33175
  1152
huffman@36437
  1153
text {* Some property holds "sufficiently close" to the limit point. *}
himmelma@33175
  1154
himmelma@33175
  1155
lemma eventually_at: (* FIXME: this replaces Limits.eventually_at *)
himmelma@33175
  1156
  "eventually P (at a) \<longleftrightarrow> (\<exists>d>0. \<forall>x. 0 < dist x a \<and> dist x a < d \<longrightarrow> P x)"
himmelma@33175
  1157
unfolding eventually_at dist_nz by auto
himmelma@33175
  1158
himmelma@33175
  1159
lemma eventually_within: "eventually P (at a within S) \<longleftrightarrow>
himmelma@33175
  1160
        (\<exists>d>0. \<forall>x\<in>S. 0 < dist x a \<and> dist x a < d \<longrightarrow> P x)"
himmelma@33175
  1161
unfolding eventually_within eventually_at dist_nz by auto
himmelma@33175
  1162
himmelma@33175
  1163
lemma eventually_within_le: "eventually P (at a within S) \<longleftrightarrow>
himmelma@33175
  1164
        (\<exists>d>0. \<forall>x\<in>S. 0 < dist x a \<and> dist x a <= d \<longrightarrow> P x)" (is "?lhs = ?rhs")
himmelma@33175
  1165
unfolding eventually_within
huffman@44668
  1166
by auto (metis dense order_le_less_trans)
himmelma@33175
  1167
himmelma@33175
  1168
lemma eventually_happens: "eventually P net ==> trivial_limit net \<or> (\<exists>x. P x)"
huffman@36358
  1169
  unfolding trivial_limit_def
huffman@36358
  1170
  by (auto elim: eventually_rev_mp)
himmelma@33175
  1171
himmelma@33175
  1172
lemma trivial_limit_eventually: "trivial_limit net \<Longrightarrow> eventually P net"
huffman@45031
  1173
  by simp
himmelma@33175
  1174
himmelma@33175
  1175
lemma trivial_limit_eq: "trivial_limit net \<longleftrightarrow> (\<forall>P. eventually P net)"
huffman@44342
  1176
  by (simp add: filter_eq_iff)
himmelma@33175
  1177
himmelma@33175
  1178
text{* Combining theorems for "eventually" *}
himmelma@33175
  1179
himmelma@33175
  1180
lemma eventually_rev_mono:
himmelma@33175
  1181
  "eventually P net \<Longrightarrow> (\<forall>x. P x \<longrightarrow> Q x) \<Longrightarrow> eventually Q net"
himmelma@33175
  1182
using eventually_mono [of P Q] by fast
himmelma@33175
  1183
himmelma@33175
  1184
lemma not_eventually: "(\<forall>x. \<not> P x ) \<Longrightarrow> ~(trivial_limit net) ==> ~(eventually (\<lambda>x. P x) net)"
himmelma@33175
  1185
  by (simp add: eventually_False)
himmelma@33175
  1186
huffman@44210
  1187
huffman@36437
  1188
subsection {* Limits *}
himmelma@33175
  1189
huffman@44081
  1190
text{* Notation Lim to avoid collition with lim defined in analysis *}
huffman@44081
  1191
huffman@44081
  1192
definition Lim :: "'a filter \<Rightarrow> ('a \<Rightarrow> 'b::t2_space) \<Rightarrow> 'b"
huffman@44081
  1193
  where "Lim A f = (THE l. (f ---> l) A)"
himmelma@33175
  1194
himmelma@33175
  1195
lemma Lim:
himmelma@33175
  1196
 "(f ---> l) net \<longleftrightarrow>
himmelma@33175
  1197
        trivial_limit net \<or>
himmelma@33175
  1198
        (\<forall>e>0. eventually (\<lambda>x. dist (f x) l < e) net)"
himmelma@33175
  1199
  unfolding tendsto_iff trivial_limit_eq by auto
himmelma@33175
  1200
himmelma@33175
  1201
text{* Show that they yield usual definitions in the various cases. *}
himmelma@33175
  1202
himmelma@33175
  1203
lemma Lim_within_le: "(f ---> l)(at a within S) \<longleftrightarrow>
himmelma@33175
  1204
           (\<forall>e>0. \<exists>d>0. \<forall>x\<in>S. 0 < dist x a  \<and> dist x a  <= d \<longrightarrow> dist (f x) l < e)"
himmelma@33175
  1205
  by (auto simp add: tendsto_iff eventually_within_le)
himmelma@33175
  1206
himmelma@33175
  1207
lemma Lim_within: "(f ---> l) (at a within S) \<longleftrightarrow>
himmelma@33175
  1208
        (\<forall>e >0. \<exists>d>0. \<forall>x \<in> S. 0 < dist x a  \<and> dist x a  < d  \<longrightarrow> dist (f x) l < e)"
himmelma@33175
  1209
  by (auto simp add: tendsto_iff eventually_within)
himmelma@33175
  1210
himmelma@33175
  1211
lemma Lim_at: "(f ---> l) (at a) \<longleftrightarrow>
himmelma@33175
  1212
        (\<forall>e >0. \<exists>d>0. \<forall>x. 0 < dist x a  \<and> dist x a  < d  \<longrightarrow> dist (f x) l < e)"
himmelma@33175
  1213
  by (auto simp add: tendsto_iff eventually_at)
himmelma@33175
  1214
himmelma@33175
  1215
lemma Lim_at_infinity:
himmelma@33175
  1216
  "(f ---> l) at_infinity \<longleftrightarrow> (\<forall>e>0. \<exists>b. \<forall>x. norm x >= b \<longrightarrow> dist (f x) l < e)"
himmelma@33175
  1217
  by (auto simp add: tendsto_iff eventually_at_infinity)
himmelma@33175
  1218
himmelma@33175
  1219
lemma Lim_eventually: "eventually (\<lambda>x. f x = l) net \<Longrightarrow> (f ---> l) net"
himmelma@33175
  1220
  by (rule topological_tendstoI, auto elim: eventually_rev_mono)
himmelma@33175
  1221
himmelma@33175
  1222
text{* The expected monotonicity property. *}
himmelma@33175
  1223
himmelma@33175
  1224
lemma Lim_within_empty: "(f ---> l) (net within {})"
himmelma@33175
  1225
  unfolding tendsto_def Limits.eventually_within by simp
himmelma@33175
  1226
himmelma@33175
  1227
lemma Lim_within_subset: "(f ---> l) (net within S) \<Longrightarrow> T \<subseteq> S \<Longrightarrow> (f ---> l) (net within T)"
himmelma@33175
  1228
  unfolding tendsto_def Limits.eventually_within
himmelma@33175
  1229
  by (auto elim!: eventually_elim1)
himmelma@33175
  1230
himmelma@33175
  1231
lemma Lim_Un: assumes "(f ---> l) (net within S)" "(f ---> l) (net within T)"
himmelma@33175
  1232
  shows "(f ---> l) (net within (S \<union> T))"
himmelma@33175
  1233
  using assms unfolding tendsto_def Limits.eventually_within
himmelma@33175
  1234
  apply clarify
himmelma@33175
  1235
  apply (drule spec, drule (1) mp, drule (1) mp)
himmelma@33175
  1236
  apply (drule spec, drule (1) mp, drule (1) mp)
himmelma@33175
  1237
  apply (auto elim: eventually_elim2)
himmelma@33175
  1238
  done
himmelma@33175
  1239
himmelma@33175
  1240
lemma Lim_Un_univ:
himmelma@33175
  1241
 "(f ---> l) (net within S) \<Longrightarrow> (f ---> l) (net within T) \<Longrightarrow>  S \<union> T = UNIV
himmelma@33175
  1242
        ==> (f ---> l) net"
himmelma@33175
  1243
  by (metis Lim_Un within_UNIV)
himmelma@33175
  1244
himmelma@33175
  1245
text{* Interrelations between restricted and unrestricted limits. *}
himmelma@33175
  1246
himmelma@33175
  1247
lemma Lim_at_within: "(f ---> l) net ==> (f ---> l)(net within S)"
himmelma@33175
  1248
  (* FIXME: rename *)
himmelma@33175
  1249
  unfolding tendsto_def Limits.eventually_within
himmelma@33175
  1250
  apply (clarify, drule spec, drule (1) mp, drule (1) mp)
himmelma@33175
  1251
  by (auto elim!: eventually_elim1)
himmelma@33175
  1252
huffman@44210
  1253
lemma eventually_within_interior:
huffman@44210
  1254
  assumes "x \<in> interior S"
huffman@44210
  1255
  shows "eventually P (at x within S) \<longleftrightarrow> eventually P (at x)" (is "?lhs = ?rhs")
huffman@44210
  1256
proof-
huffman@44519
  1257
  from assms obtain T where T: "open T" "x \<in> T" "T \<subseteq> S" ..
huffman@44210
  1258
  { assume "?lhs"
huffman@44210
  1259
    then obtain A where "open A" "x \<in> A" "\<forall>y\<in>A. y \<noteq> x \<longrightarrow> y \<in> S \<longrightarrow> P y"
huffman@44210
  1260
      unfolding Limits.eventually_within Limits.eventually_at_topological
huffman@44210
  1261
      by auto
huffman@44210
  1262
    with T have "open (A \<inter> T)" "x \<in> A \<inter> T" "\<forall>y\<in>(A \<inter> T). y \<noteq> x \<longrightarrow> P y"
huffman@44210
  1263
      by auto
huffman@44210
  1264
    then have "?rhs"
huffman@44210
  1265
      unfolding Limits.eventually_at_topological by auto
huffman@44210
  1266
  } moreover
huffman@44210
  1267
  { assume "?rhs" hence "?lhs"
huffman@44210
  1268
      unfolding Limits.eventually_within
huffman@44210
  1269
      by (auto elim: eventually_elim1)
huffman@44210
  1270
  } ultimately
huffman@44210
  1271
  show "?thesis" ..
huffman@44210
  1272
qed
huffman@44210
  1273
huffman@44210
  1274
lemma at_within_interior:
huffman@44210
  1275
  "x \<in> interior S \<Longrightarrow> at x within S = at x"
huffman@44210
  1276
  by (simp add: filter_eq_iff eventually_within_interior)
huffman@44210
  1277
huffman@44210
  1278
lemma at_within_open:
huffman@44210
  1279
  "\<lbrakk>x \<in> S; open S\<rbrakk> \<Longrightarrow> at x within S = at x"
huffman@44210
  1280
  by (simp only: at_within_interior interior_open)
huffman@44210
  1281
himmelma@33175
  1282
lemma Lim_within_open:
himmelma@33175
  1283
  fixes f :: "'a::topological_space \<Rightarrow> 'b::topological_space"
himmelma@33175
  1284
  assumes"a \<in> S" "open S"
huffman@44210
  1285
  shows "(f ---> l)(at a within S) \<longleftrightarrow> (f ---> l)(at a)"
huffman@44210
  1286
  using assms by (simp only: at_within_open)
himmelma@33175
  1287
hoelzl@43338
  1288
lemma Lim_within_LIMSEQ:
huffman@44584
  1289
  fixes a :: "'a::metric_space"
hoelzl@43338
  1290
  assumes "\<forall>S. (\<forall>n. S n \<noteq> a \<and> S n \<in> T) \<and> S ----> a \<longrightarrow> (\<lambda>n. X (S n)) ----> L"
hoelzl@43338
  1291
  shows "(X ---> L) (at a within T)"
huffman@44584
  1292
  using assms unfolding tendsto_def [where l=L]
huffman@44584
  1293
  by (simp add: sequentially_imp_eventually_within)
hoelzl@43338
  1294
hoelzl@43338
  1295
lemma Lim_right_bound:
hoelzl@43338
  1296
  fixes f :: "real \<Rightarrow> real"
hoelzl@43338
  1297
  assumes mono: "\<And>a b. a \<in> I \<Longrightarrow> b \<in> I \<Longrightarrow> x < a \<Longrightarrow> a \<le> b \<Longrightarrow> f a \<le> f b"
hoelzl@43338
  1298
  assumes bnd: "\<And>a. a \<in> I \<Longrightarrow> x < a \<Longrightarrow> K \<le> f a"
hoelzl@43338
  1299
  shows "(f ---> Inf (f ` ({x<..} \<inter> I))) (at x within ({x<..} \<inter> I))"
hoelzl@43338
  1300
proof cases
hoelzl@43338
  1301
  assume "{x<..} \<inter> I = {}" then show ?thesis by (simp add: Lim_within_empty)
hoelzl@43338
  1302
next
hoelzl@43338
  1303
  assume [simp]: "{x<..} \<inter> I \<noteq> {}"
hoelzl@43338
  1304
  show ?thesis
hoelzl@43338
  1305
  proof (rule Lim_within_LIMSEQ, safe)
hoelzl@43338
  1306
    fix S assume S: "\<forall>n. S n \<noteq> x \<and> S n \<in> {x <..} \<inter> I" "S ----> x"
hoelzl@43338
  1307
    
hoelzl@43338
  1308
    show "(\<lambda>n. f (S n)) ----> Inf (f ` ({x<..} \<inter> I))"
hoelzl@43338
  1309
    proof (rule LIMSEQ_I, rule ccontr)
hoelzl@43338
  1310
      fix r :: real assume "0 < r"
hoelzl@43338
  1311
      with Inf_close[of "f ` ({x<..} \<inter> I)" r]
hoelzl@43338
  1312
      obtain y where y: "x < y" "y \<in> I" "f y < Inf (f ` ({x <..} \<inter> I)) + r" by auto
hoelzl@43338
  1313
      from `x < y` have "0 < y - x" by auto
hoelzl@43338
  1314
      from S(2)[THEN LIMSEQ_D, OF this]
hoelzl@43338
  1315
      obtain N where N: "\<And>n. N \<le> n \<Longrightarrow> \<bar>S n - x\<bar> < y - x" by auto
hoelzl@43338
  1316
      
hoelzl@43338
  1317
      assume "\<not> (\<exists>N. \<forall>n\<ge>N. norm (f (S n) - Inf (f ` ({x<..} \<inter> I))) < r)"
hoelzl@43338
  1318
      moreover have "\<And>n. Inf (f ` ({x<..} \<inter> I)) \<le> f (S n)"
hoelzl@43338
  1319
        using S bnd by (intro Inf_lower[where z=K]) auto
hoelzl@43338
  1320
      ultimately obtain n where n: "N \<le> n" "r + Inf (f ` ({x<..} \<inter> I)) \<le> f (S n)"
hoelzl@43338
  1321
        by (auto simp: not_less field_simps)
hoelzl@43338
  1322
      with N[OF n(1)] mono[OF _ `y \<in> I`, of "S n"] S(1)[THEN spec, of n] y
hoelzl@43338
  1323
      show False by auto
hoelzl@43338
  1324
    qed
hoelzl@43338
  1325
  qed
hoelzl@43338
  1326
qed
hoelzl@43338
  1327
himmelma@33175
  1328
text{* Another limit point characterization. *}
himmelma@33175
  1329
himmelma@33175
  1330
lemma islimpt_sequential:
huffman@36667
  1331
  fixes x :: "'a::metric_space"
himmelma@33175
  1332
  shows "x islimpt S \<longleftrightarrow> (\<exists>f. (\<forall>n::nat. f n \<in> S -{x}) \<and> (f ---> x) sequentially)"
himmelma@33175
  1333
    (is "?lhs = ?rhs")
himmelma@33175
  1334
proof
himmelma@33175
  1335
  assume ?lhs
himmelma@33175
  1336
  then obtain f where f:"\<forall>y. y>0 \<longrightarrow> f y \<in> S \<and> f y \<noteq> x \<and> dist (f y) x < y"
huffman@44584
  1337
    unfolding islimpt_approachable
huffman@44584
  1338
    using choice[of "\<lambda>e y. e>0 \<longrightarrow> y\<in>S \<and> y\<noteq>x \<and> dist y x < e"] by auto
huffman@44584
  1339
  let ?I = "\<lambda>n. inverse (real (Suc n))"
huffman@44584
  1340
  have "\<forall>n. f (?I n) \<in> S - {x}" using f by simp
huffman@44584
  1341
  moreover have "(\<lambda>n. f (?I n)) ----> x"
huffman@44584
  1342
  proof (rule metric_tendsto_imp_tendsto)
huffman@44584
  1343
    show "?I ----> 0"
huffman@44584
  1344
      by (rule LIMSEQ_inverse_real_of_nat)
huffman@44584
  1345
    show "eventually (\<lambda>n. dist (f (?I n)) x \<le> dist (?I n) 0) sequentially"
huffman@44584
  1346
      by (simp add: norm_conv_dist [symmetric] less_imp_le f)
huffman@44584
  1347
  qed
huffman@44584
  1348
  ultimately show ?rhs by fast
himmelma@33175
  1349
next
himmelma@33175
  1350
  assume ?rhs
huffman@44907
  1351
  then obtain f::"nat\<Rightarrow>'a"  where f:"(\<forall>n. f n \<in> S - {x})" "(\<forall>e>0. \<exists>N. \<forall>n\<ge>N. dist (f n) x < e)" unfolding LIMSEQ_def by auto
himmelma@33175
  1352
  { fix e::real assume "e>0"
himmelma@33175
  1353
    then obtain N where "dist (f N) x < e" using f(2) by auto
himmelma@33175
  1354
    moreover have "f N\<in>S" "f N \<noteq> x" using f(1) by auto
himmelma@33175
  1355
    ultimately have "\<exists>x'\<in>S. x' \<noteq> x \<and> dist x' x < e" by auto
himmelma@33175
  1356
  }
himmelma@33175
  1357
  thus ?lhs unfolding islimpt_approachable by auto
himmelma@33175
  1358
qed
himmelma@33175
  1359
huffman@44125
  1360
lemma Lim_inv: (* TODO: delete *)
huffman@44081
  1361
  fixes f :: "'a \<Rightarrow> real" and A :: "'a filter"
huffman@44081
  1362
  assumes "(f ---> l) A" and "l \<noteq> 0"
huffman@44081
  1363
  shows "((inverse o f) ---> inverse l) A"
huffman@36437
  1364
  unfolding o_def using assms by (rule tendsto_inverse)
huffman@36437
  1365
himmelma@33175
  1366
lemma Lim_null:
himmelma@33175
  1367
  fixes f :: "'a \<Rightarrow> 'b::real_normed_vector"
huffman@44125
  1368
  shows "(f ---> l) net \<longleftrightarrow> ((\<lambda>x. f(x) - l) ---> 0) net"
himmelma@33175
  1369
  by (simp add: Lim dist_norm)
himmelma@33175
  1370
himmelma@33175
  1371
lemma Lim_null_comparison:
himmelma@33175
  1372
  fixes f :: "'a \<Rightarrow> 'b::real_normed_vector"
himmelma@33175
  1373
  assumes "eventually (\<lambda>x. norm (f x) \<le> g x) net" "(g ---> 0) net"
himmelma@33175
  1374
  shows "(f ---> 0) net"
huffman@44252
  1375
proof (rule metric_tendsto_imp_tendsto)
huffman@44252
  1376
  show "(g ---> 0) net" by fact
huffman@44252
  1377
  show "eventually (\<lambda>x. dist (f x) 0 \<le> dist (g x) 0) net"
huffman@44252
  1378
    using assms(1) by (rule eventually_elim1, simp add: dist_norm)
himmelma@33175
  1379
qed
himmelma@33175
  1380
himmelma@33175
  1381
lemma Lim_transform_bound:
himmelma@33175
  1382
  fixes f :: "'a \<Rightarrow> 'b::real_normed_vector"
himmelma@33175
  1383
  fixes g :: "'a \<Rightarrow> 'c::real_normed_vector"
himmelma@33175
  1384
  assumes "eventually (\<lambda>n. norm(f n) <= norm(g n)) net"  "(g ---> 0) net"
himmelma@33175
  1385
  shows "(f ---> 0) net"
huffman@44252
  1386
  using assms(1) tendsto_norm_zero [OF assms(2)]
huffman@44252
  1387
  by (rule Lim_null_comparison)
himmelma@33175
  1388
himmelma@33175
  1389
text{* Deducing things about the limit from the elements. *}
himmelma@33175
  1390
himmelma@33175
  1391
lemma Lim_in_closed_set:
himmelma@33175
  1392
  assumes "closed S" "eventually (\<lambda>x. f(x) \<in> S) net" "\<not>(trivial_limit net)" "(f ---> l) net"
himmelma@33175
  1393
  shows "l \<in> S"
himmelma@33175
  1394
proof (rule ccontr)
himmelma@33175
  1395
  assume "l \<notin> S"
himmelma@33175
  1396
  with `closed S` have "open (- S)" "l \<in> - S"
himmelma@33175
  1397
    by (simp_all add: open_Compl)
himmelma@33175
  1398
  with assms(4) have "eventually (\<lambda>x. f x \<in> - S) net"
himmelma@33175
  1399
    by (rule topological_tendstoD)
himmelma@33175
  1400
  with assms(2) have "eventually (\<lambda>x. False) net"
himmelma@33175
  1401
    by (rule eventually_elim2) simp
himmelma@33175
  1402
  with assms(3) show "False"
himmelma@33175
  1403
    by (simp add: eventually_False)
himmelma@33175
  1404
qed
himmelma@33175
  1405
himmelma@33175
  1406
text{* Need to prove closed(cball(x,e)) before deducing this as a corollary. *}
himmelma@33175
  1407
himmelma@33175
  1408
lemma Lim_dist_ubound:
himmelma@33175
  1409
  assumes "\<not>(trivial_limit net)" "(f ---> l) net" "eventually (\<lambda>x. dist a (f x) <= e) net"
himmelma@33175
  1410
  shows "dist a l <= e"
huffman@44252
  1411
proof-
huffman@44252
  1412
  have "dist a l \<in> {..e}"
huffman@44252
  1413
  proof (rule Lim_in_closed_set)
huffman@44252
  1414
    show "closed {..e}" by simp
huffman@44252
  1415
    show "eventually (\<lambda>x. dist a (f x) \<in> {..e}) net" by (simp add: assms)
huffman@44252
  1416
    show "\<not> trivial_limit net" by fact
huffman@44252
  1417
    show "((\<lambda>x. dist a (f x)) ---> dist a l) net" by (intro tendsto_intros assms)
huffman@44252
  1418
  qed
huffman@44252
  1419
  thus ?thesis by simp
himmelma@33175
  1420
qed
himmelma@33175
  1421
himmelma@33175
  1422
lemma Lim_norm_ubound:
himmelma@33175
  1423
  fixes f :: "'a \<Rightarrow> 'b::real_normed_vector"
himmelma@33175
  1424
  assumes "\<not>(trivial_limit net)" "(f ---> l) net" "eventually (\<lambda>x. norm(f x) <= e) net"
himmelma@33175
  1425
  shows "norm(l) <= e"
huffman@44252
  1426
proof-
huffman@44252
  1427
  have "norm l \<in> {..e}"
huffman@44252
  1428
  proof (rule Lim_in_closed_set)
huffman@44252
  1429
    show "closed {..e}" by simp
huffman@44252
  1430
    show "eventually (\<lambda>x. norm (f x) \<in> {..e}) net" by (simp add: assms)
huffman@44252
  1431
    show "\<not> trivial_limit net" by fact
huffman@44252
  1432
    show "((\<lambda>x. norm (f x)) ---> norm l) net" by (intro tendsto_intros assms)
huffman@44252
  1433
  qed
huffman@44252
  1434
  thus ?thesis by simp
himmelma@33175
  1435
qed
himmelma@33175
  1436
himmelma@33175
  1437
lemma Lim_norm_lbound:
himmelma@33175
  1438
  fixes f :: "'a \<Rightarrow> 'b::real_normed_vector"
himmelma@33175
  1439
  assumes "\<not> (trivial_limit net)"  "(f ---> l) net"  "eventually (\<lambda>x. e <= norm(f x)) net"
himmelma@33175
  1440
  shows "e \<le> norm l"
huffman@44252
  1441
proof-
huffman@44252
  1442
  have "norm l \<in> {e..}"
huffman@44252
  1443
  proof (rule Lim_in_closed_set)
huffman@44252
  1444
    show "closed {e..}" by simp
huffman@44252
  1445
    show "eventually (\<lambda>x. norm (f x) \<in> {e..}) net" by (simp add: assms)
huffman@44252
  1446
    show "\<not> trivial_limit net" by fact
huffman@44252
  1447
    show "((\<lambda>x. norm (f x)) ---> norm l) net" by (intro tendsto_intros assms)
huffman@44252
  1448
  qed
huffman@44252
  1449
  thus ?thesis by simp
himmelma@33175
  1450
qed
himmelma@33175
  1451
himmelma@33175
  1452
text{* Uniqueness of the limit, when nontrivial. *}
himmelma@33175
  1453
himmelma@33175
  1454
lemma tendsto_Lim:
himmelma@33175
  1455
  fixes f :: "'a \<Rightarrow> 'b::t2_space"
himmelma@33175
  1456
  shows "~(trivial_limit net) \<Longrightarrow> (f ---> l) net ==> Lim net f = l"
hoelzl@41970
  1457
  unfolding Lim_def using tendsto_unique[of net f] by auto
himmelma@33175
  1458
himmelma@33175
  1459
text{* Limit under bilinear function *}
himmelma@33175
  1460
himmelma@33175
  1461
lemma Lim_bilinear:
himmelma@33175
  1462
  assumes "(f ---> l) net" and "(g ---> m) net" and "bounded_bilinear h"
himmelma@33175
  1463
  shows "((\<lambda>x. h (f x) (g x)) ---> (h l m)) net"
himmelma@33175
  1464
using `bounded_bilinear h` `(f ---> l) net` `(g ---> m) net`
himmelma@33175
  1465
by (rule bounded_bilinear.tendsto)
himmelma@33175
  1466
himmelma@33175
  1467
text{* These are special for limits out of the same vector space. *}
himmelma@33175
  1468
himmelma@33175
  1469
lemma Lim_within_id: "(id ---> a) (at a within s)"
huffman@45031
  1470
  unfolding id_def by (rule tendsto_ident_at_within)
himmelma@33175
  1471
himmelma@33175
  1472
lemma Lim_at_id: "(id ---> a) (at a)"
huffman@45031
  1473
  unfolding id_def by (rule tendsto_ident_at)
himmelma@33175
  1474
himmelma@33175
  1475
lemma Lim_at_zero:
himmelma@33175
  1476
  fixes a :: "'a::real_normed_vector"
himmelma@33175
  1477
  fixes l :: "'b::topological_space"
himmelma@33175
  1478
  shows "(f ---> l) (at a) \<longleftrightarrow> ((\<lambda>x. f(a + x)) ---> l) (at 0)" (is "?lhs = ?rhs")
huffman@44252
  1479
  using LIM_offset_zero LIM_offset_zero_cancel ..
himmelma@33175
  1480
huffman@44081
  1481
text{* It's also sometimes useful to extract the limit point from the filter. *}
himmelma@33175
  1482
himmelma@33175
  1483
definition
huffman@44081
  1484
  netlimit :: "'a::t2_space filter \<Rightarrow> 'a" where
himmelma@33175
  1485
  "netlimit net = (SOME a. ((\<lambda>x. x) ---> a) net)"
himmelma@33175
  1486
himmelma@33175
  1487
lemma netlimit_within:
himmelma@33175
  1488
  assumes "\<not> trivial_limit (at a within S)"
himmelma@33175
  1489
  shows "netlimit (at a within S) = a"
himmelma@33175
  1490
unfolding netlimit_def
himmelma@33175
  1491
apply (rule some_equality)
himmelma@33175
  1492
apply (rule Lim_at_within)
huffman@44568
  1493
apply (rule tendsto_ident_at)
hoelzl@41970
  1494
apply (erule tendsto_unique [OF assms])
himmelma@33175
  1495
apply (rule Lim_at_within)
huffman@44568
  1496
apply (rule tendsto_ident_at)
himmelma@33175
  1497
done
himmelma@33175
  1498
himmelma@33175
  1499
lemma netlimit_at:
huffman@44072
  1500
  fixes a :: "'a::{perfect_space,t2_space}"
himmelma@33175
  1501
  shows "netlimit (at a) = a"
huffman@45031
  1502
  using netlimit_within [of a UNIV] by simp
himmelma@33175
  1503
huffman@44210
  1504
lemma lim_within_interior:
huffman@44210
  1505
  "x \<in> interior S \<Longrightarrow> (f ---> l) (at x within S) \<longleftrightarrow> (f ---> l) (at x)"
huffman@44210
  1506
  by (simp add: at_within_interior)
huffman@44210
  1507
huffman@44210
  1508
lemma netlimit_within_interior:
huffman@44210
  1509
  fixes x :: "'a::{t2_space,perfect_space}"
huffman@44210
  1510
  assumes "x \<in> interior S"
huffman@44210
  1511
  shows "netlimit (at x within S) = x"
huffman@44210
  1512
using assms by (simp add: at_within_interior netlimit_at)
huffman@44210
  1513
himmelma@33175
  1514
text{* Transformation of limit. *}
himmelma@33175
  1515
himmelma@33175
  1516
lemma Lim_transform:
himmelma@33175
  1517
  fixes f g :: "'a::type \<Rightarrow> 'b::real_normed_vector"
himmelma@33175
  1518
  assumes "((\<lambda>x. f x - g x) ---> 0) net" "(f ---> l) net"
himmelma@33175
  1519
  shows "(g ---> l) net"
huffman@44252
  1520
  using tendsto_diff [OF assms(2) assms(1)] by simp
himmelma@33175
  1521
himmelma@33175
  1522
lemma Lim_transform_eventually:
huffman@36667
  1523
  "eventually (\<lambda>x. f x = g x) net \<Longrightarrow> (f ---> l) net \<Longrightarrow> (g ---> l) net"
himmelma@33175
  1524
  apply (rule topological_tendstoI)
himmelma@33175
  1525
  apply (drule (2) topological_tendstoD)
himmelma@33175
  1526
  apply (erule (1) eventually_elim2, simp)
himmelma@33175
  1527
  done
himmelma@33175
  1528
himmelma@33175
  1529
lemma Lim_transform_within:
huffman@36667
  1530
  assumes "0 < d" and "\<forall>x'\<in>S. 0 < dist x' x \<and> dist x' x < d \<longrightarrow> f x' = g x'"
huffman@36667
  1531
  and "(f ---> l) (at x within S)"
huffman@36667
  1532
  shows "(g ---> l) (at x within S)"
huffman@36667
  1533
proof (rule Lim_transform_eventually)
huffman@36667
  1534
  show "eventually (\<lambda>x. f x = g x) (at x within S)"
huffman@36667
  1535
    unfolding eventually_within
huffman@36667
  1536
    using assms(1,2) by auto
huffman@36667
  1537
  show "(f ---> l) (at x within S)" by fact
huffman@36667
  1538
qed
himmelma@33175
  1539
himmelma@33175
  1540
lemma Lim_transform_at:
huffman@36667
  1541
  assumes "0 < d" and "\<forall>x'. 0 < dist x' x \<and> dist x' x < d \<longrightarrow> f x' = g x'"
huffman@36667
  1542
  and "(f ---> l) (at x)"
huffman@36667
  1543
  shows "(g ---> l) (at x)"
huffman@36667
  1544
proof (rule Lim_transform_eventually)
huffman@36667
  1545
  show "eventually (\<lambda>x. f x = g x) (at x)"
huffman@36667
  1546
    unfolding eventually_at
huffman@36667
  1547
    using assms(1,2) by auto
huffman@36667
  1548
  show "(f ---> l) (at x)" by fact
huffman@36667
  1549
qed
himmelma@33175
  1550
himmelma@33175
  1551
text{* Common case assuming being away from some crucial point like 0. *}
himmelma@33175
  1552
himmelma@33175
  1553
lemma Lim_transform_away_within:
huffman@36669
  1554
  fixes a b :: "'a::t1_space"
huffman@36667
  1555
  assumes "a \<noteq> b" and "\<forall>x\<in>S. x \<noteq> a \<and> x \<noteq> b \<longrightarrow> f x = g x"
himmelma@33175
  1556
  and "(f ---> l) (at a within S)"
himmelma@33175
  1557
  shows "(g ---> l) (at a within S)"
huffman@36669
  1558
proof (rule Lim_transform_eventually)
huffman@36669
  1559
  show "(f ---> l) (at a within S)" by fact
huffman@36669
  1560
  show "eventually (\<lambda>x. f x = g x) (at a within S)"
huffman@36669
  1561
    unfolding Limits.eventually_within eventually_at_topological
huffman@36669
  1562
    by (rule exI [where x="- {b}"], simp add: open_Compl assms)
himmelma@33175
  1563
qed
himmelma@33175
  1564
himmelma@33175
  1565
lemma Lim_transform_away_at:
huffman@36669
  1566
  fixes a b :: "'a::t1_space"
himmelma@33175
  1567
  assumes ab: "a\<noteq>b" and fg: "\<forall>x. x \<noteq> a \<and> x \<noteq> b \<longrightarrow> f x = g x"
himmelma@33175
  1568
  and fl: "(f ---> l) (at a)"
himmelma@33175
  1569
  shows "(g ---> l) (at a)"
himmelma@33175
  1570
  using Lim_transform_away_within[OF ab, of UNIV f g l] fg fl
huffman@45031
  1571
  by simp
himmelma@33175
  1572
himmelma@33175
  1573
text{* Alternatively, within an open set. *}
himmelma@33175
  1574
himmelma@33175
  1575
lemma Lim_transform_within_open:
huffman@36667
  1576
  assumes "open S" and "a \<in> S" and "\<forall>x\<in>S. x \<noteq> a \<longrightarrow> f x = g x"
huffman@36667
  1577
  and "(f ---> l) (at a)"
himmelma@33175
  1578
  shows "(g ---> l) (at a)"
huffman@36667
  1579
proof (rule Lim_transform_eventually)
huffman@36667
  1580
  show "eventually (\<lambda>x. f x = g x) (at a)"
huffman@36667
  1581
    unfolding eventually_at_topological
huffman@36667
  1582
    using assms(1,2,3) by auto
huffman@36667
  1583
  show "(f ---> l) (at a)" by fact
himmelma@33175
  1584
qed
himmelma@33175
  1585
himmelma@33175
  1586
text{* A congruence rule allowing us to transform limits assuming not at point. *}
himmelma@33175
  1587
himmelma@33175
  1588
(* FIXME: Only one congruence rule for tendsto can be used at a time! *)
himmelma@33175
  1589
huffman@36362
  1590
lemma Lim_cong_within(*[cong add]*):
hoelzl@43338
  1591
  assumes "a = b" "x = y" "S = T"
hoelzl@43338
  1592
  assumes "\<And>x. x \<noteq> b \<Longrightarrow> x \<in> T \<Longrightarrow> f x = g x"
hoelzl@43338
  1593
  shows "(f ---> x) (at a within S) \<longleftrightarrow> (g ---> y) (at b within T)"
huffman@36667
  1594
  unfolding tendsto_def Limits.eventually_within eventually_at_topological
huffman@36667
  1595
  using assms by simp
huffman@36667
  1596
huffman@36667
  1597
lemma Lim_cong_at(*[cong add]*):
hoelzl@43338
  1598
  assumes "a = b" "x = y"
huffman@36667
  1599
  assumes "\<And>x. x \<noteq> a \<Longrightarrow> f x = g x"
hoelzl@43338
  1600
  shows "((\<lambda>x. f x) ---> x) (at a) \<longleftrightarrow> ((g ---> y) (at a))"
huffman@36667
  1601
  unfolding tendsto_def eventually_at_topological
huffman@36667
  1602
  using assms by simp
himmelma@33175
  1603
himmelma@33175
  1604
text{* Useful lemmas on closure and set of possible sequential limits.*}
himmelma@33175
  1605
himmelma@33175
  1606
lemma closure_sequential:
huffman@36667
  1607
  fixes l :: "'a::metric_space"
himmelma@33175
  1608
  shows "l \<in> closure S \<longleftrightarrow> (\<exists>x. (\<forall>n. x n \<in> S) \<and> (x ---> l) sequentially)" (is "?lhs = ?rhs")
himmelma@33175
  1609
proof
himmelma@33175
  1610
  assume "?lhs" moreover
himmelma@33175
  1611
  { assume "l \<in> S"
huffman@44125
  1612
    hence "?rhs" using tendsto_const[of l sequentially] by auto
himmelma@33175
  1613
  } moreover
himmelma@33175
  1614
  { assume "l islimpt S"
himmelma@33175
  1615
    hence "?rhs" unfolding islimpt_sequential by auto
himmelma@33175
  1616
  } ultimately
himmelma@33175
  1617
  show "?rhs" unfolding closure_def by auto
himmelma@33175
  1618
next
himmelma@33175
  1619
  assume "?rhs"
himmelma@33175
  1620
  thus "?lhs" unfolding closure_def unfolding islimpt_sequential by auto
himmelma@33175
  1621
qed
himmelma@33175
  1622
himmelma@33175
  1623
lemma closed_sequential_limits:
himmelma@33175
  1624
  fixes S :: "'a::metric_space set"
himmelma@33175
  1625
  shows "closed S \<longleftrightarrow> (\<forall>x l. (\<forall>n. x n \<in> S) \<and> (x ---> l) sequentially \<longrightarrow> l \<in> S)"
himmelma@33175
  1626
  unfolding closed_limpt
himmelma@33175
  1627
  using closure_sequential [where 'a='a] closure_closed [where 'a='a] closed_limpt [where 'a='a] islimpt_sequential [where 'a='a] mem_delete [where 'a='a]
himmelma@33175
  1628
  by metis
himmelma@33175
  1629
himmelma@33175
  1630
lemma closure_approachable:
himmelma@33175
  1631
  fixes S :: "'a::metric_space set"
himmelma@33175
  1632
  shows "x \<in> closure S \<longleftrightarrow> (\<forall>e>0. \<exists>y\<in>S. dist y x < e)"
himmelma@33175
  1633
  apply (auto simp add: closure_def islimpt_approachable)
himmelma@33175
  1634
  by (metis dist_self)
himmelma@33175
  1635
himmelma@33175
  1636
lemma closed_approachable:
himmelma@33175
  1637
  fixes S :: "'a::metric_space set"
himmelma@33175
  1638
  shows "closed S ==> (\<forall>e>0. \<exists>y\<in>S. dist y x < e) \<longleftrightarrow> x \<in> S"
himmelma@33175
  1639
  by (metis closure_closed closure_approachable)
himmelma@33175
  1640
immler@50087
  1641
subsection {* Infimum Distance *}
immler@50087
  1642
immler@50087
  1643
definition "infdist x A = (if A = {} then 0 else Inf {dist x a|a. a \<in> A})"
immler@50087
  1644
immler@50087
  1645
lemma infdist_notempty: "A \<noteq> {} \<Longrightarrow> infdist x A = Inf {dist x a|a. a \<in> A}"
immler@50087
  1646
  by (simp add: infdist_def)
immler@50087
  1647
immler@50087
  1648
lemma infdist_nonneg:
immler@50087
  1649
  shows "0 \<le> infdist x A"
immler@50087
  1650
  using assms by (auto simp add: infdist_def)
immler@50087
  1651
immler@50087
  1652
lemma infdist_le:
immler@50087
  1653
  assumes "a \<in> A"
immler@50087
  1654
  assumes "d = dist x a"
immler@50087
  1655
  shows "infdist x A \<le> d"
immler@50087
  1656
  using assms by (auto intro!: SupInf.Inf_lower[where z=0] simp add: infdist_def)
immler@50087
  1657
immler@50087
  1658
lemma infdist_zero[simp]:
immler@50087
  1659
  assumes "a \<in> A" shows "infdist a A = 0"
immler@50087
  1660
proof -
immler@50087
  1661
  from infdist_le[OF assms, of "dist a a"] have "infdist a A \<le> 0" by auto
immler@50087
  1662
  with infdist_nonneg[of a A] assms show "infdist a A = 0" by auto
immler@50087
  1663
qed
immler@50087
  1664
immler@50087
  1665
lemma infdist_triangle:
immler@50087
  1666
  shows "infdist x A \<le> infdist y A + dist x y"
immler@50087
  1667
proof cases
immler@50087
  1668
  assume "A = {}" thus ?thesis by (simp add: infdist_def)
immler@50087
  1669
next
immler@50087
  1670
  assume "A \<noteq> {}" then obtain a where "a \<in> A" by auto
immler@50087
  1671
  have "infdist x A \<le> Inf {dist x y + dist y a |a. a \<in> A}"
immler@50087
  1672
  proof
immler@50087
  1673
    from `A \<noteq> {}` show "{dist x y + dist y a |a. a \<in> A} \<noteq> {}" by simp
immler@50087
  1674
    fix d assume "d \<in> {dist x y + dist y a |a. a \<in> A}"
immler@50087
  1675
    then obtain a where d: "d = dist x y + dist y a" "a \<in> A" by auto
immler@50087
  1676
    show "infdist x A \<le> d"
immler@50087
  1677
      unfolding infdist_notempty[OF `A \<noteq> {}`]
immler@50087
  1678
    proof (rule Inf_lower2)
immler@50087
  1679
      show "dist x a \<in> {dist x a |a. a \<in> A}" using `a \<in> A` by auto
immler@50087
  1680
      show "dist x a \<le> d" unfolding d by (rule dist_triangle)
immler@50087
  1681
      fix d assume "d \<in> {dist x a |a. a \<in> A}"
immler@50087
  1682
      then obtain a where "a \<in> A" "d = dist x a" by auto
immler@50087
  1683
      thus "infdist x A \<le> d" by (rule infdist_le)
immler@50087
  1684
    qed
immler@50087
  1685
  qed
immler@50087
  1686
  also have "\<dots> = dist x y + infdist y A"
immler@50087
  1687
  proof (rule Inf_eq, safe)
immler@50087
  1688
    fix a assume "a \<in> A"
immler@50087
  1689
    thus "dist x y + infdist y A \<le> dist x y + dist y a" by (auto intro: infdist_le)
immler@50087
  1690
  next
immler@50087
  1691
    fix i assume inf: "\<And>d. d \<in> {dist x y + dist y a |a. a \<in> A} \<Longrightarrow> i \<le> d"
immler@50087
  1692
    hence "i - dist x y \<le> infdist y A" unfolding infdist_notempty[OF `A \<noteq> {}`] using `a \<in> A`
immler@50087
  1693
      by (intro Inf_greatest) (auto simp: field_simps)
immler@50087
  1694
    thus "i \<le> dist x y + infdist y A" by simp
immler@50087
  1695
  qed
immler@50087
  1696
  finally show ?thesis by simp
immler@50087
  1697
qed
immler@50087
  1698
immler@50087
  1699
lemma
immler@50087
  1700
  in_closure_iff_infdist_zero:
immler@50087
  1701
  assumes "A \<noteq> {}"
immler@50087
  1702
  shows "x \<in> closure A \<longleftrightarrow> infdist x A = 0"
immler@50087
  1703
proof
immler@50087
  1704
  assume "x \<in> closure A"
immler@50087
  1705
  show "infdist x A = 0"
immler@50087
  1706
  proof (rule ccontr)
immler@50087
  1707
    assume "infdist x A \<noteq> 0"
immler@50087
  1708
    with infdist_nonneg[of x A] have "infdist x A > 0" by auto
immler@50087
  1709
    hence "ball x (infdist x A) \<inter> closure A = {}" apply auto
immler@50087
  1710
      by (metis `0 < infdist x A` `x \<in> closure A` closure_approachable dist_commute
immler@50087
  1711
        eucl_less_not_refl euclidean_trans(2) infdist_le)
immler@50087
  1712
    hence "x \<notin> closure A" by (metis `0 < infdist x A` centre_in_ball disjoint_iff_not_equal)
immler@50087
  1713
    thus False using `x \<in> closure A` by simp
immler@50087
  1714
  qed
immler@50087
  1715
next
immler@50087
  1716
  assume x: "infdist x A = 0"
immler@50087
  1717
  then obtain a where "a \<in> A" by atomize_elim (metis all_not_in_conv assms)
immler@50087
  1718
  show "x \<in> closure A" unfolding closure_approachable
immler@50087
  1719
  proof (safe, rule ccontr)
immler@50087
  1720
    fix e::real assume "0 < e"
immler@50087
  1721
    assume "\<not> (\<exists>y\<in>A. dist y x < e)"
immler@50087
  1722
    hence "infdist x A \<ge> e" using `a \<in> A`
immler@50087
  1723
      unfolding infdist_def
immler@50087
  1724
      by (force intro: Inf_greatest simp: dist_commute)
immler@50087
  1725
    with x `0 < e` show False by auto
immler@50087
  1726
  qed
immler@50087
  1727
qed
immler@50087
  1728
immler@50087
  1729
lemma
immler@50087
  1730
  in_closed_iff_infdist_zero:
immler@50087
  1731
  assumes "closed A" "A \<noteq> {}"
immler@50087
  1732
  shows "x \<in> A \<longleftrightarrow> infdist x A = 0"
immler@50087
  1733
proof -
immler@50087
  1734
  have "x \<in> closure A \<longleftrightarrow> infdist x A = 0"
immler@50087
  1735
    by (rule in_closure_iff_infdist_zero) fact
immler@50087
  1736
  with assms show ?thesis by simp
immler@50087
  1737
qed
immler@50087
  1738
immler@50087
  1739
lemma tendsto_infdist [tendsto_intros]:
immler@50087
  1740
  assumes f: "(f ---> l) F"
immler@50087
  1741
  shows "((\<lambda>x. infdist (f x) A) ---> infdist l A) F"
immler@50087
  1742
proof (rule tendstoI)
immler@50087
  1743
  fix e ::real assume "0 < e"
immler@50087
  1744
  from tendstoD[OF f this]
immler@50087
  1745
  show "eventually (\<lambda>x. dist (infdist (f x) A) (infdist l A) < e) F"
immler@50087
  1746
  proof (eventually_elim)
immler@50087
  1747
    fix x
immler@50087
  1748
    from infdist_triangle[of l A "f x"] infdist_triangle[of "f x" A l]
immler@50087
  1749
    have "dist (infdist (f x) A) (infdist l A) \<le> dist (f x) l"
immler@50087
  1750
      by (simp add: dist_commute dist_real_def)
immler@50087
  1751
    also assume "dist (f x) l < e"
immler@50087
  1752
    finally show "dist (infdist (f x) A) (infdist l A) < e" .
immler@50087
  1753
  qed
immler@50087
  1754
qed
immler@50087
  1755
himmelma@33175
  1756
text{* Some other lemmas about sequences. *}
himmelma@33175
  1757
huffman@36441
  1758
lemma sequentially_offset:
huffman@36441
  1759
  assumes "eventually (\<lambda>i. P i) sequentially"
huffman@36441
  1760
  shows "eventually (\<lambda>i. P (i + k)) sequentially"
huffman@36441
  1761
  using assms unfolding eventually_sequentially by (metis trans_le_add1)
huffman@36441
  1762
himmelma@33175
  1763
lemma seq_offset:
huffman@36441
  1764
  assumes "(f ---> l) sequentially"
huffman@36441
  1765
  shows "((\<lambda>i. f (i + k)) ---> l) sequentially"
huffman@44584
  1766
  using assms by (rule LIMSEQ_ignore_initial_segment) (* FIXME: redundant *)
himmelma@33175
  1767
himmelma@33175
  1768
lemma seq_offset_neg:
himmelma@33175
  1769
  "(f ---> l) sequentially ==> ((\<lambda>i. f(i - k)) ---> l) sequentially"
himmelma@33175
  1770
  apply (rule topological_tendstoI)
himmelma@33175
  1771
  apply (drule (2) topological_tendstoD)
himmelma@33175
  1772
  apply (simp only: eventually_sequentially)
himmelma@33175
  1773
  apply (subgoal_tac "\<And>N k (n::nat). N + k <= n ==> N <= n - k")
himmelma@33175
  1774
  apply metis
himmelma@33175
  1775
  by arith
himmelma@33175
  1776
himmelma@33175
  1777
lemma seq_offset_rev:
himmelma@33175
  1778
  "((\<lambda>i. f(i + k)) ---> l) sequentially ==> (f ---> l) sequentially"
huffman@44584
  1779
  by (rule LIMSEQ_offset) (* FIXME: redundant *)
himmelma@33175
  1780
himmelma@33175
  1781
lemma seq_harmonic: "((\<lambda>n. inverse (real n)) ---> 0) sequentially"
huffman@44584
  1782
  using LIMSEQ_inverse_real_of_nat by (rule LIMSEQ_imp_Suc)
himmelma@33175
  1783
huffman@44210
  1784
subsection {* More properties of closed balls *}
himmelma@33175
  1785
himmelma@33175
  1786
lemma closed_cball: "closed (cball x e)"
himmelma@33175
  1787
unfolding cball_def closed_def
himmelma@33175
  1788
unfolding Collect_neg_eq [symmetric] not_le
himmelma@33175
  1789
apply (clarsimp simp add: open_dist, rename_tac y)
himmelma@33175
  1790
apply (rule_tac x="dist x y - e" in exI, clarsimp)
himmelma@33175
  1791
apply (rename_tac x')
himmelma@33175
  1792
apply (cut_tac x=x and y=x' and z=y in dist_triangle)
himmelma@33175
  1793
apply simp
himmelma@33175
  1794
done
himmelma@33175
  1795
himmelma@33175
  1796
lemma open_contains_cball: "open S \<longleftrightarrow> (\<forall>x\<in>S. \<exists>e>0.  cball x e \<subseteq> S)"
himmelma@33175
  1797
proof-
himmelma@33175
  1798
  { fix x and e::real assume "x\<in>S" "e>0" "ball x e \<subseteq> S"
himmelma@33175
  1799
    hence "\<exists>d>0. cball x d \<subseteq> S" unfolding subset_eq by (rule_tac x="e/2" in exI, auto)
himmelma@33175
  1800
  } moreover
himmelma@33175
  1801
  { fix x and e::real assume "x\<in>S" "e>0" "cball x e \<subseteq> S"
himmelma@33175
  1802
    hence "\<exists>d>0. ball x d \<subseteq> S" unfolding subset_eq apply(rule_tac x="e/2" in exI) by auto
himmelma@33175
  1803
  } ultimately
himmelma@33175
  1804
  show ?thesis unfolding open_contains_ball by auto
himmelma@33175
  1805
qed
himmelma@33175
  1806
himmelma@33175
  1807
lemma open_contains_cball_eq: "open S ==> (\<forall>x. x \<in> S \<longleftrightarrow> (\<exists>e>0. cball x e \<subseteq> S))"
huffman@44170
  1808
  by (metis open_contains_cball subset_eq order_less_imp_le centre_in_cball)
himmelma@33175
  1809
himmelma@33175
  1810
lemma mem_interior_cball: "x \<in> interior S \<longleftrightarrow> (\<exists>e>0. cball x e \<subseteq> S)"
himmelma@33175
  1811
  apply (simp add: interior_def, safe)
himmelma@33175
  1812
  apply (force simp add: open_contains_cball)
himmelma@33175
  1813
  apply (rule_tac x="ball x e" in exI)
huffman@36362
  1814
  apply (simp add: subset_trans [OF ball_subset_cball])
himmelma@33175
  1815
  done
himmelma@33175
  1816
himmelma@33175
  1817
lemma islimpt_ball:
himmelma@33175
  1818
  fixes x y :: "'a::{real_normed_vector,perfect_space}"
himmelma@33175
  1819
  shows "y islimpt ball x e \<longleftrightarrow> 0 < e \<and> y \<in> cball x e" (is "?lhs = ?rhs")
himmelma@33175
  1820
proof
himmelma@33175
  1821
  assume "?lhs"
himmelma@33175
  1822
  { assume "e \<le> 0"
himmelma@33175
  1823
    hence *:"ball x e = {}" using ball_eq_empty[of x e] by auto
himmelma@33175
  1824
    have False using `?lhs` unfolding * using islimpt_EMPTY[of y] by auto
himmelma@33175
  1825
  }
himmelma@33175
  1826
  hence "e > 0" by (metis not_less)
himmelma@33175
  1827
  moreover
himmelma@33175
  1828
  have "y \<in> cball x e" using closed_cball[of x e] islimpt_subset[of y "ball x e" "cball x e"] ball_subset_cball[of x e] `?lhs` unfolding closed_limpt by auto
himmelma@33175
  1829
  ultimately show "?rhs" by auto
himmelma@33175
  1830
next
himmelma@33175
  1831
  assume "?rhs" hence "e>0"  by auto
himmelma@33175
  1832
  { fix d::real assume "d>0"
himmelma@33175
  1833
    have "\<exists>x'\<in>ball x e. x' \<noteq> y \<and> dist x' y < d"
himmelma@33175
  1834
    proof(cases "d \<le> dist x y")
himmelma@33175
  1835
      case True thus "\<exists>x'\<in>ball x e. x' \<noteq> y \<and> dist x' y < d"
himmelma@33175
  1836
      proof(cases "x=y")
himmelma@33175
  1837
        case True hence False using `d \<le> dist x y` `d>0` by auto
himmelma@33175
  1838
        thus "\<exists>x'\<in>ball x e. x' \<noteq> y \<and> dist x' y < d" by auto
himmelma@33175
  1839
      next
himmelma@33175
  1840
        case False
himmelma@33175
  1841
himmelma@33175
  1842
        have "dist x (y - (d / (2 * dist y x)) *\<^sub>R (y - x))
himmelma@33175
  1843
              = norm (x - y + (d / (2 * norm (y - x))) *\<^sub>R (y - x))"
himmelma@33175
  1844
          unfolding mem_cball mem_ball dist_norm diff_diff_eq2 diff_add_eq[THEN sym] by auto
himmelma@33175
  1845
        also have "\<dots> = \<bar>- 1 + d / (2 * norm (x - y))\<bar> * norm (x - y)"
himmelma@33175
  1846
          using scaleR_left_distrib[of "- 1" "d / (2 * norm (y - x))", THEN sym, of "y - x"]
himmelma@33175
  1847
          unfolding scaleR_minus_left scaleR_one
himmelma@33175
  1848
          by (auto simp add: norm_minus_commute)
himmelma@33175
  1849
        also have "\<dots> = \<bar>- norm (x - y) + d / 2\<bar>"
himmelma@33175
  1850
          unfolding abs_mult_pos[of "norm (x - y)", OF norm_ge_zero[of "x - y"]]
webertj@49962
  1851
          unfolding distrib_right using `x\<noteq>y`[unfolded dist_nz, unfolded dist_norm] by auto
himmelma@33175
  1852
        also have "\<dots> \<le> e - d/2" using `d \<le> dist x y` and `d>0` and `?rhs` by(auto simp add: dist_norm)
himmelma@33175
  1853
        finally have "y - (d / (2 * dist y x)) *\<^sub>R (y - x) \<in> ball x e" using `d>0` by auto
himmelma@33175
  1854
himmelma@33175
  1855
        moreover
himmelma@33175
  1856
himmelma@33175
  1857
        have "(d / (2*dist y x)) *\<^sub>R (y - x) \<noteq> 0"
himmelma@33175
  1858
          using `x\<noteq>y`[unfolded dist_nz] `d>0` unfolding scaleR_eq_0_iff by (auto simp add: dist_commute)
himmelma@33175
  1859
        moreover
himmelma@33175
  1860
        have "dist (y - (d / (2 * dist y x)) *\<^sub>R (y - x)) y < d" unfolding dist_norm apply simp unfolding norm_minus_cancel
himmelma@33175
  1861
          using `d>0` `x\<noteq>y`[unfolded dist_nz] dist_commute[of x y]
himmelma@33175
  1862
          unfolding dist_norm by auto
himmelma@33175
  1863
        ultimately show "\<exists>x'\<in>ball x e. x' \<noteq> y \<and> dist x' y < d" by (rule_tac  x="y - (d / (2*dist y x)) *\<^sub>R (y - x)" in bexI) auto
himmelma@33175
  1864
      qed
himmelma@33175
  1865
    next
himmelma@33175
  1866
      case False hence "d > dist x y" by auto
himmelma@33175
  1867
      show "\<exists>x'\<in>ball x e. x' \<noteq> y \<and> dist x' y < d"
himmelma@33175
  1868
      proof(cases "x=y")
himmelma@33175
  1869
        case True
himmelma@33175
  1870
        obtain z where **: "z \<noteq> y" "dist z y < min e d"
himmelma@33175
  1871
          using perfect_choose_dist[of "min e d" y]
himmelma@33175
  1872
          using `d > 0` `e>0` by auto
himmelma@33175
  1873
        show "\<exists>x'\<in>ball x e. x' \<noteq> y \<and> dist x' y < d"
himmelma@33175
  1874
          unfolding `x = y`
himmelma@33175
  1875
          using `z \<noteq> y` **
himmelma@33175
  1876
          by (rule_tac x=z in bexI, auto simp add: dist_commute)
himmelma@33175
  1877
      next
himmelma@33175
  1878
        case False thus "\<exists>x'\<in>ball x e. x' \<noteq> y \<and> dist x' y < d"
himmelma@33175
  1879
          using `d>0` `d > dist x y` `?rhs` by(rule_tac x=x in bexI, auto)
himmelma@33175
  1880
      qed
himmelma@33175
  1881
    qed  }
himmelma@33175
  1882
  thus "?lhs" unfolding mem_cball islimpt_approachable mem_ball by auto
himmelma@33175
  1883
qed
himmelma@33175
  1884
himmelma@33175
  1885
lemma closure_ball_lemma:
himmelma@33175
  1886
  fixes x y :: "'a::real_normed_vector"
himmelma@33175
  1887
  assumes "x \<noteq> y" shows "y islimpt ball x (dist x y)"
himmelma@33175
  1888
proof (rule islimptI)
himmelma@33175
  1889
  fix T assume "y \<in> T" "open T"
himmelma@33175
  1890
  then obtain r where "0 < r" "\<forall>z. dist z y < r \<longrightarrow> z \<in> T"
himmelma@33175
  1891
    unfolding open_dist by fast
himmelma@33175
  1892
  (* choose point between x and y, within distance r of y. *)
himmelma@33175
  1893
  def k \<equiv> "min 1 (r / (2 * dist x y))"
himmelma@33175
  1894
  def z \<equiv> "y + scaleR k (x - y)"
himmelma@33175
  1895
  have z_def2: "z = x + scaleR (1 - k) (y - x)"
himmelma@33175
  1896
    unfolding z_def by (simp add: algebra_simps)
himmelma@33175
  1897
  have "dist z y < r"
himmelma@33175
  1898
    unfolding z_def k_def using `0 < r`
himmelma@33175
  1899
    by (simp add: dist_norm min_def)
himmelma@33175
  1900
  hence "z \<in> T" using `\<forall>z. dist z y < r \<longrightarrow> z \<in> T` by simp
himmelma@33175
  1901
  have "dist x z < dist x y"
himmelma@33175
  1902
    unfolding z_def2 dist_norm
himmelma@33175
  1903
    apply (simp add: norm_minus_commute)
himmelma@33175
  1904
    apply (simp only: dist_norm [symmetric])
himmelma@33175
  1905
    apply (subgoal_tac "\<bar>1 - k\<bar> * dist x y < 1 * dist x y", simp)
himmelma@33175
  1906
    apply (rule mult_strict_right_mono)
himmelma@33175
  1907
    apply (simp add: k_def divide_pos_pos zero_less_dist_iff `0 < r` `x \<noteq> y`)
himmelma@33175
  1908
    apply (simp add: zero_less_dist_iff `x \<noteq> y`)
himmelma@33175
  1909
    done
himmelma@33175
  1910
  hence "z \<in> ball x (dist x y)" by simp
himmelma@33175
  1911
  have "z \<noteq> y"
himmelma@33175
  1912
    unfolding z_def k_def using `x \<noteq> y` `0 < r`
himmelma@33175
  1913
    by (simp add: min_def)
himmelma@33175
  1914
  show "\<exists>z\<in>ball x (dist x y). z \<in> T \<and> z \<noteq> y"
himmelma@33175
  1915
    using `z \<in> ball x (dist x y)` `z \<in> T` `z \<noteq> y`
himmelma@33175
  1916
    by fast
himmelma@33175
  1917
qed
himmelma@33175
  1918
himmelma@33175
  1919
lemma closure_ball:
himmelma@33175
  1920
  fixes x :: "'a::real_normed_vector"
himmelma@33175
  1921
  shows "0 < e \<Longrightarrow> closure (ball x e) = cball x e"
himmelma@33175
  1922
apply (rule equalityI)
himmelma@33175
  1923
apply (rule closure_minimal)
himmelma@33175
  1924
apply (rule ball_subset_cball)
himmelma@33175
  1925
apply (rule closed_cball)
himmelma@33175
  1926
apply (rule subsetI, rename_tac y)
himmelma@33175
  1927
apply (simp add: le_less [where 'a=real])
himmelma@33175
  1928
apply (erule disjE)
himmelma@33175
  1929
apply (rule subsetD [OF closure_subset], simp)
himmelma@33175
  1930
apply (simp add: closure_def)
himmelma@33175
  1931
apply clarify
himmelma@33175
  1932
apply (rule closure_ball_lemma)
himmelma@33175
  1933
apply (simp add: zero_less_dist_iff)
himmelma@33175
  1934
done
himmelma@33175
  1935
himmelma@33175
  1936
(* In a trivial vector space, this fails for e = 0. *)
himmelma@33175
  1937
lemma interior_cball:
himmelma@33175
  1938
  fixes x :: "'a::{real_normed_vector, perfect_space}"
himmelma@33175
  1939
  shows "interior (cball x e) = ball x e"
himmelma@33175
  1940
proof(cases "e\<ge>0")
himmelma@33175
  1941
  case False note cs = this
himmelma@33175
  1942
  from cs have "ball x e = {}" using ball_empty[of e x] by auto moreover
himmelma@33175
  1943
  { fix y assume "y \<in> cball x e"
himmelma@33175
  1944
    hence False unfolding mem_cball using dist_nz[of x y] cs by auto  }
himmelma@33175
  1945
  hence "cball x e = {}" by auto
himmelma@33175
  1946
  hence "interior (cball x e) = {}" using interior_empty by auto
himmelma@33175
  1947
  ultimately show ?thesis by blast
himmelma@33175
  1948
next
himmelma@33175
  1949
  case True note cs = this
himmelma@33175
  1950
  have "ball x e \<subseteq> cball x e" using ball_subset_cball by auto moreover
himmelma@33175
  1951
  { fix S y assume as: "S \<subseteq> cball x e" "open S" "y\<in>S"
himmelma@33175
  1952
    then obtain d where "d>0" and d:"\<forall>x'. dist x' y < d \<longrightarrow> x' \<in> S" unfolding open_dist by blast
himmelma@33175
  1953
himmelma@33175
  1954
    then obtain xa where xa_y: "xa \<noteq> y" and xa: "dist xa y < d"
himmelma@33175
  1955
      using perfect_choose_dist [of d] by auto
himmelma@33175
  1956
    have "xa\<in>S" using d[THEN spec[where x=xa]] using xa by(auto simp add: dist_commute)
himmelma@33175
  1957
    hence xa_cball:"xa \<in> cball x e" using as(1) by auto
himmelma@33175
  1958
himmelma@33175
  1959
    hence "y \<in> ball x e" proof(cases "x = y")
himmelma@33175
  1960
      case True
himmelma@33175
  1961
      hence "e>0" using xa_y[unfolded dist_nz] xa_cball[unfolded mem_cball] by (auto simp add: dist_commute)
himmelma@33175
  1962
      thus "y \<in> ball x e" using `x = y ` by simp
himmelma@33175
  1963
    next
himmelma@33175
  1964
      case False
himmelma@33175
  1965
      have "dist (y + (d / 2 / dist y x) *\<^sub>R (y - x)) y < d" unfolding dist_norm
himmelma@33175
  1966
        using `d>0` norm_ge_zero[of "y - x"] `x \<noteq> y` by auto
himmelma@33175
  1967
      hence *:"y + (d / 2 / dist y x) *\<^sub>R (y - x) \<in> cball x e" using d as(1)[unfolded subset_eq] by blast
himmelma@33175
  1968
      have "y - x \<noteq> 0" using `x \<noteq> y` by auto
himmelma@33175
  1969
      hence **:"d / (2 * norm (y - x)) > 0" unfolding zero_less_norm_iff[THEN sym]
himmelma@33175
  1970
        using `d>0` divide_pos_pos[of d "2*norm (y - x)"] by auto
himmelma@33175
  1971
himmelma@33175
  1972
      have "dist (y + (d / 2 / dist y x) *\<^sub>R (y - x)) x = norm (y + (d / (2 * norm (y - x))) *\<^sub>R y - (d / (2 * norm (y - x))) *\<^sub>R x - x)"
himmelma@33175
  1973
        by (auto simp add: dist_norm algebra_simps)
himmelma@33175
  1974
      also have "\<dots> = norm ((1 + d / (2 * norm (y - x))) *\<^sub>R (y - x))"
himmelma@33175
  1975
        by (auto simp add: algebra_simps)
himmelma@33175
  1976
      also have "\<dots> = \<bar>1 + d / (2 * norm (y - x))\<bar> * norm (y - x)"
himmelma@33175
  1977
        using ** by auto
webertj@49962
  1978
      also have "\<dots> = (dist y x) + d/2"using ** by (auto simp add: distrib_right dist_norm)
himmelma@33175
  1979
      finally have "e \<ge> dist x y +d/2" using *[unfolded mem_cball] by (auto simp add: dist_commute)
himmelma@33175
  1980
      thus "y \<in> ball x e" unfolding mem_ball using `d>0` by auto
himmelma@33175
  1981
    qed  }
himmelma@33175
  1982
  hence "\<forall>S \<subseteq> cball x e. open S \<longrightarrow> S \<subseteq> ball x e" by auto
himmelma@33175
  1983
  ultimately show ?thesis using interior_unique[of "ball x e" "cball x e"] using open_ball[of x e] by auto
himmelma@33175
  1984
qed
himmelma@33175
  1985
himmelma@33175
  1986
lemma frontier_ball:
himmelma@33175
  1987
  fixes a :: "'a::real_normed_vector"
himmelma@33175
  1988
  shows "0 < e ==> frontier(ball a e) = {x. dist a x = e}"
huffman@36362
  1989
  apply (simp add: frontier_def closure_ball interior_open order_less_imp_le)
nipkow@39302
  1990
  apply (simp add: set_eq_iff)
himmelma@33175
  1991
  by arith
himmelma@33175
  1992
himmelma@33175
  1993
lemma frontier_cball:
himmelma@33175
  1994
  fixes a :: "'a::{real_normed_vector, perfect_space}"
himmelma@33175
  1995
  shows "frontier(cball a e) = {x. dist a x = e}"
huffman@36362
  1996
  apply (simp add: frontier_def interior_cball closed_cball order_less_imp_le)
nipkow@39302
  1997
  apply (simp add: set_eq_iff)
himmelma@33175
  1998
  by arith
himmelma@33175
  1999
himmelma@33175
  2000
lemma cball_eq_empty: "(cball x e = {}) \<longleftrightarrow> e < 0"
nipkow@39302
  2001
  apply (simp add: set_eq_iff not_le)
himmelma@33175
  2002
  by (metis zero_le_dist dist_self order_less_le_trans)
himmelma@33175
  2003
lemma cball_empty: "e < 0 ==> cball x e = {}" by (simp add: cball_eq_empty)
himmelma@33175
  2004
himmelma@33175
  2005
lemma cball_eq_sing:
huffman@44072
  2006
  fixes x :: "'a::{metric_space,perfect_space}"
himmelma@33175
  2007
  shows "(cball x e = {x}) \<longleftrightarrow> e = 0"
himmelma@33175
  2008
proof (rule linorder_cases)
himmelma@33175
  2009
  assume e: "0 < e"
himmelma@33175
  2010
  obtain a where "a \<noteq> x" "dist a x < e"
himmelma@33175
  2011
    using perfect_choose_dist [OF e] by auto
himmelma@33175
  2012
  hence "a \<noteq> x" "dist x a \<le> e" by (auto simp add: dist_commute)
nipkow@39302
  2013
  with e show ?thesis by (auto simp add: set_eq_iff)
himmelma@33175
  2014
qed auto
himmelma@33175
  2015
himmelma@33175
  2016
lemma cball_sing:
himmelma@33175
  2017
  fixes x :: "'a::metric_space"
himmelma@33175
  2018
  shows "e = 0 ==> cball x e = {x}"
nipkow@39302
  2019
  by (auto simp add: set_eq_iff)
himmelma@33175
  2020
huffman@44210
  2021
huffman@44210
  2022
subsection {* Boundedness *}
himmelma@33175
  2023
himmelma@33175
  2024
  (* FIXME: This has to be unified with BSEQ!! *)
huffman@44207
  2025
definition (in metric_space)
huffman@44207
  2026
  bounded :: "'a set \<Rightarrow> bool" where
himmelma@33175
  2027
  "bounded S \<longleftrightarrow> (\<exists>x e. \<forall>y\<in>S. dist x y \<le> e)"
himmelma@33175
  2028
himmelma@33175
  2029
lemma bounded_any_center: "bounded S \<longleftrightarrow> (\<exists>e. \<forall>y\<in>S. dist a y \<le> e)"
himmelma@33175
  2030
unfolding bounded_def
himmelma@33175
  2031
apply safe
himmelma@33175
  2032
apply (rule_tac x="dist a x + e" in exI, clarify)
himmelma@33175
  2033
apply (drule (1) bspec)
himmelma@33175
  2034
apply (erule order_trans [OF dist_triangle add_left_mono])
himmelma@33175
  2035
apply auto
himmelma@33175
  2036
done
himmelma@33175
  2037
himmelma@33175
  2038
lemma bounded_iff: "bounded S \<longleftrightarrow> (\<exists>a. \<forall>x\<in>S. norm x \<le> a)"
himmelma@33175
  2039
unfolding bounded_any_center [where a=0]
himmelma@33175
  2040
by (simp add: dist_norm)
himmelma@33175
  2041
hoelzl@50104
  2042
lemma bounded_realI: assumes "\<forall>x\<in>s. abs (x::real) \<le> B" shows "bounded s"
hoelzl@50104
  2043
  unfolding bounded_def dist_real_def apply(rule_tac x=0 in exI)
hoelzl@50104
  2044
  using assms by auto
hoelzl@50104
  2045
himmelma@33175
  2046
lemma bounded_empty[simp]: "bounded {}" by (simp add: bounded_def)
himmelma@33175
  2047
lemma bounded_subset: "bounded T \<Longrightarrow> S \<subseteq> T ==> bounded S"
himmelma@33175
  2048
  by (metis bounded_def subset_eq)
himmelma@33175
  2049
himmelma@33175
  2050
lemma bounded_interior[intro]: "bounded S ==> bounded(interior S)"
himmelma@33175
  2051
  by (metis bounded_subset interior_subset)
himmelma@33175
  2052
himmelma@33175
  2053
lemma bounded_closure[intro]: assumes "bounded S" shows "bounded(closure S)"
himmelma@33175
  2054
proof-
himmelma@33175
  2055
  from assms obtain x and a where a: "\<forall>y\<in>S. dist x y \<le> a" unfolding bounded_def by auto
himmelma@33175
  2056
  { fix y assume "y \<in> closure S"
himmelma@33175
  2057
    then obtain f where f: "\<forall>n. f n \<in> S"  "(f ---> y) sequentially"
himmelma@33175
  2058
      unfolding closure_sequential by auto
himmelma@33175
  2059
    have "\<forall>n. f n \<in> S \<longrightarrow> dist x (f n) \<le> a" using a by simp
himmelma@33175
  2060
    hence "eventually (\<lambda>n. dist x (f n) \<le> a) sequentially"
himmelma@33175
  2061
      by (rule eventually_mono, simp add: f(1))
himmelma@33175
  2062
    have "dist x y \<le> a"
himmelma@33175
  2063
      apply (rule Lim_dist_ubound [of sequentially f])
himmelma@33175
  2064
      apply (rule trivial_limit_sequentially)
himmelma@33175
  2065
      apply (rule f(2))
himmelma@33175
  2066
      apply fact
himmelma@33175
  2067
      done
himmelma@33175
  2068
  }
himmelma@33175
  2069
  thus ?thesis unfolding bounded_def by auto
himmelma@33175
  2070
qed
himmelma@33175
  2071
himmelma@33175
  2072
lemma bounded_cball[simp,intro]: "bounded (cball x e)"
himmelma@33175
  2073
  apply (simp add: bounded_def)
himmelma@33175
  2074
  apply (rule_tac x=x in exI)
himmelma@33175
  2075
  apply (rule_tac x=e in exI)
himmelma@33175
  2076
  apply auto
himmelma@33175
  2077
  done
himmelma@33175
  2078
himmelma@33175
  2079
lemma bounded_ball[simp,intro]: "bounded(ball x e)"
himmelma@33175
  2080
  by (metis ball_subset_cball bounded_cball bounded_subset)
himmelma@33175
  2081
huffman@36362
  2082
lemma finite_imp_bounded[intro]:
huffman@36362
  2083
  fixes S :: "'a::metric_space set" assumes "finite S" shows "bounded S"
himmelma@33175
  2084
proof-
huffman@36362
  2085
  { fix a and F :: "'a set" assume as:"bounded F"
himmelma@33175
  2086
    then obtain x e where "\<forall>y\<in>F. dist x y \<le> e" unfolding bounded_def by auto
himmelma@33175
  2087
    hence "\<forall>y\<in>(insert a F). dist x y \<le> max e (dist x a)" by auto
himmelma@33175
  2088
    hence "bounded (insert a F)" unfolding bounded_def by (intro exI)
himmelma@33175
  2089
  }
himmelma@33175
  2090
  thus ?thesis using finite_induct[of S bounded]  using bounded_empty assms by auto
himmelma@33175
  2091
qed
himmelma@33175
  2092
himmelma@33175
  2093
lemma bounded_Un[simp]: "bounded (S \<union> T) \<longleftrightarrow> bounded S \<and> bounded T"
himmelma@33175
  2094
  apply (auto simp add: bounded_def)
himmelma@33175
  2095
  apply (rename_tac x y r s)
himmelma@33175
  2096
  apply (rule_tac x=x in exI)
himmelma@33175
  2097
  apply (rule_tac x="max r (dist x y + s)" in exI)
himmelma@33175
  2098
  apply (rule ballI, rename_tac z, safe)
himmelma@33175
  2099
  apply (drule (1) bspec, simp)
himmelma@33175
  2100
  apply (drule (1) bspec)
himmelma@33175
  2101
  apply (rule min_max.le_supI2)
himmelma@33175
  2102
  apply (erule order_trans [OF dist_triangle add_left_mono])
himmelma@33175
  2103
  done
himmelma@33175
  2104
himmelma@33175
  2105
lemma bounded_Union[intro]: "finite F \<Longrightarrow> (\<forall>S\<in>F. bounded S) \<Longrightarrow> bounded(\<Union>F)"
himmelma@33175
  2106
  by (induct rule: finite_induct[of F], auto)
himmelma@33175
  2107
himmelma@33175
  2108
lemma bounded_pos: "bounded S \<longleftrightarrow> (\<exists>b>0. \<forall>x\<in> S. norm x <= b)"
himmelma@33175
  2109
  apply (simp add: bounded_iff)
himmelma@33175
  2110
  apply (subgoal_tac "\<And>x (y::real). 0 < 1 + abs y \<and> (x <= y \<longrightarrow> x <= 1 + abs y)")
himmelma@33175
  2111
  by metis arith
himmelma@33175
  2112
himmelma@33175
  2113
lemma bounded_Int[intro]: "bounded S \<or> bounded T \<Longrightarrow> bounded (S \<inter> T)"
himmelma@33175
  2114
  by (metis Int_lower1 Int_lower2 bounded_subset)
himmelma@33175
  2115
himmelma@33175
  2116
lemma bounded_diff[intro]: "bounded S ==> bounded (S - T)"
himmelma@33175
  2117
apply (metis Diff_subset bounded_subset)
himmelma@33175
  2118
done
himmelma@33175
  2119
himmelma@33175
  2120
lemma bounded_insert[intro]:"bounded(insert x S) \<longleftrightarrow> bounded S"