HomeHome Metamath Proof Explorer < Previous   Next >
Browser slow? Try the
Unicode version.

Jump to page: Contents + 1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12229

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-9062)
  Hilbert Space Explorer  Hilbert Space Explorer
(9063-10650)
  Users' Mathboxes  Users' Mathboxes
(10651-12229)
 

Statement List for Metamath Proof Explorer - 9401-9500 - Page 95 of 123
TypeLabelDescription
Statement
 
Definitiondf-ch0 9401 Define the zero for closed subspaces of Hilbert space. See h0elch 9403 for closure law.
|- 0H = {0h}
 
Theoremelch0 9402 Membership in zero for closed subspaces of Hilbert space.
|- (A e. 0H <-> A = 0h)
 
Theoremh0elch 9403 The zero subspace is a closed subspace. Part of Proposition 1 of [Kalmbach] p. 65.
|- 0H e. CH
 
Theoremh0elsh 9404 The zero subspace is a subspace of Hilbert space.
|- 0H e. SH
 
Theoremhhssva 9405 The vector addition operation on a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   =>   |- ( +h |` (H X. H)) = (+v` W)
 
Theoremhhsssm 9406 The scalar multiplication operation on a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   =>   |- ( .h |` (CC X. H)) = (.s` W)
 
Theoremhhssnm 9407 The norm operation on a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   =>   |- (normh |` H) = (norm` W)
 
Theoremhhssabli 9408 Abelian group property of subspace addition.
|- H e. SH   =>   |- ( +h |` (H X. H)) e. Abel
 
Theoremhhssabl 9409 Abelian group property of subspace addition.
|- (H e. SH -> ( +h |` (H X. H)) e. Abel)
 
Theoremhhssnv 9410 Normed complex vector space property of a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   &   |- H e. SH   =>   |- W e. NrmCVec
 
Theoremhhssnvt 9411 Normed complex vector space property of a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   =>   |- (H e. SH -> W e. NrmCVec)
 
Theoremhhsst 9412 A member of SH is a subspace.
|- U = <.<. +h , .h >., normh>.   &   |- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   =>   |- (H e. SH -> W e. (SubSp` U))
 
Theoremhhshsslem1 9413 Lemma for hhsssh 9415.
 
Theoremhhshsslem2 9414 Lemma for hhsssh 9415.
 
Theoremhhsssh 9415 The predicate "H is a subspace of Hilbert space."
|- U = <.<. +h , .h >., normh>.   &   |- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   =>   |- (H e. SH <-> (W e. (SubSp` U) /\ H (_ H~))
 
Theoremhhsssh2 9416 The predicate "H is a subspace of Hilbert space."
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   =>   |- (H e. SH <-> (W e. NrmCVec /\ H (_ H~))
 
Theoremhhssba 9417 The base set of a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   &   |- H e. SH   =>   |- H = (BaseSet` W)
 
Theoremhhssvs 9418 The vector subtraction operation on a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   &   |- H e. SH   =>   |- ( -h |` (H X. H)) = (-v` W)
 
Theoremhhssvsf 9419 Mapping of the vector subtraction operation on a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   &   |- H e. SH   =>   |- ( -h |` (H X. H)):(H X. H)-->H
 
Theoremhhssph 9420 Inner product space property of a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   &   |- H e. SH   =>   |- W e. CPreHil
 
Theoremhhssims 9421 Induced metric of a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   &   |- H e. SH   &   |- D = ((normh o. -h ) |` (H X. H))   =>   |- D = (IndMet` W)
 
Theoremhhssims2 9422 Induced metric of a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   &   |- D = (IndMet` W)   &   |- H e. SH   =>   |- D = ((normh o. -h ) |` (H X. H))
 
Theoremhhssmet 9423 Induced metric of a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   &   |- D = (IndMet` W)   &   |- H e. SH   =>   |- D e. Met
 
Theoremhhssmetba 9424 The base set for the metric of a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   &   |- D = (IndMet` W)   &   |- H e. SH   =>   |- H = dom dom D
 
Theoremhhssmetdval 9425 Value of the distance function of the metric space of a subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   &   |- D = (IndMet` W)   &   |- H e. SH   =>   |- ((A e. H /\ B e. H) -> (ADB) = (normh` (A -h B)))
 
