Determinant definition from recursion
$begingroup$
I know this definition of Principle of Recursive Definition from Munkres Topology, Ch 1:
Principle of Recursive Definition: Let $A$ be a set; let $a_0$ be an element of $A$. Suppose $rho$ is a function that assigns, to each function $f$ mapping a nonempty section of the positive integers into $A$, and element of $A$. Then there exists a unique function $$h:mathbb Z_+to A$$ such that $$h_1=a_0, text{ and for } i>1,, h(i)=rho(h|{1,ldots,i-1})tag{*}$$ The formula $(*)$ is called a recursion formula for $h$. It specifies $h(1)$ and it expresses the value of $h$ at $i>1$ in terms of the values of $h$ for positive integer less than $i$.
Now, I was reading Artin's Algebra, and he says that they define determinant recursively: $$det:Bbb R^{ntimes n}to mathbb R.$$
The determinant of $1times 1$ matrix $A=[a]$ is $det A=a$, and for higher dimensions, $$det A=sum_nupm a_{nu1}det A_{nu1}.$$How can I apply principle of recursive definition to arrive at this definition of determinant?
definition determinant recursion
$endgroup$
add a comment |
$begingroup$
I know this definition of Principle of Recursive Definition from Munkres Topology, Ch 1:
Principle of Recursive Definition: Let $A$ be a set; let $a_0$ be an element of $A$. Suppose $rho$ is a function that assigns, to each function $f$ mapping a nonempty section of the positive integers into $A$, and element of $A$. Then there exists a unique function $$h:mathbb Z_+to A$$ such that $$h_1=a_0, text{ and for } i>1,, h(i)=rho(h|{1,ldots,i-1})tag{*}$$ The formula $(*)$ is called a recursion formula for $h$. It specifies $h(1)$ and it expresses the value of $h$ at $i>1$ in terms of the values of $h$ for positive integer less than $i$.
Now, I was reading Artin's Algebra, and he says that they define determinant recursively: $$det:Bbb R^{ntimes n}to mathbb R.$$
The determinant of $1times 1$ matrix $A=[a]$ is $det A=a$, and for higher dimensions, $$det A=sum_nupm a_{nu1}det A_{nu1}.$$How can I apply principle of recursive definition to arrive at this definition of determinant?
definition determinant recursion
$endgroup$
add a comment |
$begingroup$
I know this definition of Principle of Recursive Definition from Munkres Topology, Ch 1:
Principle of Recursive Definition: Let $A$ be a set; let $a_0$ be an element of $A$. Suppose $rho$ is a function that assigns, to each function $f$ mapping a nonempty section of the positive integers into $A$, and element of $A$. Then there exists a unique function $$h:mathbb Z_+to A$$ such that $$h_1=a_0, text{ and for } i>1,, h(i)=rho(h|{1,ldots,i-1})tag{*}$$ The formula $(*)$ is called a recursion formula for $h$. It specifies $h(1)$ and it expresses the value of $h$ at $i>1$ in terms of the values of $h$ for positive integer less than $i$.
Now, I was reading Artin's Algebra, and he says that they define determinant recursively: $$det:Bbb R^{ntimes n}to mathbb R.$$
The determinant of $1times 1$ matrix $A=[a]$ is $det A=a$, and for higher dimensions, $$det A=sum_nupm a_{nu1}det A_{nu1}.$$How can I apply principle of recursive definition to arrive at this definition of determinant?
definition determinant recursion
$endgroup$
I know this definition of Principle of Recursive Definition from Munkres Topology, Ch 1:
Principle of Recursive Definition: Let $A$ be a set; let $a_0$ be an element of $A$. Suppose $rho$ is a function that assigns, to each function $f$ mapping a nonempty section of the positive integers into $A$, and element of $A$. Then there exists a unique function $$h:mathbb Z_+to A$$ such that $$h_1=a_0, text{ and for } i>1,, h(i)=rho(h|{1,ldots,i-1})tag{*}$$ The formula $(*)$ is called a recursion formula for $h$. It specifies $h(1)$ and it expresses the value of $h$ at $i>1$ in terms of the values of $h$ for positive integer less than $i$.
Now, I was reading Artin's Algebra, and he says that they define determinant recursively: $$det:Bbb R^{ntimes n}to mathbb R.$$
The determinant of $1times 1$ matrix $A=[a]$ is $det A=a$, and for higher dimensions, $$det A=sum_nupm a_{nu1}det A_{nu1}.$$How can I apply principle of recursive definition to arrive at this definition of determinant?
definition determinant recursion
definition determinant recursion
asked Jan 18 at 7:17
SilentSilent
2,84132152
2,84132152
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3077928%2fdeterminant-definition-from-recursion%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3077928%2fdeterminant-definition-from-recursion%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown