Soft Question: Can “invariants” always be defined without making a “specific” choice? The Next CEO of Stack Overflowcategorical generalizations of familiar objectsCrunching some data on gradesRecommendation on setting the reference axis for mathematical objectsNatural isomorphisms: what is the status now of “the Eilenberg/Mac Lane Thesis”?Abstraction and/or concreteness - What should be emphasizedSoft question: Can one learn Fourier Analysis without a working knowledge of Integration TheorySoft Question: Why does the Axiom of Choice lead to the weirdest constructions?Soft Question-Examples of “non-prestigious” Mathematicians Making Significant Contributions?What should one know about abstract sets and structural foundations?Soft question: How can I make sure that I understand material without any practice problems?

Solution of this Diophantine Equation

Grabbing quick drinks

How to make a software documentation "officially" citable?

How can I quit an app using Terminal?

WOW air has ceased operation, can I get my tickets refunded?

Is it my responsibility to learn a new technology in my own time my employer wants to implement?

Removing read access from a file

Why did we only see the N-1 starfighters in one film?

I believe this to be a fraud - hired, then asked to cash check and send cash as Bitcoin

Was a professor correct to chastise me for writing "Prof. X" rather than "Professor X"?

How can I get through very long and very dry, but also very useful technical documents when learning a new tool?

Trouble understanding the speech of overseas colleagues

Why didn't Theresa May consult with Parliament before negotiating a deal with the EU?

Would this house-rule that treats advantage as a +1 to the roll instead (and disadvantage as -1) and allows them to stack be balanced?

What is the purpose of the Evocation wizard's Potent Cantrip feature?

Is it okay to store user locations?

Inappropriate reference requests from Journal reviewers

Why does GHC infer a monomorphic type here, even with MonomorphismRestriction disabled?

Term for the "extreme-extension" version of a straw man fallacy?

Explicit solution of a Hamiltonian system

Visit to the USA with ESTA approved before trip to Iran

If the heap is initialized for security, then why is the stack uninitialized?

How do I solve this limit?

Anatomically Correct Strange Women In Ponds Distributing Swords



Soft Question: Can “invariants” always be defined without making a “specific” choice?



The Next CEO of Stack Overflowcategorical generalizations of familiar objectsCrunching some data on gradesRecommendation on setting the reference axis for mathematical objectsNatural isomorphisms: what is the status now of “the Eilenberg/Mac Lane Thesis”?Abstraction and/or concreteness - What should be emphasizedSoft question: Can one learn Fourier Analysis without a working knowledge of Integration TheorySoft Question: Why does the Axiom of Choice lead to the weirdest constructions?Soft Question-Examples of “non-prestigious” Mathematicians Making Significant Contributions?What should one know about abstract sets and structural foundations?Soft question: How can I make sure that I understand material without any practice problems?










7












$begingroup$


I fear that I might know far too little category theory to formulate this question more precisely, that why it is only a soft question:



Give some mathematical object $A$, one can often assign to $A$ a numerical quantity $F(A) in mathbb R$ whose specific value may often shed light on important features of $A$ in return. Basic examples include:



1) The determinant of an endomorphism $f: V to V$ on a finite-dimensional $mathbb R$-vectorspace $V$,



2) The trace of an endomorphism $f: V to V$ on a finite-dimensional $mathbb R$-vectorspace $V$,



3) The Euler characterstic on a topological space $X$ admitting a finite $CW$-structure.



In each case, the quantity is usually defined at first with the aid of a specific choice. In the first two cases, one picks an arbitrary basis $B$ of $V$ and computes the corresponding quantities for the resulting square matrix. In the third case, one picks a finite $CW$-structure and computes the alternating sum of numbers of cells.



A major part of why these quantities turn out to be so interesting is of course that they are independent of the choices made (which is why they are also called invariants). In the first two cases, one usually learns this by observing that similar matrices have the same determinant and trace. Only later, after getting to know a little bit on dual spaces and exterior algebra, one finds out that there actually exist base-free definitions of both these quantities.



One usually learns about independence of the choice in the third case by being shown an equivalent, $CW$-free definition (with the aid of singular homology).



In all three cases, a numerical quantity of an object is



a) first defined with aid of a choice, then



b) shown to be independent of that choice, and finally,



c) is equivalently defined without the use of a choice.



My (vague) question now goes as follows:



If a numerical quantity of an object is defined using a specific choice and, within a context-dependent realm of possible choices, is a posteriori shown to be independent of that choice, can that same quantity always be defined without that choice ?










share|cite|improve this question











$endgroup$







  • 2




    $begingroup$
    See also: mathoverflow.net/questions/244131/nuances-regarding-naturality
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 7:33











  • $begingroup$
    very helpful and informative. I am more or less aware of all the nuances involved when dealing with isomorphisms between vector spaces because of the strong distinction between the finite-dimensional and the infinite-dimensional case. that's why I chose to stick to invariants that are only common in the first case (although there are "natural" generalizations of both the trace and the determinant, but lets not go there)
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:00






  • 2




    $begingroup$
    One solution to some of these problems involving arbitrary choices is to make all possible choices (mathoverflow.net/questions/50025/…). This applies to your example (3). Instead of picking a particular triangulation of a space, we take the singular simplicial complex in which the $n$-simplices are all functions from $Delta_n$ to the space.
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 9:35















