Home Metamath Proof ExplorerTheorem List (p. 289 of 452) < Previous  Next > Bad symbols? Try the GIF version. Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

 Color key: Metamath Proof Explorer (1-28697) Hilbert Space Explorer (28698-30220) Users' Mathboxes (30221-45184)

Theorem List for Metamath Proof Explorer - 28801-28900   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremifhvhv0 28801 Prove if(𝐴 ∈ ℋ, 𝐴, 0) ∈ ℋ. (Contributed by David A. Wheeler, 7-Dec-2018.) (New usage is discouraged.)
if(𝐴 ∈ ℋ, 𝐴, 0) ∈ ℋ

Theoremhvaddid2 28802 Addition with the zero vector. (Contributed by NM, 18-Oct-1999.) (New usage is discouraged.)
(𝐴 ∈ ℋ → (0 + 𝐴) = 𝐴)

Theoremhvmul0 28803 Scalar multiplication with the zero vector. (Contributed by NM, 30-May-1999.) (New usage is discouraged.)
(𝐴 ∈ ℂ → (𝐴 · 0) = 0)

Theoremhvmul0or 28804 If a scalar product is zero, one of its factors must be zero. (Contributed by NM, 19-May-2005.) (New usage is discouraged.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ) → ((𝐴 · 𝐵) = 0 ↔ (𝐴 = 0 ∨ 𝐵 = 0)))

Theoremhvsubid 28805 Subtraction of a vector from itself. (Contributed by NM, 30-May-1999.) (New usage is discouraged.)
(𝐴 ∈ ℋ → (𝐴 𝐴) = 0)

Theoremhvnegid 28806 Addition of negative of a vector to itself. (Contributed by NM, 4-Jun-2004.) (New usage is discouraged.)
(𝐴 ∈ ℋ → (𝐴 + (-1 · 𝐴)) = 0)

Theoremhv2neg 28807 Two ways to express the negative of a vector. (Contributed by NM, 23-May-2005.) (New usage is discouraged.)
(𝐴 ∈ ℋ → (0 𝐴) = (-1 · 𝐴))

Theoremhvaddid2i 28808 Addition with the zero vector. (Contributed by NM, 18-Aug-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ       (0 + 𝐴) = 𝐴

Theoremhvnegidi 28809 Addition of negative of a vector to itself. (Contributed by NM, 18-Aug-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ       (𝐴 + (-1 · 𝐴)) = 0

Theoremhv2negi 28810 Two ways to express the negative of a vector. (Contributed by NM, 31-Oct-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ       (0 𝐴) = (-1 · 𝐴)

Theoremhvm1neg 28811 Convert minus one times a scalar product to the negative of the scalar. (Contributed by NM, 4-Jun-2004.) (New usage is discouraged.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ) → (-1 · (𝐴 · 𝐵)) = (-𝐴 · 𝐵))

Theoremhvaddsubval 28812 Value of vector addition in terms of vector subtraction. (Contributed by NM, 10-Jun-2006.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 + 𝐵) = (𝐴 (-1 · 𝐵)))

Theoremhvadd32 28813 Commutative/associative law. (Contributed by NM, 16-Oct-1999.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵))

Theoremhvadd12 28814 Commutative/associative law. (Contributed by NM, 19-Oct-1999.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 + (𝐵 + 𝐶)) = (𝐵 + (𝐴 + 𝐶)))

Theoremhvadd4 28815 Hilbert vector space addition law. (Contributed by NM, 16-Oct-1999.) (New usage is discouraged.)
(((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ (𝐶 ∈ ℋ ∧ 𝐷 ∈ ℋ)) → ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = ((𝐴 + 𝐶) + (𝐵 + 𝐷)))

Theoremhvsub4 28816 Hilbert vector space addition/subtraction law. (Contributed by NM, 17-Oct-1999.) (New usage is discouraged.)
(((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ (𝐶 ∈ ℋ ∧ 𝐷 ∈ ℋ)) → ((𝐴 + 𝐵) − (𝐶 + 𝐷)) = ((𝐴 𝐶) + (𝐵 𝐷)))

Theoremhvaddsub12 28817 Commutative/associative law. (Contributed by NM, 19-Oct-1999.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 + (𝐵 𝐶)) = (𝐵 + (𝐴 𝐶)))

Theoremhvpncan 28818 Addition/subtraction cancellation law for vectors in Hilbert space. (Contributed by NM, 7-Jun-2004.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 + 𝐵) − 𝐵) = 𝐴)

