| 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 7428 | . . . . 5 ⊢ (𝑗 = 𝑦 → (𝐴 − 𝑗) = (𝐴 − 𝑦)) | |
| 10 | 9 | fveq2d 6889 | . . . 4 ⊢ (𝑗 = 𝑦 → (𝑁‘(𝐴 − 𝑗)) = (𝑁‘(𝐴 − 𝑦))) |
| 11 | 10 | cbvmptv 5208 | . . 3 ⊢ (𝑗 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑗))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴 − 𝑦))) |
| 12 | 11 | rneqi 5918 | . 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 25761 | 1 ⊢ (𝜑 → ∃!𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ∀wral 3076 ∃!wreu 3363 class class class wbr 5102 ↦ cmpt 5185 × cxp 5648 ran crn 5651 ↾ cres 5652 ‘cfv 6538 (class class class)co 7420 infcinf 9436 ℝcr 11202 < clt 11346 ≤ cle 11347 Basecbs 17392 ↾s cress 17413 distcds 17442 TopOpenctopn 17597 -gcsg 19151 LSubSpclss 21211 normcnm 24900 ℂPreHilccph 25492 CMetSpccms 25658 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 ax-pre-sup 11281 ax-addf 11282 ax-mulf 11283 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-iin 4953 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-tpos 8246 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-er 8720 df-map 8852 df-en 8977 df-dom 8978 df-sdom 8979 df-fin 8980 df-fi 9406 df-sup 9437 df-inf 9438 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-div 11977 df-nn 12339 df-2 12408 df-3 12409 df-4 12410 df-5 12411 df-6 12412 df-7 12413 df-8 12414 df-9 12415 df-n0 12610 df-z 12697 df-dec 12818 df-uz 12969 df-q 13079 df-rp 13124 df-xneg 13244 df-xadd 13245 df-xmul 13246 df-ico 13485 df-icc 13486 df-fz 13643 df-seq 14148 df-exp 14208 df-cj 15271 df-re 15272 df-im 15273 df-sqrt 15407 df-abs 15408 df-struct 17330 df-sets 17347 df-slot 17365 df-ndx 17377 df-base 17393 df-ress 17414 df-plusg 17446 df-mulr 17447 df-starv 17448 df-sca 17449 df-vsca 17450 df-ip 17451 df-tset 17452 df-ple 17453 df-ds 17455 df-unif 17456 df-rest 17598 df-0g 17617 df-topgen 17619 df-mgm 18821 df-sgrp 18913 df-mnd 18929 df-mhm 18983 df-grp 19152 df-minusg 19153 df-sbg 19154 df-mulg 19283 df-subg 19338 df-ghm 19433 df-cmn 20001 df-abl 20002 df-mgp 20366 df-rng 20380 df-ur 20413 df-ring 20466 df-cring 20467 df-oppr 20572 df-dvdsr 20592 df-unit 20593 df-invr 20623 df-dvr 20636 df-rhm 20707 df-subrg 20827 df-drng 20987 df-staf 21101 df-srng 21102 df-lmod 21142 df-lss 21212 df-lmhm 21302 df-lvec 21383 df-sra 21453 df-rgmod 21454 df-psmet 21675 df-xmet 21676 df-met 21677 df-bl 21678 df-mopn 21679 df-fbas 21680 df-fg 21681 df-cnfld 21684 df-phl 21937 df-top 23217 df-topon 23234 df-topsp 23256 df-bases 23269 df-cld 23342 df-ntr 23343 df-cls 23344 df-nei 23421 df-haus 23638 df-fil 24170 df-flim 24263 df-xms 24644 df-ms 24645 df-nm 24906 df-ngp 24907 df-nlm 24910 df-clm 25389 df-cph 25494 df-cfil 25581 df-cmet 25583 df-cms 25661 |
| This theorem is used by: pjthlem2 25764 |
| Copyright terms: Public domain | W3C validator |