forked from LAC1213/compact_unit_ball
-
Notifications
You must be signed in to change notification settings - Fork 0
/
compact_unit_ball.lean
406 lines (356 loc) · 10.5 KB
/
compact_unit_ball.lean
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
-- don't need to import things which other files import
import topology.sequences
import analysis.normed_space.finite_dimension
-- type class inference in Lean 3 has been pushed too far by mathematicians.
-- Lean 4 should fix these issues.
local attribute [instance, priority 10000] mul_action.to_has_scalar distrib_mul_action.to_mul_action
semimodule.to_distrib_mul_action module.to_semimodule vector_space.to_module normed_space.to_vector_space
ring.to_monoid normed_ring.to_ring normed_field.to_normed_ring add_group.to_add_monoid
add_comm_group.to_add_group normed_group.to_add_comm_group ring.to_semiring add_comm_group.to_add_comm_monoid
normed_field.to_discrete_field
-- see above.
set_option class.instance_max_depth 100
noncomputable theory
open_locale classical
open metric set
variables
{V : Type} [normed_group V] [normed_space ℝ V]
lemma two_positive : (2 : ℝ) > 0 :=
begin
linarith,
end
lemma half_positive : (1/2 : ℝ) > 0 :=
begin
simp,
linarith,
end
lemma ball_span_ash {A : set V} :
(∀ v : V, norm v ≤ 1 → v ∈ submodule.span ℝ A)
→ ∀ v : V, v ∈ submodule.span ℝ A :=
begin
intro hyp,
intro v,
cases (classical.em (v = 0)) with v0 vn0,
rw submodule.mem_span,
intros p hp,
rw v0,
exact submodule.zero_mem p,
let w : V := (1/norm v) • v,
have hwdef : w = (1/norm v) • v,
refl,
have hw2 : norm v ≠ 0,
intro hv,
rw norm_eq_zero at hv,
exact vn0 hv,
have hw : norm w ≤ 1,
have hw1 : norm w = 1,
rw hwdef,
rw norm_smul,
rw real.norm_eq_abs,
rw abs_of_nonneg,
rw mul_comm,
rw mul_one_div_cancel,
have h2 := hyp w,
exact hw2,
simp,
rw le_iff_eq_or_lt,
left,
exact hw1,
have h3 : (1/norm v : ℝ) ≠ 0,
rw div_eq_inv_mul,
rw mul_one,
exact inv_ne_zero hw2,
rw <- submodule.smul_mem_iff (submodule.span ℝ A) h3,
rw <- hwdef,
exact hyp w hw,
end
lemma ball_span {A : set V} : (∀ v : V, v ∈ (closed_ball 0 1 : set V) → v ∈ submodule.span ℝ A)
→ ∀ v : V, v ∈ submodule.span ℝ A :=
begin
intro H,
have hyp : ∀ v : V, norm v ≤ 1 → v ∈ submodule.span ℝ A,
intros v hv,
rw <- dist_zero_right at hv,
exact H v hv,
exact ball_span_ash hyp,
end
theorem finite_dimensional_span_of_finite {V : Type} {A : set V} [normed_group V] [normed_space ℝ V] (hA : finite A) :
finite_dimensional ℝ ↥(submodule.span ℝ A) :=
begin
apply is_noetherian_of_fg_of_noetherian,
exact submodule.fg_def.2 ⟨A, hA, rfl⟩,
end
lemma finite_span_seq_closed (A : set V) : finite A → is_seq_closed (↑(submodule.span ℝ A) : set V) :=
begin
intro h_fin,
apply is_seq_closed_of_is_closed,
haveI : finite_dimensional ℝ (submodule.span ℝ A) := finite_dimensional_span_of_finite h_fin,
exact submodule.closed_of_finite_dimensional _,
end
--turns cover into a choice function
lemma cover_to_func (A X : set V) (hX : X ⊆ (⋃a ∈ A, ball a (0.5 : real)))
(a : V) (ha : a ∈ A) :
∃(f : V → V), ∀x, f x ∈ A ∧ (x ∈ X → x ∈ ball (f x) (0.5 : real)) :=
begin
classical,
have : ∀(x : V), ∃a, a ∈ A ∧ (x ∈ X → x ∈ ball a (0.5 : real)) :=
begin
assume x,
by_cases h : x ∈ X,
{ simpa [h] using hX h },
{ exact ⟨a, ha, by simp [h]⟩ }
end,
choose f hf using this,
exact ⟨f, λx, hf x⟩
end
lemma compact_choice_func (hc : compact (closed_ball 0 1 : set V)) :
∃ A : set V, A ⊆ (closed_ball 0 1 : set V) ∧ finite A ∧
∃ f : V → V, ∀ x : V, f x ∈ A ∧ (x ∈ (closed_ball 0 1 : set V)
→ x ∈ ball (f x) (0.5 : real)) :=
begin
let B : set V := closed_ball 0 1,
have cover : B ⊆ ⋃ a ∈ B, ball a (0.5 : real),
{
intros x hx,
simp,
use x,
rw dist_self,
simp,
split,
simp at hx,
exact hx,
linarith,
},
obtain ⟨A, A_sub, A_fin, HcoverA⟩ :
∃ A ⊆ B, finite A ∧ B ⊆ ⋃ a ∈ A, ball a (0.5 : real) :=
compact_elim_finite_subcover_image hc (by simp[is_open_ball]) cover,
-- need that A is non-empty to construct a choice function!
have x_in : (0 : V) ∈ B,
simp,
linarith,
obtain ⟨a, a_in, ha⟩ : ∃ a ∈ A, dist (0 : V) a < (0.5 : real),
by simpa using HcoverA x_in,
have hfunc := cover_to_func A B HcoverA a a_in,
existsi A,
split,
exact A_sub,
split,
exact A_fin,
exact hfunc,
end
def aux_seq (v : V) (f : V → V) : ℕ → V
| 0 := v
| (n + 1) := (2 : ℝ) • (aux_seq n - f (aux_seq n))
def partial_sum (f : ℕ → V) : ℕ → V
| 0 := f 0
| (n + 1) := f (n + 1) + partial_sum n
def approx_seq (v : V) (f : V → V) : ℕ → V :=
partial_sum (λ n : ℕ, (1/2 : ℝ)^n • f(aux_seq v f n))
lemma bound_power_two_convergence (w : ℕ → V) {v : V}
(h : ∀ n : ℕ, norm (v - w n) ≤ (0.5 : ℝ)^(n + 1)) :
filter.tendsto w filter.at_top (nhds v) :=
begin
have H : ∀ n : ℕ, norm (w n - v) ≤ (0.5 : ℝ)^n,
intro n,
rw <- dist_eq_norm,
rw dist_comm,
rw dist_eq_norm,
apply le_trans,
exact h n,
rw pow_succ,
have h1 : (0.5 : ℝ) * (0.5 : ℝ)^n ≤ 1 * (0.5 : ℝ)^n,
rw mul_le_mul_right,
linarith,
apply pow_pos,
exact half_positive,
rw one_mul at h1,
exact h1,
rw tendsto_iff_norm_tendsto_zero,
apply squeeze_zero,
intro t,
exact norm_nonneg (w t - v),
exact H,
apply tendsto_pow_at_top_nhds_0_of_lt_1,
rw le_iff_eq_or_lt,
right,
exact half_positive,
linarith,
end
lemma approx_in_span (A : set V) (v : V) (f : V → V)
(hf : ∀ x : V, f x ∈ A):
∀ n : ℕ, approx_seq v f n ∈ submodule.span ℝ A :=
begin
let w := approx_seq v f,
have hw : w = approx_seq v f,
refl,
intro n,
rw submodule.mem_span,
intros p hp,
induction n with n hn,
{
have h1 : w 0 = (1/2 : ℝ)^0 • f(v), refl,
simp at h1,
rw <- hw,
rw h1,
have h2 : f v ∈ A := hf v,
exact hp h2,
},{
have h1 : w (n+1) = (1/2 : ℝ)^(n+1) • f(aux_seq v f (n+1)) + w(n),
refl,
rw <- hw,
rw h1,
have h2 := hp (hf (aux_seq v f (n+1))),
have h3 := submodule.smul_mem p ((1/2 : ℝ)^(n+1)) h2,
apply submodule.add_mem p,
exact h3,
exact hn,
},
end
lemma limit_in_span {S : set V} (hseq : is_seq_closed S)
{w : ℕ → V} (hw : ∀ n : ℕ, w n ∈ S)
{v : V} (hlim : filter.tendsto w filter.at_top (nhds v : filter V)) :
v ∈ S :=
begin
exact mem_of_is_seq_closed hseq hw hlim,
end
set_option profiler true
theorem compact_unit_ball_implies_finite_dim :
compact (closed_ball 0 1 : set V) → vector_space.dim ℝ V < cardinal.omega :=
begin
intro Hcomp,
obtain ⟨A, A_sub, A_fin, Hexistsf⟩ := compact_choice_func Hcomp,
obtain ⟨f, hf⟩ := Hexistsf,
let B : set V := closed_ball 0 1,
-- suffices to show B is spanned by A
rw <- finite_dimensional.finite_dimensional_iff_dim_lt_omega,
apply finite_dimensional.of_fg,
rw submodule.fg_def,
existsi A,
split,
exact A_fin,
rw submodule.eq_top_iff',
apply ball_span,
intros v hv,
let u : ℕ → V := aux_seq v f,
let w : ℕ → V := partial_sum (λ x : ℕ, (0.5 : ℝ)^x • f(u(x))),
-- want to show that w n in span A and w n -> v as n -> infty
have hw : ∀ n, w n ∈ submodule.span ℝ A,
{
have hf' : ∀ x : V, f x ∈ A,
intro x,
exact (hf x).1,
exact approx_in_span A v f hf',
},
-- this is just some algebraic manipulation
have hdist : ∀ n : ℕ, v - w n = (0.5 : real)^(n+1) • u (n+1),
{
intro n,
induction n with n hn,
{
have h1 : w 0 = (0.5 : real)^0 • f(v), refl,
rw zero_add,
rw pow_one,
rw pow_zero at h1,
rw one_smul at h1,
rw h1,
have h2 : u 1 = (2: ℝ) • (v - f(v)), refl,
rw h2,
rw smul_smul,
rw one_div_mul_cancel,
rw one_smul,
exact two_ne_zero',
}, {
have h1 : w (n+1) = (0.5 : real)^(n+1) • f(u (n+1)) + w(n), refl,
have h2 : u (n+2) = (2 : ℝ) • (u (n+1) - f (u (n+1))), refl,
rw h2,
rw pow_succ,
rw smul_smul,
rw mul_comm,
rw <- mul_assoc,
rw mul_one_div_cancel,
rw one_mul,
rw smul_sub,
rw <- hn,
rw h1,
rw add_comm _ (w n),
rw sub_sub v (w n) _,
exact two_ne_zero',
},
},
-- main bound for convergence using the expression hdist
have hbound : ∀ n : ℕ, norm (v - w n) ≤ (0.5 : ℝ)^(n+1),
{
intro n,
rw hdist n,
rw norm_smul,
rw real.norm_eq_abs,
rw abs_of_nonneg,
have hu : u(n+1) = (2 : ℝ) • (u(n) - f(u(n))), refl,
rw hu,
have husmall : norm (u n) ≤ 1,
{
induction n with n hn,
have h0 : u 0 = v, refl,
rw h0,
rw <- dist_zero_right,
exact hv,
have hu' : u(n + 1) = (2 : ℝ) • (u(n) - f(u(n))), refl,
rw hu',
have h2 := (hf (u n)).2,
rw norm_smul,
rw real.norm_eq_abs,
rw <- dist_eq_norm,
rw abs_of_nonneg,
have h3 := hn hu',
rw <- dist_zero_right at h3,
have h4 : dist (u n) (f (u n)) < 1/2,
exact h2 h3,
rw le_iff_eq_or_lt,
right,
rw <- mul_lt_mul_left two_positive at h4,
rw mul_one_div_cancel at h4,
exact h4,
exact two_ne_zero',
linarith,
},
have h2 : 0 < (1/2 : ℝ) := half_positive,
have h1 : 0 < (1/2 : ℝ)^(n+1),
exact pow_pos h2 (n+1),
have h3 : (1/2 : ℝ)^(n+1) * norm ((2:ℝ) • (u n - f(u n))) ≤ (1/2 : ℝ)^(n+1) * 1 →
(1/2 : ℝ)^(n+1) * norm ((2:ℝ) • (u n - f(u n))) ≤ (1/2 : ℝ)^(n+1),
intro h,
rw mul_one at h,
exact h,
apply h3,
rw mul_le_mul_left h1,
rw norm_smul,
rw <- dist_zero_right at husmall,
have h4 := (hf (u n)).2 husmall,
rw <- dist_eq_norm,
rw real.norm_eq_abs,
rw abs_of_nonneg,
rw <- mul_le_mul_left h2,
rw <- mul_assoc,
rw mul_one,
rw one_div_mul_cancel,
rw one_mul,
rw le_iff_eq_or_lt,
right,
exact h4,
exact two_ne_zero',
linarith,
rw ge_iff_le,
rw le_iff_eq_or_lt,
right,
exact pow_pos half_positive (n+1),
},
have hlim : filter.tendsto w filter.at_top (nhds v : filter V)
:= bound_power_two_convergence w hbound,
let S : set V := ↑(submodule.span ℝ A),
have hspan_closed : is_seq_closed S := finite_span_seq_closed A A_fin,
have hw' : ∀ n, w n ∈ S,
exact hw,
have hinS: v ∈ S,
exact limit_in_span hspan_closed hw' hlim,
exact hinS,
end