Theoremhvpncan2 28819 Addition/subtraction cancellation law for vectors in Hilbert space. (Contributed by NM, 7-Jun-2004.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 + 𝐵) − 𝐴) = 𝐵)

Theoremhvaddsubass 28820 Associativity of sum and difference of Hilbert space vectors. (Contributed by NM, 27-Aug-2004.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 + 𝐵) − 𝐶) = (𝐴 + (𝐵 𝐶)))

Theoremhvpncan3 28821 Subtraction and addition of equal Hilbert space vectors. (Contributed by NM, 27-Aug-2004.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 + (𝐵 𝐴)) = 𝐵)

Theoremhvmulcom 28822 Scalar multiplication commutative law. (Contributed by NM, 19-May-2005.) (New usage is discouraged.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → (𝐴 · (𝐵 · 𝐶)) = (𝐵 · (𝐴 · 𝐶)))

Theoremhvsubass 28823 Hilbert vector space associative law for subtraction. (Contributed by Mario Carneiro, 15-May-2014.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 𝐵) − 𝐶) = (𝐴 (𝐵 + 𝐶)))

Theoremhvsub32 28824 Hilbert vector space commutative/associative law. (Contributed by Mario Carneiro, 15-May-2014.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 𝐵) − 𝐶) = ((𝐴 𝐶) − 𝐵))