7












$begingroup$


I fear that I might know far too little category theory to formulate this question more precisely, that why it is only a soft question:



Give some mathematical object $A$, one can often assign to $A$ a numerical quantity $F(A) in mathbb R$ whose specific value may often shed light on important features of $A$ in return. Basic examples include:



1) The determinant of an endomorphism $f: V to V$ on a finite-dimensional $mathbb R$-vectorspace $V$,



2) The trace of an endomorphism $f: V to V$ on a finite-dimensional $mathbb R$-vectorspace $V$,



3) The Euler characterstic on a topological space $X$ admitting a finite $CW$-structure.



In each case, the quantity is usually defined at first with the aid of a specific choice. In the first two cases, one picks an arbitrary basis $B$ of $V$ and computes the corresponding quantities for the resulting square matrix. In the third case, one picks a finite $CW$-structure and computes the alternating sum of numbers of cells.



A major part of why these quantities turn out to be so interesting is of course that they are independent of the choices made (which is why they are also called invariants). In the first two cases, one usually learns this by observing that similar matrices have the same determinant and trace. Only later, after getting to know a little bit on dual spaces and exterior algebra, one finds out that there actually exist base-free definitions of both these quantities.



One usually learns about independence of the choice in the third case by being shown an equivalent, $CW$-free definition (with the aid of singular homology).



In all three cases, a numerical quantity of an object is



a) first defined with aid of a choice, then



b) shown to be independent of that choice, and finally,



c) is equivalently defined without the use of a choice.



My (vague) question now goes as follows:



If a numerical quantity of an object is defined using a specific choice and, within a context-dependent realm of possible choices, is a posteriori shown to be independent of that choice, can that same quantity always be defined without that choice ?










share|cite|improve this question











$endgroup$







  • 2




    $begingroup$
    See also: mathoverflow.net/questions/244131/nuances-regarding-naturality
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 7:33











  • $begingroup$
    very helpful and informative. I am more or less aware of all the nuances involved when dealing with isomorphisms between vector spaces because of the strong distinction between the finite-dimensional and the infinite-dimensional case. that's why I chose to stick to invariants that are only common in the first case (although there are "natural" generalizations of both the trace and the determinant, but lets not go there)
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:00






  • 2




    $begingroup$
    One solution to some of these problems involving arbitrary choices is to make all possible choices (mathoverflow.net/questions/50025/…). This applies to your example (3). Instead of picking a particular triangulation of a space, we take the singular simplicial complex in which the $n$-simplices are all functions from $Delta_n$ to the space.
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 9:35













7












7








7


1



$begingroup$


I fear that I might know far too little category theory to formulate this question more precisely, that why it is only a soft question:



Give some mathematical object $A$, one can often assign to $A$ a numerical quantity $F(A) in mathbb R$ whose specific value may often shed light on important features of $A$ in return. Basic examples include:



1) The determinant of an endomorphism $f: V to V$ on a finite-dimensional $mathbb R$-vectorspace $V$,



2) The trace of an endomorphism $f: V to V$ on a finite-dimensional $mathbb R$-vectorspace $V$,



3) The Euler characterstic on a topological space $X$ admitting a finite $CW$-structure.



In each case, the quantity is usually defined at first with the aid of a specific choice. In the first two cases, one picks an arbitrary basis $B$ of $V$ and computes the corresponding quantities for the resulting square matrix. In the third case, one picks a finite $CW$-structure and computes the alternating sum of numbers of cells.



A major part of why these quantities turn out to be so interesting is of course that they are independent of the choices made (which is why they are also called invariants). In the first two cases, one usually learns this by observing that similar matrices have the same determinant and trace. Only later, after getting to know a little bit on dual spaces and exterior algebra, one finds out that there actually exist base-free definitions of both these quantities.



One usually learns about independence of the choice in the third case by being shown an equivalent, $CW$-free definition (with the aid of singular homology).



In all three cases, a numerical quantity of an object is



a) first defined with aid of a choice, then



b) shown to be independent of that choice, and finally,



c) is equivalently defined without the use of a choice.



My (vague) question now goes as follows:



If a numerical quantity of an object is defined using a specific choice and, within a context-dependent realm of possible choices, is a posteriori shown to be independent of that choice, can that same quantity always be defined without that choice ?










share|cite|improve this question











$endgroup$




I fear that I might know far too little category theory to formulate this question more precisely, that why it is only a soft question:



Give some mathematical object $A$, one can often assign to $A$ a numerical quantity $F(A) in mathbb R$ whose specific value may often shed light on important features of $A$ in return. Basic examples include:



1) The determinant of an endomorphism $f: V to V$ on a finite-dimensional $mathbb R$-vectorspace $V$,



2) The trace of an endomorphism $f: V to V$ on a finite-dimensional $mathbb R$-vectorspace $V$,



3) The Euler characterstic on a topological space $X$ admitting a finite $CW$-structure.



In each case, the quantity is usually defined at first with the aid of a specific choice. In the first two cases, one picks an arbitrary basis $B$ of $V$ and computes the corresponding quantities for the resulting square matrix. In the third case, one picks a finite $CW$-structure and computes the alternating sum of numbers of cells.



