On hermitian functions over real numbers, complex numbers or real quaternions

1970 ◽  
Author(s):  
Yik-hoi Au-Yeung
1971 ◽  
Vol 70 (3) ◽  
pp. 383-386 ◽  
Author(s):  
Yik-Hoi Au-Yeung

We denote by F the field R of real numbers, the field C of complex numbers, or the skew-field H of real quaternions, and by Fn an n-dimensional left vector space over F. If A is a matrix with elements in F, we denote by A* its conjugate transpose. In all three cases of F, an n × n matrix A is said to be Hermitian if A = A* and unitary if AA* = In, where In is the n × n identity matrix. An n × n Hermitian matrix A is said to be positive definite (postive semi-definite resp.) if uAu* > 0(uAu* ≥ 0 resp.) for all u (╪ 0) in Fn. Here and in what follows we regard u as a 1 × n matrix and identify a 1 × 1 matrix with its single element. In the following we shall always use A and B to denote two n×n Hermitian matrices with elements in F, and we say that A and B can be diagonalized simultaneously if there exists an n×n non-singular matrix V with elements in F such that VAV* and VBV* are diagonal matrices. We shall use diag {A1, A2} to denote a diagonal block matrix with the square matrices A1 and A2 lying on its diagonal.


1974 ◽  
Vol 15 (1) ◽  
pp. 1-4
Author(s):  
Yik-Hoi Au-Yeung ◽  
Tai-Kwok Yuen

We denote by F the field R of real numbers, the field C of complex numbers or the skew-field H of real quaternions, and by Fn an n-dimensional left vector space over F. If A is a matrix with elements in F, we denote by A* its conjugate transpose. In all three cases of F, an n × n matrix A is said to be hermitian (unitary resp.) if A = A* (AA*= identity matrix resp.). An n ×x n hermitian matrix A is said to be definite (semidefinite resp.) if uAu*vAv* ≥ 0 (uAu*vAv* ≧ 0 resp.) for all nonzero u and v in Fn. If A and B are n × n hermitian matrices, then we say that A and B can be diagonalized simultaneously into blocks of size less than or equal to m (abbreviated to d. s. ≧ m) if there exists a nonsingular matrix U with elements in F such that UAU* = diag{A1,…, Ak} and UBU* = diag{B1…, Bk}, where, for each i = 1, …, k, Ai and Bk are of the same size and the size is ≧ m. In particular, if m = 1, then we say A and B can be diagonalized simultaneously (abbreviated to d. s.).


1951 ◽  
Vol 47 (3) ◽  
pp. 473-474 ◽  
Author(s):  
R. E. Edwards

1. Mazur(1) has shown that any normed algebra A over the real field in which the norm is multiplicative in the sense thatis equivalent (i.e. algebraically isomorphic and isometric under one and the same mapping) to one of the following algebras: (i) the real numbers, (ii) the complex numbers, (iii) the real quaternions, each of these sets being regarded as normed algebras over the real field. Completeness of A is not assumed by Mazur. A relevant discussion is given also in Lorch (2).


1970 ◽  
Vol 11 (1) ◽  
pp. 81-83 ◽  
Author(s):  
Yik-Hoi Au-Yeung

We denote by F the field R of real numbers, the field C of complex numbers, or the skew field H of real quaternions, and by Fn an n dimensional left vector space over F. If A is a matrix with elements in F, we denote by A* its conjugate transpose. In all three cases of F, an n × n matrix A is said to be hermitian if A = A*, and we say that two n × n hermitian matrices A and B with elements in F can be diagonalized simultaneously if there exists a non singular matrix U with elements in F such that UAU* and UBU* are diagonal matrices. We shall regard a vector u ∈ Fn as a l × n matrix and identify a 1 × 1 matrix with its single element, and we shall denote by diag {A1, …, Am} a diagonal block matrix with the square matrices A1, …, Am lying on its diagonal.


Author(s):  
Arthur Benjamin ◽  
Gary Chartrand ◽  
Ping Zhang