Theoremhvmulassi 28825 Scalar multiplication associative law. (Contributed by NM, 3-Sep-1999.) (New usage is discouraged.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ    &   𝐶 ∈ ℋ       ((𝐴 · 𝐵) · 𝐶) = (𝐴 · (𝐵 · 𝐶))

Theoremhvmulcomi 28826 Scalar multiplication commutative law. (Contributed by NM, 3-Sep-1999.) (New usage is discouraged.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ    &   𝐶 ∈ ℋ       (𝐴 · (𝐵 · 𝐶)) = (𝐵 · (𝐴 · 𝐶))

Theoremhvmul2negi 28827 Double negative in scalar multiplication. (Contributed by NM, 3-Sep-1999.) (New usage is discouraged.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ    &   𝐶 ∈ ℋ       (-𝐴 · (-𝐵 · 𝐶)) = (𝐴 · (𝐵 · 𝐶))

Theoremhvsubdistr1 28828 Scalar multiplication distributive law for subtraction. (Contributed by NM, 19-May-2005.) (New usage is discouraged.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 · (𝐵 𝐶)) = ((𝐴 · 𝐵) − (𝐴 · 𝐶)))

Theoremhvsubdistr2 28829 Scalar multiplication distributive law for subtraction. (Contributed by NM, 19-May-2005.) (New usage is discouraged.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → ((𝐴𝐵) · 𝐶) = ((𝐴 · 𝐶) − (𝐵 · 𝐶)))

Theoremhvdistr1i 28830 Scalar multiplication distributive law. (Contributed by NM, 3-Sep-1999.) (New usage is discouraged.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ       (𝐴 · (𝐵 + 𝐶)) = ((𝐴 · 𝐵) + (𝐴 · 𝐶))

Theoremhvsubdistr1i 28831 Scalar multiplication distributive law. (Contributed by NM, 3-Sep-1999.) (New usage is discouraged.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ       (𝐴 · (𝐵 𝐶)) = ((𝐴 · 𝐵) − (𝐴 · 𝐶))

Theoremhvassi 28832 Hilbert vector space associative law. (Contributed by NM, 3-Sep-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ       ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶))

Theoremhvadd32i 28833 Hilbert vector space commutative/associative law. (Contributed by NM, 18-Aug-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ       ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵)

Theoremhvsubassi 28834 Hilbert vector space associative law for subtraction. (Contributed by NM, 7-Oct-1999.) (Revised by Mario Carneiro, 15-May-2014.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ       ((𝐴 𝐵) − 𝐶) = (𝐴 (𝐵 + 𝐶))

Theoremhvsub32i 28835 Hilbert vector space commutative/associative law. (Contributed by NM, 7-Oct-1999.) (Revised by Mario Carneiro, 15-May-2014.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ       ((𝐴 𝐵) − 𝐶) = ((𝐴 𝐶) − 𝐵)

Theoremhvadd12i 28836 Hilbert vector space commutative/associative law. (Contributed by NM, 11-Sep-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ       (𝐴 + (𝐵 + 𝐶)) = (𝐵 + (𝐴 + 𝐶))

Theoremhvadd4i 28837 Hilbert vector space addition law. (Contributed by NM, 3-Sep-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ    &   𝐷 ∈ ℋ       ((𝐴 + 𝐵) + (𝐶 + 𝐷)) = ((𝐴 + 𝐶) + (𝐵 + 𝐷))

Theoremhvsubsub4i 28838 Hilbert vector space addition law. (Contributed by NM, 31-Oct-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ    &   𝐷 ∈ ℋ       ((𝐴 𝐵) − (𝐶 𝐷)) = ((𝐴 𝐶) − (𝐵 𝐷))

Theoremhvsubsub4 28839 Hilbert vector space addition/subtraction law. (Contributed by NM, 2-Apr-2000.) (New usage is discouraged.)
(((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ (𝐶 ∈ ℋ ∧ 𝐷 ∈ ℋ)) → ((𝐴 𝐵) − (𝐶 𝐷)) = ((𝐴 𝐶) − (𝐵 𝐷)))

Theoremhv2times 28840 Two times a vector. (Contributed by NM, 22-Jun-2006.) (New usage is discouraged.)
(𝐴 ∈ ℋ → (2 · 𝐴) = (𝐴 + 𝐴))

Theoremhvnegdii 28841 Distribution of negative over subtraction. (Contributed by NM, 31-Oct-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ       (-1 · (𝐴 𝐵)) = (𝐵 𝐴)

Theoremhvsubeq0i 28842 If the difference between two vectors is zero, they are equal. (Contributed by NM, 18-Aug-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ       ((𝐴 𝐵) = 0𝐴 = 𝐵)

Theoremhvsubcan2i 28843 Vector cancellation law. (Contributed by NM, 3-Sep-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ       ((𝐴 + 𝐵) + (𝐴 𝐵)) = (2 · 𝐴)

Theoremhvaddcani 28844 Cancellation law for vector addition. (Contributed by NM, 11-Sep-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ       ((𝐴 + 𝐵) = (𝐴 + 𝐶) ↔ 𝐵 = 𝐶)

Theoremhvsubaddi 28845 Relationship between vector subtraction and addition. (Contributed by NM, 11-Sep-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ       ((𝐴 𝐵) = 𝐶 ↔ (𝐵 + 𝐶) = 𝐴)

Theoremhvnegdi 28846 Distribution of negative over subtraction. (Contributed by NM, 2-Apr-2000.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (-1 · (𝐴 𝐵)) = (𝐵 𝐴))

Theoremhvsubeq0 28847 If the difference between two vectors is zero, they are equal. (Contributed by NM, 23-Oct-1999.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 𝐵) = 0𝐴 = 𝐵))

Theoremhvaddeq0 28848 If the sum of two vectors is zero, one is the negative of the other. (Contributed by NM, 10-Jun-2006.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 + 𝐵) = 0𝐴 = (-1 · 𝐵)))

Theoremhvaddcan 28849 Cancellation law for vector addition. (Contributed by NM, 18-May-2005.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 + 𝐵) = (𝐴 + 𝐶) ↔ 𝐵 = 𝐶))

Theoremhvaddcan2 28850 Cancellation law for vector addition. (Contributed by NM, 18-May-2005.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 + 𝐶) = (𝐵 + 𝐶) ↔ 𝐴 = 𝐵))

Theoremhvmulcan 28851 Cancellation law for scalar multiplication. (Contributed by NM, 19-May-2005.) (New usage is discouraged.)
(((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 · 𝐵) = (𝐴 · 𝐶) ↔ 𝐵 = 𝐶))

Theoremhvmulcan2 28852 Cancellation law for scalar multiplication. (Contributed by NM, 19-May-2005.) (New usage is discouraged.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℋ ∧ 𝐶 ≠ 0)) → ((𝐴 · 𝐶) = (𝐵 · 𝐶) ↔ 𝐴 = 𝐵))

Theoremhvsubcan 28853 Cancellation law for vector addition. (Contributed by NM, 18-May-2005.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 𝐵) = (𝐴 𝐶) ↔ 𝐵 = 𝐶))

Theoremhvsubcan2 28854 Cancellation law for vector addition. (Contributed by NM, 18-May-2005.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 𝐶) = (𝐵 𝐶) ↔ 𝐴 = 𝐵))

