src/HOL/Analysis/Continuous_Extension.thy
author wenzelm
Mon Mar 25 17:21:26 2019 +0100 (3 months ago)
changeset 69981 3dced198b9ec
parent 69922 4a9167f377b0
child 70136 f03a01a18c6e
permissions -rw-r--r--
more strict AFP properties;
wenzelm@63992
     1
(*  Title:      HOL/Analysis/Continuous_Extension.thy
lp15@63305
     2
    Authors:    LC Paulson, based on material from HOL Light
lp15@63305
     3
*)
lp15@63305
     4
nipkow@69508
     5
section \<open>Continuous Extensions of Functions\<close>
lp15@63305
     6
hoelzl@63594
     7
theory Continuous_Extension
lp15@66289
     8
imports Starlike
lp15@63305
     9
begin
lp15@63305
    10
lp15@63305
    11
subsection\<open>Partitions of unity subordinate to locally finite open coverings\<close>
lp15@63305
    12
lp15@63305
    13
text\<open>A difference from HOL Light: all summations over infinite sets equal zero,
lp15@63305
    14
   so the "support" must be made explicit in the summation below!\<close>
lp15@63305
    15
immler@68607
    16
proposition subordinate_partition_of_unity:
lp15@69918
    17
  fixes S :: "'a::metric_space set"
lp15@63305
    18
  assumes "S \<subseteq> \<Union>\<C>" and opC: "\<And>T. T \<in> \<C> \<Longrightarrow> open T"
lp15@63305
    19
      and fin: "\<And>x. x \<in> S \<Longrightarrow> \<exists>V. open V \<and> x \<in> V \<and> finite {U \<in> \<C>. U \<inter> V \<noteq> {}}"
lp15@63305
    20
  obtains F :: "['a set, 'a] \<Rightarrow> real"
lp15@63305
    21
    where "\<And>U. U \<in> \<C> \<Longrightarrow> continuous_on S (F U) \<and> (\<forall>x \<in> S. 0 \<le> F U x)"
lp15@63305
    22
      and "\<And>x U. \<lbrakk>U \<in> \<C>; x \<in> S; x \<notin> U\<rbrakk> \<Longrightarrow> F U x = 0"
nipkow@64267
    23
      and "\<And>x. x \<in> S \<Longrightarrow> supp_sum (\<lambda>W. F W x) \<C> = 1"
lp15@63305
    24
      and "\<And>x. x \<in> S \<Longrightarrow> \<exists>V. open V \<and> x \<in> V \<and> finite {U \<in> \<C>. \<exists>x\<in>V. F U x \<noteq> 0}"
immler@68607
    25
proof (cases "\<exists>W. W \<in> \<C> \<and> S \<subseteq> W")
lp15@63305
    26
  case True
lp15@63305
    27
    then obtain W where "W \<in> \<C>" "S \<subseteq> W" by metis
lp15@63305
    28
    then show ?thesis
lp15@69918
    29
      by (rule_tac F = "\<lambda>V x. if V = W then 1 else 0" in that) (auto simp: supp_sum_def support_on_def)
lp15@63305
    30
next
lp15@63305
    31
  case False
nipkow@64267
    32
    have nonneg: "0 \<le> supp_sum (\<lambda>V. setdist {x} (S - V)) \<C>" for x
nipkow@64267
    33
      by (simp add: supp_sum_def sum_nonneg)
lp15@63305
    34
    have sd_pos: "0 < setdist {x} (S - V)" if "V \<in> \<C>" "x \<in> S" "x \<in> V" for V x
lp15@63305
    35
    proof -
lp15@69922
    36
      have "closedin (top_of_set S) (S - V)"
nipkow@69286
    37
        by (simp add: Diff_Diff_Int closedin_def opC openin_open_Int \<open>V \<in> \<C>\<close>)
lp15@69918
    38
      with that False  setdist_pos_le [of "{x}" "S - V"]
lp15@69918
    39
      show ?thesis
lp15@69918
    40
        using setdist_gt_0_closedin by fastforce
lp15@63305
    41
    qed
nipkow@64267
    42
    have ss_pos: "0 < supp_sum (\<lambda>V. setdist {x} (S - V)) \<C>" if "x \<in> S" for x
lp15@63305
    43
    proof -
lp15@63305
    44
      obtain U where "U \<in> \<C>" "x \<in> U" using \<open>x \<in> S\<close> \<open>S \<subseteq> \<Union>\<C>\<close>
lp15@63305
    45
        by blast
lp15@63305
    46
      obtain V where "open V" "x \<in> V" "finite {U \<in> \<C>. U \<inter> V \<noteq> {}}"
lp15@63305
    47
        using \<open>x \<in> S\<close> fin by blast
lp15@63305
    48
      then have *: "finite {A \<in> \<C>. \<not> S \<subseteq> A \<and> x \<notin> closure (S - A)}"
lp15@63305
    49
        using closure_def that by (blast intro: rev_finite_subset)
lp15@63305
    50
      have "x \<notin> closure (S - U)"
lp15@69918
    51
        using \<open>U \<in> \<C>\<close> \<open>x \<in> U\<close> opC open_Int_closure_eq_empty by fastforce
lp15@63305
    52
      then show ?thesis
nipkow@64267
    53
        apply (simp add: setdist_eq_0_sing_1 supp_sum_def support_on_def)
nipkow@64267
    54
        apply (rule ordered_comm_monoid_add_class.sum_pos2 [OF *, of U])
lp15@63305
    55
        using \<open>U \<in> \<C>\<close> \<open>x \<in> U\<close> False
lp15@69918
    56
        apply (auto simp: sd_pos that)
lp15@63305
    57
        done
lp15@63305
    58
    qed
lp15@63305
    59
    define F where
lp15@69918
    60
      "F \<equiv> \<lambda>W x. if x \<in> S then setdist {x} (S - W) / supp_sum (\<lambda>V. setdist {x} (S - V)) \<C> else 0"
lp15@63305
    61
    show ?thesis
lp15@63305
    62
    proof (rule_tac F = F in that)
lp15@63305
    63
      have "continuous_on S (F U)" if "U \<in> \<C>" for U
lp15@63305
    64
      proof -
nipkow@64267
    65
        have *: "continuous_on S (\<lambda>x. supp_sum (\<lambda>V. setdist {x} (S - V)) \<C>)"
lp15@63305
    66
        proof (clarsimp simp add: continuous_on_eq_continuous_within)
lp15@63305
    67
          fix x assume "x \<in> S"
lp15@63305
    68
          then obtain X where "open X" and x: "x \<in> S \<inter> X" and finX: "finite {U \<in> \<C>. U \<inter> X \<noteq> {}}"
lp15@63305
    69
            using assms by blast
lp15@69922
    70
          then have OSX: "openin (top_of_set S) (S \<inter> X)" by blast
lp15@63305
    71
          have sumeq: "\<And>x. x \<in> S \<inter> X \<Longrightarrow>
lp15@63305
    72
                     (\<Sum>V | V \<in> \<C> \<and> V \<inter> X \<noteq> {}. setdist {x} (S - V))
nipkow@64267
    73
                     = supp_sum (\<lambda>V. setdist {x} (S - V)) \<C>"
nipkow@64267
    74
            apply (simp add: supp_sum_def)
nipkow@64267
    75
            apply (rule sum.mono_neutral_right [OF finX])
hoelzl@63593
    76
            apply (auto simp: setdist_eq_0_sing_1 support_on_def subset_iff)
lp15@63305
    77
            apply (meson DiffI closure_subset disjoint_iff_not_equal subsetCE)
lp15@63305
    78
            done
nipkow@64267
    79
          show "continuous (at x within S) (\<lambda>x. supp_sum (\<lambda>V. setdist {x} (S - V)) \<C>)"
lp15@63305
    80
            apply (rule continuous_transform_within_openin
nipkow@64267
    81
                     [where f = "\<lambda>x. (sum (\<lambda>V. setdist {x} (S - V)) {V \<in> \<C>. V \<inter> X \<noteq> {}})"
lp15@63305
    82
                        and S ="S \<inter> X"])
lp15@63305
    83
            apply (rule continuous_intros continuous_at_setdist continuous_at_imp_continuous_at_within OSX x)+
lp15@63305
    84
            apply (simp add: sumeq)
lp15@63305
    85
            done
lp15@63305
    86
        qed
lp15@63305
    87
        show ?thesis
lp15@63305
    88
          apply (simp add: F_def)
lp15@63305
    89
          apply (rule continuous_intros *)+
lp15@63305
    90
          using ss_pos apply force
lp15@63305
    91
          done
lp15@63305
    92
      qed
lp15@63305
    93
      moreover have "\<lbrakk>U \<in> \<C>; x \<in> S\<rbrakk> \<Longrightarrow> 0 \<le> F U x" for U x
lp15@63305
    94
        using nonneg [of x] by (simp add: F_def divide_simps setdist_pos_le)
lp15@63305
    95
      ultimately show "\<And>U. U \<in> \<C> \<Longrightarrow> continuous_on S (F U) \<and> (\<forall>x\<in>S. 0 \<le> F U x)"
lp15@63305
    96
        by metis
lp15@63305
    97
    next
lp15@63305
    98
      show "\<And>x U. \<lbrakk>U \<in> \<C>; x \<in> S; x \<notin> U\<rbrakk> \<Longrightarrow> F U x = 0"
lp15@63305
    99
        by (simp add: setdist_eq_0_sing_1 closure_def F_def)
lp15@63305
   100
    next
nipkow@64267
   101
      show "supp_sum (\<lambda>W. F W x) \<C> = 1" if "x \<in> S" for x
lp15@63305
   102
        using that ss_pos [OF that]
nipkow@64267
   103
        by (simp add: F_def divide_simps supp_sum_divide_distrib [symmetric])
lp15@63305
   104
    next
lp15@63305
   105
      show "\<exists>V. open V \<and> x \<in> V \<and> finite {U \<in> \<C>. \<exists>x\<in>V. F U x \<noteq> 0}" if "x \<in> S" for x
lp15@63305
   106
        using fin [OF that] that
lp15@63305
   107
        by (fastforce simp: setdist_eq_0_sing_1 closure_def F_def elim!: rev_finite_subset)
lp15@63305
   108
    qed
lp15@63305
   109
qed
lp15@63305
   110
lp15@63305
   111
nipkow@69508
   112
subsection\<open>Urysohn's Lemma for Euclidean Spaces\<close>
nipkow@69508
   113
nipkow@69508
   114
text \<open>For Euclidean spaces the proof is easy using distances.\<close>
lp15@63305
   115
lp15@63305
   116
lemma Urysohn_both_ne:
lp15@69922
   117
  assumes US: "closedin (top_of_set U) S"
lp15@69922
   118
      and UT: "closedin (top_of_set U) T"
lp15@63305
   119
      and "S \<inter> T = {}" "S \<noteq> {}" "T \<noteq> {}" "a \<noteq> b"
lp15@63305
   120
  obtains f :: "'a::euclidean_space \<Rightarrow> 'b::real_normed_vector"
lp15@63305
   121
    where "continuous_on U f"
lp15@63305
   122
          "\<And>x. x \<in> U \<Longrightarrow> f x \<in> closed_segment a b"
lp15@63305
   123
          "\<And>x. x \<in> U \<Longrightarrow> (f x = a \<longleftrightarrow> x \<in> S)"
lp15@63305
   124
          "\<And>x. x \<in> U \<Longrightarrow> (f x = b \<longleftrightarrow> x \<in> T)"