A major part of why these quantities turn out to be so interesting is of course that they are independent of the choices made (which is why they are also called invariants). In the first two cases, one usually learns this by observing that similar matrices have the same determinant and trace. Only later, after getting to know a little bit on dual spaces and exterior algebra, one finds out that there actually exist base-free definitions of both these quantities.



One usually learns about independence of the choice in the third case by being shown an equivalent, $CW$-free definition (with the aid of singular homology).



In all three cases, a numerical quantity of an object is



a) first defined with aid of a choice, then



b) shown to be independent of that choice, and finally,



c) is equivalently defined without the use of a choice.



My (vague) question now goes as follows:



If a numerical quantity of an object is defined using a specific choice and, within a context-dependent realm of possible choices, is a posteriori shown to be independent of that choice, can that same quantity always be defined without that choice ?







soft-question






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 18 at 15:11







Berni Waterman

















asked Mar 18 at 10:22









Berni WatermanBerni Waterman

998714




998714







  • 2




    $begingroup$
    See also: mathoverflow.net/questions/244131/nuances-regarding-naturality
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 7:33











  • $begingroup$
    very helpful and informative. I am more or less aware of all the nuances involved when dealing with isomorphisms between vector spaces because of the strong distinction between the finite-dimensional and the infinite-dimensional case. that's why I chose to stick to invariants that are only common in the first case (although there are "natural" generalizations of both the trace and the determinant, but lets not go there)
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:00






  • 2




    $begingroup$
    One solution to some of these problems involving arbitrary choices is to make all possible choices (mathoverflow.net/questions/50025/…). This applies to your example (3). Instead of picking a particular triangulation of a space, we take the singular simplicial complex in which the $n$-simplices are all functions from $Delta_n$ to the space.
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 9:35












  • 2




    $begingroup$
    See also: mathoverflow.net/questions/244131/nuances-regarding-naturality
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 7:33











  • $begingroup$
    very helpful and informative. I am more or less aware of all the nuances involved when dealing with isomorphisms between vector spaces because of the strong distinction between the finite-dimensional and the infinite-dimensional case. that's why I chose to stick to invariants that are only common in the first case (although there are "natural" generalizations of both the trace and the determinant, but lets not go there)
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:00






  • 2




    $begingroup$
    One solution to some of these problems involving arbitrary choices is to make all possible choices (mathoverflow.net/questions/50025/…). This applies to your example (3). Instead of picking a particular triangulation of a space, we take the singular simplicial complex in which the $n$-simplices are all functions from $Delta_n$ to the space.
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 9:35







2




2




$begingroup$
See also: mathoverflow.net/questions/244131/nuances-regarding-naturality
$endgroup$
– Oscar Cunningham
Mar 19 at 7:33





$begingroup$
See also: mathoverflow.net/questions/244131/nuances-regarding-naturality
$endgroup$
– Oscar Cunningham
Mar 19 at 7:33













$begingroup$
very helpful and informative. I am more or less aware of all the nuances involved when dealing with isomorphisms between vector spaces because of the strong distinction between the finite-dimensional and the infinite-dimensional case. that's why I chose to stick to invariants that are only common in the first case (although there are "natural" generalizations of both the trace and the determinant, but lets not go there)
$endgroup$
– Berni Waterman
Mar 19 at 8:00




$begingroup$
very helpful and informative. I am more or less aware of all the nuances involved when dealing with isomorphisms between vector spaces because of the strong distinction between the finite-dimensional and the infinite-dimensional case. that's why I chose to stick to invariants that are only common in the first case (although there are "natural" generalizations of both the trace and the determinant, but lets not go there)
$endgroup$
– Berni Waterman
Mar 19 at 8:00




2




2




$begingroup$
One solution to some of these problems involving arbitrary choices is to make all possible choices (mathoverflow.net/questions/50025/…). This applies to your example (3). Instead of picking a particular triangulation of a space, we take the singular simplicial complex in which the $n$-simplices are all functions from $Delta_n$ to the space.
$endgroup$
– Oscar Cunningham
Mar 19 at 9:35




$begingroup$
One solution to some of these problems involving arbitrary choices is to make all possible choices (mathoverflow.net/questions/50025/…). This applies to your example (3). Instead of picking a particular triangulation of a space, we take the singular simplicial complex in which the $n$-simplices are all functions from $Delta_n$ to the space.
$endgroup$
– Oscar Cunningham
Mar 19 at 9:35










3 Answers
3






active

oldest

votes


















2












$begingroup$

If you allow numerical invariants that aren’t real numbers, then “cardinal number” is an example. The cardinality of a set $A$ is the least ordinal $alpha$ for which there exists a bijection between $alpha$ and $A.$ But there is no canonical way to select a particular bijection (unless you make special set-theoretic assumptions like $V=L$), and there’s no way to bypass this.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Looking closer, it doesn't seem that the definition of cardinality, unlike the examples I gave, really chooses a specific bijection. It only checks whether there is some bijection between $A$ and an ordinal $alpha$.
    $endgroup$
    – Berni Waterman
    Mar 18 at 12:47



















1












$begingroup$

This isn't an explicit example of a "canonical" invariant without a canonical description, but I think its an important point that should be raised regarding these issues (and is too long for a comment).



Often we have multiple noncanonical choices in defining our invariant, and the existence of these choices is more important than insisting on a canonical choice free description.