Theoremhvsub0 28855 Subtraction of a zero vector. (Contributed by NM, 2-Apr-2000.) (New usage is discouraged.)
(𝐴 ∈ ℋ → (𝐴 0) = 𝐴)

Theoremhvsubadd 28856 Relationship between vector subtraction and addition. (Contributed by NM, 30-Oct-1999.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 𝐵) = 𝐶 ↔ (𝐵 + 𝐶) = 𝐴))

Theoremhvaddsub4 28857 Hilbert vector space addition/subtraction law. (Contributed by NM, 18-May-2005.) (New usage is discouraged.)
(((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ (𝐶 ∈ ℋ ∧ 𝐷 ∈ ℋ)) → ((𝐴 + 𝐵) = (𝐶 + 𝐷) ↔ (𝐴 𝐶) = (𝐷 𝐵)))

19.1.6  Inner product postulates for a Hilbert space

Axiomax-hfi 28858 Inner product maps pairs from to . (Contributed by NM, 17-Nov-2007.) (New usage is discouraged.)
·ih :( ℋ × ℋ)⟶ℂ

Theoremhicl 28859 Closure of inner product. (Contributed by NM, 17-Nov-2007.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 ·ih 𝐵) ∈ ℂ)

Theoremhicli 28860 Closure inference for inner product. (Contributed by NM, 1-Aug-1999.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ       (𝐴 ·ih 𝐵) ∈ ℂ

Axiomax-his1 28861 Conjugate law for inner product. Postulate (S1) of [Beran] p. 95. Note that ∗‘𝑥 is the complex conjugate cjval 14457 of 𝑥. In the literature, the inner product of 𝐴 and 𝐵 is usually written 𝐴, 𝐵, but our operation notation co 7145 allows us to use existing theorems about operations and also avoids a clash with the definition of an ordered pair df-op 4556. Physicists use 𝐵𝐴, called Dirac bra-ket notation, to represent this operation; see comments in df-bra 29629. (Contributed by NM, 29-Jul-1999.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 ·ih 𝐵) = (∗‘(𝐵 ·ih 𝐴)))

Axiomax-his2 28862 Distributive law for inner product. Postulate (S2) of [Beran] p. 95. (Contributed by NM, 31-Jul-1999.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 + 𝐵) ·ih 𝐶) = ((𝐴 ·ih 𝐶) + (𝐵 ·ih 𝐶)))

Axiomax-his3 28863 Associative law for inner product. Postulate (S3) of [Beran] p. 95. Warning: Mathematics textbooks usually use our version of the axiom. Physics textbooks, on the other hand, usually replace the left-hand side with (𝐵 ·ih (𝐴 · 𝐶)) (e.g., Equation 1.21b of [Hughes] p. 44; Definition (iii) of [ReedSimon] p. 36). See the comments in df-bra 29629 for why the physics definition is swapped. (Contributed by NM, 29-May-1999.) (New usage is discouraged.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 · 𝐵) ·ih 𝐶) = (𝐴 · (𝐵 ·ih 𝐶)))

Axiomax-his4 28864 Identity law for inner product. Postulate (S4) of [Beran] p. 95. (Contributed by NM, 29-May-1999.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐴 ≠ 0) → 0 < (𝐴 ·ih 𝐴))

19.2  Inner product and norms

