ALGEBRAIC STRUCTURES

MIKE FOWLER

1. Tensor SVD 1.1. Fourier Transform. Given a complex valued function f and its sequence of values on a discrete time domain, denoted fk = (f0 , f1 , f2 , . . . , fn 1) where each fi = f (ti ) for t = 0, 1, 2, . . . n 1, we can dene the discrete fourier transform (DFT) of f , f as fk = (f0 , f1 , f2 , . . . , fn1 ), where
n1

fk =
a=0

fa e

2iak n

Likewise, we can move from the fourier domain back into the time domain using the inverse discrete fourier transform (IDFT) which is given by fa = 1 n
n1

fk e
k=0

2ika n

Given a fourier sequence fk with the property |fj |2 = 1 for each k {0, . . . , n 1}, we can use the IDFT to get the time domain sequence fk . If we let be an anti-homomorphism acting on fk and let gk = (fk ) = (f0 , fn1 , fn2 . . . f1 ). We want the convolution hk = gk fk = (1, 0, 0, . . . , 0), and we know that the convolution of two sequences is equal to the point wise product of their fourier sequences, or that (1) g f = g f.
1

MIKE FOWLER

Now, we have for gk that

n1

gk =
a=0

ga e

2iak n

n1

=
a=0 n1

2iak fna e n

=
a=0 n1

2iak fa e n
2iak n

=
a=0

fa e

= fk . Now, combining this with (1), we have that hk = gk fk = (g0 f0 , g1 f1 , . . . , gn1 fn1 ) = (f0 f0 , f1 f1 , . . . , fn1 fn1 ) = (1, 1, . . . , 1). Lastly, we have that 1 hk = n
n1 a=0

1 2iak ha e n = n

n1

e
a=0

2iak n

= 0,k .

This is a generalization of Kilmer et al. orthogonal tensor relationship given by U T U = I.