Locally free sheaf: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>777sms
No edit summary
 
en>Addbot
m Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q6664699
 
Line 1: Line 1:
The name of the writer is Numbers but it's not [http://xrambo.com/user/RKDBG over the counter std test] most masucline name out there. Hiring is his profession. His wife doesn't like it the way he does but what he truly likes performing is to do aerobics and he's been performing it for fairly a while. California is exactly where her home is but she needs to move simply because of her family.
A '''complex Hadamard matrix''' is any [[complex number|complex]]
<math>N \times N</math> [[matrix (mathematics)|matrix]]  <math>H</math> satisfying two conditions:
 
*unimodularity (the modulus of each entry is unity): <math>|H_{jk}|=1 {\quad \rm for \quad} j,k=1,2,\dots,N </math>
 
*[[orthogonal matrix|orthogonality]]: <math>HH^{\dagger} = N \; {\mathbb I} </math>,
 
where  <math> {\dagger} </math> denotes the Hermitian transpose of ''H'' and <math> {\mathbb I} </math> is the identity matrix.  The concept is a generalization of the [[Hadamard matrix]]. Note that any complex Hadamard matrix <math>H</math> can be made into a [[unitary matrix]] by multiplying it by <math>\frac{1}{\sqrt{N}}</math>; conversely, any unitary matrix whose entries all have modulus <math>\frac{1}{\sqrt{N}}</math> becomes a complex Hadamard upon multiplication by <math>\sqrt{N}</math>.
 
Complex Hadamard matrices arise in the study  of [[operator algebra]]s and the theory of [[quantum computation]].  Real Hadamard matrices and [[Butson-type Hadamard matrix|Butson-type Hadamard matrices]] form particular cases of complex Hadamard matrices.
 
Complex Hadamard matrices exist for any natural ''N'' (compare the real case, in which existence is not known for every ''N''). For instance the [[Fourier matrix|Fourier matrices]]
 