19.2.1  Inner product

Theoremhis5 28865 Associative law for inner product. Lemma 3.1(S5) of [Beran] p. 95. (Contributed by NM, 29-Jul-1999.) (New usage is discouraged.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 ·ih (𝐴 · 𝐶)) = ((∗‘𝐴) · (𝐵 ·ih 𝐶)))

Theoremhis52 28866 Associative law for inner product. (Contributed by NM, 13-Feb-2006.) (New usage is discouraged.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 ·ih ((∗‘𝐴) · 𝐶)) = (𝐴 · (𝐵 ·ih 𝐶)))

Theoremhis35 28867 Move scalar multiplication to outside of inner product. (Contributed by Mario Carneiro, 15-May-2014.) (New usage is discouraged.)
(((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℋ ∧ 𝐷 ∈ ℋ)) → ((𝐴 · 𝐶) ·ih (𝐵 · 𝐷)) = ((𝐴 · (∗‘𝐵)) · (𝐶 ·ih 𝐷)))

Theoremhis35i 28868 Move scalar multiplication to outside of inner product. (Contributed by NM, 1-Jul-2005.) (Revised by Mario Carneiro, 15-May-2014.) (New usage is discouraged.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ    &   𝐶 ∈ ℋ    &   𝐷 ∈ ℋ       ((𝐴 · 𝐶) ·ih (𝐵 · 𝐷)) = ((𝐴 · (∗‘𝐵)) · (𝐶 ·ih 𝐷))

Theoremhis7 28869 Distributive law for inner product. Lemma 3.1(S7) of [Beran] p. 95. (Contributed by NM, 31-Jul-1999.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·ih (𝐵 + 𝐶)) = ((𝐴 ·ih 𝐵) + (𝐴 ·ih 𝐶)))

Theoremhiassdi 28870 Distributive/associative law for inner product, useful for linearity proofs. (Contributed by NM, 10-May-2005.) (New usage is discouraged.)
(((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ) ∧ (𝐶 ∈ ℋ ∧ 𝐷 ∈ ℋ)) → (((𝐴 · 𝐵) + 𝐶) ·ih 𝐷) = ((𝐴 · (𝐵 ·ih 𝐷)) + (𝐶 ·ih 𝐷)))

Theoremhis2sub 28871 Distributive law for inner product of vector subtraction. (Contributed by NM, 16-Nov-1999.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 𝐵) ·ih 𝐶) = ((𝐴 ·ih 𝐶) − (𝐵 ·ih 𝐶)))

Theoremhis2sub2 28872 Distributive law for inner product of vector subtraction. (Contributed by NM, 13-Feb-2006.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·ih (𝐵 𝐶)) = ((𝐴 ·ih 𝐵) − (𝐴 ·ih 𝐶)))

Theoremhire 28873 A necessary and sufficient condition for an inner product to be real. (Contributed by NM, 2-Jul-2005.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·ih 𝐵) ∈ ℝ ↔ (𝐴 ·ih 𝐵) = (𝐵 ·ih 𝐴)))

Theoremhiidrcl 28874 Real closure of inner product with self. (Contributed by NM, 29-May-1999.) (New usage is discouraged.)
(𝐴 ∈ ℋ → (𝐴 ·ih 𝐴) ∈ ℝ)

Theoremhi01 28875 Inner product with the 0 vector. (Contributed by NM, 29-May-1999.) (New usage is discouraged.)
(𝐴 ∈ ℋ → (0 ·ih 𝐴) = 0)

Theoremhi02 28876 Inner product with the 0 vector. (Contributed by NM, 13-Oct-1999.) (New usage is discouraged.)
(𝐴 ∈ ℋ → (𝐴 ·ih 0) = 0)

Theoremhiidge0 28877 Inner product with self is not negative. (Contributed by NM, 29-May-1999.) (New usage is discouraged.)
(𝐴 ∈ ℋ → 0 ≤ (𝐴 ·ih 𝐴))

