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