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