Theoremhis6 28878 Zero inner product with self means vector is zero. Lemma 3.1(S6) of [Beran] p. 95. (Contributed by NM, 27-Jul-1999.) (New usage is discouraged.)
(𝐴 ∈ ℋ → ((𝐴 ·ih 𝐴) = 0 ↔ 𝐴 = 0))

Theoremhis1i 28879 Conjugate law for inner product. Postulate (S1) of [Beran] p. 95. (Contributed by NM, 15-May-2005.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ       (𝐴 ·ih 𝐵) = (∗‘(𝐵 ·ih 𝐴))

Theoremabshicom 28880 Commuted inner products have the same absolute values. (Contributed by NM, 26-May-2006.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (abs‘(𝐴 ·ih 𝐵)) = (abs‘(𝐵 ·ih 𝐴)))

Theoremhial0 28881* A vector whose inner product is always zero is zero. (Contributed by NM, 24-Oct-1999.) (New usage is discouraged.)
(𝐴 ∈ ℋ → (∀𝑥 ∈ ℋ (𝐴 ·ih 𝑥) = 0 ↔ 𝐴 = 0))

Theoremhial02 28882* A vector whose inner product is always zero is zero. (Contributed by NM, 28-Jan-2006.) (New usage is discouraged.)
(𝐴 ∈ ℋ → (∀𝑥 ∈ ℋ (𝑥 ·ih 𝐴) = 0 ↔ 𝐴 = 0))

Theoremhisubcomi 28883 Two vector subtractions simultaneously commute in an inner product. (Contributed by NM, 1-Jul-2005.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ    &   𝐷 ∈ ℋ       ((𝐴 𝐵) ·ih (𝐶 𝐷)) = ((𝐵 𝐴) ·ih (𝐷 𝐶))

Theoremhi2eq 28884 Lemma used to prove equality of vectors. (Contributed by NM, 16-Nov-1999.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·ih (𝐴 𝐵)) = (𝐵 ·ih (𝐴 𝐵)) ↔ 𝐴 = 𝐵))

Theoremhial2eq 28885* Two vectors whose inner product is always equal are equal. (Contributed by NM, 16-Nov-1999.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (∀𝑥 ∈ ℋ (𝐴 ·ih 𝑥) = (𝐵 ·ih 𝑥) ↔ 𝐴 = 𝐵))

Theoremhial2eq2 28886* Two vectors whose inner product is always equal are equal. (Contributed by NM, 28-Jan-2006.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (∀𝑥 ∈ ℋ (𝑥 ·ih 𝐴) = (𝑥 ·ih 𝐵) ↔ 𝐴 = 𝐵))

Theoremorthcom 28887 Orthogonality commutes. (Contributed by NM, 10-Oct-1999.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·ih 𝐵) = 0 ↔ (𝐵 ·ih 𝐴) = 0))

Theoremnormlem0 28888 Lemma used to derive properties of norm. Part of Theorem 3.3(ii) of [Beran] p. 97. (Contributed by NM, 7-Oct-1999.) (New usage is discouraged.)
𝑆 ∈ ℂ    &   𝐹 ∈ ℋ    &   𝐺 ∈ ℋ       ((𝐹 (𝑆 · 𝐺)) ·ih (𝐹 (𝑆 · 𝐺))) = (((𝐹 ·ih 𝐹) + (-(∗‘𝑆) · (𝐹 ·ih 𝐺))) + ((-𝑆 · (𝐺 ·ih 𝐹)) + ((𝑆 · (∗‘𝑆)) · (𝐺 ·ih 𝐺))))

Theoremnormlem1 28889 Lemma used to derive properties of norm. Part of Theorem 3.3(ii) of [Beran] p. 97. (Contributed by NM, 22-Aug-1999.) (New usage is discouraged.)
𝑆 ∈ ℂ    &   𝐹 ∈ ℋ    &   𝐺 ∈ ℋ    &   𝑅 ∈ ℝ    &   (abs‘𝑆) = 1       ((𝐹 ((𝑆 · 𝑅) · 𝐺)) ·ih (𝐹 ((𝑆 · 𝑅) · 𝐺))) = (((𝐹 ·ih 𝐹) + (((∗‘𝑆) · -𝑅) · (𝐹 ·ih 𝐺))) + (((𝑆 · -𝑅) · (𝐺 ·ih 𝐹)) + ((𝑅↑2) · (𝐺 ·ih 𝐺))))