This chapter considers Hamiltonian graphs, a class of graphs named for nineteenth-century physicist and mathematician Sir William Rowan Hamilton. In 1835 Hamilton discovered that complex numbers could be represented as ordered pairs of real numbers. That is, a complex number a + b i (where a and b are real numbers) could be treated as the ordered pair (a, b). Here the number i has the property that i² = -1. Consequently, while the equation x² = -1 has no real number solutions, this equation has two solutions that are complex numbers, namely i and -i. The chapter first examines Hamilton's icosian calculus and Icosian Game, which has a version called Traveller's Dodecahedron or Voyage Round the World, before concluding with an analysis of the Knight's Tour Puzzle, the conditions that make a given graph Hamiltonian, and the Traveling Salesman Problem.


1969 ◽  
Vol 21 ◽  
pp. 1309-1318 ◽  
Author(s):  
James Stewart

Let G be an abelian group, written additively. A complexvalued function ƒ, defined on G, is said to be positive definite if the inequality1holds for every choice of complex numbers C1, …, cn and S1, …, sn in G. It follows directly from (1) that every positive definite function is bounded. Weil (9, p. 122) and Raïkov (5) proved that every continuous positive definite function on a locally compact abelian group is the Fourier-Stieltjes transform of a bounded positive measure, thus generalizing theorems of Herglotz (4) (G = Z, the integers) and Bochner (1) (G = R, the real numbers).If ƒ is a continuous function, then condition (1) is equivalent to the condition that2


1993 ◽  
Vol 2 (3) ◽  
pp. 77-106 ◽  
Author(s):  
Harry H. Cheng

The handling of complex numbers in the CHprogramming language will be described in this paper. Complex is a built-in data type in CH. The I/O, arithmetic and relational operations, and built-in mathematical functions are defined for both regular complex numbers and complex metanumbers of ComplexZero, Complexlnf, and ComplexNaN. Due to polymorphism, the syntax of complex arithmetic and relational operations and built-in mathematical functions are the same as those for real numbers. Besides polymorphism, the built-in mathematical functions are implemented with a variable number of arguments that greatly simplify computations of different branches of multiple-valued complex functions. The valid lvalues related to complex numbers are defined. Rationales for the design of complex features in CHare discussed from language design, implementation, and application points of views. Sample CHprograms show that a computer language that does not distinguish the sign of zeros in complex numbers can also handle the branch cuts of multiple-valued complex functions effectively so long as it is appropriately designed and implemented.


Author(s):  
Алексеенко ◽  
A. Alekseenko ◽  
Лихачева ◽  
M. Likhacheva

The article is devoted to the study of the peculiarities of real numbers in the discipline "Algebra and analysis" in the secondary school. The theme of "Real numbers" is not easy to understand and often causes difficulties for students. However, the study of this topic is now being given enough attention and time. The consequence is a lack of understanding of students and school-leavers, what constitutes the real numbers, irrational numbers. At the same time the notion of a real number is required for further successful study of mathematics. To improve the efficiency of studying the topic and form a clear idea about the different numbers offered to add significantly to the material of modern textbooks, increase the number of hours in the study of real numbers, as well as to include in the school course of algebra topics "Complex numbers" and "Algebraic structures".


2013 ◽  
Vol 11 (01) ◽  
pp. 1350001 ◽  
Author(s):  
MATTHEW McKAGUE

We consider the power of various quantum complexity classes with the restriction that states and operators are defined over a real, rather than complex, Hilbert space. It is well known that a quantum circuit over the complex numbers can be transformed into a quantum circuit over the real numbers with the addition of a single qubit. This implies that BQP retains its power when restricted to using states and operations over the reals. We show that the same is true for QMA (k), QIP (k), QMIP and QSZK.


2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Mengji Shi ◽  
Kaiyu Qin

This paper solves control problems of agents achieving consensus motions in presence of nonuniform time delays by obtaining the maximal tolerable delay value. Two types of consensus motions are considered: the rectilinear motion and the rotational motion. Unlike former results, this paper has remarkably reduced conservativeness of the consensus conditions provided in such form: for each system, if all the nonuniform time delays are bounded by the maximal tolerable delay value which is referred to as “delay margin,” the system will achieve consensus motion; otherwise, if all the delays exceed the delay margin, the system will be unstable. When discussing the system which is intended to achieve rotational consensus motion, an expanded system whose state variables are real numbers (those of the original system are complex numbers) is introduced, and corresponding consensus condition is given also in the form of delay margin. Numerical examples are provided to illustrate the results.


Sign in / Sign up

Export Citation Format

Share Document