summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
c7ee9a3)
This doesn't actually affect anything in these cases, but the row "i"
indices should be on the outside whenever we loop through a
two-dimensional array that corresponds to a matrix.
"""
def __init__(self, n, field=QQ):
V = VectorSpace(field, n)
"""
def __init__(self, n, field=QQ):
V = VectorSpace(field, n)
- mult_table = [ [ V.basis()[i]*(i == j) for i in range(n) ]
- for j in range(n) ]
+ mult_table = [ [ V.basis()[i]*(i == j) for j in range(n) ]
+ for i in range(n) ]
fdeja = super(RealCartesianProductEJA, self)
return fdeja.__init__(field, mult_table, rank=n)
fdeja = super(RealCartesianProductEJA, self)
return fdeja.__init__(field, mult_table, rank=n)
V = VectorSpace(field, dimension**2)
W = V.span_of_basis( _mat2vec(s) for s in basis )
n = len(basis)
V = VectorSpace(field, dimension**2)
W = V.span_of_basis( _mat2vec(s) for s in basis )
n = len(basis)
- mult_table = [[W.zero() for i in range(n)] for j in range(n)]
+ mult_table = [[W.zero() for j in range(n)] for i in range(n)]
for i in range(n):
for j in range(n):
mat_entry = (basis[i]*basis[j] + basis[j]*basis[i])/2
for i in range(n):
for j in range(n):
mat_entry = (basis[i]*basis[j] + basis[j]*basis[i])/2
"""
def __init__(self, n, field=QQ):
V = VectorSpace(field, n)
"""
def __init__(self, n, field=QQ):
V = VectorSpace(field, n)
- mult_table = [[V.zero() for i in range(n)] for j in range(n)]
+ mult_table = [[V.zero() for j in range(n)] for i in range(n)]
for i in range(n):
for j in range(n):
x = V.basis()[i]
for i in range(n):
for j in range(n):
x = V.basis()[i]