Theoremnormlem2 28890 Lemma used to derive properties of norm. Part of Theorem 3.3(ii) of [Beran] p. 97. (Contributed by NM, 27-Jul-1999.) (New usage is discouraged.)
𝑆 ∈ ℂ    &   𝐹 ∈ ℋ    &   𝐺 ∈ ℋ    &   𝐵 = -(((∗‘𝑆) · (𝐹 ·ih 𝐺)) + (𝑆 · (𝐺 ·ih 𝐹)))       𝐵 ∈ ℝ

Theoremnormlem3 28891 Lemma used to derive properties of norm. Part of Theorem 3.3(ii) of [Beran] p. 97. (Contributed by NM, 21-Aug-1999.) (New usage is discouraged.)
𝑆 ∈ ℂ    &   𝐹 ∈ ℋ    &   𝐺 ∈ ℋ    &   𝐵 = -(((∗‘𝑆) · (𝐹 ·ih 𝐺)) + (𝑆 · (𝐺 ·ih 𝐹)))    &   𝐴 = (𝐺 ·ih 𝐺)    &   𝐶 = (𝐹 ·ih 𝐹)    &   𝑅 ∈ ℝ       (((𝐴 · (𝑅↑2)) + (𝐵 · 𝑅)) + 𝐶) = (((𝐹 ·ih 𝐹) + (((∗‘𝑆) · -𝑅) · (𝐹 ·ih 𝐺))) + (((𝑆 · -𝑅) · (𝐺 ·ih 𝐹)) + ((𝑅↑2) · (𝐺 ·ih 𝐺))))

Theoremnormlem4 28892 Lemma used to derive properties of norm. Part of Theorem 3.3(ii) of [Beran] p. 97. (Contributed by NM, 29-Jul-1999.) (New usage is discouraged.)
𝑆 ∈ ℂ    &   𝐹 ∈ ℋ    &   𝐺 ∈ ℋ    &   𝐵 = -(((∗‘𝑆) · (𝐹 ·ih 𝐺)) + (𝑆 · (𝐺 ·ih 𝐹)))    &   𝐴 = (𝐺 ·ih 𝐺)    &   𝐶 = (𝐹 ·ih 𝐹)    &   𝑅 ∈ ℝ    &   (abs‘𝑆) = 1       ((𝐹 ((𝑆 · 𝑅) · 𝐺)) ·ih (𝐹 ((𝑆 · 𝑅) · 𝐺))) = (((𝐴 · (𝑅↑2)) + (𝐵 · 𝑅)) + 𝐶)

Theoremnormlem5 28893 Lemma used to derive properties of norm. Part of Theorem 3.3(ii) of [Beran] p. 97. (Contributed by NM, 10-Aug-1999.) (New usage is discouraged.)
𝑆 ∈ ℂ    &   𝐹 ∈ ℋ    &   𝐺 ∈ ℋ    &   𝐵 = -(((∗‘𝑆) · (𝐹 ·ih 𝐺)) + (𝑆 · (𝐺 ·ih 𝐹)))    &   𝐴 = (𝐺 ·ih 𝐺)    &   𝐶 = (𝐹 ·ih 𝐹)    &   𝑅 ∈ ℝ    &   (abs‘𝑆) = 1       0 ≤ (((𝐴 · (𝑅↑2)) + (𝐵 · 𝑅)) + 𝐶)

Theoremnormlem6 28894 Lemma used to derive properties of norm. Part of Theorem 3.3(ii) of [Beran] p. 97. (Contributed by NM, 2-Aug-1999.) (Revised by Mario Carneiro, 4-Jun-2014.) (New usage is discouraged.)
𝑆 ∈ ℂ    &   𝐹 ∈ ℋ    &   𝐺 ∈ ℋ    &   𝐵 = -(((∗‘𝑆) · (𝐹 ·ih 𝐺)) + (𝑆 · (𝐺 ·ih 𝐹)))    &   𝐴 = (𝐺 ·ih 𝐺)    &   𝐶 = (𝐹 ·ih 𝐹)    &   (abs‘𝑆) = 1       (abs‘𝐵) ≤ (2 · ((√‘𝐴) · (√‘𝐶)))

