<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mathnas</journal-id><journal-title-group><journal-title xml:lang="ru">Труды Института математики НАН Беларуси</journal-title><trans-title-group xml:lang="en"><trans-title>Proceedings of the Institute of Mathematics of the NAS of Belarus</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1812-5093</issn><publisher><publisher-name>Институт математики НАН Беларуси</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">mathnas-48</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>КРАТКИЕ СООБЩЕНИЯ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>BRIEF COMMUNICATIONS</subject></subj-group></article-categories><title-group><article-title>Альтернативное построение теории определителей</article-title><trans-title-group xml:lang="en"><trans-title>Alternative construction of the determinant theory</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Агеев</surname><given-names>С. М.</given-names></name><name name-style="western" xml:lang="en"><surname>Ageev</surname><given-names>S. M.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Минск</p></bio><bio xml:lang="en"><p>Minsk</p></bio><email xlink:type="simple">ageev_sergei@inbox.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Агеева</surname><given-names>Е. С.</given-names></name><name name-style="western" xml:lang="en"><surname>Ageeva</surname><given-names>H. S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Минск</p></bio><bio xml:lang="en"><p>Minsk</p></bio><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белорусский государственный университет</institution></aff><aff xml:lang="en"><institution>Belarusian State University</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2024</year></pub-date><pub-date pub-type="epub"><day>03</day><month>03</month><year>2025</year></pub-date><volume>32</volume><issue>2</issue><fpage>93</fpage><lpage>96</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Агеев С.М., Агеева Е.С., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Агеев С.М., Агеева Е.С.</copyright-holder><copyright-holder xml:lang="en">Ageev S.M., Ageeva H.S.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://mathnas.ejournal.by/jour/article/view/48">https://mathnas.ejournal.by/jour/article/view/48</self-uri><abstract><p>Непосредственно, без привлечения четностей перестановок и приведения матриц к ступенчатому виду, устанавливается эквивалентность разложения определителя по любой строчке и любому столбцу. С помощью этого существенно упрощается оставшаяся часть теории определителей: мультипликативное свойство определителя, обобщенная теорема Лапласа, теорема Бине-Коши и др.</p></abstract><trans-abstract xml:lang="en"><p>We establish in a direct way, without involving the sigh function of permutations and matrice reducing to echelon form, the equivalence of the expansion of determinant along any row and any column. On base of this the rest of the theory of determinants is significantly simplified: determinant multiplicativity, the generalized Laplace expansion and Cauchy-Binet formula and so on</p></trans-abstract><kwd-group xml:lang="ru"><kwd>теорема о равноправности</kwd><kwd>мультипликативное свойство определителя</kwd><kwd>обобщенная теорема Лапласа</kwd><kwd>теорема Бине-Коши</kwd></kwd-group><kwd-group xml:lang="en"><kwd>the equality theorem</kwd><kwd>the multiplicative property of determinants</kwd><kwd>the generalized Laplace expansion and Cauchy-Binet formula</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Botha J. D. Alternative proofs of the rational canonical form theorem // Int. J. Math. Educ. Sci. Technol. 1994. Vol. 25, № 5. P. 745–749.</mixed-citation><mixed-citation xml:lang="en">Botha J. D. Alternative proofs of the rational canonical form theorem. Int. J. Math. Educ. Sci. Technol., 1994, vol. 25, no. 5, pp. 745–749.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Филиппов А. Ф. Краткое доказательство теоремы о приведении матрицы к жордановой форме // Вестн. МГУ. Сер. матем. 1971. T. 26, N 1–2. C. 70–71.</mixed-citation><mixed-citation xml:lang="en">Filippov A. F. A short proof of the theorem on the reduction of a matrix to Jordan form. Mosc. Univ. Math. Bull., 1971, vol. 26, no. 1–2, pp. 70–71.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
