Brandt Modules¶

AUTHORS:

Jon Bober
Alia Hamieh
Victoria de Quehen
William Stein
Gonzalo Tornaria

Introduction¶

This tutorial outlines the construction of Brandt modules in Sage. The importance of this construction is that it provides us with a method to compute modular forms on $\Gamma_0(N)$ as outlined in Pizer’s paper [Pi]. In fact there exists a non-canonical Hecke algebra isomorphism between the Brandt modules and a certain subspace of $S_{2}(\Gamma_0(pM))$ which contains all the newforms.

The Brandt module is the free abelian group on right ideal classes of a quaternion order together with a natural Hecke action determined by Brandt matrices.

Quaternion Algebras¶

A quaternion algebra over $\QQ$ is a central simple algebra of dimension 4 over $\QQ$ . Such an algebra $A$ is said to be ramified at a place $v$ of $\QQ$ if and only if $A_v=A\otimes \QQ_v$ is a division algebra. Otherwise $A$ is said to be split at $v$ .

A = QuaternionAlgebra(p) returns the quaternion algebra $A$ over $\QQ$ ramified precisely at the places $p$ and $\infty$ .

A = QuaternionAlgebra(k,a,b) returns a quaternion algebra with basis $\{1,i,j,j\}$ over $\mathbb{K}$ such that $i^2=a$ , $j^2=b$ and $ij=k.$

An order $R$ in a quaternion algebra is a 4-dimensional lattice on $A$ which is also a subring containing the identity.

R = A.maximal_order() returns a maximal order $R$ in the quaternion algebra $A.$

An Eichler order $\mathcal{O}$ in a quaternion algebra is the intersection of two maximal orders. The level of $\mathcal{O}$ is its index in any maximal order containing it.

O = A.order_of_level_N returns an Eichler order $\mathcal{O}$ in $A$ of level $N$ where $p$ does not divide $N$ .

A right $\mathcal{O}$ -ideal $I$ is a lattice on $A$ such that $I_p=a_p\mathcal{O}$ (for some $a_p\in A_p^*$ ) for all $p<\infty$ . Two right $\mathcal{O}$ -ideals $I$ and $J$ are said to belong to the same class if $I=aJ$ for some $a \in A^*$ . (Left $\mathcal{O}$ -ideals are defined in a similar fashion.)

The right order of $I$ is defined to be the set of elements in $A$ which fix $I$ under right multiplication.

right_order (R, basis) returns the right ideal of $I$ in $R$ given a basis for the right ideal $I$ contained in the maximal order $R.$

ideal_classes(self) returns a tuple of all right ideal classes in self which, for the purpose of constructing the Brandt module B(p,M), is taken to be an Eichler order of level M.

The implementation of this method is especially interesting. It depends on the construction of a Hecke module defined as a free abelian group on right ideal classes of a quaternion algebra with the following action

where $(n,pM)=1$ and the sum is over cyclic $\mathcal{O}$ -module homomorphisms $\phi :I\rightarrow J ` of degree `n$ up to isomorphism of $J$ . Equivalently one can sum over the inclusions of the submodules $J \rightarrow n^{-1}I$ . The rough idea is to start with the trivial ideal class containing the order $\mathcal{O}$ itself. Using the method cyclic_submodules(self, I, p) one computes $T_p([\mathcal{O}])$ for some prime integer $p$ not dividing the level of the order $\mathcal{O}$ . Apply this method repeatedly and test for equivalence among resulting ideals. A theorem of Serre asserts that one gets a complete set of ideal class representatives after a finite number of repetitions.

One can prove that two ideals $I$ and $J$ are equivalent if and only if there exists an element $\alpha \in I \overline{J}$ such $N(\alpha)=N(I)N(J)$ .

is_equivalent(I,J) returns true if $I$ and $J$ are equivalent. This method first compares the theta series of $I$ and $J$ . If they are the same, it computes the theta series of the lattice $I\overline(J)$ . It returns true if the $n^{th}$ coefficient of this series is nonzero where $n=N(J)N(I)$ .

The theta series of a lattice $L$ over the quaternion algebra $A$ is defined as

L.theta_series(T,q) returns a power series representing $\theta_L(q)$ up to a precision of $\mathcal{O}(q^{T+1})$ .

Hecke Structure¶

The Hecke structure defined on the Brandt module is given by the Brandt matrices which can be computed using the definition of the Hecke operators given earlier.

hecke_matrix_from_defn (self,n) returns the matrix of the nth Hecke operator $B_{0}(n)$ acting on self, computed directly from the definition.

