Revision history [back]
 | 1 | initial version |
I tried in the sense of the first question alternatively:
sage: Q = QuadraticForm( QQ, 2, [ -1, 0, -1 ] )
sage: Q
Quadratic form in 2 variables over Rational Field with coefficients:
[ -1 0 ]
[ * -1 ]
sage: A = CliffordAlgebra( Q )
sage: A.<x,y> = CliffordAlgebra( Q )
sage: (x+y)^2
-2
sage: (x+y)^3
-2*x - 2*y
sage: (x+y)^2017 == 2^1008*(x+y)
True
The choice of an other quadratic form does the slightly more general job for $n=2$ and $\rho=-1$. The g_algebra method did not work, i suppose, because the generators are considered in a canonical order ... < i < j < ... and we are allowed only to declare how to interchange j*i for i < j . The case i == j produces problems.
I do not have more. The try
sage: F.<i,j> = FreeAlgebra( QQ, 2 )
sage: J = F.ideal( [ i*i + F(1), j*j + F(1), i*j + j*i ] )
sage: J
Twosided Ideal (1 + i^2, 1 + j^2, i*j + j*i) of Free Algebra on 2 generators (i, j) over Rational Field
sage: Q.<x,y> = F.quotient( J )
sage: (x+y)^2
x^2 + x*y + y*x + y^2
sage: Q(i) == x, Q(j) == y
(True, True)
did not work.