Theoremhhsscms 9426 The induced metric of a closed subspace is complete.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   &   |- D = (IndMet` W)   &   |- H e. CH   =>   |- D e. CMet
 
Theoremhhssbn 9427 Banach space property of a closed subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   &   |- H e. CH   =>   |- W e. CBan
 
Theoremhhsshl 9428 Hilbert space property of a closed subspace.
|- W = <.<.( +h |` (H X. H)), ( .h |` (CC X. H))>., (normh |` H)>.   &   |- H e. CH   =>   |- W e. CHil
 
Theoremocval 9429 Value of orthogonal complement of a subset of Hilbert space.
|- (H (_ H~ -> (_|_` H) = {x e. H~ | A.y e. H (x .ih y) = 0})
 
Theoremocel 9430 Membership in orthogonal complement of H subset.
|- (H (_ H~ -> (A e. (_|_` H) <-> (A e. H~ /\ A.x e. H (A .ih x) = 0)))
 
Theoremshocel 9431 Membership in orthogonal complement of H subspace.
|- (H e. SH -> (A e. (_|_` H) <-> (A e. H~ /\ A.x e. H (A .ih x) = 0)))
 
Theoremocsh 9432 The orthogonal complement of a subspace is a subspace. Part of Remark 3.12 of [Beran] p. 107.
|- (A (_ H~ -> (_|_` A) e. SH)
 
Theoremshocsh 9433 The orthogonal complement of a subspace is a subspace. Part of Remark 3.12 of [Beran] p. 107.
|- (A e. SH -> (_|_` A) e. SH)
 
Theoremocss 9434 An orthogonal complement is a subset of Hilbert space.
|- (A (_ H~ -> (_|_` A) (_ H~)
 
Theoremshocss 9435 An orthogonal complement is a subset of Hilbert space.
|- (A e. SH -> (_|_` A) (_ H~)
 
Theoremoccon 9436 Contraposition law for orthogonal complement.
|- ((A (_ H~ /\ B (_ H~) -> (A (_ B -> (_|_` B) (_ (_|_` A)))
 
Theoremoccon2 9437 Double contraposition for orthogonal complement.
|- ((A (_ H~ /\ B (_ H~) -> (A (_ B -> (_|_` (_|_` A)) (_ (_|_` (_|_` B))))
 
Theoremoccon2i 9438 Double contraposition for orthogonal complement.
|- A (_ H~   &   |- B (_ H~   =>   |- (A (_ B -> (_|_` (_|_` A)) (_ (_|_` (_|_`
 B)))
 
Theoremoc0 9439 The zero vector belongs to an orthogonal complement of a Hilbert subspace.
|- (H e. SH -> 0h e. (_|_` H))
 
Theoremocorth 9440 Members of a subset and its complement are orthogonal.
|- (H (_ H~ -> ((A e. H /\ B e. (_|_` H)) -> (A .ih B) = 0))
 
Theoremshocorth 9441 Members of a subspace and its complement are orthogonal.
|- (H e. SH -> ((A e. H /\ B e. (_|_` H)) -> (A .ih B) = 0))
 
Theoremococss 9442 Inclusion in complement of complement. Part of Proposition 1 of [Kalmbach] p. 65.
|- (A (_ H~ -> A (_ (_|_` (_|_` A)))
 
Theoremshococss 9443 Inclusion in complement of complement. Part of Proposition 1 of [Kalmbach] p. 65.
|- (A e. SH -> A (_ (_|_` (_|_` A)))
 
Theoremshorth 9444 Members of orthogonal subspaces are orthogonal.
|- (H e. SH -> (G (_ (_|_`
 H) -> ((A e. G /\ B e. H) -> (A .ih B) = 0)))
 
Theoremocin 9445 Intersection of a Hilbert subspace and its complement. Part of Proposition 1 of [Kalmbach] p. 65.
|- (A e. SH -> (A i^i (_|_` A)) = 0H)
 
Theoremocnel 9446 A nonzero vector in the complement of a subspace does not belong to the subspace.
|- ((H e. SH /\ A e. (_|_` H) /\ A =/= 0h) -> -. A e. H)
 
Theoremchocvali 9447 Value of the orthogonal complement of a Hilbert lattice element. The orthogonal complement of A is the set of vectors that are orthogonal to all vectors in A.
|- A e. CH   =>   |- (_|_` A) = {x e. H~ | A.y e. A (x .ih y) = 0}
 
Theoremchocunii 9448 Lemma for uniqueness part of Projection Theorem. Theorem 3.7(i) of [Beran] p. 102 (uniqueness part).
 
Theoremoccllem1 9449 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem2 9450 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem3 9451 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem4 9452 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem5 9453 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem6 9454 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem7 9455 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem8 9456 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccli 9457 Closure of complement of Hilbert subset. Part of Remark 3.12 of [Beran] p. 107.
|- A (_ H~   =>   |- (_|_` A) e. CH
 
Theoremoccl 9458 Closure of complement of Hilbert subset. Part of Remark 3.12 of [Beran] p. 107.
|- (A (_ H~ -> (_|_` A) e. CH)
 
Theoremshoccl 9459 Closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
|- (A e. SH -> (_|_` A) e. CH)
 
Theoremchoccl 9460 Closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
|- (A e. CH -> (_|_` A) e. CH)
 
Theoremchoccli 9461 Closure of CH orthocomplement.
|- A e. CH   =>   |- (_|_` A) e. CH
 
Projection theorem
 
Theoremprojlem1 9462 Part of Lemma 3.6 of [Beran] p. 100: "Choose e > 0. Let n0 be a natural number satisfying the inequality n0 > 4(2i0 + 1) x. e ^ -1." Used by projlem2 9463.
|- R e. RR   &   |- D e. RR   =>   |- (0 < D -> E.z e. NN ((4 x. ((2 x. R) + 1)) / z) < (D^2))
 
Theoremprojlem2 9463 Part of Lemma 3.6 of [Beran] p. 100. We need the square root for the norm limit. Used by projlem28 9489.
|- R e. RR   &   |- D e. RR   &   |- 0 <_ R   =>   |- (0 < D -> E.z e. NN (sqr` ((4 x. ((2 x. R) + 1)) / z)) < D)
 
Theoremprojlem3 9464 Part of Lemma 3.6 of [Beran] p. 100, bottom inequality. Used by projlem6 9467.
|- R e. RR   &   |- D e. NN   &   |- G e. NN   =>   |- (((2 x. ((R + (1 / D))^2)) + (2 x. ((R + (1 / G))^2))) - (4 x. (R^2))) <_ (((4 x. R) + 2) x. ((1 / D) + (1 / G)))
 
Theoremprojlem4 9465 Part of Lemma 3.6 of [Beran] p. 101, top. Used by projlem6 9467.
|- R e. RR   &   |- 0 <_ R   &   |- D e. NN   &   |- G e. NN   &   |- B e. NN   =>   |- ((B <_ D /\ B <_ G) -> (((4 x. R) + 2) x. ((1 / D) + (1 / G))) <_ ((4 x. ((2 x. R) + 1)) / B))
 
Theoremprojlem5 9466 Part of Lemma 3.6 of [Beran] p. 100, bottom. Used by projlem6 9467.
|- A e. H~   &   |- B e. H~   &   |- C e. H~   &   |- R e. RR   &   |- 0 <_ R   &   |- (4 x. (R^2)) <_ ((normh` ((B +h C) -h (2 .h A)))^2)   &   |- D e. NN   &   |- G e. NN   &   |- N e. NN   &   |- (normh` (B -h A)) < (R + (1 / D))   &   |- (normh` (C -h A)) < (R + (1 / G))   =>   |- ((normh` (B -h C))^2) < (((2 x. ((R + (1 / D))^2)) + (2 x. ((R + (1 / G))^2))) - (4 x. (R^2)))
 
Theoremprojlem6 9467 Part of Lemma 3.6 of [Beran] p. 101. Used by projlem7 9468.
|- A e. H~   &   |- B e. H~   &   |- C e. H~   &   |- R e. RR   &   |- 0 <_ R   &   |- (4 x. (R^2)) <_ ((normh` ((B +h C) -h (2 .h A)))^2)   &   |- D e. NN   &   |- G e. NN   &   |- N e. NN   &   |- (normh` (B -h A)) < (R + (1 / D))   &   |- (normh` (C -h A)) < (R + (1 / G))   =>   |- ((N <_ D /\ N <_ G) -> (normh` (B -h C)) < (sqr` ((4 x. ((2 x. R) + 1)) / N)))
 
Theoremprojlem7 9468 Part of Lemma 3.6 of [Beran] p. 101. Applies weak deduction theorem to projlem6 9467. Used by projlem19 9480.
|- A e. H~   &   |- B e. H~   &   |- C e. H~   &   |- R e. RR   &   |- 0 <_ R   &   |- (4 x. (R^2)) <_ ((normh` ((B +h C) -h (2 .h A)))^2)   &   |- D e. NN   &   |- G e. NN   &   |- N e. NN   =>   |- (((normh` (B -h A)) < (R + (1 / D)) /\ (normh` (C -h A)) < (R + (1 / G))) -> ((N <_ D /\ N <_ G) -> (normh` (B -h C)) < (sqr` ((4 x. ((2 x. R) + 1)) / N))))
 
Theoremprojlem8 9469 Part of Lemma 3.6 of [Beran] p. 100. The set S is a non-empty set of reals with an upper bound. Part of Lemma 3.6 of [Beran] p. 100. Used by projlem9 9470 projlem12 9473 projlem13 9474 projlem15 9476. Note we use 'supremum'; its negative is the infimum.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   =>   |- (S (_ RR /\ S =/= (/) /\ E.z e. RR A.w e. S w <_ z)
 
Theoremprojlem9 9470 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). Real closure of the infimum of norms. Used by projlem11 9472 projlem12 9473 projlem13 9474 projlem15 9476.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   =>   |- sup(S, RR, < ) e. RR
 
Theoremprojlem10 9471 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). A member of the infimum set. Used by projlem12 9473.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   =>   |- (B e. H -> -u(normh` (B -h A)) e. S)
 
Theoremprojlem11 9472 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). R is the infimum of the set of norms. Show it is real. Used by projlem12 9473 projlem13 9474 projlem14 9475 projlem15 9476 projlem18 9479 projlem19 9480 projlem26 9487 projlem28 9489 projlem31 9492.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   =>   |- R e. RR
 
Theoremprojlem12 9473 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). The infimum is less than any norm in the set of norms. Used by projlem14 9475 projlem18 9479 projlem31 9492.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   =>   |- (B e. H -> R <_ (normh` (B -h A)))
 
Theoremprojlem13 9474 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). The infimum of the set of norms is nonnegative. Used by projlem18 9479 projlem19 9480 projlem28 9489.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   =>   |- 0 <_ R
 
Theoremprojlem14 9475 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). Used by projlem16 9477.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   &   |- C e. NN   &   |- B e. H   =>   |- (R - (1 / C)) < (normh` (B -h A))
 
Theoremprojlem15 9476 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). Used by projlem16 9477.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   &   |- C e. NN   =>   |- E.z e. H (normh` (z -h A)) < (R + (1 / C))
 
Theoremprojlem16 9477 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). Existence of a vector sequence member, used to show (via Axiom of Choice) the vector sequence existence. Used by projlem17 9478.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   &   |- C e. NN   =>   |- E.z e. H ((R - (1 / C)) < (normh` (z -h A)) /\ (normh` (z -h A)) < (R + (1 / C)))
 
Theoremprojlem17 9478 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). This uses the Axiom of Choice to show the existence of a vector sequence satisfying the assumption of Lemma 3.6 of [Beran] p. 100: "Let {yn } be a sequence of W such that i0 - 1/n < ||x0 - yn || < i0 + 1/n." Here, H corresponds to "W"; f:NN-->H to "{yn }"; w to "n"; R to "i0 "; and (norm` (A -h (f` w))) to "||x0 - yn ||". Used by projlem 9493.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   =>   |- E.f(f:NN-->H /\ A.w e. NN ((R - (1 / w)) < (normh` ((f` w) -h A)) /\ (normh` ((f` w) -h A)) < (R + (1 / w))))
 
