Scholarlink

<p>This paper shows that any nonnegative <i>n</i> × <i>m</i> matrix free of zero rows and columns determines a map of the partition lattice of the set of cardinality n into the partition lattice of the set of cardinality m. These maps have certain properties similar to those of linear maps on vector spaces. In particular, for such maps the rank function is correctly defined and possesses a number of properties of the ordinary rank, including an upper bound for the rank of a matrix product. However, so far no lower bound has been established. In this paper, the counterpart of the Frobenius inequality for the above rank function is proved and, as a corollary, the Sylvester bound, providing a lower bound for the rank of a matrix product, is obtained.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Frobenius and Sylvester Inequalities for the Chainable Rank

  • 期刊论文

  • 发表日期：

    2025年3月1日

查看全文
  • A. E. Guterman,
  • E. R. Shafeev

摘要

This paper shows that any nonnegative n × m matrix free of zero rows and columns determines a map of the partition lattice of the set of cardinality n into the partition lattice of the set of cardinality m. These maps have certain properties similar to those of linear maps on vector spaces. In particular, for such maps the rank function is correctly defined and possesses a number of properties of the ordinary rank, including an upper bound for the rank of a matrix product. However, so far no lower bound has been established. In this paper, the counterpart of the Frobenius inequality for the above rank function is proved and, as a corollary, the Sylvester bound, providing a lower bound for the rank of a matrix product, is obtained.