7917
|
1 |
(* Title: HOL/Real/HahnBanach/HahnBanachSupLemmas.thy
|
|
2 |
ID: $Id$
|
|
3 |
Author: Gertrud Bauer, TU Munich
|
|
4 |
*)
|
|
5 |
|
9261
|
6 |
header {* The supremum w.r.t.~the function order *}
|
7917
|
7 |
|
9261
|
8 |
theory HahnBanachSupLemmas = FunctionNorm + ZornLemma:
|
9256
|
9 |
|
7917
|
10 |
text{* This section contains some lemmas that will be used in the
|
7978
|
11 |
proof of the Hahn-Banach Theorem.
|
7917
|
12 |
In this section the following context is presumed.
|
8084
|
13 |
Let $E$ be a real vector space with a seminorm $p$ on $E$.
|
7978
|
14 |
$F$ is a subspace of $E$ and $f$ a linear form on $F$. We
|
|
15 |
consider a chain $c$ of norm-preserving extensions of $f$, such that
|
7927
|
16 |
$\Union c = \idt{graph}\ap H\ap h$.
|
7917
|
17 |
We will show some properties about the limit function $h$,
|
7978
|
18 |
i.e.\ the supremum of the chain $c$.
|
9261
|
19 |
*}
|
7917
|
20 |
|
7978
|
21 |
text{* Let $c$ be a chain of norm-preserving extensions of the
|
7917
|
22 |
function $f$ and let $\idt{graph}\ap H\ap h$ be the supremum of $c$.
|
|
23 |
Every element in $H$ is member of
|
9261
|
24 |
one of the elements of the chain. *}
|
7917
|
25 |
|
|
26 |
lemma some_H'h't:
|
9261
|
27 |
"[| M = norm_pres_extensions E p F f; c \<in> chain M;
|
9374
|
28 |
graph H h = \<Union> c; x \<in> H |]
|
|
29 |
==> \<exists>H' h'. graph H' h' \<in> c \<and> (x, h x) \<in> graph H' h'
|
|
30 |
\<and> is_linearform H' h' \<and> is_subspace H' E
|
|
31 |
\<and> is_subspace F H' \<and> graph F f \<subseteq> graph H' h'
|
|
32 |
\<and> (\<forall>x \<in> H'. h' x \<le> p x)"
|
9261
|
33 |
proof -
|
|
34 |
assume m: "M = norm_pres_extensions E p F f" and "c \<in> chain M"
|
9374
|
35 |
and u: "graph H h = \<Union> c" "x \<in> H"
|
7917
|
36 |
|
9261
|
37 |
have h: "(x, h x) \<in> graph H h" ..
|
9374
|
38 |
with u have "(x, h x) \<in> \<Union> c" by simp
|
|
39 |
hence ex1: "\<exists>g \<in> c. (x, h x) \<in> g"
|
9261
|
40 |
by (simp only: Union_iff)
|
|
41 |
thus ?thesis
|
|
42 |
proof (elim bexE)
|
9374
|
43 |
fix g assume g: "g \<in> c" "(x, h x) \<in> g"
|
|
44 |
have "c \<subseteq> M" by (rule chainD2)
|
|
45 |
hence "g \<in> M" ..
|
9261
|
46 |
hence "g \<in> norm_pres_extensions E p F f" by (simp only: m)
|
9374
|
47 |
hence "\<exists>H' h'. graph H' h' = g
|
|
48 |
\<and> is_linearform H' h'
|
|
49 |
\<and> is_subspace H' E
|
|
50 |
\<and> is_subspace F H'
|
|
51 |
\<and> graph F f \<subseteq> graph H' h'
|
|
52 |
\<and> (\<forall>x \<in> H'. h' x \<le> p x)"
|
9261
|
53 |
by (rule norm_pres_extension_D)
|
|
54 |
thus ?thesis
|
|
55 |
proof (elim exE conjE)
|
|
56 |
fix H' h'
|
7917
|
57 |
assume "graph H' h' = g" "is_linearform H' h'"
|
|
58 |
"is_subspace H' E" "is_subspace F H'"
|
9374
|
59 |
"graph F f \<subseteq> graph H' h'" "\<forall>x \<in> H'. h' x \<le> p x"
|
9261
|
60 |
show ?thesis
|
|
61 |
proof (intro exI conjI)
|
|
62 |
show "graph H' h' \<in> c" by (simp!)
|
|
63 |
show "(x, h x) \<in> graph H' h'" by (simp!)
|
|
64 |
qed
|
|
65 |
qed
|
|
66 |
qed
|
|
67 |
qed
|
7917
|
68 |
|
|
69 |
|
8084
|
70 |
text{* \medskip Let $c$ be a chain of norm-preserving extensions of the
|
7917
|
71 |
function $f$ and let $\idt{graph}\ap H\ap h$ be the supremum of $c$.
|
|
72 |
Every element in the domain $H$ of the supremum function is member of
|
|
73 |
the domain $H'$ of some function $h'$, such that $h$ extends $h'$.
|
9261
|
74 |
*}
|
7917
|
75 |
|
|
76 |
lemma some_H'h':
|
9261
|
77 |
"[| M = norm_pres_extensions E p F f; c \<in> chain M;
|
9374
|
78 |
graph H h = \<Union> c; x \<in> H |]
|
|
79 |
==> \<exists>H' h'. x \<in> H' \<and> graph H' h' \<subseteq> graph H h
|
|
80 |
\<and> is_linearform H' h' \<and> is_subspace H' E \<and> is_subspace F H'
|
|
81 |
\<and> graph F f \<subseteq> graph H' h' \<and> (\<forall>x \<in> H'. h' x \<le> p x)"
|
9261
|
82 |
proof -
|
|
83 |
assume "M = norm_pres_extensions E p F f" and cM: "c \<in> chain M"
|
9374
|
84 |
and u: "graph H h = \<Union> c" "x \<in> H"
|
7917
|
85 |
|
9374
|
86 |
have "\<exists>H' h'. graph H' h' \<in> c \<and> (x, h x) \<in> graph H' h'
|
|
87 |
\<and> is_linearform H' h' \<and> is_subspace H' E
|
|
88 |
\<and> is_subspace F H' \<and> graph F f \<subseteq> graph H' h'
|
|
89 |
\<and> (\<forall>x \<in> H'. h' x \<le> p x)"
|
9261
|
90 |
by (rule some_H'h't)
|
|
91 |
thus ?thesis
|
|
92 |
proof (elim exE conjE)
|
|
93 |
fix H' h' assume "(x, h x) \<in> graph H' h'" "graph H' h' \<in> c"
|
|
94 |
"is_linearform H' h'" "is_subspace H' E" "is_subspace F H'"
|
9374
|
95 |
"graph F f \<subseteq> graph H' h'" "\<forall>x \<in> H'. h' x \<le> p x"
|
9261
|
96 |
show ?thesis
|
|
97 |
proof (intro exI conjI)
|
9374
|
98 |
show "x \<in> H'" by (rule graphD1)
|
|
99 |
from cM u show "graph H' h' \<subseteq> graph H h"
|
9261
|
100 |
by (simp! only: chain_ball_Union_upper)
|
|
101 |
qed
|
|
102 |
qed
|
|
103 |
qed
|
7917
|
104 |
|
|
105 |
|
8084
|
106 |
text{* \medskip Any two elements $x$ and $y$ in the domain $H$ of the
|
7978
|
107 |
supremum function $h$ are both in the domain $H'$ of some function
|
9261
|
108 |
$h'$, such that $h$ extends $h'$. *}
|
7917
|
109 |
|
|
110 |
lemma some_H'h'2:
|
9374
|
111 |
"[| M = norm_pres_extensions E p F f; c \<in> chain M;
|
|
112 |
graph H h = \<Union> c; x \<in> H; y \<in> H |]
|
|
113 |
==> \<exists>H' h'. x \<in> H' \<and> y \<in> H' \<and> graph H' h' \<subseteq> graph H h
|
|
114 |
\<and> is_linearform H' h' \<and> is_subspace H' E \<and> is_subspace F H'
|
|
115 |
\<and> graph F f \<subseteq> graph H' h' \<and> (\<forall>x \<in> H'. h' x \<le> p x)"
|
9261
|
116 |
proof -
|
9374
|
117 |
assume "M = norm_pres_extensions E p F f" "c \<in> chain M"
|
|
118 |
"graph H h = \<Union> c" "x \<in> H" "y \<in> H"
|
7917
|
119 |
|
|
120 |
txt {* $x$ is in the domain $H'$ of some function $h'$,
|
9261
|
121 |
such that $h$ extends $h'$. *}
|
7917
|
122 |
|
9374
|
123 |
have e1: "\<exists>H' h'. graph H' h' \<in> c \<and> (x, h x) \<in> graph H' h'
|
|
124 |
\<and> is_linearform H' h' \<and> is_subspace H' E
|
|
125 |
\<and> is_subspace F H' \<and> graph F f \<subseteq> graph H' h'
|
|
126 |
\<and> (\<forall>x \<in> H'. h' x \<le> p x)"
|
9261
|
127 |
by (rule some_H'h't)
|
7917
|
128 |
|
|
129 |
txt {* $y$ is in the domain $H''$ of some function $h''$,
|
9261
|
130 |
such that $h$ extends $h''$. *}
|
7917
|
131 |
|
9374
|
132 |
have e2: "\<exists>H'' h''. graph H'' h'' \<in> c \<and> (y, h y) \<in> graph H'' h''
|
|
133 |
\<and> is_linearform H'' h'' \<and> is_subspace H'' E
|
|
134 |
\<and> is_subspace F H'' \<and> graph F f \<subseteq> graph H'' h''
|
|
135 |
\<and> (\<forall>x \<in> H''. h'' x \<le> p x)"
|
9261
|
136 |
by (rule some_H'h't)
|
7917
|
137 |
|
9261
|
138 |
from e1 e2 show ?thesis
|
|
139 |
proof (elim exE conjE)
|
9374
|
140 |
fix H' h' assume "(y, h y) \<in> graph H' h'" "graph H' h' \<in> c"
|
7917
|
141 |
"is_linearform H' h'" "is_subspace H' E" "is_subspace F H'"
|
9374
|
142 |
"graph F f \<subseteq> graph H' h'" "\<forall>x \<in> H'. h' x \<le> p x"
|
7917
|
143 |
|
9374
|
144 |
fix H'' h'' assume "(x, h x) \<in> graph H'' h''" "graph H'' h'' \<in> c"
|
7917
|
145 |
"is_linearform H'' h''" "is_subspace H'' E" "is_subspace F H''"
|
9374
|
146 |
"graph F f \<subseteq> graph H'' h''" "\<forall>x \<in> H''. h'' x \<le> p x"
|
7917
|
147 |
|
|
148 |
txt {* Since both $h'$ and $h''$ are elements of the chain,
|
|
149 |
$h''$ is an extension of $h'$ or vice versa. Thus both
|
9261
|
150 |
$x$ and $y$ are contained in the greater one. \label{cases1}*}
|
7917
|
151 |
|
9374
|
152 |
have "graph H'' h'' \<subseteq> graph H' h' | graph H' h' \<subseteq> graph H'' h''"
|
9261
|
153 |
(is "?case1 | ?case2")
|
|
154 |
by (rule chainD)
|
|
155 |
thus ?thesis
|
|
156 |
proof
|
|
157 |
assume ?case1
|
|
158 |
show ?thesis
|
|
159 |
proof (intro exI conjI)
|
|
160 |
have "(x, h x) \<in> graph H'' h''" .
|
9374
|
161 |
also have "... \<subseteq> graph H' h'" .
|
|
162 |
finally have xh:"(x, h x) \<in> graph H' h'" .
|
|
163 |
thus x: "x \<in> H'" ..
|
|
164 |
show y: "y \<in> H'" ..
|
|
165 |
show "graph H' h' \<subseteq> graph H h"
|
9261
|
166 |
by (simp! only: chain_ball_Union_upper)
|
|
167 |
qed
|
|
168 |
next
|
|
169 |
assume ?case2
|
|
170 |
show ?thesis
|
|
171 |
proof (intro exI conjI)
|
9374
|
172 |
show x: "x \<in> H''" ..
|
9261
|
173 |
have "(y, h y) \<in> graph H' h'" by (simp!)
|
9374
|
174 |
also have "... \<subseteq> graph H'' h''" .
|
|
175 |
finally have yh: "(y, h y) \<in> graph H'' h''" .
|
|
176 |
thus y: "y \<in> H''" ..
|
|
177 |
show "graph H'' h'' \<subseteq> graph H h"
|
9261
|
178 |
by (simp! only: chain_ball_Union_upper)
|
|
179 |
qed
|
|
180 |
qed
|
|
181 |
qed
|
|
182 |
qed
|
7917
|
183 |
|
|
184 |
|
|
185 |
|
8084
|
186 |
text{* \medskip The relation induced by the graph of the supremum
|
9374
|
187 |
of a chain $c$ is definite, i.~e.~t is the graph of a function. *}
|
7917
|
188 |
|
|
189 |
lemma sup_definite:
|
9261
|
190 |
"[| M == norm_pres_extensions E p F f; c \<in> chain M;
|
9374
|
191 |
(x, y) \<in> \<Union> c; (x, z) \<in> \<Union> c |] ==> z = y"
|
9261
|
192 |
proof -
|
9374
|
193 |
assume "c \<in> chain M" "M == norm_pres_extensions E p F f"
|
|
194 |
"(x, y) \<in> \<Union> c" "(x, z) \<in> \<Union> c"
|
9261
|
195 |
thus ?thesis
|
|
196 |
proof (elim UnionE chainE2)
|
7917
|
197 |
|
7927
|
198 |
txt{* Since both $(x, y) \in \Union c$ and $(x, z) \in \Union c$
|
|
199 |
they are members of some graphs $G_1$ and $G_2$, resp., such that
|
9261
|
200 |
both $G_1$ and $G_2$ are members of $c$.*}
|
7917
|
201 |
|
9261
|
202 |
fix G1 G2 assume
|
9374
|
203 |
"(x, y) \<in> G1" "G1 \<in> c" "(x, z) \<in> G2" "G2 \<in> c" "c \<subseteq> M"
|
7917
|
204 |
|
9261
|
205 |
have "G1 \<in> M" ..
|
|
206 |
hence e1: "\<exists> H1 h1. graph H1 h1 = G1"
|
|
207 |
by (force! dest: norm_pres_extension_D)
|
|
208 |
have "G2 \<in> M" ..
|
|
209 |
hence e2: "\<exists> H2 h2. graph H2 h2 = G2"
|
|
210 |
by (force! dest: norm_pres_extension_D)
|
|
211 |
from e1 e2 show ?thesis
|
|
212 |
proof (elim exE)
|
|
213 |
fix H1 h1 H2 h2
|
|
214 |
assume "graph H1 h1 = G1" "graph H2 h2 = G2"
|
7917
|
215 |
|
7978
|
216 |
txt{* $G_1$ is contained in $G_2$ or vice versa,
|
9261
|
217 |
since both $G_1$ and $G_2$ are members of $c$. \label{cases2}*}
|
7917
|
218 |
|
9374
|
219 |
have "G1 \<subseteq> G2 | G2 \<subseteq> G1" (is "?case1 | ?case2") ..
|
9261
|
220 |
thus ?thesis
|
|
221 |
proof
|
|
222 |
assume ?case1
|
|
223 |
have "(x, y) \<in> graph H2 h2" by (force!)
|
|
224 |
hence "y = h2 x" ..
|
|
225 |
also have "(x, z) \<in> graph H2 h2" by (simp!)
|
|
226 |
hence "z = h2 x" ..
|
|
227 |
finally show ?thesis .
|
|
228 |
next
|
|
229 |
assume ?case2
|
|
230 |
have "(x, y) \<in> graph H1 h1" by (simp!)
|
|
231 |
hence "y = h1 x" ..
|
|
232 |
also have "(x, z) \<in> graph H1 h1" by (force!)
|
|
233 |
hence "z = h1 x" ..
|
|
234 |
finally show ?thesis .
|
|
235 |
qed
|
|
236 |
qed
|
|
237 |
qed
|
|
238 |
qed
|
7917
|
239 |
|
8084
|
240 |
text{* \medskip The limit function $h$ is linear. Every element $x$ in the
|
7927
|
241 |
domain of $h$ is in the domain of a function $h'$ in the chain of norm
|
|
242 |
preserving extensions. Furthermore, $h$ is an extension of $h'$ so
|
7978
|
243 |
the function values of $x$ are identical for $h'$ and $h$. Finally, the
|
9261
|
244 |
function $h'$ is linear by construction of $M$. *}
|
7917
|
245 |
|
|
246 |
lemma sup_lf:
|
9374
|
247 |
"[| M = norm_pres_extensions E p F f; c \<in> chain M;
|
|
248 |
graph H h = \<Union> c |] ==> is_linearform H h"
|
9261
|
249 |
proof -
|
9374
|
250 |
assume "M = norm_pres_extensions E p F f" "c \<in> chain M"
|
|
251 |
"graph H h = \<Union> c"
|
7917
|
252 |
|
9261
|
253 |
show "is_linearform H h"
|
|
254 |
proof
|
|
255 |
fix x y assume "x \<in> H" "y \<in> H"
|
9374
|
256 |
have "\<exists>H' h'. x \<in> H' \<and> y \<in> H' \<and> graph H' h' \<subseteq> graph H h
|
|
257 |
\<and> is_linearform H' h' \<and> is_subspace H' E
|
|
258 |
\<and> is_subspace F H' \<and> graph F f \<subseteq> graph H' h'
|
|
259 |
\<and> (\<forall>x \<in> H'. h' x \<le> p x)"
|
9261
|
260 |
by (rule some_H'h'2)
|
7917
|
261 |
|
9261
|
262 |
txt {* We have to show that $h$ is additive. *}
|
7917
|
263 |
|
9261
|
264 |
thus "h (x + y) = h x + h y"
|
|
265 |
proof (elim exE conjE)
|
9374
|
266 |
fix H' h' assume "x \<in> H'" "y \<in> H'"
|
|
267 |
and b: "graph H' h' \<subseteq> graph H h"
|
9261
|
268 |
and "is_linearform H' h'" "is_subspace H' E"
|
|
269 |
have "h' (x + y) = h' x + h' y"
|
|
270 |
by (rule linearform_add)
|
|
271 |
also have "h' x = h x" ..
|
|
272 |
also have "h' y = h y" ..
|
|
273 |
also have "x + y \<in> H'" ..
|
|
274 |
with b have "h' (x + y) = h (x + y)" ..
|
|
275 |
finally show ?thesis .
|
|
276 |
qed
|
|
277 |
next
|
|
278 |
fix a x assume "x \<in> H"
|
9374
|
279 |
have "\<exists> H' h'. x \<in> H' \<and> graph H' h' \<subseteq> graph H h
|
|
280 |
\<and> is_linearform H' h' \<and> is_subspace H' E
|
|
281 |
\<and> is_subspace F H' \<and> graph F f \<subseteq> graph H' h'
|
|
282 |
\<and> (\<forall> x \<in> H'. h' x \<le> p x)"
|
9261
|
283 |
by (rule some_H'h')
|
7917
|
284 |
|
9261
|
285 |
txt{* We have to show that $h$ is multiplicative. *}
|
7917
|
286 |
|
9374
|
287 |
thus "h (a \<cdot> x) = a * h x"
|
9261
|
288 |
proof (elim exE conjE)
|
9374
|
289 |
fix H' h' assume "x \<in> H'"
|
|
290 |
and b: "graph H' h' \<subseteq> graph H h"
|
9261
|
291 |
and "is_linearform H' h'" "is_subspace H' E"
|
9374
|
292 |
have "h' (a \<cdot> x) = a * h' x"
|
9261
|
293 |
by (rule linearform_mult)
|
|
294 |
also have "h' x = h x" ..
|
9374
|
295 |
also have "a \<cdot> x \<in> H'" ..
|
|
296 |
with b have "h' (a \<cdot> x) = h (a \<cdot> x)" ..
|
9261
|
297 |
finally show ?thesis .
|
|
298 |
qed
|
|
299 |
qed
|
|
300 |
qed
|
7917
|
301 |
|
8084
|
302 |
text{* \medskip The limit of a non-empty chain of norm
|
7917
|
303 |
preserving extensions of $f$ is an extension of $f$,
|
|
304 |
since every element of the chain is an extension
|
|
305 |
of $f$ and the supremum is an extension
|
9261
|
306 |
for every element of the chain.*}
|
7917
|
307 |
|
|
308 |
lemma sup_ext:
|
9374
|
309 |
"[| graph H h = \<Union> c; M = norm_pres_extensions E p F f;
|
|
310 |
c \<in> chain M; \<exists>x. x \<in> c |] ==> graph F f \<subseteq> graph H h"
|
9261
|
311 |
proof -
|
9374
|
312 |
assume "M = norm_pres_extensions E p F f" "c \<in> chain M"
|
|
313 |
"graph H h = \<Union> c"
|
|
314 |
assume "\<exists>x. x \<in> c"
|
9261
|
315 |
thus ?thesis
|
|
316 |
proof
|
9374
|
317 |
fix x assume "x \<in> c"
|
|
318 |
have "c \<subseteq> M" by (rule chainD2)
|
|
319 |
hence "x \<in> M" ..
|
9261
|
320 |
hence "x \<in> norm_pres_extensions E p F f" by (simp!)
|
7917
|
321 |
|
9374
|
322 |
hence "\<exists>G g. graph G g = x
|
|
323 |
\<and> is_linearform G g
|
|
324 |
\<and> is_subspace G E
|
|
325 |
\<and> is_subspace F G
|
|
326 |
\<and> graph F f \<subseteq> graph G g
|
|
327 |
\<and> (\<forall>x \<in> G. g x \<le> p x)"
|
9261
|
328 |
by (simp! add: norm_pres_extension_D)
|
7917
|
329 |
|
9261
|
330 |
thus ?thesis
|
|
331 |
proof (elim exE conjE)
|
9374
|
332 |
fix G g assume "graph F f \<subseteq> graph G g"
|
9261
|
333 |
also assume "graph G g = x"
|
|
334 |
also have "... \<in> c" .
|
9374
|
335 |
hence "x \<subseteq> \<Union> c" by fast
|
|
336 |
also have [RS sym]: "graph H h = \<Union> c" .
|
9261
|
337 |
finally show ?thesis .
|
|
338 |
qed
|
|
339 |
qed
|
|
340 |
qed
|
7917
|
341 |
|
8084
|
342 |
text{* \medskip The domain $H$ of the limit function is a superspace of $F$,
|
7927
|
343 |
since $F$ is a subset of $H$. The existence of the $\zero$ element in
|
|
344 |
$F$ and the closure properties follow from the fact that $F$ is a
|
9261
|
345 |
vector space. *}
|
7917
|
346 |
|
|
347 |
lemma sup_supF:
|
9374
|
348 |
"[| graph H h = \<Union> c; M = norm_pres_extensions E p F f;
|
|
349 |
c \<in> chain M; \<exists>x. x \<in> c; is_subspace F E; is_vectorspace E |]
|
9261
|
350 |
==> is_subspace F H"
|
|
351 |
proof -
|
9374
|
352 |
assume "M = norm_pres_extensions E p F f" "c \<in> chain M" "\<exists>x. x \<in> c"
|
|
353 |
"graph H h = \<Union> c" "is_subspace F E" "is_vectorspace E"
|
7917
|
354 |
|
9261
|
355 |
show ?thesis
|
|
356 |
proof
|
9374
|
357 |
show "0 \<in> F" ..
|
|
358 |
show "F \<subseteq> H"
|
9261
|
359 |
proof (rule graph_extD2)
|
9374
|
360 |
show "graph F f \<subseteq> graph H h"
|
9261
|
361 |
by (rule sup_ext)
|
|
362 |
qed
|
9374
|
363 |
show "\<forall>x \<in> F. \<forall>y \<in> F. x + y \<in> F"
|
9261
|
364 |
proof (intro ballI)
|
9374
|
365 |
fix x y assume "x \<in> F" "y \<in> F"
|
9261
|
366 |
show "x + y \<in> F" by (simp!)
|
|
367 |
qed
|
9374
|
368 |
show "\<forall>x \<in> F. \<forall>a. a \<cdot> x \<in> F"
|
9261
|
369 |
proof (intro ballI allI)
|
|
370 |
fix x a assume "x\<in>F"
|
9374
|
371 |
show "a \<cdot> x \<in> F" by (simp!)
|
9261
|
372 |
qed
|
|
373 |
qed
|
|
374 |
qed
|
7917
|
375 |
|
8084
|
376 |
text{* \medskip The domain $H$ of the limit function is a subspace
|
9261
|
377 |
of $E$. *}
|
7917
|
378 |
|
|
379 |
lemma sup_subE:
|
9374
|
380 |
"[| graph H h = \<Union> c; M = norm_pres_extensions E p F f;
|
|
381 |
c \<in> chain M; \<exists>x. x \<in> c; is_subspace F E; is_vectorspace E |]
|
9261
|
382 |
==> is_subspace H E"
|
|
383 |
proof -
|
9374
|
384 |
assume "M = norm_pres_extensions E p F f" "c \<in> chain M" "\<exists>x. x \<in> c"
|
|
385 |
"graph H h = \<Union> c" "is_subspace F E" "is_vectorspace E"
|
9261
|
386 |
show ?thesis
|
|
387 |
proof
|
7917
|
388 |
|
7978
|
389 |
txt {* The $\zero$ element is in $H$, as $F$ is a subset
|
9261
|
390 |
of $H$: *}
|
7917
|
391 |
|
9374
|
392 |
have "0 \<in> F" ..
|
9261
|
393 |
also have "is_subspace F H" by (rule sup_supF)
|
9374
|
394 |
hence "F \<subseteq> H" ..
|
|
395 |
finally show "0 \<in> H" .
|
7917
|
396 |
|
9261
|
397 |
txt{* $H$ is a subset of $E$: *}
|
7917
|
398 |
|
9374
|
399 |
show "H \<subseteq> E"
|
9261
|
400 |
proof
|
9374
|
401 |
fix x assume "x \<in> H"
|
|
402 |
have "\<exists>H' h'. x \<in> H' \<and> graph H' h' \<subseteq> graph H h
|
|
403 |
\<and> is_linearform H' h' \<and> is_subspace H' E
|
|
404 |
\<and> is_subspace F H' \<and> graph F f \<subseteq> graph H' h'
|
|
405 |
\<and> (\<forall>x \<in> H'. h' x \<le> p x)"
|
9261
|
406 |
by (rule some_H'h')
|
9374
|
407 |
thus "x \<in> E"
|
9261
|
408 |
proof (elim exE conjE)
|
9374
|
409 |
fix H' h' assume "x \<in> H'" "is_subspace H' E"
|
|
410 |
have "H' \<subseteq> E" ..
|
|
411 |
thus "x \<in> E" ..
|
9261
|
412 |
qed
|
|
413 |
qed
|
7917
|
414 |
|
9261
|
415 |
txt{* $H$ is closed under addition: *}
|
7917
|
416 |
|
9374
|
417 |
show "\<forall>x \<in> H. \<forall>y \<in> H. x + y \<in> H"
|
9261
|
418 |
proof (intro ballI)
|
9374
|
419 |
fix x y assume "x \<in> H" "y \<in> H"
|
|
420 |
have "\<exists>H' h'. x \<in> H' \<and> y \<in> H' \<and> graph H' h' \<subseteq> graph H h
|
|
421 |
\<and> is_linearform H' h' \<and> is_subspace H' E
|
|
422 |
\<and> is_subspace F H' \<and> graph F f \<subseteq> graph H' h'
|
|
423 |
\<and> (\<forall>x \<in> H'. h' x \<le> p x)"
|
9261
|
424 |
by (rule some_H'h'2)
|
|
425 |
thus "x + y \<in> H"
|
|
426 |
proof (elim exE conjE)
|
|
427 |
fix H' h'
|
9374
|
428 |
assume "x \<in> H'" "y \<in> H'" "is_subspace H' E"
|
|
429 |
"graph H' h' \<subseteq> graph H h"
|
9261
|
430 |
have "x + y \<in> H'" ..
|
9374
|
431 |
also have "H' \<subseteq> H" ..
|
9261
|
432 |
finally show ?thesis .
|
|
433 |
qed
|
|
434 |
qed
|
7917
|
435 |
|
9261
|
436 |
txt{* $H$ is closed under scalar multiplication: *}
|
7917
|
437 |
|
9374
|
438 |
show "\<forall>x \<in> H. \<forall>a. a \<cdot> x \<in> H"
|
9261
|
439 |
proof (intro ballI allI)
|
9374
|
440 |
fix x a assume "x \<in> H"
|
|
441 |
have "\<exists>H' h'. x \<in> H' \<and> graph H' h' \<subseteq> graph H h
|
|
442 |
\<and> is_linearform H' h' \<and> is_subspace H' E
|
|
443 |
\<and> is_subspace F H' \<and> graph F f \<subseteq> graph H' h'
|
|
444 |
\<and> (\<forall>x \<in> H'. h' x \<le> p x)"
|
9261
|
445 |
by (rule some_H'h')
|
9374
|
446 |
thus "a \<cdot> x \<in> H"
|
9261
|
447 |
proof (elim exE conjE)
|
|
448 |
fix H' h'
|
9374
|
449 |
assume "x \<in> H'" "is_subspace H' E" "graph H' h' \<subseteq> graph H h"
|
|
450 |
have "a \<cdot> x \<in> H'" ..
|
|
451 |
also have "H' \<subseteq> H" ..
|
9261
|
452 |
finally show ?thesis .
|
|
453 |
qed
|
|
454 |
qed
|
|
455 |
qed
|
|
456 |
qed
|
7917
|
457 |
|
8084
|
458 |
text {* \medskip The limit function is bounded by
|
7978
|
459 |
the norm $p$ as well, since all elements in the chain are
|
|
460 |
bounded by $p$.
|
9261
|
461 |
*}
|
7917
|
462 |
|
9374
|
463 |
lemma sup_norm_pres:
|
|
464 |
"[| graph H h = \<Union> c; M = norm_pres_extensions E p F f; c \<in> chain M |]
|
|
465 |
==> \<forall> x \<in> H. h x \<le> p x"
|
9261
|
466 |
proof
|
9374
|
467 |
assume "M = norm_pres_extensions E p F f" "c \<in> chain M"
|
|
468 |
"graph H h = \<Union> c"
|
|
469 |
fix x assume "x \<in> H"
|
|
470 |
have "\<exists>H' h'. x \<in> H' \<and> graph H' h' \<subseteq> graph H h
|
|
471 |
\<and> is_linearform H' h' \<and> is_subspace H' E \<and> is_subspace F H'
|
|
472 |
\<and> graph F f \<subseteq> graph H' h' \<and> (\<forall> x \<in> H'. h' x \<le> p x)"
|
9261
|
473 |
by (rule some_H'h')
|
9374
|
474 |
thus "h x \<le> p x"
|
9261
|
475 |
proof (elim exE conjE)
|
|
476 |
fix H' h'
|
9374
|
477 |
assume "x \<in> H'" "graph H' h' \<subseteq> graph H h"
|
|
478 |
and a: "\<forall>x \<in> H'. h' x \<le> p x"
|
9261
|
479 |
have [RS sym]: "h' x = h x" ..
|
9374
|
480 |
also from a have "h' x \<le> p x " ..
|
9261
|
481 |
finally show ?thesis .
|
|
482 |
qed
|
|
483 |
qed
|
7917
|
484 |
|
|
485 |
|
8084
|
486 |
text{* \medskip The following lemma is a property of linear forms on
|
7917
|
487 |
real vector spaces. It will be used for the lemma
|
8838
|
488 |
$\idt{abs{\dsh}HahnBanach}$ (see page \pageref{abs-HahnBanach}). \label{abs-ineq-iff}
|
7917
|
489 |
For real vector spaces the following inequations are equivalent:
|
|
490 |
\begin{matharray}{ll}
|
|
491 |
\forall x\in H.\ap |h\ap x|\leq p\ap x& {\rm and}\\
|
|
492 |
\forall x\in H.\ap h\ap x\leq p\ap x\\
|
|
493 |
\end{matharray}
|
9261
|
494 |
*}
|
7917
|
495 |
|
8838
|
496 |
lemma abs_ineq_iff:
|
7978
|
497 |
"[| is_subspace H E; is_vectorspace E; is_seminorm E p;
|
7917
|
498 |
is_linearform H h |]
|
9374
|
499 |
==> (\<forall>x \<in> H. |h x| \<le> p x) = (\<forall>x \<in> H. h x \<le> p x)"
|
9261
|
500 |
(concl is "?L = ?R")
|
|
501 |
proof -
|
7978
|
502 |
assume "is_subspace H E" "is_vectorspace E" "is_seminorm E p"
|
9261
|
503 |
"is_linearform H h"
|
|
504 |
have h: "is_vectorspace H" ..
|
|
505 |
show ?thesis
|
|
506 |
proof
|
|
507 |
assume l: ?L
|
|
508 |
show ?R
|
|
509 |
proof
|
9374
|
510 |
fix x assume x: "x \<in> H"
|
|
511 |
have "h x \<le> |h x|" by (rule abs_ge_self)
|
|
512 |
also from l have "... \<le> p x" ..
|
|
513 |
finally show "h x \<le> p x" .
|
9261
|
514 |
qed
|
|
515 |
next
|
|
516 |
assume r: ?R
|
|
517 |
show ?L
|
|
518 |
proof
|
9374
|
519 |
fix x assume "x \<in> H"
|
|
520 |
show "!! a b :: real. [| - a \<le> b; b \<le> a |] ==> |b| \<le> a"
|
9261
|
521 |
by arith
|
9374
|
522 |
show "- p x \<le> h x"
|
9261
|
523 |
proof (rule real_minus_le)
|
|
524 |
from h have "- h x = h (- x)"
|
|
525 |
by (rule linearform_neg [RS sym])
|
9374
|
526 |
also from r have "... \<le> p (- x)" by (simp!)
|
9261
|
527 |
also have "... = p x"
|
|
528 |
by (rule seminorm_minus [OF _ subspace_subsetD])
|
9374
|
529 |
finally show "- h x \<le> p x" .
|
9261
|
530 |
qed
|
9374
|
531 |
from r show "h x \<le> p x" ..
|
9261
|
532 |
qed
|
|
533 |
qed
|
|
534 |
qed
|
7917
|
535 |
|
|
536 |
|
9261
|
537 |
end |