If f and g are orthogonal, are f* and g orthogonal?

  • Thread starter Thread starter Aziza
  • Start date Start date
  • Tags Tags
    Orthogonal
Aziza
Messages
189
Reaction score
1
I am curious:

if f and g are (complex) orthogonal functions, are f* and g also orthogonal? (* denotes complex conjugate).

I would think the answer is no, in general, but I just want to confirm
 
Physics news on Phys.org
What are you integrating over and what functions are you allowed?

For example if you're integrating over the unit circle and all you ask for are integrable functions, then if f = 1/sqrt(z) and g = 1/sqrt(z) (where z has an argument between 0 and 2pi), then
\oint fg dz = 2\pi i
but
\oint f^* g dz = \oint 1 dz = 0

So f and g are orthogonal, but f* and g are not.
 
Last edited:
  • Like
Likes 1 person
A simpler example for f,g\in \mathbb C^2, (which we could write as f,g: \{1,2\}\to \mathbb C if you like):

Let f:= (1,i), g:=(1,-i). Then \langle f, g \rangle = (1)(\overline{1})+(i)(\overline{-i}) = (1)(1)+ (i)(i) = 0, and \langle f^*, g \rangle = (\overline{1})(\overline{1})+(\overline{i})(\overline{-i}) = (1)(1)+ (-i)(i) = 2\neq 0, so that f,g are orthogonal, but f^*,g aren't.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top