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

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-9063)
  Hilbert Space Explorer  Hilbert Space Explorer
(9064-10651)
  Users' Mathboxes  Users' Mathboxes
(10652-12230)
 

Statement List for Metamath Proof Explorer - 9001-9100 - Page 91 of 123
TypeLabelDescription
Statement
 
Theoremefifolem7 9001 Lemma for efifo 9002.
 
Theoremefifo 9002 The exponential function of an imaginary number maps the closed-below, open-above interval from 0 to 2 x. pi onto the unit circle. (Contributed by Paul Chapman, 16-Mar-2008.)
|- F = {<.x, y>. | (x e. (0[,)(2 x. pi)) /\ y = (exp` (i x. x)))}   &   |- S = {z e. CC | (abs` z) = 1}   =>   |- F:(0[,)(2 x. pi))-onto->S
 
Theoremefif1lem1 9003 Lemma for efif1 9010.
 
Theoremefif1lem2 9004 Lemma for efif1 9010.
 
Theoremefif1lem3 9005 Lemma for efif1 9010.
 
Theoremefif1lem4 9006 Lemma for efif1 9010.
 
Theoremefif1lem5 9007 Lemma for efif1 9010.
 
Theoremefif1lem6 9008 Lemma for efif1 9010.
 
Theoremefif1lem7 9009 Lemma for efif1 9010.
 
Theoremefif1 9010 The exponential function of an imaginary number maps the closed-below, open-above interval from 0 to 2 x. pi one-to-one to the unit circle. (Contributed by Paul Chapman, 16-Mar-2008.)
|- F = {<.x, y>. | (x e. (0[,)(2 x. pi)) /\ y = (exp` (i x. x)))}   &   |- S = {z e. CC | (abs` z) = 1}   =>   |- F:(0[,)(2 x. pi))-1-1->S
 
Theoremefif1o 9011 The exponential function of an imaginary number maps the closed-below, open-above interval from 0 to 2 x. pi one-to-one onto the unit circle. (Contributed by Paul Chapman, 16-Mar-2008.)
|- F = {<.x, y>. | (x e. (0[,)(2 x. pi)) /\ y = (exp` (i x. x)))}   &   |- S = {z e. CC | (abs` z) = 1}   =>   |- F:(0[,)(2 x. pi))-1-1-onto->S
 
Theoremefielcirc 9012 Membership of the exponential function of i times a real number in the unit circle. (Contributed by Paul Chapman, 25-Mar-2008.)
|- C = {w e. CC | (abs` w) = 1}   =>   |- (A e. RR -> (exp` (i x. A)) e. C)
 
Theoremcircgrp 9013 The circle group T is an Abelian group. (Contributed by Paul Chapman, 25-Mar-2008.)
|- C = {w e. CC | (abs` w) = 1}   &   |- T = ( x. |` (C X. C))   =>   |- T e. Abel
 
Theoremshftefif1olem 9014 Lemma for shftefif1o 9015.
 
Theoremshftefif1o 9015 The exponential function of i times a real number maps any closed-below, open-above real interval of length 2 x. pi one-to-one onto the unit circle. (Contributed by Paul Chapman, 25-Mar-2008.)
|- D = (A[,)(A + (2 x. pi)))   &   |- G = {<.x, y>. | (x e. D /\ y = (exp` (i x. x)))}   &   |- C = {w e. CC | (abs` w) = 1}   =>   |- (A e. RR -> G:D-1-1-onto->C)
 
Theoremeff1lem 9016 Lemma for eff1i 9017.
 
Theoremeff1i 9017 The exponential function maps the set S, of complex numbers with imaginary part in a closed-below, open-above real interval of length 2 x. pi starting at A, one-to-one to the nonzero complex numbers. (Contributed by Paul Chapman, 16-Apr-2008.)
|- A e. RR   &   |- D = (A[,)(A + (2 x. pi)))   &   |- S = {v e. CC | (Im` v) e. D}   &   |- F = {<.z, w>. | (z e. D /\ w = (exp` (i x. z)))}   &   |- C = {v e. CC | (abs` v) = 1}   =>   |- (exp |` S):S-1-1->(CC \ {0})
 
Theoremeffoi 9018 The exponential function maps the set S, of complex numbers with imaginary part in a closed-below, open-above real interval of length 2 x. pi starting at A, onto the nonzero complex numbers. (Contributed by Paul Chapman, 16-Apr-2008.)
|- A e. RR   &   |- D = (A[,)(A + (2 x. pi)))   &   |- S = {v e. CC | (Im` v) e. D}   &   |- F = {<.z, w>. | (z e. D /\ w = (exp` (i x. z)))}   &   |- C = {v e. CC | (abs` v) = 1}   =>   |- (exp |` S):S-onto->(CC \ {0})
 
Theoremeff1oi 9019 The exponential function maps the set S, of complex numbers with imaginary part in a closed-below, open-above real interval of length 2 x. pi starting at A, one-to-one onto the nonzero complex numbers. A would normally be fixed at 0 or -upi, according to choice of principal domain for the exponential function. (Contributed by Paul Chapman, 16-Apr-2008.)
|- A e. RR   &   |- D = (A[,)(A + (2 x. pi)))   &   |- S = {v e. CC | (Im` v) e. D}   =>   |- (exp |` S):S-1-1-onto->(CC \ {0})
 
Theoremefper 9020 The exponential function is periodic. (Contributed by Paul Chapman, 21-Apr-2008.)
|- ((A e. CC /\ K e. ZZ) -> (exp` (A + ((i x. (2 x. pi)) x. K))) = (exp` A))
 
Theoremeff1o 9021 The exponential function restricted to its principal domain maps one-to-one onto the nonzero complex numbers. (Contributed by Paul Chapman, 21-Apr-2008.)
|- (exp |` {x e. CC | (Im` x) e. (-upi[,)pi)}):{x e. CC | (Im` x) e. (-upi[,)pi)}-1-1-onto->(CC \ {0})
 
The natural logarithm on complex numbers
 
Syntaxclog 9022 Extend class notation with the natural logarithm function on complex numbers.
class log
 
Definitiondf-log 9023 Define the natural logarithm function on complex numbers. See http://en.wikipedia.org/wiki/Natural_logarithm ("The natural logarithm function can also be defined as the inverse function of the exponential function").
|- log = `'(exp |` {x e. CC | (Im` x) e. (-upi[,)pi)})
 
Theoremlogrn 9024 The range of the natural logarithm function, also the principal domain of the exponential function. This allows us to write the longer class abstraction as simply ran log. (Contributed by Paul Chapman, 21-Apr-2008.)
|- ran log = {x e. CC | (Im` x) e. (-upi[,)pi)}
 
Theoremdflog2 9025 The natural logarithm function in terms of the exponential function restricted to its principal domain. (Contributed by Paul Chapman, 21-Apr-2008.)
|- log = `'(exp |` ran log)
 
Theoremresslogrn 9026 The range of the natural logarithm function includes the real numbers. (Contributed by Paul Chapman, 21-Apr-2008.)
|- RR (_ ran log
 
Theoremeff1o2 9027 The exponential function restricted to its principal domain maps one-to-one onto the nonzero complex numbers. (Contributed by Paul Chapman, 21-Apr-2008.)
|- (exp |` ran log):ran log-1-1-onto->(CC \ {0})
 
Theoremlogf1o 9028 The natural logarithm function maps the nonzero complex numbers one-to-one onto its range. (Contributed by Paul Chapman, 21-Apr-2008.)
|- log:(CC \ {0})-1-1-onto->ran log
 
Theoremdfrelog 9029 The natural logarithm function on the positive reals in terms of the real exponential function. (Contributed by Paul Chapman, 21-Apr-2008.)
|- (log |` RR+) = `'(exp |` RR)
 
Theoremrelogf1o 9030 The natural logarithm function maps the positive reals one-to-one onto the real numbers. (Contributed by Paul Chapman, 21-Apr-2008.)
|- (log |` RR+):RR+-1-1-onto->RR
 
Theoremlogcl 9031 Closure of the natural logarithm function. (Contributed by Paul Chapman, 21-Apr-2008.)
|- ((A e. CC /\ A =/= 0) -> (log` A) e. ran log)
 
Theoremrelogcl 9032 Closure of the natural logarithm function on positive reals. (Contributed by Steve Rodriguez, 25-Nov-2007.)
|- (A e. RR+ -> (log` A) e. RR)
 
Theoremeflog 9033 Relationship between the natural logarithm function and the exponential function. (Contributed by Paul Chapman, 21-Apr-2008.)
|- ((A e. CC /\ A =/= 0) -> (exp` (log` A)) = A)
 
Theoremreeflog 9034 Relationship between the natural logarithm function and the exponential function. (Contributed by Steve Rodriguez, 25-Nov-2007.)
|- (A e. RR+ -> (exp` (log` A)) = A)
 
Theoremlogef 9035 Relationship between the natural logarithm function and the exponential function. (Contributed by Paul Chapman, 21-Apr-2008.)
|- (A e. ran log -> (log` (exp` A)) = A)
 
Theoremrelogef 9036 Relationship between the natural logarithm function and the exponential function. (Contributed by Steve Rodriguez, 25-Nov-2007.)
|- (A e. RR -> (log` (exp` A)) = A)
 
Theoremlogeftb 9037 Relationship between the natural logarithm function and the exponential function. (Contributed by Paul Chapman, 21-Apr-2008.)
|- ((A e. CC /\ A =/= 0 /\ B e. ran log) -> ((log` A) = B <-> (exp` B) = A))
 
Theoremrelogeftb 9038 Relationship between the natural logarithm function and the exponential function. (Contributed by Steve Rodriguez, 25-Nov-2007.)
|- ((A e. RR+ /\ B e. RR) -> ((log` A) = B <-> (exp` B) = A))
 
Theoremlog1 9039 The natural logarithm of 1. One case of Property 1a of [Cohen] p. 301. (Contributed by Steve Rodriguez, 25-Nov-2007.)
|- (log` 1) = 0
 
Theoremloge 9040 The natural logarithm of e. One case of Property 1b of [Cohen] p. 301. (Contributed by Steve Rodriguez, 25-Nov-2007.)
|- (log` e) = 1
 
Theorempilog 9041 Relationship between pi and the natural logarithm function. (Contributed by Paul Chapman, 21-Apr-2008.)
|- pi = (i x. (log` -u1))
 
Theoremrelogoprlem 9042 Lemma for relogmul 9043 and relogdiv 9044. Remark of [Cohen] p. 301 ("The proof of Property 3 is quite similar to the proof given for Property 2").
 
Theoremrelogmul 9043 The natural logarithm of the product of two positive real numbers is the sum of natural logarithms. Property 2 of [Cohen] p. 301, restricted to natural logarithms. (Contributed by Steve Rodriguez, 25-Nov-2007.)
|- ((A e. RR+ /\ B e. RR+) -> (log` (A x. B)) = ((log` A) + (log` B)))
 
Theoremrelogdiv 9044 The natural logarithm of the quotient of two positive real numbers is the difference of natural logarithms. Exercise 72(a) and Property 3 of [Cohen] p. 301, restricted to natural logarithms. (Contributed by Steve Rodriguez, 25-Nov-2007.)
|- ((A e. RR+ /\ B e. RR+) -> (log` (A / B)) = ((log` A) - (log` B)))
 
Theoremexplog 9045 Exponentiation of a nonzero complex number to a nonnegative integer power. (Contributed by Paul Chapman, 21-Apr-2008.)
|- ((A e. CC /\ A =/= 0 /\ N e. NN0) -> (A^N) = (exp` (N x. (log` A))))
 
Theoremreexplog 9046 Exponentiation of a positive real number to a nonnegative integer power. (Contributed by Steve Rodriguez, 25-Nov-2007.)
|- ((A e. RR+ /\ N e. NN0) -> (A^N) = (exp` (N x. (log` A))))
 
Theoremrelogexp 9047 The natural logarithm of positive A raised to an nonnegative integer power. Property 4 of [Cohen] p. 301-302, restricted to natural logarithms and nonnegative-integer powers N. (Contributed by Steve Rodriguez, 25-Nov-2007.)
|- ((A e. RR+ /\ N e. NN0) -> (log` (A^N)) = (N x. (log`
 A)))
 
Theoremrelogiso 9048 The natural logarithm function on positive reals determines an isomorphism from the positive reals onto the reals. (Contributed by Steve Rodriguez, 25-Nov-2007.)
|- (log |` RR+) Isom < , < (RR+, RR)
 
Theoremlogltb 9049 The natural logarithm function on positive reals is strictly monotonic. (Contributed by Steve Rodriguez, 25-Nov-2007.)
|- ((A e. RR+ /\ B e. RR+) -> (A < B <-> (log` A) < (log` B)))
 
ZFC Set Theory plus the Tarksi-Grothendieck Axiom
 
Introduce the Tarksi-Grothendieck Axiom
 
Axiomax-groth 9050 The Tarksi-Grothendieck Axiom. For every set x there is an inaccessible cardinal y such that y is not in x. The addition of this axiom to ZFC set theory provides a framework for category theory, thus for all practical purposes giving us a complete foundation for "all of mathematics." This version of the axiom is used by the Mizar project (http://www.mizar.org/JFM/Axiomatics/tarski.html ). Unlike the ZFC axioms, this axiom is very long when expressed in terms of primitive symbols - see grothprim 9058. An open problem is finding a shorter equivalent.
|- E.y(x e. y /\ A.z e. y (A.w(w (_ z -> w e. y) /\ E.w e. y A.v(v (_ z -> v e. w)) /\ A.z(z (_ y -> (z ~~ y \/ z e. y)))
 
Theoremaxgroth2 9051 Alternate version of the Tarksi-Grothendieck Axiom.
|- E.y(x e. y /\ A.z e. y (A.w(w (_ z -> w e. y) /\ E.w e. y A.v(v (_ z -> v e. w)) /\ A.z(z (_ y -> (y ~<_ z \/ z e. y)))
 
Theoremaxgroth3 9052 Alternate version of the Tarksi-Grothendieck Axiom. ax-ac 4891 is used to derive this version.
|- E.y(x e. y /\ A.z e. y (A.w(w (_ z -> w e. y) /\ E.w e. y A.v(v (_ z -> v e. w)) /\ A.z(z (_ y -> ((y \ z) ~<_ z \/ z e. y)))
 
Theoremaxgroth4 9053 Alternate version of the Tarksi-Grothendieck Axiom. ax-ac 4891 is used to derive this version.
|- E.y(x e. y /\ A.z e. y E.v e. y A.w(w (_ z -> w e. (y i^i v)) /\ A.z(z (_ y -> ((y \ z) ~<_ z \/ z e. y)))
 
Theoremgrothinf 9054 The Tarksi-Grothendieck Axiom implies the Axiom of Infinity (in the form of omex 4773). Note that our proof does not depend on the Axiom of Infinity.
|- om e. V
 
Theoremgrothpw 9055 Derive the Axiom of Power Sets ax-pow 2819 from the Tarksi-Grothendieck axiom ax-groth 9050. That it follows is mentioned by Bob Solovay at http://www.cs.nyu.edu/pipermail/fom/2008-March/012783.html. Note that ax-pow 2819 is not used by the proof. (Contributed by Gérard Lang, 22-Jun-2009.)
|- E.yA.z(A.w(w e. z -> w e. x) -> z e. y)
 
Theoremaxgroth5 9056 The Tarski-Grothendieck axiom using abbreviations.
|- E.y(x e. y /\ A.z e. y (P~z (_ y /\ E.w e. y P~z (_ w) /\ A.z e. P~ y(z ~~ y \/ z e. y))
 
Theoremgrothprimlem 9057 Lemma for grothprim 9058. Expand the membership of an unordered pair into primitives.
 
Theoremgrothprim 9058 The Tarksi-Grothendieck Axiom ax-groth 9050 expanded into set theory primitives using 163 symbols. An open problem is whether a shorter equivalent exists (when expanded to primitives).
|- E.y(x e. y /\ A.z((z e. y -> E.v(v e. y /\ A.w(A.u(u e. w -> u e. z) -> (w e. y /\ w e. v)))) /\ E.w((w e. z -> w e. y) -> (A.v((v e. z -> E.tA.u(E.g(g e. w /\ A.h(h e. g <-> (h = v \/ h = u))) -> u = t)) /\ (v e. y -> (v e. z \/ E.u(u e. z /\ E.g(g e. w /\ A.h(h e. g <-> (h = u \/ h = v))))))) \/ z e. y))))
 
Humor
 
April Fool's theorem
 
Theoremavril1 9059 Poisson d'Avril's Theorem. This theorem is noted for its Selbstdokumentieren property, which means, literally, "self-documenting" and recalls the principle of quidquid germanus dictum sit, altum viditur, often used in set theory. Starting with the seemingly simple yet profound fact that any object x equals itself (proved by Tarski in 1965; see Lemma 6 of [Tarski] p. 68), we demonstrate that the power set of the real numbers, as a relation on the value of the imaginary unit, does not conjoin with an empty relation on the product of the additive and multiplicative identity elements, leading to this startling conclusion that has left even seasoned professional mathematicians scratching their heads. (Contributed by Prof. Loof Lirpa, 1-Apr-2005.)

A reply to skeptics can be found at http://us.metamath.org/mpegif/mmnotes.txt, under the 1-Apr-2006 entry.

|- -. (AP~RR(i` 1) /\ F(/)(0 x. 1))
 
Theorem2bornot2b 9060 The law of excluded middle. Act III, Theorem 1 of Shakespeare, Hamlet, Prince of Denmark (1602). Its author leaves its proof as an exercise for the reader - "To be, or not to be: that is the question" - starting a trend that has become standard in modern-day textbooks, serving to make the frustrated reader feel inferior, or in some cases to mask the fact that the author does not know its solution. (Contributed by Prof. Loof Lirpa, 1-Apr-2006.)
|- (2 x. B \/ -. 2 x. B)
 
Theoremhelloworld 9061 The classic "Hello world" benchmark has been translated into 314 computer programming languages - see http://www.roesler-ac.de/wolfram/hello.htm. However, for many years it eluded a proof that it is more than just a conjecture, even though a wily mathematician once claimed, "I have discovered a truly marvelous proof of this, which this margin is too narrow to contain." Using an IBM 709 mainframe, a team of mathematicians led by Prof. Loof Lirpa, at the New College of Tahiti, were finally able put it rest with a remarkably short proof only 4 lines long. (Contributed by Prof. Loof Lirpa, 1-Apr-2007.)
|- -. (h e. (LL0) /\ W(/)(R.1d))
 
Theorem1p1e2 9062 One plus one equals two. Using proof-shortening techniques pioneered by Mr. Mel O'Cat, along with the latest supercomputer technology, Prof. Loof Lirpa and colleagues were able to shorten Whitehead and Russell's 360-page proof that 1+1=2 in Principia Mathematica to this remarkable proof only two steps long, thus establishing a new world's record for this famous theorem. (Contributed by Prof. Loof Lirpa, 1-Apr-2008.)
|- (1 + 1) = 2
 
Theoremeqid1 9063 Law of identity (reflexivity of class equality). Theorem 6.4 of [Quine] p. 41.

This law is thought to have originated with Aristotle (Metaphysics, Book VII, Part 17). It is one of the three axioms of Ayn Rand's philosophy (Atlas Shrugged, Part Three, Chapter VII). While some have proposed extending Rand's axiomatization to include Compassion and Kindness, others fear that such an extension may flirt with logical inconsistency. (Thanks to Stefan Allan and Prof. Loof Lirpa for this information.)

|- A = A
 
Hilbert Space Explorer
 
Syntaxchil 9064 Extend class notation with Hilbert vector space.
class H~
 
Syntaxcva 9065 Extend class notation with vector addition in Hilbert space. In the literature, the subscript "v" is omitted, but we need it to avoid ambiguity with complex number addition + caddc 5392.
class +h
 
Syntaxcsm 9066 Extend class notation with scalar multiplication in Hilbert space. In the literature scalar multiplication is usually indicated by juxtaposition, but we need an explicit symbol to prevent ambiguity.
class .h
 
Syntaxc0v 9067 Extend class notation with zero vector in Hilbert space.
class 0h
 
Syntaxcmv 9068 Extend class notation with vector subtraction in Hilbert space.
class -h
 
Syntaxcsp 9069 Extend class notation with inner (scalar) product in Hilbert space. In the literature, the inner product of A and B is usually written <.A, B>. but our operation notation allows us to use existing theorems about operations and also eliminates ambiguity with the definition of an ordered pair df-op 2475.
class .ih
 
Syntaxcno 9070 Extend class notation with the norm function in Hilbert space. In the literature, the norm of A is usually written "|| A ||", but we use function notation to take advantage of our existing theorems about functions.
class normh
 
Syntaxccau 9071 Extend class notation with set of Cauchy sequences in Hilbert space.
class Cauchy
 
Syntaxchli 9072 Extend class notation with convergence relation in Hilbert space.
class ~~>v
 
Syntaxcsh 9073 Extend class notation with set of subspaces of a Hilbert space.
class SH
 
Syntaxcch 9074 Extend class notation with set of closed subspaces of a Hilbert space.
class CH
 
Syntaxcort 9075 Extend class notation with orthogonal complement in CH.
class _|_
 
Syntaxcph 9076 Extend class notation with subspace sum in CH.
class +H
 
Syntaxcspn 9077 Extend class notation with subspace span in CH.
class span
 
Syntaxchj 9078 Extend class notation with join in CH.
class vH
 
Syntaxchsup 9079 Extend class notation with supremum of a collection in CH.
class \/H
 
Syntaxc0h 9080 Extend class notation with zero of CH.
class 0H
 
Syntaxccm 9081 Extend class notation with the commutes relation on a Hilbert lattice.
class C_H
 
Syntaxcpj 9082 Extend class notation with set of projections on a Hilbert space.
class proj
 
Syntaxchos 9083 Extend class notation with sum of Hilbert space operators.
class +op
 
Syntaxchot 9084 Extend class notation with scalar product of a Hilbert space operator.
class .op
 
Syntaxchod 9085 Extend class notation with difference of Hilbert space operators.
class -op
 
Syntaxchfs 9086 Extend class notation with sum of Hilbert space functionals.
class +fn
 
Syntaxchft 9087 Extend class notation with scalar product of Hilbert space functional.
class .fn
 
Syntaxch0o 9088 Extend class notation with the Hilbert space zero operator.
class 0hop
 
Syntaxchio 9089 Extend class notation with Hilbert space identity operator.
class Iop
 
Syntaxcnop 9090 Extend class notation with the operator norm function.
class normop
 
Syntaxcco 9091 Extend class notation with set of continuous Hilbert space operators.
class ConOp
 
Syntaxclo 9092 Extend class notation with set of linear Hilbert space operators.
class LinOp
 
Syntaxcbo 9093 Extend class notation with set of bounded linear operators.
class BndLinOp
 
Syntaxcuo 9094 Extend class notation with set of unitary Hilbert space operators.
class UniOp
 
Syntaxcho 9095 Extend class notation with set of Hermitian Hilbert space operators.
class HrmOp
 
Syntaxcnmf 9096 Extend class notation with the functional norm function.
class normfn
 
Syntaxcnl 9097 Extend class notation with the functional nullspace function.
class null
 
Syntaxccnf 9098 Extend class notation with set of continuous Hilbert space functionals.
class ConFn
 
Syntaxclf 9099 Extend class notation with set of linear Hilbert space functionals.
class LinFn
 
Syntaxcado 9100 Extend class notation with Hilbert space adjoint function.
class adjh

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