
// Make newform 231.2.j.a in Magma, downloaded from the LMFDB on 18 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_231_j();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_231_j_Hecke();"
// To make the coeffs of the qexp of the newform in the Hecke field type "qexpCoeffs();"
// To make the newform (type ModFrm), type "MakeNewformModFrm_231_2_j_a();".
// This may take a long time!  To see verbose output, uncomment the SetVerbose lines below.
// The precision argument determines an initial guess on how many Fourier coefficients to use.
// This guess is increased enough to uniquely determine the newform.
// To make the Hecke irreducible modular symbols subspace (type ModSym)
// containing the newform, type "MakeNewformModSym_231_2_j_a();".
// This may take a long time!  To see verbose output, uncomment the SetVerbose line below.
// The default sign is -1.  You can change this with the optional parameter "sign".
function ConvertToHeckeField(input: pass_field := false, Kf := [])
    if not pass_field then
        poly := [1, -1, 1, -1, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rfbasis := [Kf.1^i : i in [0..Degree(Kf)-1]];
    inp_vec := Vector(Rfbasis)*ChangeRing(Transpose(Matrix([[elt : elt in row] : row in input])),Kf);
    return Eltseq(inp_vec);
end function;


// To make the character of type GrpDrchElt, type "MakeCharacter_231_j();"
function MakeCharacter_231_j()
    N := 231;
    order := 5;
    char_gens := [155, 199, 211];
    v := [5, 5, 3];
    // chi(gens[i]) = zeta^v[i]
    assert UnitGenerators(DirichletGroup(N)) eq char_gens;
    F := CyclotomicField(order);
    chi := DirichletCharacterFromValuesOnUnitGenerators(DirichletGroup(N,F),[F|F.1^e:e in v]);
    return MinimalBaseRingCharacter(chi);
end function;

// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_231_j_Hecke();"
function MakeCharacter_231_j_Hecke(Kf)
    N := 231;
    order := 5;
    char_gens := [155, 199, 211];
    char_values := [[1, 0, 0, 0], [1, 0, 0, 0], [0, 0, 0, -1]];
    assert UnitGenerators(DirichletGroup(N)) eq char_gens;
    values := ConvertToHeckeField(char_values : pass_field := true, Kf := Kf); // the value of chi on the gens as elements in the Hecke field
    F := Universe(values);// the Hecke field
    chi := DirichletCharacterFromValuesOnUnitGenerators(DirichletGroup(N,F),values);
    return chi;
end function;


function ExtendMultiplicatively(weight, aps, character)
    prec := NextPrime(NthPrime(#aps)) - 1; // we will able to figure out a_0 ... a_prec
    primes := PrimesUpTo(prec);
    prime_powers := primes;
    assert #primes eq #aps;
    log_prec := Floor(Log(prec)/Log(2)); // prec < 2^(log_prec+1)
    F := Universe(aps);
    FXY<X, Y> := PolynomialRing(F, 2);
    // 1/(1 - a_p T + p^(weight - 1) * char(p) T^2) = 1 + a_p T + a_{p^2} T^2 + ...
    R<T> := PowerSeriesRing(FXY : Precision := log_prec + 1);
    recursion := Coefficients(1/(1 - X*T + Y*T^2));
    coeffs := [F!0: i in [1..(prec+1)]];
    coeffs[1] := 1; //a_1
    for i := 1 to #primes do
        p := primes[i];
        coeffs[p] := aps[i];
        b := p^(weight - 1) * F!character(p);
        r := 2;
        p_power := p * p;
        //deals with powers of p
        while p_power le prec do
            Append(~prime_powers, p_power);
            coeffs[p_power] := Evaluate(recursion[r + 1], [aps[i], b]);
            p_power *:= p;
            r +:= 1;
        end while;    
    end for;
    Sort(~prime_powers);
    for pp in prime_powers do
        for k := 1 to Floor(prec/pp) do
            if GCD(k, pp) eq 1 then
                coeffs[pp*k] := coeffs[pp]*coeffs[k];
            end if;
        end for;
    end for;
    return coeffs;
end function;


function qexpCoeffs()
    // To make the coeffs of the qexp of the newform in the Hecke field type "qexpCoeffs();"
    weight := 2;
    raw_aps := [[-2, 1, -1, 2], [0, 0, -1, 0], [-1, 0, -1, 0], [0, 0, 0, -1], [-2, 2, -3, 4], [-3, -1, 1, 3], [0, 3, 0, 0], [0, 0, 4, 0], [-6, 0, -2, 2], [0, 0, 0, -3], [1, -3, 3, -1], [-4, 4, 0, 6], [0, -5, 5, -5], [-9, 0, 0, 0], [0, 5, 2, 5], [-1, -4, 4, 1], [1, -1, 0, -12], [6, -3, 6, 0], [0, 0, -6, 6], [-2, -9, -2, 0], [-3, 3, 0, 2], [-5, 2, -2, 5], [-8, 10, -8, 0], [7, 0, -7, 7], [9, 3, -3, -9], [-2, 0, 0, 2], [2, -2, 0, -11], [0, -8, -3, -8], [6, 0, -9, 9], [0, -4, 5, -4], [-9, 8, -9, 0], [3, 0, -7, 7], [4, 4, 4, 0], [-9, 9, 0, 12], [7, 9, 7, 0], [0, -1, -9, -1], [0, 3, -21, 3], [-14, 17, -17, 14], [-12, 7, -7, 12], [0, 1, 11, 1], [0, -4, 19, -4], [2, -11, 2, 0], [-4, 4, 0, -19], [12, 2, 12, 0], [4, 0, -10, 10], [-6, 0, -9, 9], [-5, -9, 9, 5], [0, -10, 1, -10], [-1, 1, 0, 0], [-12, -14, 14, 12], [3, -15, 15, -3], [0, 1, -2, 1], [3, 0, -6, 6], [3, 9, -9, -3], [-4, 4, 0, -2], [-15, 0, 0, 0], [18, -9, 18, 0], [-16, 16, 0, 7], [10, -6, 6, -10], [-17, 16, -17, 0], [0, -6, -11, -6], [14, -14, 0, 8], [-3, 0, -6, 6], [0, 13, 3, 13], [7, -10, 7, 0], [-13, 11, -11, 13], [13, 0, 30, -30], [-2, 2, 0, -1], [16, -2, 16, 0], [0, 9, -12, 9], [21, 0, 6, -6], [21, -21, 0, -3], [-6, 6, 0, 21], [-28, 0, -10, 10], [11, -6, 11, 0], [-3, 18, -18, 3], [-26, 26, 0, 12], [9, 0, 15, -15], [-15, 21, -15, 0], [-9, 8, -8, 9], [-9, 0, -7, 7], [0, 1, 3, 1], [-19, 18, -18, 19], [8, -8, 0, -14], [15, 0, 24, -24], [0, -14, 30, -14], [-11, 7, -7, 11], [-3, 16, -3, 0], [-3, 0, 12, -12], [14, 0, 27, -27], [-14, -5, -14, 0], [7, -16, 7, 0], [0, -15, 3, -15], [-14, 14, 0, 32], [0, 0, 0, 5], [0, -2, 27, -2], [0, -10, 21, -10], [-20, 20, 0, 13], [12, -27, 12, 0], [-1, -24, 24, 1], [0, 22, -13, 22], [10, -10, 0, -2], [1, 27, -27, -1], [0, -4, -5, -4], [-13, 0, -16, 16], [3, 20, 3, 0], [0, 0, 0, -6], [-14, 0, -20, 20], [11, -34, 11, 0], [16, -16, 0, -4], [-34, 31, -31, 34], [0, 21, -18, 21], [7, 0, 11, -11], [0, 6, 22, 6], [-14, 14, 0, 15], [0, 17, -28, 17], [0, 32, 0, 0], [9, -17, 17, -9], [4, -4, 0, -29], [3, 0, -18, 18], [-11, 0, -12, 12], [3, 9, -9, -3], [5, -31, 5, 0], [9, 0, -14, 14], [-9, 16, -16, 9], [0, -10, 5, -10], [-10, 12, -10, 0], [5, -5, 0, 10], [16, 0, 33, -33], [26, -26, 0, -9], [6, 3, -3, -6], [5, -12, 5, 0], [0, 9, 12, 9], [4, 14, -14, -4], [21, 6, -6, -21], [26, 0, -4, 4], [0, 8, 6, 8], [27, -24, 27, 0], [-3, -42, -3, 0], [-19, 15, -19, 0], [0, -6, -26, -6], [26, -26, 0, 4], [-32, 8, -8, 32], [-15, -23, 23, 15], [-9, 9, 0, -13], [0, 0, -15, 0], [15, -31, 15, 0], [19, 0, 8, -8], [33, 0, 12, -12], [2, -1, 2, 0], [0, -25, 31, -25], [-15, 0, 26, -26], [0, -25, 36, -25], [-10, 10, 0, -37], [27, -41, 27, 0], [-9, -14, 14, 9], [-4, 28, -4, 0], [0, -36, 0, 0], [23, -27, 27, -23], [-34, 38, -34, 0], [6, 0, 9, -9], [-1, 1, 0, -40], [-24, 0, -14, 14], [0, -12, -21, -12], [-41, 19, -19, 41], [38, -38, 0, -23], [36, 0, 11, -11], [-8, 8, 0, -42]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_231_j_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_231_2_j_a();".
// This may take a long time!  To see verbose output, uncomment the SetVerbose lines below.
// The precision argument determines an initial guess on how many Fourier coefficients to use.
// This guess is increased enough to uniquely determine the newform.
function MakeNewformModFrm_231_2_j_a(:prec:=4)
    chi := MakeCharacter_231_j();
    f_vec := qexpCoeffs();
    Kf := Universe(f_vec);
    // SetVerbose("ModularForms", true);
    // SetVerbose("ModularSymbols", true);
    S := CuspidalSubspace(ModularForms(chi, 2));
    S := BaseChange(S, Kf);
    maxprec := NextPrime(997) - 1;
    while true do
        trunc_vec := Vector(Kf, [0] cat [f_vec[i]: i in [1..prec]]);
        B := Basis(S, prec + 1);
        S_basismat := Matrix([AbsEltseq(g): g in B]);
        if Rank(S_basismat) eq Min(NumberOfRows(S_basismat), NumberOfColumns(S_basismat)) then
            S_basismat := ChangeRing(S_basismat,Kf);
            f_lincom := Solution(S_basismat,trunc_vec);
            f := &+[f_lincom[i]*Basis(S)[i] : i in [1..#Basis(S)]];
            return f;
        end if;
        error if prec eq maxprec, "Unable to distinguish newform within newspace";
        prec := Min(Ceiling(1.25 * prec), maxprec);
    end while;
end function;


// To make the Hecke irreducible modular symbols subspace (type ModSym)
// containing the newform, type "MakeNewformModSym_231_2_j_a();".
// This may take a long time!  To see verbose output, uncomment the SetVerbose line below.
// The default sign is -1.  You can change this with the optional parameter "sign".
function MakeNewformModSym_231_2_j_a( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_231_j();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<2,R![1, -1, 6, 4, 1]>],Snew);
    return Vf;
end function;