
// Make newform 150.2.g.b in Magma, downloaded from the LMFDB on 24 April 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_150_g();"
// To make the character of type GrpDrchElt with Codomain the HeckeField, type "MakeCharacter_150_g_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_150_2_g_b();".
// 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_150_2_g_b();".
// 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_150_g();"
function MakeCharacter_150_g()
    N := 150;
    order := 5;
    char_gens := [101, 127];
    v := [5, 2];
    // 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_150_g_Hecke();"
function MakeCharacter_150_g_Hecke(Kf)
    N := 150;
    order := 5;
    char_gens := [101, 127];
    char_values := [[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 := [[1, -1, 1, -1], [0, 0, 0, 1], [0, 2, -1, 2], [2, 0, 0, 0], [2, -4, 4, -2], [-3, 3, -3, 0], [0, -3, 6, -3], [0, -2, -4, -2], [-6, 6, -6, 6], [-1, 1, 0, 3], [0, -6, 0, -6], [3, 4, 3, 0], [-5, 3, -5, 0], [2, 0, 2, -2], [2, -2, 0, -8], [-9, 9, 0, 6], [8, -4, 8, 0], [4, -7, 7, -4], [0, 6, -6, 6], [10, -10, 0, -2], [8, -5, 5, -8], [0, 0, 0, 0], [0, 0, 6, 0], [-3, 2, -2, 3], [3, -3, 0, 9], [13, 0, 7, -7], [-6, 6, 0, 12], [-2, 0, -8, 8], [9, 3, 9, 0], [-9, 6, -9, 0], [-10, 4, -4, 10], [0, -2, -2, -2], [-13, 7, -13, 0], [-6, -6, 6, 6], [-14, 0, -13, 13], [6, 0, 8, -8], [13, 0, -3, 3], [4, -18, 4, 0], [0, -4, 4, -4], [19, -14, 14, -19], [-10, 10, 0, 20], [0, 13, -12, 13], [2, 2, 2, 0], [4, 0, 1, -1], [7, -7, 0, 2], [10, 0, 10, -10], [8, -8, 8, -8], [12, -6, 6, -12], [4, -12, 12, -4], [15, -15, 0, 0], [0, 5, -19, 5], [12, 12, -12, -12], [-3, 12, -3, 0], [-6, 0, 4, -4], [-10, 0, 1, -1], [4, 2, 4, 0], [0, -5, -5, -5], [-10, 10, 0, -12], [27, -24, 24, -27], [0, 5, -3, 5], [0, -2, 2, -2], [-11, 0, 11, -11], [-26, 0, -6, 6], [-4, -10, 10, 4], [-20, 14, -20, 0], [0, 8, -2, 8], [0, 4, -30, 4], [24, -14, 24, 0], [2, -2, 0, 2], [-3, 0, -11, 11], [-4, 4, 0, -14], [-16, 18, -16, 0], [0, 4, -10, 4], [-22, 10, -10, 22], [12, -12, 0, -16], [0, -4, 18, -4], [18, 3, -3, -18], [-24, 24, 0, 10], [-18, 0, 5, -5], [21, -8, 21, 0], [0, 16, -28, 16], [5, -5, 0, 3], [0, -6, 0, -6], [0, -3, -25, -3], [-4, -14, 14, 4], [-12, 0, -26, 26], [-13, 0, -11, 11], [-6, 0, 4, -4], [-17, 22, -22, 17], [6, 16, 6, 0], [0, 10, 22, 10], [-4, 4, 0, 2], [-6, -14, -6, 0], [16, -20, 16, 0], [-14, 0, 12, -12], [4, -4, 0, -28], [-19, 2, -19, 0], [-15, 15, 0, 18], [12, -6, 6, -12], [15, -12, 15, 0], [0, 0, 0, -2], [-3, 0, 15, -15], [4, -8, 4, 0], [0, 1, 22, 1], [-6, 6, 0, -24], [10, 14, -14, -10], [-16, 6, -16, 0], [15, 0, 13, -13], [14, 0, 8, -8], [-4, 0, -7, 7], [-18, 0, -10, 10], [-9, 16, -9, 0], [0, 1, 9, 1], [0, -12, -4, -12], [0, 18, -32, 18], [-8, 22, -8, 0], [12, 0, 32, -32], [16, -16, 0, 10], [23, -23, 0, -5], [8, -34, 8, 0], [30, -26, 26, -30], [1, -12, 12, -1], [-30, 34, -34, 30], [0, -12, 12, -12], [-10, 18, -10, 0], [30, 0, 31, -31], [-11, 23, -11, 0], [0, -20, 10, -20], [-20, 14, -14, 20], [0, 20, 6, 20], [-18, 12, -12, 18], [-16, 0, -14, 14], [18, 0, 2, -2], [-24, 0, 3, -3], [26, 5, -5, -26], [0, 20, 10, 20], [-6, 11, -11, 6], [30, -12, 30, 0], [7, -7, 0, 2], [23, 6, 23, 0], [-20, 14, -14, 20], [24, -24, 0, 6], [-12, -10, 10, 12], [-18, 16, -16, 18], [3, -3, 0, -44], [-24, 6, -6, 24], [-25, 25, 0, 24], [-22, 0, -28, 28], [-4, -48, -4, 0], [10, -6, 10, 0], [16, 5, -5, -16], [0, -40, 22, -40], [0, -10, 36, -10], [-10, -32, -10, 0], [30, 0, 6, -6], [-14, 40, -40, 14], [0, -8, -6, -8], [21, -21, 0, -3], [5, -32, 5, 0], [-7, -26, -7, 0], [-8, 8, 0, 2], [37, -37, 0, -27], [0, -8, 36, -8], [32, -32, 0, -18], [6, -15, 15, -6], [0, 30, -24, 30], [30, -42, 30, 0], [12, -12, 0, -18]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_150_g_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


// To make the newform (type ModFrm), type "MakeNewformModFrm_150_2_g_b();".
// 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_150_2_g_b(:prec:=4)
    chi := MakeCharacter_150_g();
    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_150_2_g_b();".
// 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_150_2_g_b( : sign := -1)
    R<x> := PolynomialRing(Rationals());
    chi := MakeCharacter_150_g();
    // SetVerbose("ModularSymbols", true);
    Snew := NewSubspace(CuspidalSubspace(ModularSymbols(chi,2,sign)));
    Vf := Kernel([<7,R![-2, 1]>],Snew);
    return Vf;
end function;