An example is the fundamental group of a space. For a reasonable, connected space, the abstract group we get is independent of the basepoint chosen, but changing our basepoint by a given path induces a conjugation action of the fundamental group on itself. Thus, to get at this action, and all the basepoint changing phenomena, eg, covering spaces, we need to consider all the basepoint choices, and how they relate to one another.



However if we insist on basepoint independence, we get what remains after forcing the fundamental group's conjugation action on itself to be trivial, which gives us the first homology group of our space, that is, $pi_1(X,,x_0)^abcong H_1(X)$.



Another instance of this is that one can recover a (finite) nonabelian group as the tensor automorphisms of a "forgetful" functor $F:Rep^Grightarrow Vect$, but this choice of forgetful functor is noncanonical. However we can recover the abelianisation $G^ab$ of the group $G$ from its category of representations canonically i'm pretty sure, with no forgetful functor (basepoint) required, by considering the tensor automorphisms of the identity functor on the subcategory generated by invertible objects in $Rep^G$.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    In terms of functoriality, it is of course very important to stick to choices. To my knowledge, this is also part of the reason why the category of based topological spaces has been introduced in the first place. Moreover, I agree with you that in many instances, trying to find a "coordinate-free" definition may deviate from the actual purpose. This is also why I'm asking this only in the case of numerical invariants (to which fundamental groups don't belong to).
    $endgroup$
    – Berni Waterman
    Mar 18 at 11:04



















1












$begingroup$

Suppose we have some invariant in a set $B$ that is defined in terms of a choice of $ain A$. Then without picking an $ain A$ we may still construct the function $f:Ato B$ that maps $ain A$ to the corresponding value of the invariant in $B$.



We can then prove that for all $a_1,a_2in A$ we have $f(a_1)=f(a_2)$. This proof will involve considering some particular $a_1$ and $a_2$ in $A$, but I wouldn't say that it has made any choices since $a_1$ and $a_2$ both range over all of $A$.



I think this is as far as one can go without making a choice. To actually define the value of the invariant one has to say "pick $ain A$ and consider $f(a)$". This is necessary because otherwise $A$ might be empty, and the invariant wouldn't be defined at all.



For example if your definition of "finite-dimensional vector space" is "has a finite basis" then your definition of determinant has to involve picking a finite basis. Otherwise the determinant would also be defined for infinite dimensional spaces. Even the definition of determinant involving exterior powers must involve picking a finite basis somewhere (it considers $Lambda^mathrmdim(V)(V)$, and you have to pick a finite basis to calculate $mathrmdim(V)$).






share|cite|improve this answer











$endgroup$












  • $begingroup$
    for finite-dimensional vector spaces $V$, couldn't I define "dim(V)" as the largest integer $n$ such that $Lambda^n V neq 0$ and thereby weasel around picking a basis ?
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:26











  • $begingroup$
    @BerniWaterman How do you know such an $n$ exists?
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 8:34










  • $begingroup$
    I think I see where you are getting at: it is true that for finite-dimensional vector spaces, $Lambda^k V$ contains only one element for $k > dim(V)$. However, in order to determine that, one needs to understand how a basis of $Lambda^k V$ is built from a basis of $V$, right?
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:42











  • $begingroup$
    In programming terms, one could say something like list(rang(f))[0].
    $endgroup$
    – J.G.
    Mar 19 at 8:48










  • $begingroup$
    @J.G. Then the question would be that of how list chooses which order to arrange the elements.
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 9:38











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
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3152622%2fsoft-question-can-invariants-always-be-defined-without-making-a-specific-ch%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























3 Answers
3






active

oldest

votes








3 Answers
3






active

oldest

votes









active

oldest

votes






active

oldest

votes









2












$begingroup$

If you allow numerical invariants that aren’t real numbers, then “cardinal number” is an example. The cardinality of a set $A$ is the least ordinal $alpha$ for which there exists a bijection between $alpha$ and $A.$ But there is no canonical way to select a particular bijection (unless you make special set-theoretic assumptions like $V=L$), and there’s no way to bypass this.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Looking closer, it doesn't seem that the definition of cardinality, unlike the examples I gave, really chooses a specific bijection. It only checks whether there is some bijection between $A$ and an ordinal $alpha$.
    $endgroup$
    – Berni Waterman
    Mar 18 at 12:47
















2












$begingroup$

If you allow numerical invariants that aren’t real numbers, then “cardinal number” is an example. The cardinality of a set $A$ is the least ordinal $alpha$ for which there exists a bijection between $alpha$ and $A.$ But there is no canonical way to select a particular bijection (unless you make special set-theoretic assumptions like $V=L$), and there’s no way to bypass this.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Looking closer, it doesn't seem that the definition of cardinality, unlike the examples I gave, really chooses a specific bijection. It only checks whether there is some bijection between $A$ and an ordinal $alpha$.
    $endgroup$
    – Berni Waterman
    Mar 18 at 12:47














2












2








2





$begingroup$

If you allow numerical invariants that aren’t real numbers, then “cardinal number” is an example. The cardinality of a set $A$ is the least ordinal $alpha$ for which there exists a bijection between $alpha$ and $A.$ But there is no canonical way to select a particular bijection (unless you make special set-theoretic assumptions like $V=L$), and there’s no way to bypass this.






share|cite|improve this answer









$endgroup$



If you allow numerical invariants that aren’t real numbers, then “cardinal number” is an example. The cardinality of a set $A$ is the least ordinal $alpha$ for which there exists a bijection between $alpha$ and $A.$ But there is no canonical way to select a particular bijection (unless you make special set-theoretic assumptions like $V=L$), and there’s no way to bypass this.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Mar 18 at 11:32









Mitchell SpectorMitchell Spector

7,0572624




7,0572624











  • $begingroup$
    Looking closer, it doesn't seem that the definition of cardinality, unlike the examples I gave, really chooses a specific bijection. It only checks whether there is some bijection between $A$ and an ordinal $alpha$.
    $endgroup$
    – Berni Waterman
    Mar 18 at 12:47

















  • $begingroup$
    Looking closer, it doesn't seem that the definition of cardinality, unlike the examples I gave, really chooses a specific bijection. It only checks whether there is some bijection between $A$ and an ordinal $alpha$.
    $endgroup$
    – Berni Waterman
    Mar 18 at 12:47
















$begingroup$
Looking closer, it doesn't seem that the definition of cardinality, unlike the examples I gave, really chooses a specific bijection. It only checks whether there is some bijection between $A$ and an ordinal $alpha$.
$endgroup$
– Berni Waterman
Mar 18 at 12:47





$begingroup$
Looking closer, it doesn't seem that the definition of cardinality, unlike the examples I gave, really chooses a specific bijection. It only checks whether there is some bijection between $A$ and an ordinal $alpha$.
$endgroup$
– Berni Waterman
Mar 18 at 12:47












1












$begingroup$

This isn't an explicit example of a "canonical" invariant without a canonical description, but I think its an important point that should be raised regarding these issues (and is too long for a comment).



Often we have multiple noncanonical choices in defining our invariant, and the existence of these choices is more important than insisting on a canonical choice free description.



An example is the fundamental group of a space. For a reasonable, connected space, the abstract group we get is independent of the basepoint chosen, but changing our basepoint by a given path induces a conjugation action of the fundamental group on itself. Thus, to get at this action, and all the basepoint changing phenomena, eg, covering spaces, we need to consider all the basepoint choices, and how they relate to one another.



However if we insist on basepoint independence, we get what remains after forcing the fundamental group's conjugation action on itself to be trivial, which gives us the first homology group of our space, that is, $pi_1(X,,x_0)^abcong H_1(X)$.



Another instance of this is that one can recover a (finite) nonabelian group as the tensor automorphisms of a "forgetful" functor $F:Rep^Grightarrow Vect$, but this choice of forgetful functor is noncanonical. However we can recover the abelianisation $G^ab$ of the group $G$ from its category of representations canonically i'm pretty sure, with no forgetful functor (basepoint) required, by considering the tensor automorphisms of the identity functor on the subcategory generated by invertible objects in $Rep^G$.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    In terms of functoriality, it is of course very important to stick to choices. To my knowledge, this is also part of the reason why the category of based topological spaces has been introduced in the first place. Moreover, I agree with you that in many instances, trying to find a "coordinate-free" definition may deviate from the actual purpose. This is also why I'm asking this only in the case of numerical invariants (to which fundamental groups don't belong to).
    $endgroup$
    – Berni Waterman
    Mar 18 at 11:04
















1












$begingroup$

This isn't an explicit example of a "canonical" invariant without a canonical description, but I think its an important point that should be raised regarding these issues (and is too long for a comment).



Often we have multiple noncanonical choices in defining our invariant, and the existence of these choices is more important than insisting on a canonical choice free description.



An example is the fundamental group of a space. For a reasonable, connected space, the abstract group we get is independent of the basepoint chosen, but changing our basepoint by a given path induces a conjugation action of the fundamental group on itself. Thus, to get at this action, and all the basepoint changing phenomena, eg, covering spaces, we need to consider all the basepoint choices, and how they relate to one another.



However if we insist on basepoint independence, we get what remains after forcing the fundamental group's conjugation action on itself to be trivial, which gives us the first homology group of our space, that is, $pi_1(X,,x_0)^abcong H_1(X)$.



Another instance of this is that one can recover a (finite) nonabelian group as the tensor automorphisms of a "forgetful" functor $F:Rep^Grightarrow Vect$, but this choice of forgetful functor is noncanonical. However we can recover the abelianisation $G^ab$ of the group $G$ from its category of representations canonically i'm pretty sure, with no forgetful functor (basepoint) required, by considering the tensor automorphisms of the identity functor on the subcategory generated by invertible objects in $Rep^G$.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    In terms of functoriality, it is of course very important to stick to choices. To my knowledge, this is also part of the reason why the category of based topological spaces has been introduced in the first place. Moreover, I agree with you that in many instances, trying to find a "coordinate-free" definition may deviate from the actual purpose. This is also why I'm asking this only in the case of numerical invariants (to which fundamental groups don't belong to).
    $endgroup$
    – Berni Waterman
    Mar 18 at 11:04














1












1








1





$begingroup$

This isn't an explicit example of a "canonical" invariant without a canonical description, but I think its an important point that should be raised regarding these issues (and is too long for a comment).



Often we have multiple noncanonical choices in defining our invariant, and the existence of these choices is more important than insisting on a canonical choice free description.



An example is the fundamental group of a space. For a reasonable, connected space, the abstract group we get is independent of the basepoint chosen, but changing our basepoint by a given path induces a conjugation action of the fundamental group on itself. Thus, to get at this action, and all the basepoint changing phenomena, eg, covering spaces, we need to consider all the basepoint choices, and how they relate to one another.



However if we insist on basepoint independence, we get what remains after forcing the fundamental group's conjugation action on itself to be trivial, which gives us the first homology group of our space, that is, $pi_1(X,,x_0)^abcong H_1(X)$.



Another instance of this is that one can recover a (finite) nonabelian group as the tensor automorphisms of a "forgetful" functor $F:Rep^Grightarrow Vect$, but this choice of forgetful functor is noncanonical. However we can recover the abelianisation $G^ab$ of the group $G$ from its category of representations canonically i'm pretty sure, with no forgetful functor (basepoint) required, by considering the tensor automorphisms of the identity functor on the subcategory generated by invertible objects in $Rep^G$.






share|cite|improve this answer









$endgroup$



This isn't an explicit example of a "canonical" invariant without a canonical description, but I think its an important point that should be raised regarding these issues (and is too long for a comment).



Often we have multiple noncanonical choices in defining our invariant, and the existence of these choices is more important than insisting on a canonical choice free description.



An example is the fundamental group of a space. For a reasonable, connected space, the abstract group we get is independent of the basepoint chosen, but changing our basepoint by a given path induces a conjugation action of the fundamental group on itself. Thus, to get at this action, and all the basepoint changing phenomena, eg, covering spaces, we need to consider all the basepoint choices, and how they relate to one another.



However if we insist on basepoint independence, we get what remains after forcing the fundamental group's conjugation action on itself to be trivial, which gives us the first homology group of our space, that is, $pi_1(X,,x_0)^abcong H_1(X)$.



Another instance of this is that one can recover a (finite) nonabelian group as the tensor automorphisms of a "forgetful" functor $F:Rep^Grightarrow Vect$, but this choice of forgetful functor is noncanonical. However we can recover the abelianisation $G^ab$ of the group $G$ from its category of representations canonically i'm pretty sure, with no forgetful functor (basepoint) required, by considering the tensor automorphisms of the identity functor on the subcategory generated by invertible objects in $Rep^G$.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Mar 18 at 10:49









user277182user277182

498212




498212











  • $begingroup$
    In terms of functoriality, it is of course very important to stick to choices. To my knowledge, this is also part of the reason why the category of based topological spaces has been introduced in the first place. Moreover, I agree with you that in many instances, trying to find a "coordinate-free" definition may deviate from the actual purpose. This is also why I'm asking this only in the case of numerical invariants (to which fundamental groups don't belong to).
    $endgroup$
    – Berni Waterman
    Mar 18 at 11:04

















  • $begingroup$
    In terms of functoriality, it is of course very important to stick to choices. To my knowledge, this is also part of the reason why the category of based topological spaces has been introduced in the first place. Moreover, I agree with you that in many instances, trying to find a "coordinate-free" definition may deviate from the actual purpose. This is also why I'm asking this only in the case of numerical invariants (to which fundamental groups don't belong to).
    $endgroup$
    – Berni Waterman
    Mar 18 at 11:04
















$begingroup$
In terms of functoriality, it is of course very important to stick to choices. To my knowledge, this is also part of the reason why the category of based topological spaces has been introduced in the first place. Moreover, I agree with you that in many instances, trying to find a "coordinate-free" definition may deviate from the actual purpose. This is also why I'm asking this only in the case of numerical invariants (to which fundamental groups don't belong to).
$endgroup$
– Berni Waterman
Mar 18 at 11:04





$begingroup$
In terms of functoriality, it is of course very important to stick to choices. To my knowledge, this is also part of the reason why the category of based topological spaces has been introduced in the first place. Moreover, I agree with you that in many instances, trying to find a "coordinate-free" definition may deviate from the actual purpose. This is also why I'm asking this only in the case of numerical invariants (to which fundamental groups don't belong to).
$endgroup$
– Berni Waterman
Mar 18 at 11:04












1












$begingroup$

Suppose we have some invariant in a set $B$ that is defined in terms of a choice of $ain A$. Then without picking an $ain A$ we may still construct the function $f:Ato B$ that maps $ain A$ to the corresponding value of the invariant in $B$.



We can then prove that for all $a_1,a_2in A$ we have $f(a_1)=f(a_2)$. This proof will involve considering some particular $a_1$ and $a_2$ in $A$, but I wouldn't say that it has made any choices since $a_1$ and $a_2$ both range over all of $A$.



I think this is as far as one can go without making a choice. To actually define the value of the invariant one has to say "pick $ain A$ and consider $f(a)$". This is necessary because otherwise $A$ might be empty, and the invariant wouldn't be defined at all.



For example if your definition of "finite-dimensional vector space" is "has a finite basis" then your definition of determinant has to involve picking a finite basis. Otherwise the determinant would also be defined for infinite dimensional spaces. Even the definition of determinant involving exterior powers must involve picking a finite basis somewhere (it considers $Lambda^mathrmdim(V)(V)$, and you have to pick a finite basis to calculate $mathrmdim(V)$).






