| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > minvec | Structured version Visualization version GIF version | ||
| Description: Minimizing vector theorem, or the Hilbert projection theorem. There is exactly one vector in a complete subspace 𝑊 that minimizes the distance to an arbitrary vector 𝐴 in a parent inner product space. Theorem 3.3-1 of [Kreyszig] p. 144, specialized to subspaces instead of convex subsets. (Contributed by NM, 11-Apr-2008.) (Proof shortened by Mario Carneiro, 9-May-2014.) (Revised by Mario Carneiro, 15-Oct-2015.) (Proof shortened by AV, 3-Oct-2020.) |
| Ref | Expression |
|---|---|
| minvec.x | ⊢ 𝑋 = (Base‘𝑈) |
| minvec.m | ⊢ − = (-g‘𝑈) |
| minvec.n | ⊢ 𝑁 = (norm‘𝑈) |
| minvec.u | ⊢ (𝜑 → 𝑈 ∈ ℂPreHil) |
| minvec.y | ⊢ (𝜑 → 𝑌 ∈ (LSubSp‘𝑈)) |
| minvec.w | ⊢ (𝜑 → (𝑈 ↾s 𝑌) ∈ CMetSp) |
| minvec.a | ⊢ (𝜑 → 𝐴 ∈ 𝑋) |
| Ref | Expression |
|---|---|
| minvec | ⊢ (𝜑 → ∃!𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | minvec.x | . 2 ⊢ 𝑋 = (Base‘𝑈) | |
| 2 | minvec.m | . 2 ⊢ − = (-g‘𝑈) | |
| 3 | minvec.n | . 2 ⊢ 𝑁 = (norm‘𝑈) | |
| 4 | minvec.u | . 2 ⊢ (𝜑 → 𝑈 ∈ ℂPreHil) | |
| 5 | minvec.y | . 2 ⊢ (𝜑 → 𝑌 ∈ (LSubSp‘𝑈)) | |
| 6 | minvec.w | . 2 ⊢ (𝜑 → (𝑈 ↾s 𝑌) ∈ CMetSp) | |
| 7 | minvec.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 8 | eqid 2760 | . 2 ⊢ (TopOpen‘𝑈) = (TopOpen‘𝑈) | |
| 9 | oveq2 7422 | . . . . 5 ⊢ (𝑗 = 𝑦 → (𝐴 − 𝑗) = (𝐴 − 𝑦)) | |
| 10 | 9 | fveq2d 6883 | . . . 4 ⊢ (𝑗 = 𝑦 → (𝑁‘(𝐴 − 𝑗)) = (𝑁‘(𝐴 − 𝑦))) |
| 11 | 10 | cbvmptv 5209 | . . 3 ⊢ (𝑗 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑗))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) |
| 12 | 11 | rneqi 5921 | . 2 ⊢ ran (𝑗 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑗))) = ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) |
| 13 | eqid 2760 | . 2 ⊢ inf(ran (𝑗 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑗))), ℝ, < ) = inf(ran (𝑗 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑗))), ℝ, < ) | |
| 14 | eqid 2760 | . 2 ⊢ ((dist‘𝑈) ↾ (𝑋 × 𝑋)) = ((dist‘𝑈) ↾ (𝑋 × 𝑋)) | |
| 15 | 1, 2, 3, 4, 5, 6, 7, 8, 12, 13, 14 | minveclem7 25664 | 1 ⊢ (𝜑 → ∃!𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ∃!wreu 3363 class class class wbr 5103 ↦ cmpt 5186 × cxp 5653 ran crn 5656 ↾ cres 5657 ‘cfv 6533 (class class class)co 7414 infcinf 9412 ℝcr 11124 < clt 11268 ≤ cle 11269 Basecbs 17302 ↾s cress 17323 distcds 17352 TopOpenctopn 17507 -gcsg 19060 LSubSpclss 21116 normcnm 24803 ℂPreHilccph 25395 CMetSpccms 25561 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 ax-pre-sup 11203 ax-addf 11204 ax-mulf 11205 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-tpos 8225 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8456 df-er 8697 df-map 8829 df-en 8954 df-dom 8955 df-sdom 8956 df-fin 8957 df-fi 9382 df-sup 9413 df-inf 9414 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-div 11897 df-nn 12259 df-2 12328 df-3 12329 df-4 12330 df-5 12331 df-6 12332 df-7 12333 df-8 12334 df-9 12335 df-n0 12530 df-z 12617 df-dec 12738 df-uz 12889 df-q 12999 df-rp 13044 df-xneg 13164 df-xadd 13165 df-xmul 13166 df-ico 13405 df-icc 13406 df-fz 13563 df-seq 14067 df-exp 14127 df-cj 15187 df-re 15188 df-im 15189 df-sqrt 15323 df-abs 15324 df-struct 17240 df-sets 17257 df-slot 17275 df-ndx 17287 df-base 17303 df-ress 17324 df-plusg 17356 df-mulr 17357 df-starv 17358 df-sca 17359 df-vsca 17360 df-ip 17361 df-tset 17362 df-ple 17363 df-ds 17365 df-unif 17366 df-rest 17508 df-0g 17527 df-topgen 17529 df-mgm 18731 df-sgrp 18822 df-mnd 18838 df-mhm 18892 df-grp 19061 df-minusg 19062 df-sbg 19063 df-mulg 19192 df-subg 19247 df-ghm 19342 df-cmn 19910 df-abl 19911 df-mgp 20275 df-rng 20289 df-ur 20322 df-ring 20375 df-cring 20376 df-oppr 20479 df-dvdsr 20499 df-unit 20500 df-invr 20530 df-dvr 20543 df-rhm 20614 df-subrg 20733 df-drng 20893 df-staf 21006 df-srng 21007 df-lmod 21047 df-lss 21117 df-lmhm 21207 df-lvec 21288 df-sra 21358 df-rgmod 21359 df-psmet 21578 df-xmet 21579 df-met 21580 df-bl 21581 df-mopn 21582 df-fbas 21583 df-fg 21584 df-cnfld 21587 df-phl 21840 df-top 23120 df-topon 23137 df-topsp 23159 df-bases 23172 df-cld 23245 df-ntr 23246 df-cls 23247 df-nei 23324 df-haus 23541 df-fil 24073 df-flim 24166 df-xms 24547 df-ms 24548 df-nm 24809 df-ngp 24810 df-nlm 24813 df-clm 25292 df-cph 25397 df-cfil 25484 df-cmet 25486 df-cms 25564 |
| This theorem is used by: pjthlem2 25667 |
| Copyright terms: Public domain | W3C validator |