Let y=Ax. A is a matrix n by m and m>n. Also, x gets its values from a finite alphabet. How can i show if the mapping from x to y is injective for given A and alphabet (beside a search method)?(adsbygoogle = window.adsbygoogle || []).push({});

For example, let A and the alphabet be

[1 0 1/sqrt2 1/sqrt2]

[0 1 1/sqrt2 -1/sqrt2]

and

{1, -1}

respectively. For this alphabet, x can be [1 1 -1 -1]'. Actually, there are 2^m=16 possible options for x, considering all permutations. Using this permutation set and A matrix, the operation will be one-to-one even if we map larger space to smaller space! Indeed, it is possible to test the injectivity with this scale. However, when we have larger matrices, search algorithm (i.e., testing all mappings) would take very long. If i can, i would like to verify it without a search algorithm.

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Injective Mapping

Loading...

Similar Threads - Injective Mapping | Date |
---|---|

I Does this theorem need that Ker{F}=0? | May 1, 2017 |

Demonstrating that a mapping is injective | May 13, 2014 |

Conditions for Surjective and Injective linear maps | Jul 16, 2013 |

Linear injective mapping | Oct 9, 2009 |

Identity map and injectivity | Feb 25, 2008 |

**Physics Forums - The Fusion of Science and Community**