Restrict attention to vectors in ℝ^m where m is a natural number.(adsbygoogle = window.adsbygoogle || []).push({});

Let σ be the vector of ones. Let V be the set of vectors whose largest entry is 1 and whose smallest entry is 0.

When is it (generically) the case that the set of vectors {σ, v_1, v_2, ..., v_n} is linearly independent, where v_i are vectors randomly drawn from V?

I am guessing that this is so whenever m > n + 1, but am not sure how to prove it.

Any help is much appreciated, thank you!

JF

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

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!

# Genericity of Linear Independence

Loading...

Similar Threads for Genericity Linear Independence |
---|

I Intuitive Linear Transformation |

I Linear Programming: how to identify conflicting equations |

I Adding a matrix and a scalar. |

I Linear mapping of a binary vector based on its decimal value |

I Solutions to equations involving linear transformations |

**Physics Forums | Science Articles, Homework Help, Discussion**