However, one can efficiently compute Brandt matrices using theta series. In fact, let { $I_{1},.....,I_{h}$ } be a set of right $\mathcal{O}$ -ideal class representatives. The (i,j) entry in the Brandt matrix $B_{0}(n)$ is the product of the $n^{th}$ coefficient in the theta series of the lattice $I_{i}\overline{I_{j}}$ and the first coefficient in the theta series of the lattice $I_{i}\overline{I_{i}}$ .

compute_hecke_matrix_brandt(self,n) returns the nth Hecke matrix, computed using theta series.

Example¶

sage: B = BrandtModule(23)

sage: B.maximal_order()
Order of Quaternion Algebra (-1, -23) with base ring Rational Field with basis (1/2 + 1/2*j, 1/2*i + 1/2*k, j, k)

sage: B.right_ideals()
(Fractional ideal (2 + 2*j, 2*i + 2*k, 4*j, 4*k), Fractional ideal (2 + 2*j, 2*i + 6*k, 8*j, 8*k), Fractional ideal (2 + 10*j + 8*k, 2*i + 8*j + 6*k, 16*j, 16*k))

sage: B.hecke_matrix(2)
[1 2 0]
[1 1 1]
[0 3 0]

sage: B.brandt_series(3)
[1/4 + q + q^2 + O(q^3)     1/4 + q^2 + O(q^3)           1/4 + O(q^3)]
[  1/2 + 2*q^2 + O(q^3) 1/2 + q + q^2 + O(q^3)   1/2 + 3*q^2 + O(q^3)]
[          1/6 + O(q^3)     1/6 + q^2 + O(q^3)       1/6 + q + O(q^3)]

References¶

[Pi] Arnold Pizer, An Algorithm for Computing Modular Forms on $\Gamma_{0}(N)$
[Ko] David Kohel, Hecke Module Structure of Quaternions

Further Examples¶

We decompose a Brandt module over both $\ZZ$ and $\QQ$ .:

sage: B = BrandtModule(43, base_ring=ZZ); B
Brandt module of dimension 4 of level 43 of weight 2 over Integer Ring
sage: D = B.decomposition()
sage: D
[
Subspace of dimension 1 of Brandt module of dimension 4 of level 43 of weight 2 over Integer Ring,
Subspace of dimension 1 of Brandt module of dimension 4 of level 43 of weight 2 over Integer Ring,
Subspace of dimension 2 of Brandt module of dimension 4 of level 43 of weight 2 over Integer Ring
]
sage: D[0].basis()
((0, 0, 1, -1),)
sage: D[1].basis()
((1, 2, 2, 2),)
sage: D[2].basis()
((1, 1, -1, -1), (0, 2, -1, -1))
sage: B = BrandtModule(43, base_ring=QQ); B
Brandt module of dimension 4 of level 43 of weight 2 over Rational Field
sage: B.decomposition()[2].basis()
((1, 0, -1/2, -1/2), (0, 1, -1/2, -1/2))

sage.modular.quatalg.brandt.BrandtModule(N, M=1, weight=2, base_ring=Rational Field, use_cache=True)¶

Return the Brandt module of given weight associated to the prime power p^r and integer M, where p and M are coprime.

INPUT:

N – a product of primes with odd exponents
M – an integer coprime to q (default: 1)
weight – an integer that is at least 2 (default: 2)
base_ring – the base ring (default: QQ)
use_cache – whether to use the cache (default: True)

OUTPUT:

a Brandt module

EXAMPLES:

sage: BrandtModule(17)
Brandt module of dimension 2 of level 17 of weight 2 over Rational Field
sage: BrandtModule(17,15)
Brandt module of dimension 32 of level 17*15 of weight 2 over Rational Field
sage: BrandtModule(3,7)
Brandt module of dimension 2 of level 3*7 of weight 2 over Rational Field
sage: BrandtModule(3,weight=2)
Brandt module of dimension 1 of level 3 of weight 2 over Rational Field
sage: BrandtModule(11, base_ring=ZZ)
Brandt module of dimension 2 of level 11 of weight 2 over Integer Ring
sage: BrandtModule(11, base_ring=QQbar)
Brandt module of dimension 2 of level 11 of weight 2 over Algebraic Field

The use_cache option determines whether the Brandt module returned by this function is cached.:

sage: BrandtModule(37) is BrandtModule(37)
True
sage: BrandtModule(37,use_cache=False) is BrandtModule(37,use_cache=False)
False

