Resolving a rational system of equations with too many unkowns












2












$begingroup$


A little bit of context.



While working a larger proof (the proof is quite related to this question I asked), I stumbled upon the following problem.



The question.




Can we find $x_1,ldots,x_{24}inmathbb Q$ such that for all $a,b,c,dinmathbb Q$:



$$ (x_1a+x_2b+x_3c+x_4d)(x_5a+x_6b+x_7c+x_8d)-(x_{9}a+x_{10}b+x_{11}c+x_{12}d)(x_{13}a+x_{14}b+x_{15}c+x_{16}d)-(x_{17}a+x_{18}b+x_{19}c+x_{20}d)(x_{21}a+x_{22}b+x_{23}c+x_{24}d)$$
$$=7a^2-b^2-c^2-d^2quad ?$$




What I tried.



I have tried to do a systematic resolution of the underlying system, but this is too massive to compute.



I have tried arbitrarily fixing some of the $x_i$ in order to simplify the system, but I always end up in one of the following cases:




  • no solution,


  • irrational solutions,


  • complex solutions.



None of this cases is acceptable.



Any leads would be greatly appreciated.










share|cite|improve this question









$endgroup$












  • $begingroup$
    You can just remove all the terms $x_{17}$ through $x_{24}$. They are redundant with the preceding eight. Replace $x_9$ with $x_9+x_{17}$ and so on.
    $endgroup$
    – Ross Millikan
    Jan 21 at 15:18


















2












$begingroup$


A little bit of context.



While working a larger proof (the proof is quite related to this question I asked), I stumbled upon the following problem.



The question.




Can we find $x_1,ldots,x_{24}inmathbb Q$ such that for all $a,b,c,dinmathbb Q$:



$$ (x_1a+x_2b+x_3c+x_4d)(x_5a+x_6b+x_7c+x_8d)-(x_{9}a+x_{10}b+x_{11}c+x_{12}d)(x_{13}a+x_{14}b+x_{15}c+x_{16}d)-(x_{17}a+x_{18}b+x_{19}c+x_{20}d)(x_{21}a+x_{22}b+x_{23}c+x_{24}d)$$
$$=7a^2-b^2-c^2-d^2quad ?$$




What I tried.



I have tried to do a systematic resolution of the underlying system, but this is too massive to compute.



I have tried arbitrarily fixing some of the $x_i$ in order to simplify the system, but I always end up in one of the following cases:




  • no solution,


  • irrational solutions,


  • complex solutions.



None of this cases is acceptable.



Any leads would be greatly appreciated.










share|cite|improve this question









$endgroup$












  • $begingroup$
    You can just remove all the terms $x_{17}$ through $x_{24}$. They are redundant with the preceding eight. Replace $x_9$ with $x_9+x_{17}$ and so on.
    $endgroup$
    – Ross Millikan
    Jan 21 at 15:18
















2












2








2


1



$begingroup$


A little bit of context.



While working a larger proof (the proof is quite related to this question I asked), I stumbled upon the following problem.



The question.




Can we find $x_1,ldots,x_{24}inmathbb Q$ such that for all $a,b,c,dinmathbb Q$:



$$ (x_1a+x_2b+x_3c+x_4d)(x_5a+x_6b+x_7c+x_8d)-(x_{9}a+x_{10}b+x_{11}c+x_{12}d)(x_{13}a+x_{14}b+x_{15}c+x_{16}d)-(x_{17}a+x_{18}b+x_{19}c+x_{20}d)(x_{21}a+x_{22}b+x_{23}c+x_{24}d)$$
$$=7a^2-b^2-c^2-d^2quad ?$$




What I tried.



I have tried to do a systematic resolution of the underlying system, but this is too massive to compute.



I have tried arbitrarily fixing some of the $x_i$ in order to simplify the system, but I always end up in one of the following cases:




  • no solution,


  • irrational solutions,


  • complex solutions.



None of this cases is acceptable.



Any leads would be greatly appreciated.










share|cite|improve this question









$endgroup$




A little bit of context.



While working a larger proof (the proof is quite related to this question I asked), I stumbled upon the following problem.



The question.




Can we find $x_1,ldots,x_{24}inmathbb Q$ such that for all $a,b,c,dinmathbb Q$:



$$ (x_1a+x_2b+x_3c+x_4d)(x_5a+x_6b+x_7c+x_8d)-(x_{9}a+x_{10}b+x_{11}c+x_{12}d)(x_{13}a+x_{14}b+x_{15}c+x_{16}d)-(x_{17}a+x_{18}b+x_{19}c+x_{20}d)(x_{21}a+x_{22}b+x_{23}c+x_{24}d)$$
$$=7a^2-b^2-c^2-d^2quad ?$$




What I tried.



I have tried to do a systematic resolution of the underlying system, but this is too massive to compute.



I have tried arbitrarily fixing some of the $x_i$ in order to simplify the system, but I always end up in one of the following cases:




  • no solution,


  • irrational solutions,


  • complex solutions.



None of this cases is acceptable.



Any leads would be greatly appreciated.







algebra-precalculus systems-of-equations diophantine-equations






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 21 at 15:03









E. JosephE. Joseph

11.7k82856




