How to compute if a multivector inverse exists in Clifford Algebra The Next CEO of Stack OverflowCalculating the inverse of a multivectorInverse of a general nonfactorizable multivectorHow do I evaluate the Clifford product in dimensions greater than 3?Clifford Algebra Multiplication IntuitionInverse of a general nonfactorizable multivectorFinding an element in a Clifford algebra that satisfy some specific commutation and anti-commutation relationGeneralizing the dot product to multivectorsWhat happens to Clifford algebra structure and periodicity when the field is weird?Is the reverse really an anti-automorphism of a a Clifford algebra?Transformation of metric tensor under clifford algebra?How to perform wedge productOn the algebraic formulation of the Clifford algebra
Reference request: Grassmannian and Plucker coordinates in type B, C, D
Necessary condition on homology group for a set to be contractible
Do I need to write [sic] when a number is less than 10 but isn't written out?
How to write a definition with variants?
Flying from Cape Town to England and return to another province
Is it possible to use a NPN BJT as switch, from single power source?
Are police here, aren't itthey?
Why don't programming languages automatically manage the synchronous/asynchronous problem?
Which one is the true statement?
Dominated convergence theorem - what sequence?
Why specifically branches as firewood on the Altar?
How to edit “Name” property in GCI output?
Why does standard notation not preserve intervals (visually)
Help understanding this unsettling image of Titan, Epimetheus, and Saturn's rings?
Does Germany produce more waste than the US?
Can we say or write : "No, it'sn't"?
Would a completely good Muggle be able to use a wand?
0-rank tensor vs vector in 1D
Would a grinding machine be a simple and workable propulsion system for an interplanetary spacecraft?
If the heap is zero-initialized for security, then why is the stack merely uninitialized?
Is there a difference between "Fahrstuhl" and "Aufzug"
Do they change the text of the seder in Israel?
Why do airplanes bank sharply to the right after air-to-air refueling?
Yu-Gi-Oh cards in Python 3
How to compute if a multivector inverse exists in Clifford Algebra
The Next CEO of Stack OverflowCalculating the inverse of a multivectorInverse of a general nonfactorizable multivectorHow do I evaluate the Clifford product in dimensions greater than 3?Clifford Algebra Multiplication IntuitionInverse of a general nonfactorizable multivectorFinding an element in a Clifford algebra that satisfy some specific commutation and anti-commutation relationGeneralizing the dot product to multivectorsWhat happens to Clifford algebra structure and periodicity when the field is weird?Is the reverse really an anti-automorphism of a a Clifford algebra?Transformation of metric tensor under clifford algebra?How to perform wedge productOn the algebraic formulation of the Clifford algebra
$begingroup$
Suppose we have a 4 dimension positive signature clifford algebra. In Calculating the inverse of a multivector and Inverse of a general nonfactorizable multivector, the inverse of a multivector is presented as a solution when vectors/bivectors are present
$B^-1 = fracB^daggerB B^dagger$
but the above is not true for any multivector. For example, how to know if
$(1+e_1234)^-1$
exists and how to compute it?
clifford-algebras geometric-algebras
$endgroup$
add a comment |
$begingroup$
Suppose we have a 4 dimension positive signature clifford algebra. In Calculating the inverse of a multivector and Inverse of a general nonfactorizable multivector, the inverse of a multivector is presented as a solution when vectors/bivectors are present
$B^-1 = fracB^daggerB B^dagger$
but the above is not true for any multivector. For example, how to know if
$(1+e_1234)^-1$
exists and how to compute it?
clifford-algebras geometric-algebras
$endgroup$
add a comment |
$begingroup$
Suppose we have a 4 dimension positive signature clifford algebra. In Calculating the inverse of a multivector and Inverse of a general nonfactorizable multivector, the inverse of a multivector is presented as a solution when vectors/bivectors are present
$B^-1 = fracB^daggerB B^dagger$
but the above is not true for any multivector. For example, how to know if
$(1+e_1234)^-1$
exists and how to compute it?
clifford-algebras geometric-algebras
$endgroup$
Suppose we have a 4 dimension positive signature clifford algebra. In Calculating the inverse of a multivector and Inverse of a general nonfactorizable multivector, the inverse of a multivector is presented as a solution when vectors/bivectors are present
$B^-1 = fracB^daggerB B^dagger$
but the above is not true for any multivector. For example, how to know if
$(1+e_1234)^-1$
exists and how to compute it?
clifford-algebras geometric-algebras
clifford-algebras geometric-algebras
asked Mar 19 at 13:10
paco gilpaco gil
82
82
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Naively speaking, the existence of inverses will depend on the signature $(p,q)$ of the quadratic space $mathbbR^p,q=(mathbbR^p+q,g)$, in which for an orthonormal basis $e_i_i=1^n=p+q$ and $v=sum v^ie_i$ we have
$$g(v,v)=(v^1)^2+(v^2)^2+cdots+(v^p)^2-(v^p+1)^2-cdots-(v^p+q)^2.$$
For your example, notice that if $(e_1234)^2=-1$, then
$$(1+e_1234)frac12(1-e_1234)=1,$$
which means that $(1+e_1234)^-1=frac12(1-e_1234)$.
Now, if $(e_1234)^2=1$, then there is no inverse for $(1+e_1234)$, which is due to the fact that $xoverlinex=0$. More specifically, one can derive conditions for which there are inverses for the cases where $p+q=nleq 5$. The discovery of new faster methods for higher dimensions, which do not depend on the signature is a problem still under development as of today. As an example, we could cite this.
$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: "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%2f3154032%2fhow-to-compute-if-a-multivector-inverse-exists-in-clifford-algebra%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
$begingroup$
Naively speaking, the existence of inverses will depend on the signature $(p,q)$ of the quadratic space $mathbbR^p,q=(mathbbR^p+q,g)$, in which for an orthonormal basis $e_i_i=1^n=p+q$ and $v=sum v^ie_i$ we have
$$g(v,v)=(v^1)^2+(v^2)^2+cdots+(v^p)^2-(v^p+1)^2-cdots-(v^p+q)^2.$$
For your example, notice that if $(e_1234)^2=-1$, then
$$(1+e_1234)frac12(1-e_1234)=1,$$
which means that $(1+e_1234)^-1=frac12(1-e_1234)$.
Now, if $(e_1234)^2=1$, then there is no inverse for $(1+e_1234)$, which is due to the fact that $xoverlinex=0$. More specifically, one can derive conditions for which there are inverses for the cases where $p+q=nleq 5$. The discovery of new faster methods for higher dimensions, which do not depend on the signature is a problem still under development as of today. As an example, we could cite this.
$endgroup$
add a comment |
$begingroup$
Naively speaking, the existence of inverses will depend on the signature $(p,q)$ of the quadratic space $mathbbR^p,q=(mathbbR^p+q,g)$, in which for an orthonormal basis $e_i_i=1^n=p+q$ and $v=sum v^ie_i$ we have
$$g(v,v)=(v^1)^2+(v^2)^2+cdots+(v^p)^2-(v^p+1)^2-cdots-(v^p+q)^2.$$
For your example, notice that if $(e_1234)^2=-1$, then
$$(1+e_1234)frac12(1-e_1234)=1,$$
which means that $(1+e_1234)^-1=frac12(1-e_1234)$.
Now, if $(e_1234)^2=1$, then there is no inverse for $(1+e_1234)$, which is due to the fact that $xoverlinex=0$. More specifically, one can derive conditions for which there are inverses for the cases where $p+q=nleq 5$. The discovery of new faster methods for higher dimensions, which do not depend on the signature is a problem still under development as of today. As an example, we could cite this.
$endgroup$
add a comment |
$begingroup$
Naively speaking, the existence of inverses will depend on the signature $(p,q)$ of the quadratic space $mathbbR^p,q=(mathbbR^p+q,g)$, in which for an orthonormal basis $e_i_i=1^n=p+q$ and $v=sum v^ie_i$ we have
$$g(v,v)=(v^1)^2+(v^2)^2+cdots+(v^p)^2-(v^p+1)^2-cdots-(v^p+q)^2.$$
For your example, notice that if $(e_1234)^2=-1$, then
$$(1+e_1234)frac12(1-e_1234)=1,$$
which means that $(1+e_1234)^-1=frac12(1-e_1234)$.
Now, if $(e_1234)^2=1$, then there is no inverse for $(1+e_1234)$, which is due to the fact that $xoverlinex=0$. More specifically, one can derive conditions for which there are inverses for the cases where $p+q=nleq 5$. The discovery of new faster methods for higher dimensions, which do not depend on the signature is a problem still under development as of today. As an example, we could cite this.
$endgroup$
Naively speaking, the existence of inverses will depend on the signature $(p,q)$ of the quadratic space $mathbbR^p,q=(mathbbR^p+q,g)$, in which for an orthonormal basis $e_i_i=1^n=p+q$ and $v=sum v^ie_i$ we have
$$g(v,v)=(v^1)^2+(v^2)^2+cdots+(v^p)^2-(v^p+1)^2-cdots-(v^p+q)^2.$$
For your example, notice that if $(e_1234)^2=-1$, then
$$(1+e_1234)frac12(1-e_1234)=1,$$
which means that $(1+e_1234)^-1=frac12(1-e_1234)$.
Now, if $(e_1234)^2=1$, then there is no inverse for $(1+e_1234)$, which is due to the fact that $xoverlinex=0$. More specifically, one can derive conditions for which there are inverses for the cases where $p+q=nleq 5$. The discovery of new faster methods for higher dimensions, which do not depend on the signature is a problem still under development as of today. As an example, we could cite this.
edited Mar 20 at 17:39
answered Mar 20 at 16:33
Aquerman KuczmendaAquerman Kuczmenda
1065
1065
add a comment |
add a comment |
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%2f3154032%2fhow-to-compute-if-a-multivector-inverse-exists-in-clifford-algebra%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