TESTS:

Note that N and M must be coprime:

sage: BrandtModule(3,15)
...
ValueError: M must be coprime to N

Only weight 2 is currently implemented:

sage: BrandtModule(3,weight=4)
...
NotImplementedError: weight != 2 not yet implemented

Brandt modules are cached:

sage: B = BrandtModule(3,5,2,ZZ)
sage: B is BrandtModule(3,5,2,ZZ)
True

class sage.modular.quatalg.brandt.BrandtModuleElement(parent, x)¶

Bases: sage.modular.hecke.element.HeckeModuleElement

monodromy_pairing(x)¶

Return the monodromy pairing of self and x.

EXAMPLES:

sage: B = BrandtModule(5,13)
sage: B.monodromy_weights()
(1, 3, 1, 1, 1, 3)
sage: (B.0 + B.1).monodromy_pairing(B.0 + B.1)
4

class sage.modular.quatalg.brandt.BrandtModule_class(N, M, weight, base_ring)¶

Bases: sage.modular.hecke.ambient_module.AmbientHeckeModule

A Brandt module.

EXAMPLES:

sage: BrandtModule(3, 10)
Brandt module of dimension 4 of level 3*10 of weight 2 over Rational Field

M()¶

Return the auxiliary level (prime to p part) of the quaternion order used to compute this Brandt module.

EXAMPLES:

sage: BrandtModule(7,5,2,ZZ).M()
5

N()¶

Return ramification level N.

EXAMPLES:

sage: BrandtModule(7,5,2,ZZ).N()
7

brandt_series(prec, var='q')¶

Return matrix of power series $\sum T_n q^n$ to the given precision. Note that the Hecke operators in this series are always over $\QQ$ , even if the base ring of this Brandt module is not $\QQ$ .

INPUT:

prec – positive intege
var – string (default: $q$ )

OUTPUT:

matrix of power series with coefficients in $\QQ$

EXAMPLES:

sage: B = BrandtModule(11)
sage: B.brandt_series(2)
[1/4 + q + O(q^2)     1/4 + O(q^2)]
[    1/6 + O(q^2) 1/6 + q + O(q^2)]
sage: B.brandt_series(5)
[1/4 + q + q^2 + 2*q^3 + 5*q^4 + O(q^5)   1/4 + 3*q^2 + 3*q^3 + 3*q^4 + O(q^5)]
[  1/6 + 2*q^2 + 2*q^3 + 2*q^4 + O(q^5)         1/6 + q + q^3 + 4*q^4 + O(q^5)]

Asking for a smaller precision works.:

sage: B.brandt_series(3)
[1/4 + q + q^2 + O(q^3)   1/4 + 3*q^2 + O(q^3)]
[  1/6 + 2*q^2 + O(q^3)       1/6 + q + O(q^3)]
sage: B.brandt_series(3,var='t')
[1/4 + t + t^2 + O(t^3)   1/4 + 3*t^2 + O(t^3)]
[  1/6 + 2*t^2 + O(t^3)       1/6 + t + O(t^3)]

cyclic_submodules(I, p)¶

Return a list of rescaled versions of the fractional right ideals $J$ such that $J$ contains $I$ and the quotient has group structure the product of two cyclic groups of order $p$ .

We emphasize again that $J$ is rescaled to be integral.

INPUT:: I – ideal I in R = self.order_of_level_N() p – prime p coprime to self.level()
OUTPUT:: list of the p+1 fractional right R-ideals that contain I such that J/I is GF(p) x GF(p).

EXAMPLES:

sage: B = BrandtModule(11)
sage: I = B.order_of_level_N().unit_ideal()
sage: B.cyclic_submodules(I, 2)
[Fractional ideal (1/2 + 3/2*j + k, 1/2*i + j + 1/2*k, 2*j, 2*k),
 Fractional ideal (1/2 + 1/2*i + 1/2*j + 1/2*k, i + k, j + k, 2*k),
 Fractional ideal (1/2 + 1/2*j + k, 1/2*i + j + 3/2*k, 2*j, 2*k)]
sage: B.cyclic_submodules(I, 3)
[Fractional ideal (1/2 + 1/2*j, 1/2*i + 5/2*k, 3*j, 3*k),
 Fractional ideal (1/2 + 3/2*j + 2*k, 1/2*i + 2*j + 3/2*k, 3*j, 3*k),
 Fractional ideal (1/2 + 3/2*j + k, 1/2*i + j + 3/2*k, 3*j, 3*k),
 Fractional ideal (1/2 + 5/2*j, 1/2*i + 1/2*k, 3*j, 3*k)]