share|cite|improve this answer











$endgroup$












  • $begingroup$
    for finite-dimensional vector spaces $V$, couldn't I define "dim(V)" as the largest integer $n$ such that $Lambda^n V neq 0$ and thereby weasel around picking a basis ?
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:26











  • $begingroup$
    @BerniWaterman How do you know such an $n$ exists?
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 8:34










  • $begingroup$
    I think I see where you are getting at: it is true that for finite-dimensional vector spaces, $Lambda^k V$ contains only one element for $k > dim(V)$. However, in order to determine that, one needs to understand how a basis of $Lambda^k V$ is built from a basis of $V$, right?
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:42











  • $begingroup$
    In programming terms, one could say something like list(rang(f))[0].
    $endgroup$
    – J.G.
    Mar 19 at 8:48










  • $begingroup$
    @J.G. Then the question would be that of how list chooses which order to arrange the elements.
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 9:38















1












$begingroup$

Suppose we have some invariant in a set $B$ that is defined in terms of a choice of $ain A$. Then without picking an $ain A$ we may still construct the function $f:Ato B$ that maps $ain A$ to the corresponding value of the invariant in $B$.



We can then prove that for all $a_1,a_2in A$ we have $f(a_1)=f(a_2)$. This proof will involve considering some particular $a_1$ and $a_2$ in $A$, but I wouldn't say that it has made any choices since $a_1$ and $a_2$ both range over all of $A$.



