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-10658

Color key:    Metamath Proof Explorer  Metamath Proof Explorer (1-8729)   Hilbert Space Explorer  Hilbert Space Explorer (8730-10658)  

Statement List for Metamath Proof Explorer - 9101-9200 - Page 92 of 107
TypeLabelDescription
Statement
 
Theoremshocss 9101 An orthogonal complement is a subset of Hilbert space.
|- (A e. SH -> (_|_` A) (_ H~)
 
Theoremoccont 9102 Contraposition law for orthogonal complement.
|- ((A (_ H~ /\ B (_ H~) -> (A (_ B -> (_|_` B) (_ (_|_` A)))
 
Theoremoccon2t 9103 Double contraposition for orthogonal complement.
|- ((A (_ H~ /\ B (_ H~) -> (A (_ B -> (_|_` (_|_` A)) (_ (_|_` (_|_` B))))
 
Theoremoccon2 9104 Double contraposition for orthogonal complement.
|- A (_ H~   &   |- B (_ H~   =>   |- (A (_ B -> (_|_` (_|_` A)) (_ (_|_` (_|_`
 B)))
 
Theoremoc0 9105 The zero vector belongs to an orthogonal complement of a Hilbert subspace.
|- (H e. SH -> 0h e. (_|_` H))
 
Theoremocorth 9106 Members of a subset and its complement are orthogonal.
|- (H (_ H~ -> ((A e. H /\ B e. (_|_` H)) -> (A .ih B) = 0))
 
Theoremshocorth 9107 Members of a subspace and its complement are orthogonal.
|- (H e. SH -> ((A e. H /\ B e. (_|_` H)) -> (A .ih B) = 0))
 
Theoremococss 9108 Inclusion in complement of complement. Part of Proposition 1 of [Kalmbach] p. 65.
|- (A (_ H~ -> A (_ (_|_` (_|_` A)))
 
Theoremshococss 9109 Inclusion in complement of complement. Part of Proposition 1 of [Kalmbach] p. 65.
|- (A e. SH -> A (_ (_|_` (_|_` A)))
 
Theoremshorth 9110 Members of orthogonal subspaces are orthogonal.
|- (H e. SH -> (G (_ (_|_`
 H) -> ((A e. G /\ B e. H) -> (A .ih B) = 0)))
 
Theoremocin 9111 Intersection of a Hilbert subspace and its complement. Part of Proposition 1 of [Kalmbach] p. 65.
|- (A e. SH -> (A i^i (_|_` A)) = 0H)
 
Theoremocnelt 9112 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)
 
Theoremchocval 9113 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}
 
Theoremchocuni 9114 Lemma for uniqueness part of Projection Theorem. Theorem 3.7(i) of [Beran] p. 102 (uniqueness part).
 
Theoremoccllem1 9115 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem2 9116 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem3 9117 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem4 9118 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem5 9119 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem6 9120 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem7 9121 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccllem8 9122 Lemma for closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
 
Theoremoccl 9123 Closure of complement of Hilbert subset. Part of Remark 3.12 of [Beran] p. 107.
|- A (_ H~   =>   |- (_|_` A) e. CH
 
Theoremocclt 9124 Closure of complement of Hilbert subset. Part of Remark 3.12 of [Beran] p. 107.
|- (A (_ H~ -> (_|_` A) e. CH)
 
Theoremshocclt 9125 Closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
|- (A e. SH -> (_|_` A) e. CH)
 
Theoremchocclt 9126 Closure of complement of Hilbert subspace. Part of Remark 3.12 of [Beran] p. 107.
|- (A e. CH -> (_|_` A) e. CH)
 
Theoremchoccl 9127 Closure of CH orthocomplement.
|- A e. CH   =>   |- (_|_` A) e. CH
 
Projection theorem
 
Theoremprojlem1 9128 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 9129.
|- R e. RR   &   |- D e. RR   =>   |- (0 < D -> E.z e. NN ((4 x. ((2 x. R) + 1)) / z) < (D^2))
 
Theoremprojlem2 9129 Part of Lemma 3.6 of [Beran] p. 100. We need the square root for the norm limit. Used by projlem28 9155.
|- R e. RR   &   |- D e. RR   &   |- 0 <_ R   =>   |- (0 < D -> E.z e. NN (sqr` ((4 x. ((2 x. R) + 1)) / z)) < D)
 
Theoremprojlem3 9130 Part of Lemma 3.6 of [Beran] p. 100, bottom inequality. Used by projlem6 9133.
|- 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 9131 Part of Lemma 3.6 of [Beran] p. 101, top. Used by projlem6 9133.
|- 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 9132 Part of Lemma 3.6 of [Beran] p. 100, bottom. Used by projlem6 9133.
|- 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 9133 Part of Lemma 3.6 of [Beran] p. 101. Used by projlem7 9134.
|- 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 9134 Part of Lemma 3.6 of [Beran] p. 101. Applies weak deduction theorem to projlem6 9133. Used by projlem19 9146.
|- 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 9135 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 9136 projlem12 9139 projlem13 9140 projlem15 9142. 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 9136 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). Real closure of the infimum of norms. Used by projlem11 9138 projlem12 9139 projlem13 9140 projlem15 9142.
|- 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 9137 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). A member of the infimum set. Used by projlem12 9139.
|- 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 9138 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 9139 projlem13 9140 projlem14 9141 projlem15 9142 projlem18 9145 projlem19 9146 projlem26 9153 projlem28 9155 projlem31 9158.
|- 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 9139 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 9141 projlem18 9145 projlem31 9158.
|- 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 9140 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 9145 projlem19 9146 projlem28 9155.
|- 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 9141 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). Used by projlem16 9143.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(normh` (v -h A))}   &   |- R = -usup(