Theoremnormlem7 28895 Lemma used to derive properties of norm. Part of Theorem 3.3(ii) of [Beran] p. 97. (Contributed by NM, 11-Aug-1999.) (New usage is discouraged.)
𝑆 ∈ ℂ    &   𝐹 ∈ ℋ    &   𝐺 ∈ ℋ    &   (abs‘𝑆) = 1       (((∗‘𝑆) · (𝐹 ·ih 𝐺)) + (𝑆 · (𝐺 ·ih 𝐹))) ≤ (2 · ((√‘(𝐺 ·ih 𝐺)) · (√‘(𝐹 ·ih 𝐹))))

Theoremnormlem8 28896 Lemma used to derive properties of norm. (Contributed by NM, 30-Jun-2005.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ    &   𝐷 ∈ ℋ       ((𝐴 + 𝐵) ·ih (𝐶 + 𝐷)) = (((𝐴 ·ih 𝐶) + (𝐵 ·ih 𝐷)) + ((𝐴 ·ih 𝐷) + (𝐵 ·ih 𝐶)))

Theoremnormlem9 28897 Lemma used to derive properties of norm. (Contributed by NM, 30-Jun-2005.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ    &   𝐶 ∈ ℋ    &   𝐷 ∈ ℋ       ((𝐴 𝐵) ·ih (𝐶 𝐷)) = (((𝐴 ·ih 𝐶) + (𝐵 ·ih 𝐷)) − ((𝐴 ·ih 𝐷) + (𝐵 ·ih 𝐶)))

Theoremnormlem7tALT 28898 Lemma used to derive properties of norm. Part of Theorem 3.3(ii) of [Beran] p. 97. (Contributed by NM, 11-Oct-1999.) (New usage is discouraged.) (Proof modification is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ       ((𝑆 ∈ ℂ ∧ (abs‘𝑆) = 1) → (((∗‘𝑆) · (𝐴 ·ih 𝐵)) + (𝑆 · (𝐵 ·ih 𝐴))) ≤ (2 · ((√‘(𝐵 ·ih 𝐵)) · (√‘(𝐴 ·ih 𝐴)))))

Theorembcseqi 28899 Equality case of Bunjakovaskij-Cauchy-Schwarz inequality. Specifically, in the equality case the two vectors are collinear. Compare bcsiHIL 28959. (Contributed by NM, 16-Jul-2001.) (New usage is discouraged.)
𝐴 ∈ ℋ    &   𝐵 ∈ ℋ       (((𝐴 ·ih 𝐵) · (𝐵 ·ih 𝐴)) = ((𝐴 ·ih 𝐴) · (𝐵 ·ih 𝐵)) ↔ ((𝐵 ·ih 𝐵) · 𝐴) = ((𝐴 ·ih 𝐵) · 𝐵))

Theoremnormlem9at 28900 Lemma used to derive properties of norm. Part of Remark 3.4(B) of [Beran] p. 98. (Contributed by NM, 10-May-2005.) (New usage is discouraged.)
((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 𝐵) ·ih (𝐴 𝐵)) = (((𝐴 ·ih 𝐴) + (𝐵 ·ih 𝐵)) − ((𝐴 ·ih 𝐵) + (𝐵 ·ih 𝐴))))

Page List
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-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42400 425 42401-42500 426 42501-42600 427 42601-42700 428 42701-42800 429 42801-42900 430 42901-43000 431 43001-43100 432 43101-43200 433 43201-43300 434 43301-43400 435 43401-43500 436 43501-43600 437 43601-43700 438 43701-43800 439 43801-43900 440 43901-44000 441 44001-44100 442 44101-44200 443 44201-44300 444 44301-44400 445 44401-44500 446 44501-44600 447 44601-44700 448 44701-44800 449 44801-44900 450 44901-45000 451 45001-45100 452 45101-45184
 Copyright terms: Public domain < Previous  Next >