Theoremprojlem18 9479 Part of Lemma 3.6 of [Beran] p. 101, top. Used by projlem19 9480.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   &   |- B e. H   &   |- C e. H   =>   |- (4 x. (R^2)) <_ ((normh` ((B +h C) -h (2 .h A)))^2)
 
Theoremprojlem19 9480 Part of Lemma 3.6 of [Beran] p. 101. Used by projlem20 9481.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   &   |- B e. H   &   |- C e. H   &   |- D e. NN   &   |- G e. NN   &   |- N e. NN   =>   |- (((normh` (B -h A)) < (R + (1 / D)) /\ (normh` (C -h A)) < (R + (1 / G))) -> ((N <_ D /\ N <_ G) -> (normh` (B -h C)) < (sqr` ((4 x. ((2 x. R) + 1)) / N))))
 
Theoremprojlem20 9481 Part of Lemma 3.6 of [Beran] p. 101. Used by projlem27 9488.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   &   |- N e. NN   =>   |- (((B e. H /\ C e. H) /\ (D e. NN /\ G e. NN)) -> (((normh` (B -h A)) < (R + (1 / D)) /\ (normh` (C -h A)) < (R + (1 / G))) -> ((N <_ D /\ N <_ G) -> (normh` (B -h C)) < (sqr` ((4 x. ((2 x. R) + 1)) / N)))))
 
Theoremprojlem21 9482 Part of Lemma 3.6 of [Beran] p. 100. The hypothesis lets us work with our postulated vector sequence (whose existence was shown by projlem17 9478). Here we just show the sequence value belongs to the closed subspace H. Used by projlem27 9488 projlem28 9489.
|- (ph <-> (F:NN-->H /\ A.w e. NN ((R - (1 / w)) < (normh` ((F` w) -h A)) /\ (normh` ((F` w) -h A)) < (R + (1 / w)))))   =>   |- (ph -> (D e. NN -> (F` D) e. H))
 
Theoremprojlem22 9483 Part of Lemma 3.6 of [Beran] p. 100. Here we show a member of the vector sequence is bounded. Used by projlem27 9488.
|- (ph <-> (F:NN-->H /\ A.w e. NN ((R - (1 / w)) < (normh` ((F` w) -h A)) /\ (normh` ((F` w) -h A)) < (R + (1 / w)))))   =>   |- (ph -> (D e. NN -> (normh` ((F` D) -h A)) < (R + (1 / D))))
 