11.7k82856












  • $begingroup$
    You can just remove all the terms $x_{17}$ through $x_{24}$. They are redundant with the preceding eight. Replace $x_9$ with $x_9+x_{17}$ and so on.
    $endgroup$
    – Ross Millikan
    Jan 21 at 15:18




















  • $begingroup$
    You can just remove all the terms $x_{17}$ through $x_{24}$. They are redundant with the preceding eight. Replace $x_9$ with $x_9+x_{17}$ and so on.
    $endgroup$
    – Ross Millikan
    Jan 21 at 15:18


















$begingroup$
You can just remove all the terms $x_{17}$ through $x_{24}$. They are redundant with the preceding eight. Replace $x_9$ with $x_9+x_{17}$ and so on.
$endgroup$
– Ross Millikan
Jan 21 at 15:18






$begingroup$
You can just remove all the terms $x_{17}$ through $x_{24}$. They are redundant with the preceding eight. Replace $x_9$ with $x_9+x_{17}$ and so on.
$endgroup$
– Ross Millikan
Jan 21 at 15:18












1 Answer
1






active

oldest

votes


















2












$begingroup$

From Legendre $3$-square theorem the right hand side can never vanish unless all terms are zero.



However, no mather what the $x_i$ are, it is possible with three linear conditions on $(a,b,c,d)$ to force the left hand side to vanish, meaning the left hand side has infinitely many rational zeroes.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thanks for the answer. Can we find explicitly these linear conditions on $(a,b,c,d,)$?
    $endgroup$
    – E. Joseph
    Jan 22 at 10:46










  • $begingroup$
    Vanish one factor per term in your left hand side.
    $endgroup$
    – Mindlack
    Jan 22 at 10:47











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%2f3081971%2fresolving-a-rational-system-of-equations-with-too-many-unkowns%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









2












$begingroup$

From Legendre $3$-square theorem the right hand side can never vanish unless all terms are zero.



However, no mather what the $x_i$ are, it is possible with three linear conditions on $(a,b,c,d)$ to force the left hand side to vanish, meaning the left hand side has infinitely many rational zeroes.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thanks for the answer. Can we find explicitly these linear conditions on $(a,b,c,d,)$?
    $endgroup$
    – E. Joseph
    Jan 22 at 10:46










  • $begingroup$
    Vanish one factor per term in your left hand side.
    $endgroup$
    – Mindlack
    Jan 22 at 10:47
















2












$begingroup$

From Legendre $3$-square theorem the right hand side can never vanish unless all terms are zero.



However, no mather what the $x_i$ are, it is possible with three linear conditions on $(a,b,c,d)$ to force the left hand side to vanish, meaning the left hand side has infinitely many rational zeroes.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thanks for the answer. Can we find explicitly these linear conditions on $(a,b,c,d,)$?
    $endgroup$
    – E. Joseph
    Jan 22 at 10:46










  • $begingroup$
    Vanish one factor per term in your left hand side.
    $endgroup$
    – Mindlack
    Jan 22 at 10:47














2












2








2





$begingroup$

From Legendre $3$-square theorem the right hand side can never vanish unless all terms are zero.



However, no mather what the $x_i$ are, it is possible with three linear conditions on $(a,b,c,d)$ to force the left hand side to vanish, meaning the left hand side has infinitely many rational zeroes.






share|cite|improve this answer









$endgroup$



From Legendre $3$-square theorem the right hand side can never vanish unless all terms are zero.



However, no mather what the $x_i$ are, it is possible with three linear conditions on $(a,b,c,d)$ to force the left hand side to vanish, meaning the left hand side has infinitely many rational zeroes.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Jan 21 at 15:17









MindlackMindlack

4,885211




4,885211












  • $begingroup$
    Thanks for the answer. Can we find explicitly these linear conditions on $(a,b,c,d,)$?
    $endgroup$
    – E. Joseph
    Jan 22 at 10:46










  • $begingroup$
    Vanish one factor per term in your left hand side.
    $endgroup$
    – Mindlack
    Jan 22 at 10:47


















  • $begingroup$
    Thanks for the answer. Can we find explicitly these linear conditions on $(a,b,c,d,)$?
    $endgroup$
    – E. Joseph
    Jan 22 at 10:46










  • $begingroup$
    Vanish one factor per term in your left hand side.
    $endgroup$
    – Mindlack
    Jan 22 at 10:47
















$begingroup$
Thanks for the answer. Can we find explicitly these linear conditions on $(a,b,c,d,)$?
$endgroup$
– E. Joseph
Jan 22 at 10:46




$begingroup$
Thanks for the answer. Can we find explicitly these linear conditions on $(a,b,c,d,)$?
$endgroup$
– E. Joseph
Jan 22 at 10:46












$begingroup$
Vanish one factor per term in your left hand side.
$endgroup$
– Mindlack
Jan 22 at 10:47




$begingroup$
Vanish one factor per term in your left hand side.
$endgroup$
– Mindlack
Jan 22 at 10:47


















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%2f3081971%2fresolving-a-rational-system-of-equations-with-too-many-unkowns%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

Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

ts Property 'filter' does not exist on type '{}'

mat-slide-toggle shouldn't change it's state when I click cancel in confirmation window