I think this is as far as one can go without making a choice. To actually define the value of the invariant one has to say "pick $ain A$ and consider $f(a)$". This is necessary because otherwise $A$ might be empty, and the invariant wouldn't be defined at all.



For example if your definition of "finite-dimensional vector space" is "has a finite basis" then your definition of determinant has to involve picking a finite basis. Otherwise the determinant would also be defined for infinite dimensional spaces. Even the definition of determinant involving exterior powers must involve picking a finite basis somewhere (it considers $Lambda^mathrmdim(V)(V)$, and you have to pick a finite basis to calculate $mathrmdim(V)$).






share|cite|improve this answer











$endgroup$












  • $begingroup$
    for finite-dimensional vector spaces $V$, couldn't I define "dim(V)" as the largest integer $n$ such that $Lambda^n V neq 0$ and thereby weasel around picking a basis ?
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:26











  • $begingroup$
    @BerniWaterman How do you know such an $n$ exists?
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 8:34










  • $begingroup$
    I think I see where you are getting at: it is true that for finite-dimensional vector spaces, $Lambda^k V$ contains only one element for $k > dim(V)$. However, in order to determine that, one needs to understand how a basis of $Lambda^k V$ is built from a basis of $V$, right?
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:42











  • $begingroup$
    In programming terms, one could say something like list(rang(f))[0].
    $endgroup$
    – J.G.
    Mar 19 at 8:48










  • $begingroup$
    @J.G. Then the question would be that of how list chooses which order to arrange the elements.
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 9:38













1












1








1





$begingroup$

Suppose we have some invariant in a set $B$ that is defined in terms of a choice of $ain A$. Then without picking an $ain A$ we may still construct the function $f:Ato B$ that maps $ain A$ to the corresponding value of the invariant in $B$.



We can then prove that for all $a_1,a_2in A$ we have $f(a_1)=f(a_2)$. This proof will involve considering some particular $a_1$ and $a_2$ in $A$, but I wouldn't say that it has made any choices since $a_1$ and $a_2$ both range over all of $A$.



I think this is as far as one can go without making a choice. To actually define the value of the invariant one has to say "pick $ain A$ and consider $f(a)$". This is necessary because otherwise $A$ might be empty, and the invariant wouldn't be defined at all.



For example if your definition of "finite-dimensional vector space" is "has a finite basis" then your definition of determinant has to involve picking a finite basis. Otherwise the determinant would also be defined for infinite dimensional spaces. Even the definition of determinant involving exterior powers must involve picking a finite basis somewhere (it considers $Lambda^mathrmdim(V)(V)$, and you have to pick a finite basis to calculate $mathrmdim(V)$).






share|cite|improve this answer











$endgroup$



Suppose we have some invariant in a set $B$ that is defined in terms of a choice of $ain A$. Then without picking an $ain A$ we may still construct the function $f:Ato B$ that maps $ain A$ to the corresponding value of the invariant in $B$.



We can then prove that for all $a_1,a_2in A$ we have $f(a_1)=f(a_2)$. This proof will involve considering some particular $a_1$ and $a_2$ in $A$, but I wouldn't say that it has made any choices since $a_1$ and $a_2$ both range over all of $A$.



I think this is as far as one can go without making a choice. To actually define the value of the invariant one has to say "pick $ain A$ and consider $f(a)$". This is necessary because otherwise $A$ might be empty, and the invariant wouldn't be defined at all.



For example if your definition of "finite-dimensional vector space" is "has a finite basis" then your definition of determinant has to involve picking a finite basis. Otherwise the determinant would also be defined for infinite dimensional spaces. Even the definition of determinant involving exterior powers must involve picking a finite basis somewhere (it considers $Lambda^mathrmdim(V)(V)$, and you have to pick a finite basis to calculate $mathrmdim(V)$).







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Mar 19 at 8:41

