lp15@63305
   125
proof -
lp15@63305
   126
  have S0: "\<And>x. x \<in> U \<Longrightarrow> setdist {x} S = 0 \<longleftrightarrow> x \<in> S"
lp15@63305
   127
    using \<open>S \<noteq> {}\<close>  US setdist_eq_0_closedin  by auto
lp15@63305
   128
  have T0: "\<And>x. x \<in> U \<Longrightarrow> setdist {x} T = 0 \<longleftrightarrow> x \<in> T"
lp15@63305
   129
    using \<open>T \<noteq> {}\<close>  UT setdist_eq_0_closedin  by auto
lp15@63305
   130
  have sdpos: "0 < setdist {x} S + setdist {x} T" if "x \<in> U" for x
lp15@63305
   131
  proof -
nipkow@69508
   132
    have "\<not> (setdist {x} S = 0 \<and> setdist {x} T = 0)"
lp15@63305
   133
      using assms by (metis IntI empty_iff setdist_eq_0_closedin that)
lp15@63305
   134
    then show ?thesis
lp15@63305
   135
      by (metis add.left_neutral add.right_neutral add_pos_pos linorder_neqE_linordered_idom not_le setdist_pos_le)
lp15@63305
   136
  qed
lp15@63305
   137
  define f where "f \<equiv> \<lambda>x. a + (setdist {x} S / (setdist {x} S + setdist {x} T)) *\<^sub>R (b - a)"
lp15@63305
   138
  show ?thesis
lp15@63305
   139
  proof (rule_tac f = f in that)
lp15@63305
   140
    show "continuous_on U f"
lp15@63305
   141
      using sdpos unfolding f_def
lp15@63305
   142
      by (intro continuous_intros | force)+
lp15@63305
   143
    show "f x \<in> closed_segment a b" if "x \<in> U" for x
lp15@63305
   144
        unfolding f_def
lp15@63305
   145
      apply (simp add: closed_segment_def)
lp15@63305
   146
      apply (rule_tac x="(setdist {x} S / (setdist {x} S + setdist {x} T))" in exI)
lp15@63305
   147
      using sdpos that apply (simp add: algebra_simps)
lp15@63305
   148
      done
lp15@63305
   149
    show "\<And>x. x \<in> U \<Longrightarrow> (f x = a \<longleftrightarrow> x \<in> S)"
lp15@63305
   150
      using S0 \<open>a \<noteq> b\<close> f_def sdpos by force
lp15@63305
   151
    show "(f x = b \<longleftrightarrow> x \<in> T)" if "x \<in> U" for x
lp15@63305
   152
    proof -
lp15@63305
   153
      have "f x = b \<longleftrightarrow> (setdist {x} S / (setdist {x} S + setdist {x} T)) = 1"
lp15@63305
   154
        unfolding f_def
lp15@63305
   155
        apply (rule iffI)
