Transpose in the context of Special orthogonal group


Transpose in the context of Special orthogonal group

Transpose Study page number 1 of 1

Play TriviaQuestions Online!

or

Skip to study material about Transpose in the context of "Special orthogonal group"


⭐ Core Definition: Transpose

In linear algebra, the transpose of a matrix is an operator that flips a matrix over its diagonal;that is, transposition switches the row and column indices of the matrix A to produce another matrix, often denoted A (among other notations).

The transpose of a matrix was introduced in 1858 by the British mathematician Arthur Cayley.

↓ Menu
HINT:

πŸ‘‰ Transpose in the context of Special orthogonal group

In mathematics, the orthogonal group in dimension n, denoted O(n), is the group of distance-preserving transformations of a Euclidean space of dimension n that preserve a fixed point, where the group operation is given by composing transformations. The orthogonal group is sometimes called the general orthogonal group, by analogy with the general linear group. Equivalently, it is the group of n Γ— n orthogonal matrices, where the group operation is given by matrix multiplication (an orthogonal matrix is a real matrix whose inverse equals its transpose). The orthogonal group is an algebraic group and a Lie group. It is compact.

The orthogonal group in dimension n has two connected components. The one that contains the identity element is a normal subgroup, called the special orthogonal group, and denoted SO(n). It consists of all orthogonal matrices of determinant 1. This group is also called the rotation group, generalizing the fact that in dimensions 2 and 3, its elements are the usual rotations around a point (in dimension 2) or a line (in dimension 3). In low dimension, these groups have been widely studied, see SO(2), SO(3) and SO(4). The other component consists of all orthogonal matrices of determinant βˆ’1. This component does not form a group, as the product of any two of its elements is of determinant 1, and therefore not an element of the component.

↓ Explore More Topics
In this Dossier

Transpose in the context of Unary operation

In mathematics, a unary operation is an operation with only one operand, i.e. a single input. This is in contrast to binary operations, which use two operands. An example is any function ⁠⁠, where A is a set; the function ⁠⁠ is a unary operation on A.

Common notations are prefix notation (e.g. Β¬, βˆ’), postfix notation (e.g. factorial n!), functional notation (e.g. sin x or sin(x)), and superscripts (e.g. transpose A). Other notations exist as well, for example, in the case of the square root, a horizontal bar extending the square root sign over the argument can indicate the extent of the argument.

View the full Wikipedia page for Unary operation
↑ Return to Menu

Transpose in the context of Square matrix

In mathematics, a square matrix is a matrix with the same number of rows and columns. An n-by-n matrix is known as a square matrix of order . Any two square matrices of the same order can be added and multiplied.

Square matrices are often used to represent simple linear transformations, such as shearing or rotation. For example, if is a square matrix representing a rotation (rotation matrix) and is a column vector describing the position of a point in space, the product yields another column vector describing the position of that point after that rotation. If is a row vector, the same transformation can be obtained using , where is the transpose of .

View the full Wikipedia page for Square matrix
↑ Return to Menu

Transpose in the context of Linear algebraic group

In mathematics, a linear algebraic group is a subgroup of the group of invertible matrices (under matrix multiplication) that is defined by polynomial equations. An example is the orthogonal group, defined by the relation where is the transpose of .

Many Lie groups can be viewed as linear algebraic groups over the field of real or complex numbers. (For example, every compact Lie group can be regarded as a linear algebraic group over R (necessarily R-anisotropic and reductive), as can many noncompact groups such as the simple Lie group SL(n,R).) The simple Lie groups were classified by Wilhelm Killing and Γ‰lie Cartan in the 1880s and 1890s. At that time, no special use was made of the fact that the group structure can be defined by polynomials, that is, that these are algebraic groups. The founders of the theory of algebraic groups include Maurer, Chevalley, and KolchinΒ (1948). In the 1950s, Armand Borel constructed much of the theory of algebraic groups as it exists today.

View the full Wikipedia page for Linear algebraic group
↑ Return to Menu