| 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 2729 | . 2 ⊢ (TopOpen‘𝑈) = (TopOpen‘𝑈) | |
| 9 | oveq2 7361 | . . . . 5 ⊢ (𝑗 = 𝑦 → (𝐴 − 𝑗) = (𝐴 − 𝑦)) | |
| 10 | 9 | fveq2d 6830 | . . . 4 ⊢ (𝑗 = 𝑦 → (𝑁‘(𝐴 − 𝑗)) = (𝑁‘(𝐴 − 𝑦))) |
| 11 | 10 | cbvmptv 5199 | . . 3 ⊢ (𝑗 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑗))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) |
| 12 | 11 | rneqi 5883 | . 2 ⊢ ran (𝑗 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑗))) = ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) |
| 13 | eqid 2729 | . 2 ⊢ inf(ran (𝑗 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑗))), ℝ, < ) = inf(ran (𝑗 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑗))), ℝ, < ) | |
| 14 | eqid 2729 | . 2 ⊢ ((dist‘𝑈) ↾ (𝑋 × 𝑋)) = ((dist‘𝑈) ↾ (𝑋 × 𝑋)) | |
| 15 | 1, 2, 3, 4, 5, 6, 7, 8, 12, 13, 14 | minveclem7 25351 | 1 ⊢ (𝜑 → ∃!𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 ∀wral 3044 ∃!wreu 3343 class class class wbr 5095 ↦ cmpt 5176 × cxp 5621 ran crn 5624 ↾ cres 5625 ‘cfv 6486 (class class class)co 7353 infcinf 9350 ℝcr 11027 < clt 11168 ≤ cle 11169 Basecbs 17138 ↾s cress 17159 distcds 17188 TopOpenctopn 17343 -gcsg 18832 LSubSpclss 20852 normcnm 24480 ℂPreHilccph 25082 CMetSpccms 25248 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106 ax-addf 11107 ax-mulf 11108 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3345 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-tp 4584 df-op 4586 df-uni 4862 df-int 4900 df-iun 4946 df-iin 4947 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7807 df-1st 7931 df-2nd 7932 df-tpos 8166 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8632 df-map 8762 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-fi 9320 df-sup 9351 df-inf 9352 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-div 11796 df-nn 12147 df-2 12209 df-3 12210 df-4 12211 df-5 12212 df-6 12213 df-7 12214 df-8 12215 df-9 12216 df-n0 12403 df-z 12490 df-dec 12610 df-uz 12754 df-q 12868 df-rp 12912 df-xneg 13032 df-xadd 13033 df-xmul 13034 df-ico 13272 df-icc 13273 df-fz 13429 df-seq 13927 df-exp 13987 df-cj 15024 df-re 15025 df-im 15026 df-sqrt 15160 df-abs 15161 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17139 df-ress 17160 df-plusg 17192 df-mulr 17193 df-starv 17194 df-sca 17195 df-vsca 17196 df-ip 17197 df-tset 17198 df-ple 17199 df-ds 17201 df-unif 17202 df-rest 17344 df-0g 17363 df-topgen 17365 df-mgm 18532 df-sgrp 18611 df-mnd 18627 df-mhm 18675 df-grp 18833 df-minusg 18834 df-sbg 18835 df-mulg 18965 df-subg 19020 df-ghm 19110 df-cmn 19679 df-abl 19680 df-mgp 20044 df-rng 20056 df-ur 20085 df-ring 20138 df-cring 20139 df-oppr 20240 df-dvdsr 20260 df-unit 20261 df-invr 20291 df-dvr 20304 df-rhm 20375 df-subrg 20473 df-drng 20634 df-staf 20742 df-srng 20743 df-lmod 20783 df-lss 20853 df-lmhm 20944 df-lvec 21025 df-sra 21095 df-rgmod 21096 df-psmet 21271 df-xmet 21272 df-met 21273 df-bl 21274 df-mopn 21275 df-fbas 21276 df-fg 21277 df-cnfld 21280 df-phl 21551 df-top 22797 df-topon 22814 df-topsp 22836 df-bases 22849 df-cld 22922 df-ntr 22923 df-cls 22924 df-nei 23001 df-haus 23218 df-fil 23749 df-flim 23842 df-xms 24224 df-ms 24225 df-nm 24486 df-ngp 24487 df-nlm 24490 df-clm 24979 df-cph 25084 df-cfil 25171 df-cmet 25173 df-cms 25251 |
| This theorem is referenced by: pjthlem2 25354 |
| Copyright terms: Public domain | W3C validator |