src/HOL/Real/HahnBanach/HahnBanachExtLemmas.thy
author wenzelm
Tue Jul 15 19:39:37 2008 +0200 (2008-07-15)
changeset 27612 d3eb431db035
parent 27611 2c01c0bdb385
child 29234 60f7fb56f8cd
permissions -rw-r--r--
modernized specifications and proofs;
tuned document;
wenzelm@7917
     1
(*  Title:      HOL/Real/HahnBanach/HahnBanachExtLemmas.thy
wenzelm@7917
     2
    ID:         $Id$
wenzelm@7917
     3
    Author:     Gertrud Bauer, TU Munich
wenzelm@7917
     4
*)
wenzelm@7917
     5
wenzelm@10007
     6
header {* Extending non-maximal functions *}
wenzelm@7917
     7
wenzelm@27612
     8
theory HahnBanachExtLemmas
wenzelm@27612
     9
imports FunctionNorm
wenzelm@27612
    10
begin
wenzelm@7917
    11
wenzelm@10687
    12
text {*
wenzelm@10687
    13
  In this section the following context is presumed.  Let @{text E} be
wenzelm@10687
    14
  a real vector space with a seminorm @{text q} on @{text E}. @{text
wenzelm@10687
    15
  F} is a subspace of @{text E} and @{text f} a linear function on
wenzelm@10687
    16
  @{text F}. We consider a subspace @{text H} of @{text E} that is a
wenzelm@10687
    17
  superspace of @{text F} and a linear form @{text h} on @{text
wenzelm@10687
    18
  H}. @{text H} is a not equal to @{text E} and @{text "x\<^sub>0"} is
wenzelm@10687
    19
  an element in @{text "E - H"}.  @{text H} is extended to the direct
wenzelm@10687
    20
  sum @{text "H' = H + lin x\<^sub>0"}, so for any @{text "x \<in> H'"}
wenzelm@10687
    21
  the decomposition of @{text "x = y + a \<cdot> x"} with @{text "y \<in> H"} is
wenzelm@13515
    22
  unique. @{text h'} is defined on @{text H'} by @{text "h' x = h y +
wenzelm@13515
    23
  a \<cdot> \<xi>"} for a certain @{text \<xi>}.
wenzelm@7917
    24
wenzelm@10687
    25
  Subsequently we show some properties of this extension @{text h'} of
wenzelm@10687
    26
  @{text h}.
wenzelm@7917
    27
wenzelm@13515
    28
  \medskip This lemma will be used to show the existence of a linear
wenzelm@13515
    29
  extension of @{text f} (see page \pageref{ex-xi-use}). It is a
wenzelm@13515
    30
  consequence of the completeness of @{text \<real>}. To show
wenzelm@10687
    31
  \begin{center}
wenzelm@10687
    32
  \begin{tabular}{l}
wenzelm@10687
    33
  @{text "\<exists>\<xi>. \<forall>y \<in> F. a y \<le> \<xi> \<and> \<xi> \<le> b y"}
wenzelm@10687
    34
  \end{tabular}
wenzelm@10687
    35
  \end{center}
wenzelm@10687
    36
  \noindent it suffices to show that
wenzelm@10687
    37
  \begin{center}
wenzelm@10687
    38
  \begin{tabular}{l}
wenzelm@10687
    39
  @{text "\<forall>u \<in> F. \<forall>v \<in> F. a u \<le> b v"}
wenzelm@10687
    40
  \end{tabular}
wenzelm@10687
    41
  \end{center}
wenzelm@10687
    42
*}
wenzelm@7917
    43
wenzelm@10687
    44
lemma ex_xi:
ballarin@27611
    45
  assumes "vectorspace F"
wenzelm@13515
    46
  assumes r: "\<And>u v. u \<in> F \<Longrightarrow> v \<in> F \<Longrightarrow> a u \<le> b v"
wenzelm@13515
    47
  shows "\<exists>xi::real. \<forall>y \<in> F. a y \<le> xi \<and> xi \<le> b y"
wenzelm@10007
    48
proof -
ballarin@27611
    49
  interpret vectorspace [F] by fact
wenzelm@7917
    50
  txt {* From the completeness of the reals follows:
wenzelm@13515
    51
    The set @{text "S = {a u. u \<in> F}"} has a supremum, if it is
wenzelm@13515
    52
    non-empty and has an upper bound. *}
wenzelm@7917
    53
wenzelm@13515
    54
  let ?S = "{a u | u. u \<in> F}"
wenzelm@13515
    55
  have "\<exists>xi. lub ?S xi"
wenzelm@13515
    56
  proof (rule real_complete)
wenzelm@13515
    57
    have "a 0 \<in> ?S" by blast
wenzelm@13515
    58
    then show "\<exists>X. X \<in> ?S" ..
wenzelm@13515
    59
    have "\<forall>y \<in> ?S. y \<le> b 0"
wenzelm@13515
    60
    proof
wenzelm@13515
    61
      fix y assume y: "y \<in> ?S"
wenzelm@13515
    62
      then obtain u where u: "u \<in> F" and y: "y = a u" by blast
wenzelm@13515
    63
      from u and zero have "a u \<le> b 0" by (rule r)
wenzelm@13515
    64
      with y show "y \<le> b 0" by (simp only:)
wenzelm@10007
    65
    qed
wenzelm@13515
    66
    then show "\<exists>u. \<forall>y \<in> ?S. y \<le> u" ..
wenzelm@10007
    67
  qed
wenzelm@13515
    68
  then obtain xi where xi: "lub ?S xi" ..
wenzelm@13515
    69
  {
wenzelm@13515
    70
    fix y assume "y \<in> F"
wenzelm@13515
    71
    then have "a y \<in> ?S" by blast
wenzelm@13515
    72
    with xi have "a y \<le> xi" by (rule lub.upper)
wenzelm@13515
    73
  } moreover {
wenzelm@13515
    74
    fix y assume y: "y \<in> F"
wenzelm@13515
    75
    from xi have "xi \<le> b y"
wenzelm@13515
    76
    proof (rule lub.least)
wenzelm@13515
    77
      fix au assume "au \<in> ?S"
wenzelm@13515
    78
      then obtain u where u: "u \<in> F" and au: "au = a u" by blast
wenzelm@13515
    79
      from u y have "a u \<le> b y" by (rule r)
wenzelm@13515
    80
      with au show "au \<le> b y" by (simp only:)
wenzelm@10007
    81
    qed
wenzelm@13515
    82
  } ultimately show "\<exists>xi. \<forall>y \<in> F. a y \<le> xi \<and> xi \<le> b y" by blast
wenzelm@10007
    83
qed
wenzelm@7917
    84
wenzelm@10687
    85
text {*
wenzelm@13515
    86
  \medskip The function @{text h'} is defined as a @{text "h' x = h y
wenzelm@13515
    87
  + a \<cdot> \<xi>"} where @{text "x = y + a \<cdot> \<xi>"} is a linear extension of
wenzelm@13515
    88
  @{text h} to @{text H'}.
wenzelm@13515
    89
*}
wenzelm@7917
    90
wenzelm@10687
    91
lemma h'_lf:
wenzelm@13515
    92
  assumes h'_def: "h' \<equiv> \<lambda>x. let (y, a) =
wenzelm@13515
    93
      SOME (y, a). x = y + a \<cdot> x0 \<and> y \<in> H in h y + a * xi"
wenzelm@10687
    94
    and H'_def: "H' \<equiv> H + lin x0"
wenzelm@13515
    95
    and HE: "H \<unlhd> E"
ballarin@27611
    96
  assumes "linearform H h"
wenzelm@13515
    97
  assumes x0: "x0 \<notin> H"  "x0 \<in> E"  "x0 \<noteq> 0"
ballarin@27611
    98
  assumes E: "vectorspace E"
wenzelm@13515
    99
  shows "linearform H' h'"
ballarin@27611
   100
proof -
ballarin@27611
   101
  interpret linearform [H h] by fact
ballarin@27611
   102
  interpret vectorspace [E] by fact
wenzelm@27612
   103
  show ?thesis
wenzelm@27612
   104
  proof
ballarin@27611
   105
    note E = `vectorspace E`
ballarin@27611
   106
    have H': "vectorspace H'"
ballarin@27611
   107
    proof (unfold H'_def)
ballarin@27611
   108
      from `x0 \<in> E`
ballarin@27611
   109
      have "lin x0 \<unlhd> E" ..
ballarin@27611
   110
      with HE show "vectorspace (H + lin x0)" using E ..
ballarin@27611
   111
    qed
ballarin@27611
   112
    {
ballarin@27611
   113
      fix x1 x2 assume x1: "x1 \<in> H'" and x2: "x2 \<in> H'"
ballarin@27611
   114
      show "h' (x1 + x2) = h' x1 + h' x2"
ballarin@27611
   115
      proof -
ballarin@27611
   116
	from H' x1 x2 have "x1 + x2 \<in> H'"
ballarin@27611
   117
          by (rule vectorspace.add_closed)
ballarin@27611
   118
	with x1 x2 obtain y y1 y2 a a1 a2 where
ballarin@27611
   119
          x1x2: "x1 + x2 = y + a \<cdot> x0" and y: "y \<in> H"
wenzelm@13515
   120
          and x1_rep: "x1 = y1 + a1 \<cdot> x0" and y1: "y1 \<in> H"
wenzelm@13515
   121
          and x2_rep: "x2 = y2 + a2 \<cdot> x0" and y2: "y2 \<in> H"
wenzelm@27612
   122
          unfolding H'_def sum_def lin_def by blast
ballarin@27611
   123
	
ballarin@27611
   124
	have ya: "y1 + y2 = y \<and> a1 + a2 = a" using E HE _ y x0
ballarin@27611
   125
	proof (rule decomp_H') txt_raw {* \label{decomp-H-use} *}
ballarin@27611
   126
          from HE y1 y2 show "y1 + y2 \<in> H"
ballarin@27611
   127
            by (rule subspace.add_closed)
ballarin@27611
   128
          from x0 and HE y y1 y2
ballarin@27611
   129
          have "x0 \<in> E"  "y \<in> E"  "y1 \<in> E"  "y2 \<in> E" by auto
ballarin@27611
   130
          with x1_rep x2_rep have "(y1 + y2) + (a1 + a2) \<cdot> x0 = x1 + x2"
ballarin@27611
   131
            by (simp add: add_ac add_mult_distrib2)
ballarin@27611
   132
          also note x1x2
ballarin@27611
   133
          finally show "(y1 + y2) + (a1 + a2) \<cdot> x0 = y + a \<cdot> x0" .
ballarin@27611
   134
	qed
ballarin@27611
   135
	
ballarin@27611
   136
	from h'_def x1x2 E HE y x0
ballarin@27611
   137
	have "h' (x1 + x2) = h y + a * xi"
ballarin@27611
   138
          by (rule h'_definite)
ballarin@27611
   139
	also have "\<dots> = h (y1 + y2) + (a1 + a2) * xi"
ballarin@27611
   140
          by (simp only: ya)
ballarin@27611
   141
	also from y1 y2 have "h (y1 + y2) = h y1 + h y2"
ballarin@27611
   142
          by simp
ballarin@27611
   143
	also have "\<dots> + (a1 + a2) * xi = (h y1 + a1 * xi) + (h y2 + a2 * xi)"
ballarin@27611
   144
          by (simp add: left_distrib)
ballarin@27611
   145
	also from h'_def x1_rep E HE y1 x0
ballarin@27611
   146
	have "h y1 + a1 * xi = h' x1"
ballarin@27611
   147
          by (rule h'_definite [symmetric])
ballarin@27611
   148
	also from h'_def x2_rep E HE y2 x0
ballarin@27611
   149
	have "h y2 + a2 * xi = h' x2"
ballarin@27611
   150
          by (rule h'_definite [symmetric])
ballarin@27611
   151
	finally show ?thesis .
wenzelm@10007
   152
      qed
ballarin@27611
   153
    next
ballarin@27611
   154
      fix x1 c assume x1: "x1 \<in> H'"
ballarin@27611
   155
      show "h' (c \<cdot> x1) = c * (h' x1)"
ballarin@27611
   156
      proof -
ballarin@27611
   157
	from H' x1 have ax1: "c \<cdot> x1 \<in> H'"
ballarin@27611
   158
          by (rule vectorspace.mult_closed)
ballarin@27611
   159
	with x1 obtain y a y1 a1 where
wenzelm@27612
   160
            cx1_rep: "c \<cdot> x1 = y + a \<cdot> x0" and y: "y \<in> H"
wenzelm@13515
   161
          and x1_rep: "x1 = y1 + a1 \<cdot> x0" and y1: "y1 \<in> H"
wenzelm@27612
   162
          unfolding H'_def sum_def lin_def by blast
ballarin@27611
   163
	
ballarin@27611
   164
	have ya: "c \<cdot> y1 = y \<and> c * a1 = a" using E HE _ y x0
ballarin@27611
   165
	proof (rule decomp_H')
ballarin@27611
   166
          from HE y1 show "c \<cdot> y1 \<in> H"
ballarin@27611
   167
            by (rule subspace.mult_closed)
ballarin@27611
   168
          from x0 and HE y y1
ballarin@27611
   169
          have "x0 \<in> E"  "y \<in> E"  "y1 \<in> E" by auto
ballarin@27611
   170
          with x1_rep have "c \<cdot> y1 + (c * a1) \<cdot> x0 = c \<cdot> x1"
ballarin@27611
   171
            by (simp add: mult_assoc add_mult_distrib1)
ballarin@27611
   172
          also note cx1_rep
ballarin@27611
   173
          finally show "c \<cdot> y1 + (c * a1) \<cdot> x0 = y + a \<cdot> x0" .
ballarin@27611
   174
	qed
ballarin@27611
   175
	
ballarin@27611
   176
	from h'_def cx1_rep E HE y x0 have "h' (c \<cdot> x1) = h y + a * xi"
ballarin@27611
   177
          by (rule h'_definite)
ballarin@27611
   178
	also have "\<dots> = h (c \<cdot> y1) + (c * a1) * xi"
ballarin@27611
   179
          by (simp only: ya)
ballarin@27611
   180
	also from y1 have "h (c \<cdot> y1) = c * h y1"
ballarin@27611
   181
          by simp
ballarin@27611
   182
	also have "\<dots> + (c * a1) * xi = c * (h y1 + a1 * xi)"
ballarin@27611
   183
          by (simp only: right_distrib)
ballarin@27611
   184
	also from h'_def x1_rep E HE y1 x0 have "h y1 + a1 * xi = h' x1"
ballarin@27611
   185
          by (rule h'_definite [symmetric])
ballarin@27611
   186
	finally show ?thesis .
wenzelm@10007
   187
      qed
ballarin@27611
   188
    }
ballarin@27611
   189
  qed
wenzelm@10007
   190
qed
wenzelm@7917
   191
wenzelm@10687
   192
text {* \medskip The linear extension @{text h'} of @{text h}
wenzelm@13515
   193
  is bounded by the seminorm @{text p}. *}
wenzelm@7917
   194
bauerg@9374
   195
lemma h'_norm_pres:
wenzelm@13515
   196
  assumes h'_def: "h' \<equiv> \<lambda>x. let (y, a) =
wenzelm@13515
   197
      SOME (y, a). x = y + a \<cdot> x0 \<and> y \<in> H in h y + a * xi"
wenzelm@10687
   198
    and H'_def: "H' \<equiv> H + lin x0"
wenzelm@13515
   199
    and x0: "x0 \<notin> H"  "x0 \<in> E"  "x0 \<noteq> 0"
ballarin@27611
   200
  assumes E: "vectorspace E" and HE: "subspace H E"
ballarin@27611
   201
    and "seminorm E p" and "linearform H h"
wenzelm@13515
   202
  assumes a: "\<forall>y \<in> H. h y \<le> p y"
wenzelm@13515
   203
    and a': "\<forall>y \<in> H. - p (y + x0) - h y \<le> xi \<and> xi \<le> p (y + x0) - h y"
wenzelm@13515
   204
  shows "\<forall>x \<in> H'. h' x \<le> p x"
ballarin@27611
   205
proof -
ballarin@27611
   206
  interpret vectorspace [E] by fact
ballarin@27611
   207
  interpret subspace [H E] by fact
ballarin@27611
   208
  interpret seminorm [E p] by fact
ballarin@27611
   209
  interpret linearform [H h] by fact
wenzelm@27612
   210
  show ?thesis
wenzelm@27612
   211
  proof
ballarin@27611
   212
    fix x assume x': "x \<in> H'"
ballarin@27611
   213
    show "h' x \<le> p x"
ballarin@27611
   214
    proof -
ballarin@27611
   215
      from a' have a1: "\<forall>ya \<in> H. - p (ya + x0) - h ya \<le> xi"
ballarin@27611
   216
	and a2: "\<forall>ya \<in> H. xi \<le> p (ya + x0) - h ya" by auto
ballarin@27611
   217
      from x' obtain y a where
wenzelm@27612
   218
          x_rep: "x = y + a \<cdot> x0" and y: "y \<in> H"
wenzelm@27612
   219
	unfolding H'_def sum_def lin_def by blast
ballarin@27611
   220
      from y have y': "y \<in> E" ..
ballarin@27611
   221
      from y have ay: "inverse a \<cdot> y \<in> H" by simp
ballarin@27611
   222
      
ballarin@27611
   223
      from h'_def x_rep E HE y x0 have "h' x = h y + a * xi"
ballarin@27611
   224
	by (rule h'_definite)
ballarin@27611
   225
      also have "\<dots> \<le> p (y + a \<cdot> x0)"
ballarin@27611
   226
      proof (rule linorder_cases)
ballarin@27611
   227
	assume z: "a = 0"
ballarin@27611
   228
	then have "h y + a * xi = h y" by simp
ballarin@27611
   229
	also from a y have "\<dots> \<le> p y" ..
ballarin@27611
   230
	also from x0 y' z have "p y = p (y + a \<cdot> x0)" by simp
ballarin@27611
   231
	finally show ?thesis .
ballarin@27611
   232
      next
ballarin@27611
   233
	txt {* In the case @{text "a < 0"}, we use @{text "a\<^sub>1"}
ballarin@27611
   234
          with @{text ya} taken as @{text "y / a"}: *}
wenzelm@27612
   235
	assume lz: "a < 0" then have nz: "a \<noteq> 0" by simp
ballarin@27611
   236
	from a1 ay
ballarin@27611
   237
	have "- p (inverse a \<cdot> y + x0) - h (inverse a \<cdot> y) \<le> xi" ..
ballarin@27611
   238
	with lz have "a * xi \<le>
wenzelm@13515
   239
          a * (- p (inverse a \<cdot> y + x0) - h (inverse a \<cdot> y))"
ballarin@27611
   240
          by (simp add: mult_left_mono_neg order_less_imp_le)
ballarin@27611
   241
	
ballarin@27611
   242
	also have "\<dots> =
wenzelm@13515
   243
          - a * (p (inverse a \<cdot> y + x0)) - a * (h (inverse a \<cdot> y))"
ballarin@27611
   244
	  by (simp add: right_diff_distrib)
ballarin@27611
   245
	also from lz x0 y' have "- a * (p (inverse a \<cdot> y + x0)) =
wenzelm@13515
   246
          p (a \<cdot> (inverse a \<cdot> y + x0))"
ballarin@27611
   247
          by (simp add: abs_homogenous)
ballarin@27611
   248
	also from nz x0 y' have "\<dots> = p (y + a \<cdot> x0)"
ballarin@27611
   249
          by (simp add: add_mult_distrib1 mult_assoc [symmetric])
ballarin@27611
   250
	also from nz y have "a * (h (inverse a \<cdot> y)) =  h y"
ballarin@27611
   251
          by simp
ballarin@27611
   252
	finally have "a * xi \<le> p (y + a \<cdot> x0) - h y" .
ballarin@27611
   253
	then show ?thesis by simp
ballarin@27611
   254
      next
ballarin@27611
   255
	txt {* In the case @{text "a > 0"}, we use @{text "a\<^sub>2"}
ballarin@27611
   256
          with @{text ya} taken as @{text "y / a"}: *}
wenzelm@27612
   257
	assume gz: "0 < a" then have nz: "a \<noteq> 0" by simp
ballarin@27611
   258
	from a2 ay
ballarin@27611
   259
	have "xi \<le> p (inverse a \<cdot> y + x0) - h (inverse a \<cdot> y)" ..
ballarin@27611
   260
	with gz have "a * xi \<le>
wenzelm@13515
   261
          a * (p (inverse a \<cdot> y + x0) - h (inverse a \<cdot> y))"
ballarin@27611
   262
          by simp
wenzelm@27612
   263
	also have "\<dots> = a * p (inverse a \<cdot> y + x0) - a * h (inverse a \<cdot> y)"
ballarin@27611
   264
	  by (simp add: right_diff_distrib)
ballarin@27611
   265
	also from gz x0 y'
ballarin@27611
   266
	have "a * p (inverse a \<cdot> y + x0) = p (a \<cdot> (inverse a \<cdot> y + x0))"
ballarin@27611
   267
          by (simp add: abs_homogenous)
ballarin@27611
   268
	also from nz x0 y' have "\<dots> = p (y + a \<cdot> x0)"
ballarin@27611
   269
          by (simp add: add_mult_distrib1 mult_assoc [symmetric])
ballarin@27611
   270
	also from nz y have "a * h (inverse a \<cdot> y) = h y"
ballarin@27611
   271
          by simp
ballarin@27611
   272
	finally have "a * xi \<le> p (y + a \<cdot> x0) - h y" .
ballarin@27611
   273
	then show ?thesis by simp
ballarin@27611
   274
      qed
ballarin@27611
   275
      also from x_rep have "\<dots> = p x" by (simp only:)
ballarin@27611
   276
      finally show ?thesis .
wenzelm@10007
   277
    qed
wenzelm@10007
   278
  qed
wenzelm@13515
   279
qed
wenzelm@7917
   280
wenzelm@10007
   281
end