# The Unapologetic Mathematician

## Orthogonal transformations

Given a form on a vector space $V$ represented by the transformation $B$ and a linear map $T:V\rightarrow V$, we’ve seen how to transform $B$ by the action of $T$. That is, the space of all bilinear forms is a vector space which carries a representation of $\mathrm{GL}(V)$. But given a particular form $B$, what is the stabilizer of $B$? That is, what transformations in $\mathrm{GL}(V)$ send $B$ back to itself.

Before we answer this, let’s look at it in a slightly different way. Given a form $B$ we have a way of pairing vectors in $V$ to get scalars. On the other hand, if we have a transformation $T$ we could use it on the vectors before pairing them. We’re looking for those transformations so that for every pair of vectors the result of the pairing by $B$ is the same before and after applying $T$.

So let’s look at the action we described last time: the form $B$ is sent to $T^*BT$. So we’re looking for all $T$ so that

$\displaystyle T^*BT=B$

We say that such a transformation is $B$-orthogonal, and the subgroup of all such transformations is the “orthogonal group” $\mathrm{O}(V,B)\subseteq \mathrm{GL}(V)$. Sometimes, since the vector space $V$ is sort of implicit in the form $B$, we abbreviate the group to $\mathrm{O}(B)$.

Now there’s one particular orthogonal group that’s particularly useful. If we’ve got an inner-product space $V$ (the setup for having our bra-ket notation) then the inner product itself is a form, and it’s described by the identity transformation. That is, the orthogonality condition in this case is that

$\displaystyle T^*T=I_V$

A transformation is orthogonal if its adjoint is the same as its inverse. This is the version of orthogonality that we’re most familiar with. Commonly, when we say that a transformation is “orthogonal” with no qualification about what form we’re using, we just mean that this condition holds.

Let’s take a look at this last condition geometrically. We use the inner product to define a notion of (squared-)length $\langle v\vert v\rangle$ and a notion of (the cosine of) angle $\langle w\vert v\rangle$. So let’s transform the space by $T$ and see what happens to our inner product, and thus to lengths and angles.

$\displaystyle\langle T(w)\vert T(v)\rangle=\langle w\rvert T^*T\lvert v\rangle$

First off, note that no matter what $T$ we use, the transformation in the middle is self-adjoint and positive-definite, and so the new form is symmetric and positive-definite, and thus defines another inner product. But when is it the same inner product? When $T^*T=I_V$, of course! For then we have

$\displaystyle\langle T(w)\vert T(v)\rangle=\langle w\rvert T^*T\lvert v\rangle=\langle w\rvert I_V\lvert v\rangle=\langle w\vert v\rangle$

So orthogonal transformations are exactly those which preserve the notions of length and angle defined by the inner product. Geometrically, they correspond to rotations and reflections that change orientations, but leave lengths of vectors the same, and leave the angle between any pair of vectors the same.

About these ads

### Like this:

Like Loading...

Posted by John Armstrong | Algebra, Linear Algebra

## 9 Comments	»

1. [...] Unitary transformations are like orthogonal transformations, except we’re working with a complex inner product space. We’ll focus on just the [...]

Pingback by | July 28, 2009 | Reply

2. [...] and Orthogonal Matrices Let’s see what happens when we take a unitary or orthogonal transformation and turn it into a matrix by picking a basis for our vector [...]

Pingback by | July 29, 2009 | Reply

3. [...] of Unitary and Orthogonal Transformations Okay, we’ve got groups of unitary and orthogonal transformations (and the latter we can generalize to groups of matrices over arbitrary fields. [...]

Pingback by | July 31, 2009 | Reply

4. [...] All the transformations in our analogy — self-adjoint and unitary (or orthogonal), and even anti-self-adjoint (antisymmetric and “skew-Hermitian”) transformations [...]

Pingback by | August 5, 2009 | Reply

5. [...] over whose transpose and inverse are the same, which is related to the orthogonal group of orthogonal transformations of the real vector space preserving a specified bilinear form . Lastly, [...]

Pingback by | September 8, 2009 | Reply

6. [...] We can choose one, but there’s a whole family of other equally valid choices related by orthogonal transformations. Ideally, we should define things which don’t depend on this choice at all. If we must make a [...]

Pingback by | September 22, 2009 | Reply

7. [...] and inner product-preserving transformations, but we can also throw in reflections to get the whole orthogonal group, of all transformations from one orthonormal basis to [...]

Pingback by | November 10, 2009 | Reply

8. [...] Now that we’ve got our playing field down, we need to define a reflection. This will be an orthogonal transformation, which is just a fancy way of saying “preserves lengths and angles”. What makes it a [...]

Pingback by | January 18, 2010 | Reply

9. [...] if the form is invariant for the representation , then the image of is actually contained in the orthogonal group: [...]

Pingback by | September 27, 2010 | Reply

« Previous | Next »

## About this weblog

This is mainly an expository blath, with occasional high-level excursions, humorous observations, rants, and musings. The main-line exposition should be accessible to the “Generally Interested Lay Audience”, as long as you trace the links back towards the basics. Check the sidebar for specific topics (under “Categories”).

I’m in the process of tweaking some aspects of the site to make it easier to refer back to older topics, so try to make the best of it for now.

• ## RSS Feeds

RSS - Posts

RSS - Comments

• ## Feedback

Got something to say? Anonymous questions, comments, and suggestions at Formspring.me!
%d bloggers like this:
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 33, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.906356155872345, "perplexity_flag": "head"}