| Home | Trees | Indices | Help |
|---|
|
|
object --+
|
structure.sage_object.SageObject --+
|
structure.element.Element --+
|
structure.element.ModuleElement --+
|
structure.element.RingElement --+
|
structure.element.AlgebraElement --+
|
free_algebra_quotient_element.FreeAlgebraQuotientElement --+
|
QuaternionAlgebraElement
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Inherited from Inherited from Inherited from Inherited from Inherited from Inherited from Inherited from Inherited from Inherited from |
|||
|
|||
|
Inherited from |
|||
|
|||
Create the element x of the quaternion algebra H. |
cmp(x,y) |
Return the conjugate of this element.
EXAMPLES:
sage: A.<i,j,k>=QuaternionAlgebra(QQ,-5,-2)
sage: x=3*i-j+2
sage: x.conjugate()
2 - 3*i + j
|
Return the reduced trace of this element.
\note{In a quaternion algebra $A$, every element $x$ is
quadratic over the center, thus $x^2 = \Tr(x)*x - \Nr(x)$, so
we solve for a linear relation $(1,-\Tr(x),\Nr(x))$ among
$[x^2, x, 1]$ for the reduced trace of $x$.}
EXAMPLES:
sage: A.<i,j,k>=QuaternionAlgebra(QQ,-5,-2)
sage: x=3*i-j+2
sage: x.reduced_trace()
4
|
Return the reduced norm of this element.
EXAMPLES:
sage: A.<i,j,k>=QuaternionAlgebra(QQ,-5,-2)
sage: x=3*i-j+2
sage: x.reduced_norm()
51
|
Return the characteristic polynomial of this element in terms
of the given variable.
EXAMPLES:
sage: A.<i,j,k>=QuaternionAlgebra(QQ,-5,-2)
sage: x=3*i-j+2
sage: x.charpoly('t')
t^2 - 4*t + 51
|
Return the characteristic polynomial of this element in terms
of the given variable.
EXAMPLES:
sage: A.<i,j,k>=QuaternionAlgebra(QQ,-5,-2)
sage: x=3*i-j+2
sage: x.charpoly('t')
t^2 - 4*t + 51
|
Return the minimal polynomial of this element in terms
of the given variable.
EXAMPLES:
sage: A.<i,j,k>=QuaternionAlgebra(QQ,-5,-2)
sage: x=3*i-j+2
sage: x.minpoly('t')
t^2 - 4*t + 51
|
Return the minimal polynomial of this element in terms
of the given variable.
EXAMPLES:
sage: A.<i,j,k>=QuaternionAlgebra(QQ,-5,-2)
sage: x=3*i-j+2
sage: x.minpoly('t')
t^2 - 4*t + 51
|
Return True if the element is an invertible element of the
quaternion algebra.
EXAMPLES:
sage: A.<i,j,k> = QuaternionAlgebra(QQ,-1,-1)
sage: i.is_unit()
True
sage: (i-5+j*k).is_unit()
True
sage: A(0).is_unit()
False
|
File: sage/structure/element.pyx (starting at line 1549) Return the additive order of self.
|
Return True is this element of a quaternion algebra is
a scalar (i.e. lies in the base field).
EXAMPLES:
sage: A.<i,j,k> = QuaternionAlgebra(QQ,-1,-1)
sage: i.is_scalar()
False
sage: (i-5+j*k).is_scalar()
False
sage: A(12).is_scalar()
True
|
Return True is this element of a quaternion algebra is
"pure" (i.e. has no scalar component, or has reduced-trace zero).
EXAMPLES:
sage: A.<i,j,k> = QuaternionAlgebra(QQ,-1,-1)
sage: i.is_pure()
True
sage: (i-5+j*k).is_pure()
False
sage: A(12).is_pure()
False
|
Return the part of the quaternion 'self' that lies in the base field/ring.
This is given by the reduced trace (note: we assume characteristic not 2).
We could cheat, using self.vector(), but we really don't know what basis
is in place. Do we?
EXAMPLES:
sage: A.<i,j,k> = QuaternionAlgebra(QQ,-1,-1)
sage: i.scalar_part()
0
sage: x = A([1,-3/2,0,2])
sage: x.scalar_part()
1
|
Return the part of the quaternion 'self' that lies in the vector subspace
"<i,j,k>" (figuratively speaking). We just strip off the scalar part...
EXAMPLES:
sage: A.<i,j,k> = QuaternionAlgebra(QQ,-1,-1)
sage: x = A([1,-3/2,0,2])
sage: x.pure_part()
-3/2*i + 2*k
|
Right division in the quaternion algebra
EXAMPLES:
sage: A.<i,j,k>=QuaternionAlgebra(QQ,-1,-1)
sage: x=3*i-j+2
sage: y=i-1
sage: x/y
1/2 - 5/2*i + 1/2*j - 1/2*k
Note that 1/x will raise an AttributeError. The way to get
the inverse of x is
sage: A(1)/x
1/7 - 3/14*i + 1/14*j
|
Left division in the quaternion algebra
EXAMPLES:
sage: A.<i,j,k>=QuaternionAlgebra(QQ,-1,-1)
sage: x=3*i-j+2
sage: y=i-1
sage: x\y
1/14 + 5/14*i - 1/14*j - 1/14*k
|
| Home | Trees | Indices | Help |
|---|
| Generated by Epydoc 3.0beta1 on Thu Jul 17 04:23:30 2008 | http://epydoc.sourceforge.net |