
// Make newform 725.2.a.d in Magma, downloaded from the LMFDB on 02 May 2024.
// To make the character of type GrpDrchElt, type "MakeCharacter_725_a();"
// To make the coeffs of the qexp of the newform in the Hecke field type "qexpCoeffs();"
// To make the newform (type ModFrm), type "MakeNewformModFrm_725_2_a_d();".
// 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_725_2_a_d();".
// 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, -3, -1, 1];
        Kf := NumberField(Polynomial([elt : elt in poly]));
        AssignNames(~Kf, ["nu"]);
    end if;
    Rf_num := [[1, 0, 0], [0, 1, 0], [-2, -1, 1]];
    Rf_basisdens := [1, 1, 1];
    Rf_basisnums := ChangeUniverse([[z : z in elt] : elt in Rf_num], Kf);
    Rfbasis := [Rf_basisnums[i]/Rf_basisdens[i] : i in [1..Degree(Kf)]];
    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_725_a();"
function MakeCharacter_725_a()
    N := 725;
    order := 1;
    char_gens := [552, 176];
    v := [1, 1];
    // 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;

function MakeCharacter_725_a_Hecke(Kf)
    return MakeCharacter_725_a();
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, 0, -1], [1, -1, -1], [0, 0, 0], [1, -1, 1], [3, -1, -1], [2, 0, -2], [1, -3, 1], [1, -3, -1], [-5, 1, 1], [1, 0, 0], [3, 3, 1], [-1, -1, 3], [-4, 2, 0], [3, 1, 1], [-7, 3, 3], [-4, 2, 0], [0, 4, 2], [2, 0, 2], [3, 1, 1], [8, 0, 2], [1, 1, 7], [1, 5, 1], [1, -1, -3], [8, -2, 2], [11, 3, -3], [4, -6, -6], [3, 1, 5], [3, -7, -1], [-6, 8, 2], [1, -7, 3], [3, 9, -3], [-1, -5, -3], [13, 1, -3], [-6, 2, -6], [-6, -4, 4], [0, 4, -2], [7, 7, 5], [-1, 1, -3], [-15, -1, -5], [-6, 12, 10], [4, 4, 4], [6, -4, -6], [13, -3, 1], [-13, -1, -5], [8, -6, -2], [0, -4, -2], [5, 1, 5], [-5, -3, 1], [-1, 5, 5], [6, 8, 0], [-6, 0, -12], [4, 4, 2], [-6, -4, 0], [3, 3, 11], [-10, 8, -2], [-3, -5, 7], [0, 10, 12], [-1, 11, 11], [0, -2, 8], [-14, -4, -10], [17, 3, -5], [-9, 11, 1], [-9, 17, 1], [-5, -5, -7], [2, -8, -14], [-5, -5, -13], [-9, 15, 1], [-9, -1, -3], [3, -7, 7], [-6, 12, 4], [4, 2, -4], [11, -1, -7], [-3, -9, -13], [4, -6, -10], [19, -1, -5], [-1, 5, 11], [-16, 2, -4], [-8, 2, -10], [10, 4, 2], [-18, 8, -2], [10, -18, -12], [2, -4, -10], [-4, 8, 12], [-11, -3, 5], [6, -10, -4], [-7, -13, 3], [6, 0, 2], [8, -2, 4], [-16, -10, 10], [11, -3, -11], [-17, 13, 1], [-17, 15, 3], [-3, 7, -15], [-1, 19, 1], [-12, 0, -12], [9, 7, -5], [-6, 4, 2], [-10, 12, -6], [13, 3, 3], [36, -2, 2], [27, -3, 3], [-10, 20, 12], [11, -7, -11], [-6, -8, -2], [0, -16, 12], [-13, -17, 7], [11, -3, -7], [4, -10, 4], [5, -3, -15], [-4, 2, 12], [-3, -9, -17], [14, -8, 4], [7, 15, -3], [-3, 1, -7], [10, -6, -10], [0, 14, 4], [33, -13, -5], [-11, -17, 5], [-19, 9, 3], [1, -19, -9], [6, -20, 2], [12, 6, -14], [7, 11, 17], [5, -5, 7], [18, 6, -8], [-10, -4, -6], [-10, 0, 10], [-16, 12, -6], [21, 3, -1], [-3, 13, 9], [17, 13, 11], [-15, 3, -5], [-7, -3, -9], [-11, -3, 3], [-10, 12, -4], [-4, -10, -18], [-25, 11, 3], [-17, 9, -1], [33, -7, -1], [-12, -22, 6], [14, -10, -2], [-26, 0, -4], [21, -17, -9], [1, 3, 3], [8, 10, 4], [15, 3, 11], [-3, 21, 25], [18, -4, -6], [9, 13, -3], [-17, 13, 3], [8, -2, -4], [4, 6, 12], [9, 7, 9], [-1, 9, 1], [21, -9, -13], [17, 13, 15], [4, 12, 14], [46, -4, 0], [12, 6, -4], [-6, 4, -4], [3, 1, 9], [6, 0, 4], [-25, 5, -3], [13, -11, -13], [2, 20, 18], [17, -5, -9], [24, -12, -2], [5, -15, -5]];
    aps := ConvertToHeckeField(raw_aps);
    chi := MakeCharacter_725_a_Hecke(Universe(aps));
    return ExtendMultiplicatively(weight, aps, chi);
end function;


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