lp15@63305
   156
         apply (metis  \<open>a \<noteq> b\<close> add_diff_cancel_left' eq_iff_diff_eq_0 pth_1 real_vector.scale_right_imp_eq, force)
lp15@63305
   157
        done
lp15@63305
   158
      also have "...  \<longleftrightarrow> setdist {x} T = 0 \<and> setdist {x} S \<noteq> 0"
lp15@63305
   159
        using sdpos that
lp15@63305
   160
        by (simp add: divide_simps) linarith
lp15@63305
   161
      also have "...  \<longleftrightarrow> x \<in> T"
lp15@63305
   162
        using \<open>S \<noteq> {}\<close> \<open>T \<noteq> {}\<close> \<open>S \<inter> T = {}\<close> that
lp15@63305
   163
        by (force simp: S0 T0)
lp15@63305
   164
      finally show ?thesis .
lp15@63305
   165
    qed
lp15@63305
   166
  qed
lp15@63305
   167
qed
lp15@63305
   168
lp15@63305
   169
proposition Urysohn_local_strong:
lp15@69922
   170
  assumes US: "closedin (top_of_set U) S"
lp15@69922
   171
      and UT: "closedin (top_of_set U) T"
lp15@63305
   172
      and "S \<inter> T = {}" "a \<noteq> b"
lp15@63305
   173
  obtains f :: "'a::euclidean_space \<Rightarrow> 'b::euclidean_space"
lp15@63305
   174
    where "continuous_on U f"
lp15@63305
   175
          "\<And>x. x \<in> U \<Longrightarrow> f x \<in> closed_segment a b"
lp15@63305
   176
          "\<And>x. x \<in> U \<Longrightarrow> (f x = a \<longleftrightarrow> x \<in> S)"
lp15@63305
   177
          "\<And>x. x \<in> U \<Longrightarrow> (f x = b \<longleftrightarrow> x \<in> T)"
lp15@63305
   178
proof (cases "S = {}")
lp15@63305
   179
  case True show ?thesis
lp15@63305
   180
  proof (cases "T = {}")
lp15@63305
   181
    case True show ?thesis
lp15@63305
   182
    proof (rule_tac f = "\<lambda>x. midpoint a b" in that)
lp15@63305
   183
      show "continuous_on U (\<lambda>x. midpoint a b)"
lp15@63305
   184
        by (intro continuous_intros)
lp15@63305
   185
      show "midpoint a b \<in> closed_segment a b"
lp15@63305
   186
        using csegment_midpoint_subset by blast
lp15@63305
   187
      show "(midpoint a b = a) = (x \<in> S)" for x
lp15@63305
   188
        using \<open>S = {}\<close> \<open>a \<noteq> b\<close> by simp
lp15@63305
   189
      show "(midpoint a b = b) = (x \<in> T)" for x
lp15@63305
   190
        using \<open>T = {}\<close> \<open>a \<noteq> b\<close> by simp
lp15@63305
   191
    qed
lp15@63305
   192
  next
lp15@63305
   193
    case False
lp15@63305
   194
    show ?thesis
lp15@63305
   195
    proof (cases "T = U")
lp15@63305
   196
      case True with \<open>S = {}\<close> \<open>a \<noteq> b\<close> show ?thesis
lp15@63305
   197
        by (rule_tac f = "\<lambda>x. b" in that) (auto simp: continuous_on_const)
lp15@63305
   198
    next
lp15@63305
   199
      case False
lp15@63305
   200
      with UT closedin_subset obtain c where c: "c \<in> U" "c \<notin> T"
lp15@63305
   201
        by fastforce
lp15@63305
   202
      obtain f where f: "continuous_on U f"
lp15@63305
   203
                "\<And>x. x \<in> U \<Longrightarrow> f x \<in> closed_segment (midpoint a b) b"
lp15@63305
   204
                "\<And>x. x \<in> U \<Longrightarrow> (f x = midpoint a b \<longleftrightarrow> x = c)"
lp15@63305
   205
                "\<And>x. x \<in> U \<Longrightarrow> (f x = b \<longleftrightarrow> x \<in> T)"
lp15@63305
   206
        apply (rule Urysohn_both_ne [of U "{c}" T "midpoint a b" "b"])
lp15@63305
   207
        using c \<open>T \<noteq> {}\<close> assms apply simp_all
lp15@63305
   208
        done
lp15@63305
   209
      show ?thesis
lp15@63305
   210
        apply (rule_tac f=f in that)
lp15@63305
   211
        using \<open>S = {}\<close> \<open>T \<noteq> {}\<close> f csegment_midpoint_subset notin_segment_midpoint [OF \<open>a \<noteq> b\<close>]
lp15@63305
   212
        apply force+
lp15@63305
   213
        done
lp15@63305
   214
    qed
lp15@63305
   215
  qed
lp15@63305
   216
next
lp15@63305
   217
  case False
lp15@63305
   218
  show ?thesis
lp15@63305
   219
  proof (cases "T = {}")
lp15@63305
   220
    case True show ?thesis
lp15@63305
   221
    proof (cases "S = U")
lp15@63305
   222
      case True with \<open>T = {}\<close> \<open>a \<noteq> b\<close> show ?thesis
lp15@63305
   223
        by (rule_tac f = "\<lambda>x. a" in that) (auto simp: continuous_on_const)
lp15@63305
   224
    next
lp15@63305
   225
      case False
lp15@63305
   226
      with US closedin_subset obtain c where c: "c \<in> U" "c \<notin> S"
lp15@63305
   227
        by fastforce
lp15@63305
   228
      obtain f where f: "continuous_on U f"
lp15@63305
   229
                "\<And>x. x \<in> U \<Longrightarrow> f x \<in> closed_segment a (midpoint a b)"
lp15@63305
   230
                "\<And>x. x \<in> U \<Longrightarrow> (f x = midpoint a b \<longleftrightarrow> x = c)"
lp15@63305
   231
                "\<And>x. x \<in> U \<Longrightarrow> (f x = a \<longleftrightarrow> x \<in> S)"
lp15@63305
   232
        apply (rule Urysohn_both_ne [of U S "{c}" a "midpoint a b"])
lp15@63305
   233
        using c \<open>S \<noteq> {}\<close> assms apply simp_all
lp15@63305
   234
        apply (metis midpoint_eq_endpoint)
lp15@63305
   235
        done
lp15@63305
   236
      show ?thesis
lp15@63305
   237
        apply (rule_tac f=f in that)
lp15@63305
   238
        using \<open>S \<noteq> {}\<close> \<open>T = {}\<close> f  \<open>a \<noteq> b\<close>
lp15@63305
   239
        apply simp_all
lp15@63305
   240
        apply (metis (no_types) closed_segment_commute csegment_midpoint_subset midpoint_sym subset_iff)
lp15@63305
   241
        apply (metis closed_segment_commute midpoint_sym notin_segment_midpoint)
lp15@63305
   242
        done
lp15@63305
   243
    qed
lp15@63305
   244
  next
lp15@63305
   245
    case False
lp15@63305
   246
    show ?thesis
lp15@63305
   247
      using Urysohn_both_ne [OF US UT \<open>S \<inter> T = {}\<close> \<open>S \<noteq> {}\<close> \<open>T \<noteq> {}\<close> \<open>a \<noteq> b\<close>] that
lp15@63305
   248
      by blast
lp15@63305
   249
  qed
lp15@63305
   250
qed
lp15@63305
   251
lp15@63305
   252
lemma Urysohn_local:
lp15@69922
   253
  assumes US: "closedin (top_of_set U) S"
lp15@69922
   254
      and UT: "closedin (top_of_set U) T"
lp15@63305
   255
      and "S \<inter> T = {}"
lp15@63305
   256
  obtains f :: "'a::euclidean_space \<Rightarrow> 'b::euclidean_space"
lp15@63305
   257
    where "continuous_on U f"
lp15@63305
   258
          "\<And>x. x \<in> U \<Longrightarrow> f x \<in> closed_segment a b"
lp15@63305
   259
          "\<And>x. x \<in> S \<Longrightarrow> f x = a"
lp15@63305
   260
          "\<And>x. x \<in> T \<Longrightarrow> f x = b"
lp15@63305
   261
proof (cases "a = b")
lp15@63305
   262
  case True then show ?thesis
lp15@63305
   263
    by (rule_tac f = "\<lambda>x. b" in that) (auto simp: continuous_on_const)
lp15@63305
   264
next
lp15@63305
   265
  case False
lp15@63305
   266
  then show ?thesis
lp15@63305
   267
    apply (rule Urysohn_local_strong [OF assms])
lp15@63305
   268
    apply (erule that, assumption)
lp15@63305
   269
    apply (meson US closedin_singleton closedin_trans)
lp15@63305
   270
    apply (meson UT closedin_singleton closedin_trans)
lp15@63305
   271
    done
lp15@63305
   272
qed
lp15@63305
   273
lp15@63305
   274
lemma Urysohn_strong:
lp15@63305
   275
  assumes US: "closed S"
lp15@63305
   276
      and UT: "closed T"
lp15@63305
   277
      and "S \<inter> T = {}" "a \<noteq> b"
lp15@63305
   278
  obtains f :: "'a::euclidean_space \<Rightarrow> 'b::euclidean_space"
lp15@63305
   279
    where "continuous_on UNIV f"
lp15@63305
   280
          "\<And>x. f x \<in> closed_segment a b"
lp15@63305
   281
          "\<And>x. f x = a \<longleftrightarrow> x \<in> S"
lp15@63305
   282
          "\<And>x. f x = b \<longleftrightarrow> x \<in> T"
lp15@66884
   283
using assms by (auto intro: Urysohn_local_strong [of UNIV S T])
lp15@63305
   284
immler@68607
   285
proposition Urysohn:
lp15@63305
   286
  assumes US: "closed S"
lp15@63305
   287
      and UT: "closed T"
lp15@63305
   288
      and "S \<inter> T = {}"
lp15@63305
   289
  obtains f :: "'a::euclidean_space \<Rightarrow> 'b::euclidean_space"
lp15@63305
   290
    where "continuous_on UNIV f"
lp15@63305
   291
          "\<And>x. f x \<in> closed_segment a b"
lp15@63305
   292
          "\<And>x. x \<in> S \<Longrightarrow> f x = a"
lp15@63305
   293
          "\<And>x. x \<in> T \<Longrightarrow> f x = b"
immler@68607
   294
  using assms by (auto intro: Urysohn_local [of UNIV S T a b])
lp15@63305
   295
lp15@63305
   296
nipkow@69518
   297
subsection\<open>Dugundji's Extension Theorem and Tietze Variants\<close>
lp15@63305
   298
nipkow@69518
   299
text \<open>See \cite{dugundji}.\<close>
lp15@63305
   300
immler@68607
   301
theorem Dugundji:
lp15@69918
   302
  fixes f :: "'a::{metric_space,second_countable_topology} \<Rightarrow> 'b::real_inner"
lp15@63305
   303
  assumes "convex C" "C \<noteq> {}"
lp15@69922
   304
      and cloin: "closedin (top_of_set U) S"
lp15@63305
   305
      and contf: "continuous_on S f" and "f ` S \<subseteq> C"
lp15@63305
   306
  obtains g where "continuous_on U g" "g ` U \<subseteq> C"
lp15@63305
   307
                  "\<And>x. x \<in> S \<Longrightarrow> g x = f x"
immler@68607
   308
proof (cases "S = {}")
lp15@63305
   309
  case True then show thesis
wenzelm@67613
   310
    apply (rule_tac g="\<lambda>x. SOME y. y \<in> C" in that)
lp15@63305
   311
      apply (rule continuous_intros)
lp15@63305
   312
     apply (meson all_not_in_conv \<open>C \<noteq> {}\<close> image_subsetI someI_ex, simp)
lp15@63305
   313
    done
lp15@63305
   314
next
lp15@63305
   315
  case False
lp15@63305
   316
  then have sd_pos: "\<And>x. \<lbrakk>x \<in> U; x \<notin> S\<rbrakk> \<Longrightarrow> 0 < setdist {x} S"
lp15@63305
   317
    using setdist_eq_0_closedin [OF cloin] le_less setdist_pos_le by fastforce
lp15@63305
   318
  define \<B> where "\<B> = {ball x (setdist {x} S / 2) |x. x \<in> U - S}"
lp15@63305
   319
  have [simp]: "\<And>T. T \<in> \<B> \<Longrightarrow> open T"
lp15@63305
   320
    by (auto simp: \<B>_def)
lp15@63305
   321
  have USS: "U - S \<subseteq> \<Union>\<B>"
lp15@63305
   322
    by (auto simp: sd_pos \<B>_def)
lp15@63305
   323
  obtain \<C> where USsub: "U - S \<subseteq> \<Union>\<C>"
lp15@63305
   324
       and nbrhd: "\<And>U. U \<in> \<C> \<Longrightarrow> open U \<and> (\<exists>T. T \<in> \<B> \<and> U \<subseteq> T)"
lp15@69918
   325
       and fin: "\<And>x. x \<in> U - S \<Longrightarrow> \<exists>V. open V \<and> x \<in> V \<and> finite {U. U \<in> \<C> \<and> U \<inter> V \<noteq> {}}"
lp15@69918
   326
    by (rule paracompact [OF USS]) auto
lp15@63305
   327
  have "\<exists>v a. v \<in> U \<and> v \<notin> S \<and> a \<in> S \<and>
lp15@63305
   328
              T \<subseteq> ball v (setdist {v} S / 2) \<and>
lp15@63305
   329
              dist v a \<le> 2 * setdist {v} S" if "T \<in> \<C>" for T
lp15@63305
   330
  proof -
lp15@63305
   331
    obtain v where v: "T \<subseteq> ball v (setdist {v} S / 2)" "v \<in> U" "v \<notin> S"
lp15@63305
   332
      using \<open>T \<in> \<C>\<close> nbrhd by (force simp: \<B>_def)
lp15@63305
   333
    then obtain a where "a \<in> S" "dist v a < 2 * setdist {v} S"
lp15@63305
   334
      using setdist_ltE [of "{v}" S "2 * setdist {v} S"]
lp15@63305
   335
      using False sd_pos by force
lp15@63305
   336
    with v show ?thesis
lp15@63305
   337
      apply (rule_tac x=v in exI)
lp15@63305
   338
      apply (rule_tac x=a in exI, auto)
lp15@63305
   339
      done
lp15@63305
   340
  qed
lp15@63305
   341
  then obtain \<V> \<A> where
lp15@63305
   342
    VA: "\<And>T. T \<in> \<C> \<Longrightarrow> \<V> T \<in> U \<and> \<V> T \<notin> S \<and> \<A> T \<in> S \<and>
lp15@63305
   343
              T \<subseteq> ball (\<V> T) (setdist {\<V> T} S / 2) \<and>
lp15@63305
   344
              dist (\<V> T) (\<A> T) \<le> 2 * setdist {\<V> T} S"
lp15@63305
   345
    by metis
lp15@63305
   346
  have sdle: "setdist {\<V> T} S \<le> 2 * setdist {v} S" if "T \<in> \<C>" "v \<in> T" for T v
lp15@63305
   347
    using setdist_Lipschitz [of "\<V> T" S v] VA [OF \<open>T \<in> \<C>\<close>] \<open>v \<in> T\<close> by auto
lp15@63305
   348
  have d6: "dist a (\<A> T) \<le> 6 * dist a v" if "T \<in> \<C>" "v \<in> T" "a \<in> S" for T v a
lp15@63305
   349
  proof -
lp15@63305
   350
    have "dist (\<V> T) v < setdist {\<V> T} S / 2"
lp15@63305
   351
      using that VA mem_ball by blast
lp15@69918
   352
    also have "\<dots> \<le> setdist {v} S"
lp15@63305
   353
      using sdle [OF \<open>T \<in> \<C>\<close> \<open>v \<in> T\<close>] by simp
lp15@63305
   354
    also have vS: "setdist {v} S \<le> dist a v"
lp15@63305
   355
      by (simp add: setdist_le_dist setdist_sym \<open>a \<in> S\<close>)
lp15@63305
   356
    finally have VTV: "dist (\<V> T) v < dist a v" .
lp15@63305
   357
    have VTS: "setdist {\<V> T} S \<le> 2 * dist a v"
lp15@63305
   358
      using sdle that vS by force
lp15@63305
   359
    have "dist a (\<A> T) \<le> dist a v + dist v (\<V> T) + dist (\<V> T) (\<A> T)"
lp15@63305
   360
      by (metis add.commute add_le_cancel_left dist_commute dist_triangle2 dist_triangle_le)
lp15@69918
   361
    also have "\<dots> \<le> dist a v + dist a v + dist (\<V> T) (\<A> T)"
lp15@63305
   362
      using VTV by (simp add: dist_commute)
lp15@69918
   363
    also have "\<dots> \<le> 2 * dist a v + 2 * setdist {\<V> T} S"
lp15@63305
   364
      using VA [OF \<open>T \<in> \<C>\<close>] by auto
lp15@63305
   365
    finally show ?thesis
lp15@63305
   366
      using VTS by linarith
lp15@63305
   367
  qed
lp15@63305
   368
  obtain H :: "['a set, 'a] \<Rightarrow> real"
lp15@63305
   369
    where Hcont: "\<And>Z. Z \<in> \<C> \<Longrightarrow> continuous_on (U-S) (H Z)"
lp15@63305
   370
      and Hge0: "\<And>Z x. \<lbrakk>Z \<in> \<C>; x \<in> U-S\<rbrakk> \<Longrightarrow> 0 \<le> H Z x"
lp15@63305
   371
      and Heq0: "\<And>x Z. \<lbrakk>Z \<in> \<C>; x \<in> U-S; x \<notin> Z\<rbrakk> \<Longrightarrow> H Z x = 0"
nipkow@64267
   372
      and H1: "\<And>x. x \<in> U-S \<Longrightarrow> supp_sum (\<lambda>W. H W x) \<C> = 1"
lp15@63305
   373
      and Hfin: "\<And>x. x \<in> U-S \<Longrightarrow> \<exists>V. open V \<and> x \<in> V \<and> finite {U \<in> \<C>. \<exists>x\<in>V. H U x \<noteq> 0}"
lp15@63305
   374
    apply (rule subordinate_partition_of_unity [OF USsub _ fin])
lp15@63305
   375
    using nbrhd by auto
nipkow@64267
   376
  define g where "g \<equiv> \<lambda>x. if x \<in> S then f x else supp_sum (\<lambda>T. H T x *\<^sub>R f(\<A> T)) \<C>"
lp15@63305
   377
  show ?thesis
lp15@63305
   378
  proof (rule that)
lp15@63305
   379
    show "continuous_on U g"
lp15@63305
   380
    proof (clarsimp simp: continuous_on_eq_continuous_within)
lp15@63305
   381
      fix a assume "a \<in> U"
lp15@63305
   382
      show "continuous (at a within U) g"
lp15@63305
   383
      proof (cases "a \<in> S")
lp15@63305
   384
        case True show ?thesis
lp15@63305
   385
        proof (clarsimp simp add: continuous_within_topological)
lp15@63305
   386
          fix W
lp15@63305
   387
          assume "open W" "g a \<in> W"
lp15@63305
   388
          then obtain e where "0 < e" and e: "ball (f a) e \<subseteq> W"
lp15@63305
   389
            using openE True g_def by auto
lp15@63305
   390
          have "continuous (at a within S) f"
lp15@63305
   391
            using True contf continuous_on_eq_continuous_within by blast
lp15@63305
   392
          then obtain d where "0 < d"
lp15@63305
   393
                        and d: "\<And>x. \<lbrakk>x \<in> S; dist x a < d\<rbrakk> \<Longrightarrow> dist (f x) (f a) < e"
lp15@63305
   394
            using continuous_within_eps_delta \<open>0 < e\<close> by force
lp15@63305
   395
          have "g y \<in> ball (f a) e" if "y \<in> U" and y: "y \<in> ball a (d / 6)" for y
lp15@63305
   396
          proof (cases "y \<in> S")
lp15@63305
   397
            case True
lp15@63305
   398
            then have "dist (f a) (f y) < e"
lp15@63305
   399
              by (metis ball_divide_subset_numeral dist_commute in_mono mem_ball y d)
lp15@63305
   400
            then show ?thesis
lp15@63305
   401
              by (simp add: True g_def)
lp15@63305
   402
          next
lp15@63305
   403
            case False
lp15@63305
   404
            have *: "dist (f (\<A> T)) (f a) < e" if "T \<in> \<C>" "H T y \<noteq> 0" for T
lp15@63305
   405
            proof -
lp15@63305
   406
              have "y \<in> T"
lp15@63305
   407
                using Heq0 that False \<open>y \<in> U\<close> by blast
lp15@63305
   408
              have "dist (\<A> T) a < d"
lp15@63305
   409
                using d6 [OF \<open>T \<in> \<C>\<close> \<open>y \<in> T\<close> \<open>a \<in> S\<close>] y
lp15@63305
   410
                by (simp add: dist_commute mult.commute)
lp15@63305
   411
              then show ?thesis
lp15@63305
   412
                using VA [OF \<open>T \<in> \<C>\<close>] by (auto simp: d)
lp15@63305
   413
            qed
nipkow@64267
   414
            have "supp_sum (\<lambda>T. H T y *\<^sub>R f (\<A> T)) \<C> \<in> ball (f a) e"
nipkow@64267
   415
              apply (rule convex_supp_sum [OF convex_ball])
lp15@63305
   416
              apply (simp_all add: False H1 Hge0 \<open>y \<in> U\<close>)
lp15@63305
   417
              by (metis dist_commute *)
lp15@63305
   418
            then show ?thesis
lp15@63305
   419
              by (simp add: False g_def)
lp15@63305
   420
          qed
lp15@63305
   421
          then show "\<exists>A. open A \<and> a \<in> A \<and> (\<forall>y\<in>U. y \<in> A \<longrightarrow> g y \<in> W)"
lp15@63305
   422
            apply (rule_tac x = "ball a (d / 6)" in exI)
lp15@63305
   423
            using e \<open>0 < d\<close> by fastforce
lp15@63305
   424
        qed
lp15@63305
   425
      next
lp15@63305
   426
        case False
lp15@63305
   427
        obtain N where N: "open N" "a \<in> N"
lp15@63305
   428
                   and finN: "finite {U \<in> \<C>. \<exists>a\<in>N. H U a \<noteq> 0}"
lp15@63305
   429
          using Hfin False \<open>a \<in> U\<close> by auto
lp15@69922
   430
        have oUS: "openin (top_of_set U) (U - S)"
lp15@63305
   431
          using cloin by (simp add: openin_diff)
lp15@63305
   432
        have HcontU: "continuous (at a within U) (H T)" if "T \<in> \<C>" for T
lp15@63305
   433
          using Hcont [OF \<open>T \<in> \<C>\<close>] False  \<open>a \<in> U\<close> \<open>T \<in> \<C>\<close>
lp15@63305
   434
          apply (simp add: continuous_on_eq_continuous_within continuous_within)
lp15@63305
   435
          apply (rule Lim_transform_within_set)
lp15@63305
   436
          using oUS
lp15@63305
   437
            apply (force simp: eventually_at openin_contains_ball dist_commute dest!: bspec)+
lp15@63305
   438
          done
lp15@63305
   439
        show ?thesis
lp15@63305
   440
        proof (rule continuous_transform_within_openin [OF _ oUS])
nipkow@64267
   441
          show "continuous (at a within U) (\<lambda>x. supp_sum (\<lambda>T. H T x *\<^sub>R f (\<A> T)) \<C>)"
lp15@63305
   442
          proof (rule continuous_transform_within_openin)
lp15@63305
   443
            show "continuous (at a within U)
lp15@63305
   444
                    (\<lambda>x. \<Sum>T\<in>{U \<in> \<C>. \<exists>x\<in>N. H U x \<noteq> 0}. H T x *\<^sub>R f (\<A> T))"
lp15@63305
   445
              by (force intro: continuous_intros HcontU)+
lp15@63305
   446
          next
lp15@69922
   447
            show "openin (top_of_set U) ((U - S) \<inter> N)"
lp15@63305
   448
              using N oUS openin_trans by blast
lp15@63305
   449
          next
lp15@63305
   450
            show "a \<in> (U - S) \<inter> N" using False \<open>a \<in> U\<close> N by blast
lp15@63305
   451
          next
lp15@63305
   452
            show "\<And>x. x \<in> (U - S) \<inter> N \<Longrightarrow>
lp15@63305
   453
                         (\<Sum>T \<in> {U \<in> \<C>. \<exists>x\<in>N. H U x \<noteq> 0}. H T x *\<^sub>R f (\<A> T))
nipkow@64267
   454
                         = supp_sum (\<lambda>T. H T x *\<^sub>R f (\<A> T)) \<C>"
nipkow@64267
   455
              by (auto simp: supp_sum_def support_on_def
nipkow@64267
   456
                       intro: sum.mono_neutral_right [OF finN])
lp15@63305
   457
          qed
lp15@63305
   458
        next
lp15@63305
   459
          show "a \<in> U - S" using False \<open>a \<in> U\<close> by blast
lp15@63305
   460
        next
nipkow@64267
   461
          show "\<And>x. x \<in> U - S \<Longrightarrow> supp_sum (\<lambda>T. H T x *\<^sub>R f (\<A> T)) \<C> = g x"
lp15@63305
   462
            by (simp add: g_def)
lp15@63305
   463
        qed
lp15@63305
   464
      qed
lp15@63305
   465
    qed
lp15@63305
   466
    show "g ` U \<subseteq> C"
lp15@63305
   467
      using \<open>f ` S \<subseteq> C\<close> VA
nipkow@64267
   468
      by (fastforce simp: g_def Hge0 intro!: convex_supp_sum [OF \<open>convex C\<close>] H1)
lp15@63305
   469
    show "\<And>x. x \<in> S \<Longrightarrow> g x = f x"
lp15@63305
   470
      by (simp add: g_def)
lp15@63305
   471
  qed
lp15@63305
   472
qed
lp15@63305
   473
lp15@63305
   474
immler@68607
   475
corollary Tietze:
lp15@69918
   476
  fixes f :: "'a::{metric_space,second_countable_topology} \<Rightarrow> 'b::real_inner"
lp15@63305
   477
  assumes "continuous_on S f"
lp15@69922
   478
    and "closedin (top_of_set U) S"
lp15@69918
   479
    and "0 \<le> B"
lp15@69918
   480
    and "\<And>x. x \<in> S \<Longrightarrow> norm(f x) \<le> B"
lp15@63305
   481
  obtains g where "continuous_on U g" "\<And>x. x \<in> S \<Longrightarrow> g x = f x"
lp15@69918
   482
    "\<And>x. x \<in> U \<Longrightarrow> norm(g x) \<le> B"
lp15@69918
   483
  using assms by (auto simp: image_subset_iff intro: Dugundji [of "cball 0 B" U S f])
lp15@63305
   484
nipkow@69518
   485
corollary%unimportant Tietze_closed_interval:
lp15@69918
   486
  fixes f :: "'a::{metric_space,second_countable_topology} \<Rightarrow> 'b::euclidean_space"
lp15@63305
   487
  assumes "continuous_on S f"
lp15@69922
   488
    and "closedin (top_of_set U) S"
lp15@69918
   489
    and "cbox a b \<noteq> {}"
lp15@69918
   490
    and "\<And>x. x \<in> S \<Longrightarrow> f x \<in> cbox a b"
lp15@63305
   491
  obtains g where "continuous_on U g" "\<And>x. x \<in> S \<Longrightarrow> g x = f x"
lp15@69918
   492
    "\<And>x. x \<in> U \<Longrightarrow> g x \<in> cbox a b"
lp15@69918
   493
  apply (rule Dugundji [of "cbox a b" U S f])
lp15@69918
   494
  using assms by auto
lp15@63305
   495
nipkow@69518
   496
corollary%unimportant Tietze_closed_interval_1:
lp15@69918
   497
  fixes f :: "'a::{metric_space,second_countable_topology} \<Rightarrow> real"
lp15@63305
   498
  assumes "continuous_on S f"
lp15@69922
   499
    and "closedin (top_of_set U) S"
lp15@69918
   500
    and "a \<le> b"
lp15@69918
   501
    and "\<And>x. x \<in> S \<Longrightarrow> f x \<in> cbox a b"
lp15@63305
   502
  obtains g where "continuous_on U g" "\<And>x. x \<in> S \<Longrightarrow> g x = f x"
lp15@69918
   503
    "\<And>x. x \<in> U \<Longrightarrow> g x \<in> cbox a b"
lp15@69918
   504
  apply (rule Dugundji [of "cbox a b" U S f])
lp15@69918
   505
  using assms by (auto simp: image_subset_iff)
lp15@63305
   506
nipkow@69518
   507
corollary%unimportant Tietze_open_interval:
lp15@69918
   508
  fixes f :: "'a::{metric_space,second_countable_topology} \<Rightarrow> 'b::euclidean_space"
lp15@63305
   509
  assumes "continuous_on S f"
lp15@69922
   510
    and "closedin (top_of_set U) S"
lp15@69918
   511
    and "box a b \<noteq> {}"
lp15@69918
   512
    and "\<And>x. x \<in> S \<Longrightarrow> f x \<in> box a b"
lp15@63305
   513
  obtains g where "continuous_on U g" "\<And>x. x \<in> S \<Longrightarrow> g x = f x"
lp15@69918
   514
    "\<And>x. x \<in> U \<Longrightarrow> g x \<in> box a b"
lp15@69918
   515
  apply (rule Dugundji [of "box a b" U S f])
lp15@69918
   516
  using assms by auto
lp15@63305
   517
nipkow@69518
   518
corollary%unimportant Tietze_open_interval_1:
lp15@69918
   519
  fixes f :: "'a::{metric_space,second_countable_topology} \<Rightarrow> real"
lp15@63305
   520
  assumes "continuous_on S f"
lp15@69922
   521
    and "closedin (top_of_set U) S"
lp15@69918
   522
    and "a < b"
lp15@69918
   523
    and no: "\<And>x. x \<in> S \<Longrightarrow> f x \<in> box a b"
lp15@63305
   524
  obtains g where "continuous_on U g" "\<And>x. x \<in> S \<Longrightarrow> g x = f x"
lp15@69918
   525
    "\<And>x. x \<in> U \<Longrightarrow> g x \<in> box a b"
lp15@69918
   526
  apply (rule Dugundji [of "box a b" U S f])
lp15@69918
   527
  using assms by (auto simp: image_subset_iff)
lp15@63305
   528
nipkow@69518
   529
corollary%unimportant Tietze_unbounded:
lp15@69918
   530
  fixes f :: "'a::{metric_space,second_countable_topology} \<Rightarrow> 'b::real_inner"
lp15@63305
   531
  assumes "continuous_on S f"
lp15@69922
   532
    and "closedin (top_of_set U) S"
lp15@63305
   533
  obtains g where "continuous_on U g" "\<And>x. x \<in> S \<Longrightarrow> g x = f x"
lp15@69918
   534
  apply (rule Dugundji [of UNIV U S f])
lp15@69918
   535
  using assms by auto
lp15@63305
   536
lp15@63305
   537
end