Discrete time system that is homogenous but not additive

Talltunetalk
Messages
8
Reaction score
0
I have just started working with discrete time signals, more specifically various system properties. I am wondering if their is a discrete time system that is homogeneous but not additive? This is basically testing the linearity of a signal with the additive and homogeneous criteria.
 
Physics news on Phys.org
What does homogeneous mean in this context? Simple examples of non-additive systems would be ##x \mapsto x^2##, ##x \mapsto \sin(x)## and so forth.
 
T{x1[n] +x2[n]} = T{x1[n]} + T{x2[n]}

It is using linear to algebra to see if the system is linear. It has to be both have the additivity and homogeneous/scaling property
 
What if you define something like
$$T(x[n]) = \begin{cases}x[n] & \text{ if }x[0] \neq x[1] \\
0 & \text{ if }x[0] = x[1]\end{cases}$$
In other words, ##T## maps the sequence ##\{x[n]\}## to itself if ##x[0] \neq x[1]##, and it maps ##\{x[n]\}## to the zero sequence if ##x[0] = x[1]##.

Verification that ##T## is homogeneous is straightforward.

Case 1: ##c = 0##. Then clearly ##cx[0] = cx[1]##, so ##T(cx[n]) = 0 = cT(x[n])##.

Case 2: ##c \neq 0## and ##x[0] \neq x[1]##. Then ##cx[0] \neq cx[1]##, so ##T(cx[n]) = cx[n] = cT(x[n])##.

Case 3: ##c \neq 0## and ##x[0] = x[1]##. Then ##cx[0] = cx[1]##, so ##T(cx[n]) = 0 = cT(x[n])##.

On the other hand, ##T## is not additive. For example, let
$$x_1[n] = \begin{cases}1 & \text{ if }n = 0 \\
0 & \text{ if }n \neq 0\end{cases}$$
$$x_2[n] = \begin{cases}1 & \text{ if }n = 1 \\
0 & \text{ if }n \neq 1\end{cases}$$
Then ##T## maps ##\{x_1[n]\}## to itself, and ##\{x_2[n]\}## to itself, but ##T## maps ##\{x_1[n] + x_2[n]\}## to the zero sequence.
 
##\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

Replies
10
Views
947
Replies
0
Views
2K
Replies
5
Views
2K
Replies
4
Views
2K
Replies
9
Views
2K
Back
Top