:<math> [F_N]_{jk}:= \exp[(2\pi i(j - 1)(k - 1) / N]
{\quad \rm for \quad} j,k=1,2,\dots,N </math>
 
belong to this class.
 
==Equivalency==
Two complex Hadamard matrices are called equivalent, written <math>H_1 \simeq H_2</math>, if there exist diagonal [[unitary matrix|unitary matrices]] <math>D_1, D_2</math> and [[permutation matrix|permutation matrices]] <math>P_1, P_2</math>
such that
 
:<math> H_1 = D_1 P_1 H_2 P_2 D_2. </math>
 
Any complex Hadamard matrix is equivalent to a '''dephased''' Hadamard matrix, in which all elements  in the first row and first column are equal to unity.
 
For <math>N=2,3</math> and <math> 5</math> all complex Hadamard matrices are equivalent to the Fourier matrix <math>F_{N}</math>. For <math>N=4</math> there exists
a continuous, one-parameter family of inequivalent complex Hadamard matrices,
 
:<math> F_{4}^{(1)}(a):=
\begin{bmatrix} 1 & 1      & 1  & 1 \\
                1 & ie^{ia} & -1 & -ie^{ia} \\
                1 & -1      & 1  &-1 \\
                1 & -ie^{ia}& -1 & i e^{ia}
\end{bmatrix}
{\quad \rm with \quad } a\in [0,\pi) . </math>
 
For <math>N=6</math> the following families of complex Hadamard matrices
are known:
 
* a single two-parameter family which includes <math>F_6</math>,
* a single one-parameter family <math>D_6(t)</math>,
* a one-parameter orbit <math>B_6(\theta)</math>, including the circulant Hadamard matrix <math>C_6</math>,
* a two-parameter orbit including the previous two examples <math>X_6(\alpha)</math>,
* a one-parameter orbit <math>M_6(x)</math> of symmetric matrices,
* a two-parameter orbit including the previous example <math>K_6(x,y)</math>,
* a three-parameter orbit including all the previous examples <math>K_6(x,y,z)</math>,
* a further construction with four degrees of freedom, <math>G_6</math>, yielding other examples than <math>K_6(x,y,z)</math>,
* a single point - one  of the Butson-type Hadamard matrices, <math>S_6 \in H(3,6)</math>.  
 
It is not known, however, if this list is complete, but it is conjectured that <math>K_6(x,y,z),G_6,S_6</math> is an exhaustive (but not necessarily irredundant) list of all complex Hadamard matrices of order 6.
 
== References ==
*U. Haagerup, Orthogonal maximal abelian *-subalgebras of the n×n matrices and cyclic n-roots, Operator Algebras and Quantum Field Theory (Rome), 1996 (Cambridge, MA: International Press) pp 296-322.
*P. Dita, Some results on the parametrization of complex Hadamard matrices, J. Phys. A: Math. Gen. 37, 5355-5374 (2004).
*F. Szollosi, A two-parametric family of complex Hadamard matrices of order 6 induced by hypocycloids, preprint, [http://arxiv.org/abs/0811.3930v2 arXiv:0811.3930v2] [math.OA]
*W. Tadej and [[Karol_Życzkowski|K. Życzkowski]], A concise guide to complex Hadamard matrices Open Systems & Infor. Dyn. 13 133-177 (2006)
 
== External links ==
*For an explicit list of known <math>N=6</math> complex Hadamard matrices and several examples of Hadamard matrices of size 7-16 see [http://chaos.if.uj.edu.pl/~karol/hadamard/ Catalogue of Complex Hadamard Matrices]
 
[[Category:Matrices]]

Latest revision as of 15:16, 15 March 2013

A complex Hadamard matrix is any complex N×N matrix H satisfying two conditions:

where denotes the Hermitian transpose of H and 𝕀 is the identity matrix. The concept is a generalization of the Hadamard matrix. Note that any complex Hadamard matrix H can be made into a unitary matrix by multiplying it by 1N; conversely, any unitary matrix whose entries all have modulus 1N becomes a complex Hadamard upon multiplication by N.

Complex Hadamard matrices arise in the study of operator algebras and the theory of quantum computation. Real Hadamard matrices and Butson-type Hadamard matrices form particular cases of complex Hadamard matrices.

Complex Hadamard matrices exist for any natural N (compare the real case, in which existence is not known for every N). For instance the Fourier matrices

[FN]jk:=exp[(2πi(j1)(k1)/N]forj,k=1,2,,N

belong to this class.

Equivalency

Two complex Hadamard matrices are called equivalent, written H1H2, if there exist diagonal unitary matrices D1,D2 and permutation matrices P1,P2 such that

H1=D1P1H2P2D2.

Any complex Hadamard matrix is equivalent to a dephased Hadamard matrix, in which all elements in the first row and first column are equal to unity.

For N=2,3 and 5 all complex Hadamard matrices are equivalent to the Fourier matrix FN. For N=4 there exists a continuous, one-parameter family of inequivalent complex Hadamard matrices,

F4(1)(a):=[11111ieia1ieia11111ieia1ieia]witha[0,π).

For N=6 the following families of complex Hadamard matrices are known:

  • a single two-parameter family which includes F6,
  • a single one-parameter family D6(t),
  • a one-parameter orbit B6(θ), including the circulant Hadamard matrix C6,
  • a two-parameter orbit including the previous two examples X6(α),
  • a one-parameter orbit M6(x) of symmetric matrices,
  • a two-parameter orbit including the previous example K6(x,y),
  • a three-parameter orbit including all the previous examples K6(x,y,z),
  • a further construction with four degrees of freedom, G6, yielding other examples than K6(x,y,z),
  • a single point - one of the Butson-type Hadamard matrices, S6H(3,6).

It is not known, however, if this list is complete, but it is conjectured that K6(x,y,z),G6,S6 is an exhaustive (but not necessarily irredundant) list of all complex Hadamard matrices of order 6.

References

  • U. Haagerup, Orthogonal maximal abelian *-subalgebras of the n×n matrices and cyclic n-roots, Operator Algebras and Quantum Field Theory (Rome), 1996 (Cambridge, MA: International Press) pp 296-322.
  • P. Dita, Some results on the parametrization of complex Hadamard matrices, J. Phys. A: Math. Gen. 37, 5355-5374 (2004).
  • F. Szollosi, A two-parametric family of complex Hadamard matrices of order 6 induced by hypocycloids, preprint, arXiv:0811.3930v2 [math.OA]
  • W. Tadej and K. Życzkowski, A concise guide to complex Hadamard matrices Open Systems & Infor. Dyn. 13 133-177 (2006)

External links