Sort with assumptionsvariable sized lists and using lists as variablesRetaining and reusing a one-to-one mapping from a sortSorting a matrix alphanumericallyRearranging a ListHow can I check if one expression implies another?Generating an Array of VectorsImporting, sorting and exporting listsDeleting Lonely Numbers From a ListApplying multiple functions to a single column in a tableFind positions in which list elements are equal
Creepy dinosaur pc game identification
Finding NDSolve method details
Why do we read the Megillah by night and by day?
Can somebody explain the brexit thing in one or two child-proof sentences?
Multiplicative persistence
What spells are affected by the size of the caster?
Why does the Sun have different day lengths, but not the gas giants?
How could a planet have erratic days?
Longest common substring in linear time
Why is so much work done on numerical verification of the Riemann Hypothesis?
A question about fixed points and non-expansive map
How much character growth crosses the line into breaking the character
Is a model fitted to data or is data fitted to a model?
How do you respond to a colleague from another team when they're wrongly expecting that you'll help them?
Travelling outside the UK without a passport
Query about absorption line spectra
What is this called? Old film camera viewer?
Could the E-bike drivetrain wear down till needing replacement after 400 km?
Need a math help for the Cagan's model in macroeconomics
What is the difference between Reference and Background image in 2.8
Should I stop contributing to retirement accounts?
Loading commands from file
Which one is correct as adjective “protruding” or “protruded”?
How can "mimic phobia" be cured or prevented?
Sort with assumptions
variable sized lists and using lists as variablesRetaining and reusing a one-to-one mapping from a sortSorting a matrix alphanumericallyRearranging a ListHow can I check if one expression implies another?Generating an Array of VectorsImporting, sorting and exporting listsDeleting Lonely Numbers From a ListApplying multiple functions to a single column in a tableFind positions in which list elements are equal
$begingroup$
I have a list which looks like this
list = 0, Subscript[x,7], -Subscript[x,3]-Subscript[x,9], -Subscript[x,9];
and all the $x_i$'s are positive semidefinite (i.e. nonnegative) real numbers. I would like to be able to sort this into
sortedlist = -Subscript[x,3]-Subscript[x,9], -Subscript[x,9], 0, Subscript[x,7]
How do I achieve this? I tried
Assuming[Subscript[x,3] > 0 && Subscript[x,7] > 0 && Subscript[x,9] > 0, Sort[list]]
But this obviously does not work. In general, I'd like to be able to impose more constraints on the $x_i's$ when they're being sorted.
list-manipulation symbolic array sorting
asked Mar 19 at 21:09
leastactionleastaction
244210
$endgroup$
add a comment |
$begingroup$
I have a list which looks like this
list = 0, Subscript[x,7], -Subscript[x,3]-Subscript[x,9], -Subscript[x,9];
and all the $x_i$'s are positive semidefinite (i.e. nonnegative) real numbers. I would like to be able to sort this into
sortedlist = -Subscript[x,3]-Subscript[x,9], -Subscript[x,9], 0, Subscript[x,7]
How do I achieve this? I tried
Assuming[Subscript[x,3] > 0 && Subscript[x,7] > 0 && Subscript[x,9] > 0, Sort[list]]
But this obviously does not work. In general, I'd like to be able to impose more constraints on the $x_i's$ when they're being sorted.
list-manipulation symbolic array sorting
asked Mar 19 at 21:09
leastactionleastaction
244210
$endgroup$
1
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
Mar 19 at 21:31
add a comment |
$begingroup$
I have a list which looks like this
list = 0, Subscript[x,7], -Subscript[x,3]-Subscript[x,9], -Subscript[x,9];
and all the $x_i$'s are positive semidefinite (i.e. nonnegative) real numbers. I would like to be able to sort this into
sortedlist = -Subscript[x,3]-Subscript[x,9], -Subscript[x,9], 0, Subscript[x,7]
How do I achieve this? I tried
Assuming[Subscript[x,3] > 0 && Subscript[x,7] > 0 && Subscript[x,9] > 0, Sort[list]]
But this obviously does not work. In general, I'd like to be able to impose more constraints on the $x_i's$ when they're being sorted.
list-manipulation symbolic array sorting
asked Mar 19 at 21:09
leastactionleastaction
244210
$endgroup$
I have a list which looks like this
list = 0, Subscript[x,7], -Subscript[x,3]-Subscript[x,9], -Subscript[x,9];
and all the $x_i$'s are positive semidefinite (i.e. nonnegative) real numbers. I would like to be able to sort this into
sortedlist = -Subscript[x,3]-Subscript[x,9], -Subscript[x,9], 0, Subscript[x,7]
How do I achieve this? I tried
Assuming[Subscript[x,3] > 0 && Subscript[x,7] > 0 && Subscript[x,9] > 0, Sort[list]]
But this obviously does not work. In general, I'd like to be able to impose more constraints on the $x_i's$ when they're being sorted.
list-manipulation symbolic array sorting
list-manipulation symbolic array sorting
asked Mar 19 at 21:09
leastactionleastaction
244210
asked Mar 19 at 21:09
leastactionleastaction
244210
asked Mar 19 at 21:09
leastactionleastaction
244210
asked Mar 19 at 21:09
leastactionleastaction
244210
asked Mar 19 at 21:09
leastactionleastaction
244210
244210
1
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
Mar 19 at 21:31
add a comment |
1
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
Mar 19 at 21:31
1
1
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
Mar 19 at 21:31
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
Mar 19 at 21:31
add a comment |
4 Answers
4
active
oldest
votes
$begingroup$
Here is a possibility:
sortWithAssumptions[list_, assum_] := Module[order,
order[a_, b_] := Simplify[a < b, assum];
Sort[list, order]
]
For your example:
sortWithAssumptions[
0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9],
Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0
] //TeXForm
$left-x_3-x_9,-x_9,0,x_7right$
Another example:
sortWithAssumptions[
0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9], Subscript[x,9],
Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0&&Subscript[x,7]<Subscript[x,9]
] //TeXForm
$left-x_3-x_9,-x_9,0,x_7,x_9right$
answered Mar 19 at 21:35
Carl WollCarl Woll
71.4k394186
$endgroup$
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
Mar 19 at 21:38
add a comment |
$begingroup$
How about:
list[[Ordering[list /. _Subscript -> 1]]]
-Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7]
So basically we sort it the way it would be sorted with all subscripts == 1.
answered Mar 19 at 21:28
Kuba♦Kuba
107k12210530
$endgroup$
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
Mar 19 at 21:31
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1and atOrdering[list /. _Subscript -> 1].
$endgroup$
– Kuba♦
Mar 19 at 21:32
$begingroup$
I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
$endgroup$
– leastaction
Mar 19 at 21:36
1
$begingroup$
@leastaction sure, which means there isn't only one correct answer and every valid within constraints is correct.
$endgroup$
– Kuba♦
Mar 19 at 21:38
add a comment |
$begingroup$
Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]
(* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
answered Mar 19 at 21:35
MarcoBMarcoB
37.9k556114
$endgroup$
add a comment |
$begingroup$
In this case, we can use RankedMin and FullSimplify to get the answer you seek
Assuming[
Subscript[x, 3] > 0 && Subscript[x, 7] > 0 && Subscript[x, 9] > 0,
FullSimplify[Table[RankedMin[list, i], i, 1, Length[list]]]]
(* -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
This has the advantage of not returning a (potentially) wrong answer if the sort order is uncertain.
answered Mar 19 at 21:36
mikadomikado
6,7171929
$endgroup$
add a comment |
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: "387"
;
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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
,
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%2fmathematica.stackexchange.com%2fquestions%2f193600%2fsort-with-assumptions%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Here is a possibility:
sortWithAssumptions[list_, assum_] := Module[order,
order[a_, b_] := Simplify[a < b, assum];
Sort[list, order]
]
For your example:
sortWithAssumptions[
0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9],
Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0
] //TeXForm
$left-x_3-x_9,-x_9,0,x_7right$
Another example:
sortWithAssumptions[
0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9], Subscript[x,9],
Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0&&Subscript[x,7]<Subscript[x,9]
] //TeXForm
$left-x_3-x_9,-x_9,0,x_7,x_9right$
answered Mar 19 at 21:35
Carl WollCarl Woll
71.4k394186
$endgroup$
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
Mar 19 at 21:38
add a comment |
$begingroup$
Here is a possibility:
sortWithAssumptions[list_, assum_] := Module[order,
order[a_, b_] := Simplify[a < b, assum];
Sort[list, order]
]
For your example:
sortWithAssumptions[
0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9],
Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0
] //TeXForm
$left-x_3-x_9,-x_9,0,x_7right$
Another example:
sortWithAssumptions[
0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9], Subscript[x,9],
Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0&&Subscript[x,7]<Subscript[x,9]
] //TeXForm
$left-x_3-x_9,-x_9,0,x_7,x_9right$
answered Mar 19 at 21:35
Carl WollCarl Woll
71.4k394186
$endgroup$
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
Mar 19 at 21:38
add a comment |
$begingroup$
Here is a possibility:
sortWithAssumptions[list_, assum_] := Module[order,
order[a_, b_] := Simplify[a < b, assum];
Sort[list, order]
]
For your example:
sortWithAssumptions[
0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9],
Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0
] //TeXForm
$left-x_3-x_9,-x_9,0,x_7right$
Another example:
sortWithAssumptions[
0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9], Subscript[x,9],
Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0&&Subscript[x,7]<Subscript[x,9]
] //TeXForm
$left-x_3-x_9,-x_9,0,x_7,x_9right$
answered Mar 19 at 21:35
Carl WollCarl Woll
71.4k394186
$endgroup$
Here is a possibility:
sortWithAssumptions[list_, assum_] := Module[order,
order[a_, b_] := Simplify[a < b, assum];
Sort[list, order]
]
For your example:
sortWithAssumptions[
0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9],
Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0
] //TeXForm
$left-x_3-x_9,-x_9,0,x_7right$
Another example:
sortWithAssumptions[
0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9], Subscript[x,9],
Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0&&Subscript[x,7]<Subscript[x,9]
] //TeXForm
$left-x_3-x_9,-x_9,0,x_7,x_9right$
answered Mar 19 at 21:35
Carl WollCarl Woll
71.4k394186
answered Mar 19 at 21:35
Carl WollCarl Woll
71.4k394186
answered Mar 19 at 21:35
Carl WollCarl Woll
71.4k394186
answered Mar 19 at 21:35
Carl WollCarl Woll
71.4k394186
71.4k394186
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
Mar 19 at 21:38
add a comment |
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
Mar 19 at 21:38
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
Mar 19 at 21:38
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
Mar 19 at 21:38
add a comment |
$begingroup$
How about:
list[[Ordering[list /. _Subscript -> 1]]]
-Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7]
So basically we sort it the way it would be sorted with all subscripts == 1.
answered Mar 19 at 21:28
Kuba♦Kuba
107k12210530
$endgroup$
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
Mar 19 at 21:31
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1and atOrdering[list /. _Subscript -> 1].
$endgroup$
– Kuba♦
Mar 19 at 21:32
$begingroup$
I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
$endgroup$
– leastaction
Mar 19 at 21:36
1
$begingroup$
@leastaction sure, which means there isn't only one correct answer and every valid within constraints is correct.
$endgroup$
– Kuba♦
Mar 19 at 21:38
add a comment |
$begingroup$
How about:
list[[Ordering[list /. _Subscript -> 1]]]
-Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7]
So basically we sort it the way it would be sorted with all subscripts == 1.
answered Mar 19 at 21:28
Kuba♦Kuba
107k12210530
$endgroup$
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
Mar 19 at 21:31
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1and atOrdering[list /. _Subscript -> 1].
$endgroup$
– Kuba♦
Mar 19 at 21:32
$begingroup$
I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
$endgroup$
– leastaction
Mar 19 at 21:36
1
$begingroup$
@leastaction sure, which means there isn't only one correct answer and every valid within constraints is correct.
$endgroup$
– Kuba♦
Mar 19 at 21:38
add a comment |
$begingroup$
How about:
list[[Ordering[list /. _Subscript -> 1]]]
-Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7]
So basically we sort it the way it would be sorted with all subscripts == 1.
answered Mar 19 at 21:28
Kuba♦Kuba
107k12210530
$endgroup$
How about:
list[[Ordering[list /. _Subscript -> 1]]]
-Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7]
So basically we sort it the way it would be sorted with all subscripts == 1.
answered Mar 19 at 21:28
Kuba♦Kuba
107k12210530
answered Mar 19 at 21:28
Kuba♦Kuba
107k12210530
answered Mar 19 at 21:28
Kuba♦Kuba
107k12210530
answered Mar 19 at 21:28
Kuba♦Kuba
107k12210530
107k12210530
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
Mar 19 at 21:31
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1and atOrdering[list /. _Subscript -> 1].
$endgroup$
– Kuba♦
Mar 19 at 21:32
$begingroup$
I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
$endgroup$
– leastaction
Mar 19 at 21:36
1
$begingroup$
@leastaction sure, which means there isn't only one correct answer and every valid within constraints is correct.
$endgroup$
– Kuba♦
Mar 19 at 21:38
add a comment |
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
Mar 19 at 21:31
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1and atOrdering[list /. _Subscript -> 1].
$endgroup$
– Kuba♦
Mar 19 at 21:32
$begingroup$
I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
$endgroup$
– leastaction
Mar 19 at 21:36
1
$begingroup$
@leastaction sure, which means there isn't only one correct answer and every valid within constraints is correct.
$endgroup$
– Kuba♦
Mar 19 at 21:38
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
Mar 19 at 21:31
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
Mar 19 at 21:31
$begingroup$
@leastaction just take a look at
list /. _Subscript -> 1 and at Ordering[list /. _Subscript -> 1].$endgroup$
– Kuba♦
Mar 19 at 21:32
$begingroup$
@leastaction just take a look at
list /. _Subscript -> 1 and at Ordering[list /. _Subscript -> 1].$endgroup$
– Kuba♦
Mar 19 at 21:32
$begingroup$
I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
$endgroup$
– leastaction
Mar 19 at 21:36
$begingroup$
I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
$endgroup$
– leastaction
Mar 19 at 21:36
1
1
$begingroup$
@leastaction sure, which means there isn't only one correct answer and every valid within constraints is correct.
$endgroup$
– Kuba♦
Mar 19 at 21:38
$begingroup$
@leastaction sure, which means there isn't only one correct answer and every valid within constraints is correct.
$endgroup$
– Kuba♦
Mar 19 at 21:38
add a comment |
$begingroup$
Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]
(* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
answered Mar 19 at 21:35
MarcoBMarcoB
37.9k556114
$endgroup$
add a comment |
$begingroup$
Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]
(* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
answered Mar 19 at 21:35
MarcoBMarcoB
37.9k556114
$endgroup$
add a comment |
$begingroup$
Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]
(* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
answered Mar 19 at 21:35
MarcoBMarcoB
37.9k556114
$endgroup$
Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]
(* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
answered Mar 19 at 21:35
MarcoBMarcoB
37.9k556114
answered Mar 19 at 21:35
MarcoBMarcoB
37.9k556114
answered Mar 19 at 21:35
MarcoBMarcoB
37.9k556114
answered Mar 19 at 21:35
MarcoBMarcoB
37.9k556114
37.9k556114
add a comment |
add a comment |
$begingroup$
In this case, we can use RankedMin and FullSimplify to get the answer you seek
Assuming[
Subscript[x, 3] > 0 && Subscript[x, 7] > 0 && Subscript[x, 9] > 0,
FullSimplify[Table[RankedMin[list, i], i, 1, Length[list]]]]
(* -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
This has the advantage of not returning a (potentially) wrong answer if the sort order is uncertain.
answered Mar 19 at 21:36
mikadomikado
6,7171929
$endgroup$
add a comment |
$begingroup$
In this case, we can use RankedMin and FullSimplify to get the answer you seek
Assuming[
Subscript[x, 3] > 0 && Subscript[x, 7] > 0 && Subscript[x, 9] > 0,
FullSimplify[Table[RankedMin[list, i], i, 1, Length[list]]]]
(* -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
This has the advantage of not returning a (potentially) wrong answer if the sort order is uncertain.
answered Mar 19 at 21:36
mikadomikado
6,7171929
$endgroup$
add a comment |
$begingroup$
In this case, we can use RankedMin and FullSimplify to get the answer you seek
Assuming[
Subscript[x, 3] > 0 && Subscript[x, 7] > 0 && Subscript[x, 9] > 0,
FullSimplify[Table[RankedMin[list, i], i, 1, Length[list]]]]
(* -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
This has the advantage of not returning a (potentially) wrong answer if the sort order is uncertain.
answered Mar 19 at 21:36
mikadomikado
6,7171929
$endgroup$
In this case, we can use RankedMin and FullSimplify to get the answer you seek
Assuming[
Subscript[x, 3] > 0 && Subscript[x, 7] > 0 && Subscript[x, 9] > 0,
FullSimplify[Table[RankedMin[list, i], i, 1, Length[list]]]]
(* -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
This has the advantage of not returning a (potentially) wrong answer if the sort order is uncertain.
answered Mar 19 at 21:36
mikadomikado
6,7171929
edited Mar 19 at 21:43
answered Mar 19 at 21:36
mikadomikado
6,7171929
answered Mar 19 at 21:36
mikadomikado
6,7171929
answered Mar 19 at 21:36
mikadomikado
6,7171929
6,7171929
add a comment |
add a comment |
Thanks for contributing an answer to Mathematica 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%2fmathematica.stackexchange.com%2fquestions%2f193600%2fsort-with-assumptions%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
1
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
Mar 19 at 21:31