Theoremprojlem23 9484 Part of Lemma 3.6 of [Beran] p. 101. The hypothesis lets us work with the sequence G which corresponds to Beran's "{||yn-x0||}". Used by projlem25 9486 projlem26 9487.
|- G = {<.x, y>. | (x e. NN /\ y = (normh` ((F` x) -h A)))}   =>   |- (D e. NN -> (G` D) = (normh` ((F` D) -h A)))
 
Theoremprojlem24 9485 Part of Lemma 3.6 of [Beran] p. 101. Here we show our vector sequence implies the real numbers sequence G corresponding to Beran's "{||yn-x0||}". Used by projlem25 9486 projlem26 9487.
|- G = {<.x, y>. | (x e. NN /\ y = (normh` ((F` x) -h A)))}   &   |- A e. H~   =>   |- (F:NN-->H~ -> G:NN-->CC)
 
Theoremprojlem25 9486 Part of Lemma 3.6 of [Beran] p. 101. "The sequence {||yn-x0||} of real numbers converges to the number ||y0-x0||" (here, "y0" is A and "x0" is z). Used by projlem31 9492.
|- G = {<.x, y>. | (x e. NN /\ y = (normh` ((F` x) -h A)))}   &   |- A e. H~   &   |- F e. V   =>   |- (F ~~>v z -> G ~~> (normh` (z -h A)))
 
Theoremprojlem26 9487 Part of Lemma 3.6 of [Beran] p. 101. The real sequence G (Beran's "{||yn-x0||}") converges to the infimum of norms. Used by projlem31 9492.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   &   |- (ph <-> (F:NN-->H /\ A.w e. NN ((R - (1 / w)) < (normh` ((F` w) -h A)) /\ (normh` ((F` w) -h A)) < (R + (1 / w)))))   &   |- G = {<.x, y>. | (x e. NN /\ y = (normh` ((F` x) -h A)))}   =>   |- (ph -> G ~~> R)
 
Theoremprojlem27 9488 Part of Lemma 3.6 of [Beran] p. 101. Boundedness to show F is a Cauchy sequence. Used by projlem28 9489.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   &   |- (ph <-> (F:NN-->H /\ A.w e. NN ((R - (1 / w)) < (normh` ((F` w) -h A)) /\ (normh` ((F` w) -h A)) < (R + (1 / w)))))   &   |- N e. NN   =>   |- ((ph /\ (D e. NN /\ G e. NN)) -> ((N <_ D /\ N <_ G) -> (normh` ((F` D) -h (F` G))) < (sqr`
 ((4 x. ((2 x. R) + 1)) / N))))
 
Theoremprojlem28 9489 Part of Lemma 3.6 of [Beran] p. 101. Boundedness to show F is a Cauchy sequence. Used by projlem29 9490.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   &   |- (ph <-> (F:NN-->H /\ A.w e. NN ((R - (1 / w)) < (normh` ((F` w) -h A)) /\ (normh` ((F` w) -h A)) < (R + (1 / w)))))   &   |- D e. RR   =>   |- (ph -> (0 < D -> E.z e. NN A.x e. NN A.y e. NN ((z <_ x /\ z <_ y) -> (normh` ((F` x) -h (F` y))) < D)))
 
Theoremprojlem29 9490 Part of Lemma 3.6 of [Beran] p. 101: 'Hence, {yn} is a Cauchy sequence.' Used by projlem30 9491.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   &   |- (ph <-> (F:NN-->H /\ A.w e. NN ((R - (1 / w)) < (normh` ((F` w) -h A)) /\ (normh` ((F` w) -h A)) < (R + (1 / w)))))   =>   |- (ph -> F e. Cauchy)
 
Theoremprojlem30 9491 Part of Lemma 3.6 of [Beran] p. 101: 'By completeness of W, there exists y0 e. W such that yn->y0.' Used by projlem31 9492.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   &   |- (ph <-> (F:NN-->H /\ A.w e. NN ((R - (1 / w)) < (normh` ((F` w) -h A)) /\ (normh` ((F` w) -h A)) < (R + (1 / w)))))   =>   |- (ph -> E.z e. H F ~~>v z)
 
Theoremprojlem31 9492 Part of Lemma 3.6 of [Beran] p. 101. The postulated vector sequence F implies our conclusion. By showing such a sequence exists (which was done with the Axiom of Choice in projlem17 9478), we can show the final conclusion, projlem 9493.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(S, RR, < )   &   |- (ph <-> (F:NN-->H /\ A.w e. NN ((R - (1 / w)) < (normh` ((F` w) -h A)) /\ (normh` ((F` w) -h A)) < (R + (1 / w)))))   &   |- F e. V   =>   |- (ph -> E.x e. H A.y e. H (normh` (x -h A)) <_ (normh` (y -h A)))
 
Theoremprojlem 9493 Lemma 3.6 of [Beran] p. 101: "Let H be a complete subspace of a (pre-)Hilbert space H~ and let A e. H~. Then there exists a vector x e. H such that (norm` (x -h A)) <_ (norm` (y -h A)) for every y e. H." This is a lemma for the projection theorem.
|- A e. H~   &   |- H e. CH   =>   |- E.x e. H A.y e. H (normh` (x -h A)) <_ (normh` (y -h A))
 
TheoremprojlemHIL 9494 Lemma 3.6 of [Beran] p. 101: "Let H be a complete subspace of a (pre-)Hilbert space H~ and let A e. H~. Then there exists a vector x e. H such that (norm` (x -h A)) <_ (norm` (y -h A)) for every y e. H." This is a lemma for the projection theorem.
|- A e. H~   &   |- H e. CH   =>   |- E.x e. H A.y e. H (normh` (x -h A)) <_ (normh` (y -h A))
 
Theorempjthlem1 9495 Lemma for pjthi 9509.
 
Theorempjthlem2 9496 Lemma for pjthi 9509.
 
Theorempjthlem3 9497 Lemma for pjthi 9509.
 
Theorempjthlem4 9498 Lemma for pjthi 9509.
 
Theorempjthlem5 9499 Lemma for pjthi 9509.
 
Theorempjthlem6 9500 Lemma for pjthi 9509.

MPE Home   Contents Copyright terms: Public domain < Previous  Next >