Determinant/Recursively/Definition

From Wikiversity
Jump to navigation Jump to search
Determinant

Let be a field, and let denote an -matrix over with entries . For , let denote the -matrix, which arises from , when we remove the first column and the -th row. Then one defines recursively the determinant of by

Failed to parse (unknown function "\begin{cases}"): {\displaystyle {{}} \det M = \begin{cases} a_{11}\, , & \text{ for } n <table class="metadata plainlinks ambox ambox-notice" style=""> <tr> <td class="mbox-image"><div style="width: 52px;"> [[File:Wikiversity logo 2017.svg|50px|link=]]</div></td> <td class="mbox-text" style=""> '''[[m:Soft redirect|Soft redirect]]'''<br />This page can be found at <span id="SoftRedirect">[[mw:Help:Magic words#Other]]</span>. </td> </tr> </table>[[Category:Wikiversity soft redirects|Determinant/Recursively/Definition]] __NOINDEX__ 1 \, , \\ \sum_{i <table class="metadata plainlinks ambox ambox-notice" style=""> <tr> <td class="mbox-image"><div style="width: 52px;"> [[File:Wikiversity logo 2017.svg|50px|link=]]</div></td> <td class="mbox-text" style=""> '''[[m:Soft redirect|Soft redirect]]'''<br />This page can be found at <span id="SoftRedirect">[[mw:Help:Magic words#Other]]</span>. </td> </tr> </table>[[Category:Wikiversity soft redirects|Determinant/Recursively/Definition]] __NOINDEX__ 1}^n(-1)^{i+1} a_{i1} \det M_i & \text{ for } n \geq 2 \, . \end{cases} \, }