sage: B.cyclic_submodules(I, 11)
...
ValueError: p must be coprime to the level

eisenstein_subspace()¶

Return the 1-dimensional subspace of self on which the Hecke operators $T_p$ act as $p+1$ for $p$ coprime to the level.

NOTE: This function assumes that the base field has characteristic 0.

EXAMPLES:

sage: B = BrandtModule(11); B.eisenstein_subspace()
Subspace of dimension 1 of Brandt module of dimension 2 of level 11 of weight 2 over Rational Field
sage: B.eisenstein_subspace() is B.eisenstein_subspace()
True
sage: BrandtModule(3,11).eisenstein_subspace().basis()
((1, 1),)
sage: BrandtModule(7,10).eisenstein_subspace().basis()
((1, 1, 1, 1/2, 1, 1, 1/2, 1, 1, 1),)
sage: BrandtModule(7,10,base_ring=ZZ).eisenstein_subspace().basis()
((2, 2, 2, 1, 2, 2, 1, 2, 2, 2),)

free_module()¶

Return the underlying free module of the Brandt module.

EXAMPLES:

sage: B = BrandtModule(10007,389)
sage: B.free_module()
Vector space of dimension 325196 over Rational Field

hecke_matrix(n, algorithm='default', sparse=False, B=None)¶

Return the matrix of the n-th Hecke operator.

INPUT:

$n$ – integer

algorithm – string (default: ‘default’)

‘default’ – let Sage guess which algorithm is best

‘direct’ – use cyclic subideals (generally much better when you want few Hecke operators and the dimension is very large); uses ‘theta’ if n divides the level.

‘brandt’ – use Brandt matrices (generally much better when you want many Hecke operators and the dimension is very small; bad when the dimension is large)

sparse – bool (default: False)

$B$ – integer or None (default: None); in direct algorithm, use theta series to this precision as an initial check for equality of ideal classes.

EXAMPLES:

sage: B = BrandtModule(3,7); B.hecke_matrix(2)
[0 3]
[1 2]
sage: B.hecke_matrix(5, algorithm='brandt')
[0 6]
[2 4]
sage: t = B.hecke_matrix(11, algorithm='brandt', sparse=True); t
[ 6  6]
[ 2 10]
sage: type(t)
<type 'sage.matrix.matrix_rational_sparse.Matrix_rational_sparse'>
sage: B.hecke_matrix(19, algorithm='direct', B=2)
[ 8 12]
[ 4 16]

is_cuspidal()¶

Returns whether self is cuspidal, i.e. has no Eisenstein part.

EXAMPLES:: sage: B = BrandtModule(3, 4) sage: B.is_cuspidal() False sage: B.eisenstein_subspace() Brandt module of dimension 1 of level 3*4 of weight 2 over Rational Field

maximal_order()¶

Return a maximal order in the quaternion algebra associated to this Brandt module.

EXAMPLES:

sage: BrandtModule(17).maximal_order()
Order of Quaternion Algebra (-17, -3) with base ring Rational Field with basis (1/2 + 1/2*j, 1/2*i + 1/2*k, -1/3*j - 1/3*k, k)
sage: BrandtModule(17).maximal_order() is BrandtModule(17).maximal_order()
True

monodromy_weights()¶

Return the weights for the monodromy pairing on this Brandt module. The weights are associated to each ideal class in our fixed choice of basis. The weight of an ideal class $[I]$ is half the number of units of the right order $I$ .

NOTE: The base ring must be $\QQ$ or $\ZZ$ .

EXAMPLES:

sage: BrandtModule(11).monodromy_weights()
(2, 3)
sage: BrandtModule(37).monodromy_weights()
(1, 1, 1)
sage: BrandtModule(43).monodromy_weights()
(2, 1, 1, 1)
sage: BrandtModule(7,10).monodromy_weights()
(1, 1, 1, 2, 1, 1, 2, 1, 1, 1)
sage: BrandtModule(5,13).monodromy_weights()
(1, 3, 1, 1, 1, 3)

order_of_level_N()¶

Return Eichler order of level N = p^(2*r+1)*M in the quaternion algebra.

EXAMPLES:

sage: BrandtModule(7).order_of_level_N()
Order of Quaternion Algebra (-1, -7) with base ring Rational Field with basis (1/2 + 1/2*j, 1/2*i + 1/2*k, j, k)
sage: BrandtModule(7,13).order_of_level_N()
Order of Quaternion Algebra (-1, -7) with base ring Rational Field with basis (1/2 + 1/2*j + 12*k, 1/2*i + 9/2*k, j + 11*k, 13*k)
sage: BrandtModule(7,3*17).order_of_level_N()
Order of Quaternion Algebra (-1, -7) with base ring Rational Field with basis (1/2 + 1/2*j + 35*k, 1/2*i + 65/2*k, j + 19*k, 51*k)

quaternion_algebra()¶

Return the quaternion algebra A over QQ ramified precisely at p and infinity used to compute this Brandt module.

EXAMPLES:

sage: BrandtModule(997).quaternion_algebra()
Quaternion Algebra (-2, -997) with base ring Rational Field
sage: BrandtModule(2).quaternion_algebra()
Quaternion Algebra (-1, -1) with base ring Rational Field
sage: BrandtModule(3).quaternion_algebra()
Quaternion Algebra (-1, -3) with base ring Rational Field
sage: BrandtModule(5).quaternion_algebra()
Quaternion Algebra (-2, -5) with base ring Rational Field
sage: BrandtModule(17).quaternion_algebra()
Quaternion Algebra (-17, -3) with base ring Rational Field

right_ideals(B=None)¶

Return sorted tuple of representatives for the equivalence classes of right ideals in self.

OUTPUT:

sorted tuple of fractional ideals

EXAMPLES:

sage: B = BrandtModule(23)
sage: B.right_ideals()
(Fractional ideal (2 + 2*j, 2*i + 2*k, 4*j, 4*k),
 Fractional ideal (2 + 2*j, 2*i + 6*k, 8*j, 8*k),
 Fractional ideal (2 + 10*j + 8*k, 2*i + 8*j + 6*k, 16*j, 16*k))

TEST:

sage: B = BrandtModule(1009)
sage: Is = B.right_ideals()
sage: n = len(Is)
sage: prod(not Is[i].is_equivalent(Is[j]) for i in range(n) for j in range(i))
1

class sage.modular.quatalg.brandt.BrandtSubmodule(ambient, submodule, dual_free_module=None, check=True)¶: Bases: sage.modular.hecke.submodule.HeckeSubmodule

sage.modular.quatalg.brandt.basis_for_left_ideal(R, gens)¶

Return a basis for the left ideal of R with given generators.

INPUT:

R – quaternion order
gens – list of elements of R

OUTPUT:

list of four elements of R

EXAMPLES:

sage: B = BrandtModule(17); A = B.quaternion_algebra(); i,j,k = A.gens()
sage: sage.modular.quatalg.brandt.basis_for_left_ideal(B.maximal_order(), [i+j,i-j,2*k,A(3)])
[1/2 + 1/6*j + 2/3*k, 1/2*i + 1/2*k, 1/3*j + 1/3*k, k]
sage: sage.modular.quatalg.brandt.basis_for_left_ideal(B.maximal_order(), [3*(i+j),3*(i-j),6*k,A(3)])
[3/2 + 1/2*j + 2*k, 3/2*i + 3/2*k, j + k, 3*k]

sage.modular.quatalg.brandt.benchmark_magma(levels, silent=False)¶

INPUT:

levels – list of pairs (p,M) where p is a prime not dividing M
silent – bool, default False; if True suppress printing during computation

OUTPUT:

list of 4-tuples (‘magma’, p, M, tm), where tm is the CPU time in seconds to compute T2 using Magma

EXAMPLES:

sage: a = sage.modular.quatalg.brandt.benchmark_magma([(11,1), (37,1), (43,1), (97,1)])  # optional - magma
('magma', 11, 1, ...)
('magma', 37, 1, ...)
('magma', 43, 1, ...)
('magma', 97, 1, ...)
sage: a = sage.modular.quatalg.brandt.benchmark_magma([(11,2), (37,2), (43,2), (97,2)])  # optional - magma
('magma', 11, 2, ...)
('magma', 37, 2, ...)
('magma', 43, 2, ...)
('magma', 97, 2, ...)

sage.modular.quatalg.brandt.benchmark_sage(levels, silent=False)¶

INPUT:

levels – list of pairs (p,M) where p is a prime not dividing M
silent – bool, default False; if True suppress printing during computation

OUTPUT:

list of 4-tuples (‘sage’, p, M, tm), where tm is the CPU time in seconds to compute T2 using Sage

EXAMPLES:

