| 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 2765 | . 2 ⊢ (TopOpen‘𝑈) = (TopOpen‘𝑈) | |
| 9 | oveq2 7408 | . . . . 5 ⊢ (𝑗 = 𝑦 → (𝐴 − 𝑗) = (𝐴 − 𝑦)) | |
| 10 | 9 | fveq2d 6875 | . . . 4 ⊢ (𝑗 = 𝑦 → (𝑁‘(𝐴 − 𝑗)) = (𝑁‘(𝐴 − 𝑦))) |
| 11 | 10 | cbvmptv 5209 | . . 3 ⊢ (𝑗 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑗))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) |
| 12 | 11 | rneqi 5918 | . 2 ⊢ ran (𝑗 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑗))) = ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) |
| 13 | eqid 2765 | . 2 ⊢ inf(ran (𝑗 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑗))), ℝ, < ) = inf(ran (𝑗 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑗))), ℝ, < ) | |
| 14 | eqid 2765 | . 2 ⊢ ((dist‘𝑈) ↾ (𝑋 × 𝑋)) = ((dist‘𝑈) ↾ (𝑋 × 𝑋)) | |
| 15 | 1, 2, 3, 4, 5, 6, 7, 8, 12, 13, 14 | minveclem7 25555 | 1 ⊢ (𝜑 → ∃!𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1563 ∈ wcel 2145 ∀wral 3079 ∃!wreu 3368 class class class wbr 5105 ↦ cmpt 5186 × cxp 5650 ran crn 5653 ↾ cres 5654 ‘cfv 6525 (class class class)co 7400 infcinf 9389 ℝcr 11087 < clt 11231 ≤ cle 11232 Basecbs 17259 ↾s cress 17280 distcds 17309 TopOpenctopn 17464 -gcsg 18992 LSubSpclss 21021 normcnm 24694 ℂPreHilccph 25286 CMetSpccms 25452 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 ax-addf 11167 ax-mulf 11168 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-iin 4955 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-tpos 8210 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-map 8814 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-fi 9359 df-sup 9390 df-inf 9391 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12225 df-2 12294 df-3 12295 df-4 12296 df-5 12297 df-6 12298 df-7 12299 df-8 12300 df-9 12301 df-n0 12496 df-z 12583 df-dec 12703 df-uz 12854 df-q 12964 df-rp 13008 df-xneg 13128 df-xadd 13129 df-xmul 13130 df-ico 13369 df-icc 13370 df-fz 13527 df-seq 14029 df-exp 14089 df-cj 15140 df-re 15141 df-im 15142 df-sqrt 15276 df-abs 15277 df-struct 17197 df-sets 17214 df-slot 17232 df-ndx 17244 df-base 17260 df-ress 17281 df-plusg 17313 df-mulr 17314 df-starv 17315 df-sca 17316 df-vsca 17317 df-ip 17318 df-tset 17319 df-ple 17320 df-ds 17322 df-unif 17323 df-rest 17465 df-0g 17484 df-topgen 17486 df-mgm 18688 df-sgrp 18767 df-mnd 18783 df-mhm 18831 df-grp 18993 df-minusg 18994 df-sbg 18995 df-mulg 19125 df-subg 19180 df-ghm 19275 df-cmn 19843 df-abl 19844 df-mgp 20208 df-rng 20222 df-ur 20255 df-ring 20308 df-cring 20309 df-oppr 20410 df-dvdsr 20430 df-unit 20431 df-invr 20461 df-dvr 20474 df-rhm 20545 df-subrg 20646 df-drng 20806 df-staf 20911 df-srng 20912 df-lmod 20952 df-lss 21022 df-lmhm 21112 df-lvec 21193 df-sra 21263 df-rgmod 21264 df-psmet 21474 df-xmet 21475 df-met 21476 df-bl 21477 df-mopn 21478 df-fbas 21479 df-fg 21480 df-cnfld 21483 df-phl 21736 df-top 23012 df-topon 23029 df-topsp 23051 df-bases 23064 df-cld 23137 df-ntr 23138 df-cls 23139 df-nei 23216 df-haus 23433 df-fil 23964 df-flim 24057 df-xms 24438 df-ms 24439 df-nm 24700 df-ngp 24701 df-nlm 24704 df-clm 25183 df-cph 25288 df-cfil 25375 df-cmet 25377 df-cms 25455 |
| This theorem is referenced by: pjthlem2 25558 |
| Copyright terms: Public domain | W3C validator |