answered Mar 19 at 8:04









Oscar CunninghamOscar Cunningham

10.3k23061




10.3k23061











  • $begingroup$
    for finite-dimensional vector spaces $V$, couldn't I define "dim(V)" as the largest integer $n$ such that $Lambda^n V neq 0$ and thereby weasel around picking a basis ?
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:26











  • $begingroup$
    @BerniWaterman How do you know such an $n$ exists?
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 8:34










  • $begingroup$
    I think I see where you are getting at: it is true that for finite-dimensional vector spaces, $Lambda^k V$ contains only one element for $k > dim(V)$. However, in order to determine that, one needs to understand how a basis of $Lambda^k V$ is built from a basis of $V$, right?
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:42











  • $begingroup$
    In programming terms, one could say something like list(rang(f))[0].
    $endgroup$
    – J.G.
    Mar 19 at 8:48










  • $begingroup$
    @J.G. Then the question would be that of how list chooses which order to arrange the elements.
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 9:38
















  • $begingroup$
    for finite-dimensional vector spaces $V$, couldn't I define "dim(V)" as the largest integer $n$ such that $Lambda^n V neq 0$ and thereby weasel around picking a basis ?
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:26











  • $begingroup$
    @BerniWaterman How do you know such an $n$ exists?
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 8:34










  • $begingroup$
    I think I see where you are getting at: it is true that for finite-dimensional vector spaces, $Lambda^k V$ contains only one element for $k > dim(V)$. However, in order to determine that, one needs to understand how a basis of $Lambda^k V$ is built from a basis of $V$, right?
    $endgroup$
    – Berni Waterman
    Mar 19 at 8:42











  • $begingroup$
    In programming terms, one could say something like list(rang(f))[0].
    $endgroup$
    – J.G.
    Mar 19 at 8:48










  • $begingroup$
    @J.G. Then the question would be that of how list chooses which order to arrange the elements.
    $endgroup$
    – Oscar Cunningham
    Mar 19 at 9:38















$begingroup$
for finite-dimensional vector spaces $V$, couldn't I define "dim(V)" as the largest integer $n$ such that $Lambda^n V neq 0$ and thereby weasel around picking a basis ?
$endgroup$
– Berni Waterman
Mar 19 at 8:26





$begingroup$
for finite-dimensional vector spaces $V$, couldn't I define "dim(V)" as the largest integer $n$ such that $Lambda^n V neq 0$ and thereby weasel around picking a basis ?
$endgroup$
– Berni Waterman
Mar 19 at 8:26













$begingroup$
@BerniWaterman How do you know such an $n$ exists?
$endgroup$
– Oscar Cunningham
Mar 19 at 8:34




$begingroup$
@BerniWaterman How do you know such an $n$ exists?
$endgroup$
– Oscar Cunningham
Mar 19 at 8:34












$begingroup$
I think I see where you are getting at: it is true that for finite-dimensional vector spaces, $Lambda^k V$ contains only one element for $k > dim(V)$. However, in order to determine that, one needs to understand how a basis of $Lambda^k V$ is built from a basis of $V$, right?
$endgroup$
– Berni Waterman
Mar 19 at 8:42





$begingroup$
I think I see where you are getting at: it is true that for finite-dimensional vector spaces, $Lambda^k V$ contains only one element for $k > dim(V)$. However, in order to determine that, one needs to understand how a basis of $Lambda^k V$ is built from a basis of $V$, right?
$endgroup$
– Berni Waterman
Mar 19 at 8:42













$begingroup$
In programming terms, one could say something like list(rang(f))[0].
$endgroup$
– J.G.
Mar 19 at 8:48




$begingroup$
In programming terms, one could say something like list(rang(f))[0].
$endgroup$
– J.G.
Mar 19 at 8:48












$begingroup$
@J.G. Then the question would be that of how list chooses which order to arrange the elements.
$endgroup$
– Oscar Cunningham
Mar 19 at 9:38




$begingroup$
@J.G. Then the question would be that of how list chooses which order to arrange the elements.
$endgroup$
– Oscar Cunningham
Mar 19 at 9:38

















draft saved

draft discarded
















































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.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3152622%2fsoft-question-can-invariants-always-be-defined-without-making-a-specific-ch%23new-answer', 'question_page');

);

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







Popular posts from this blog

Moe incest case Sentencing See also References Navigation menu"'Australian Josef Fritzl' fathered four children by daughter""Small town recoils in horror at 'Australian Fritzl' incest case""Victorian rape allegations echo Fritzl case - Just In (Australian Broadcasting Corporation)""Incest father jailed for 22 years""'Australian Fritzl' sentenced to 22 years in prison for abusing daughter for three decades""RSJ v The Queen"

Who is our nearest planetary neighbor, on average?Santa Claus flies to the South PoleSeven Spheres of Unequal Mass, a weighing problem with a twistDescribe a large integerFast Mental Calculation of $7.5^7$Math in Space (without the help of celebrities)Find the value of $bigstar$: Puzzle 8 - InequalityWho drinks beer while running anyway?A Crucial DeliveryRanking And AverageHow long will my money last at roulette?

Daza language Contents Vocabulary Phonology References External links Navigation menudaza1242Daza"Dazaga"eeee178086576