sage: a = sage.modular.quatalg.brandt.benchmark_sage([(11,1), (37,1), (43,1), (97,1)])
('sage', 11, 1, ...)
('sage', 37, 1, ...)
('sage', 43, 1, ...)
('sage', 97, 1, ...)
sage: a = sage.modular.quatalg.brandt.benchmark_sage([(11,2), (37,2), (43,2), (97,2)])
('sage', 11, 2, ...)
('sage', 37, 2, ...)
('sage', 43, 2, ...)
('sage', 97, 2, ...)

sage.modular.quatalg.brandt.class_number(p, r, M)¶

Return the class number of an order of level N = p^r*M in the quaternion algebra over QQ ramified precisely at p and infinity.

This is an implementation of Theorem 1.12 of [Pizer, 1980].

INPUT:

p – a prime
r – an odd positive integer (default: 1)
M – an integer coprime to q (default: 1)

OUTPUT:

Integer

EXAMPLES:

sage: sage.modular.quatalg.brandt.class_number(389,1,1)
33
sage: sage.modular.quatalg.brandt.class_number(389,1,2)  # TODO -- right?
97
sage: sage.modular.quatalg.brandt.class_number(389,3,1)  # TODO -- right?
4892713

sage.modular.quatalg.brandt.maximal_order(A)¶

Return a maximal order in the quaternion algebra ramified at p and infinity.

This is an implementation of Proposition 5.2 of [Pizer, 1980].

INPUT:

A – quaternion algebra ramified precisely at p and infinity

OUTPUT:

a maximal order in A

EXAMPLES:

sage: A = BrandtModule(17).quaternion_algebra()
sage: sage.modular.quatalg.brandt.maximal_order(A)
Order of Quaternion Algebra (-17, -3) with base ring Rational Field with basis (1/2 + 1/2*j, 1/2*i + 1/2*k, -1/3*j - 1/3*k, k)

sage.modular.quatalg.brandt.quaternion_order_with_given_level(A, level)¶

Return an order in the quaternion algebra A with given level. (Implemented only when the base field is the rational numbers.)

INPUT:

level – The level of the order to be returned. Currently this is only implemented: when the level is divisible by at most one power of a prime that ramifies in this quaternion algebra.

EXAMPLES:

sage: from sage.modular.quatalg.brandt import quaternion_order_with_given_level, maximal_order
sage: A.<i,j,k> = QuaternionAlgebra(5)
sage: level = 2 * 5 * 17
sage: O = quaternion_order_with_given_level(A, level)
sage: M = maximal_order(A)
sage: L = O.free_module()
sage: N = M.free_module()
sage: print L.index_in(N) == level/5  #check that the order has the right index in the maximal order
True

sage.modular.quatalg.brandt.right_order(R, basis)¶

Given a basis for a left ideal I, return the right order in the quaternion order R of elements such that I*x is contained in I.

INPUT:

R – order in quaternion algebra
basis – basis for an ideal I

OUTPUT:

order in quaternion algebra

EXAMPLES:

We do a consistency check with the ideal equal to a maximal order.:

sage: B = BrandtModule(17); basis = sage.modular.quatalg.brandt.basis_for_left_ideal(B.maximal_order(), B.maximal_order().basis())
sage: sage.modular.quatalg.brandt.right_order(B.maximal_order(), basis)
Order of Quaternion Algebra (-17, -3) with base ring Rational Field with basis (1/2 + 1/6*j + 2/3*k, 1/2*i + 1/2*k, 1/3*j + 1/3*k, k)
sage: basis
[1/2 + 1/6*j + 2/3*k, 1/2*i + 1/2*k, 1/3*j + 1/3*k, k]

sage: B = BrandtModule(17); A = B.quaternion_algebra(); i,j,k = A.gens()
sage: basis = sage.modular.quatalg.brandt.basis_for_left_ideal(B.maximal_order(), [i*j-j])
sage: sage.modular.quatalg.brandt.right_order(B.maximal_order(), basis)
Order of Quaternion Algebra (-17, -3) with base ring Rational Field with basis (1/2 + 1/2*i + 1/2*j + 17/2*k, i, j + 8*k, 9*k)

Brandt Modules¶

Introduction¶

Quaternion Algebras¶

Hecke Structure¶

Example¶

References¶

Further Examples¶

Table Of Contents

Previous topic

Next topic

This Page

Navigation

Brandt Modules¶

Introduction¶

Quaternion Algebras¶

Hecke Structure¶

Example¶

References¶

Further Examples¶

Table Of Contents

Previous topic

Next topic

This Page

Quick search

Navigation