# Oscar code for working with number field 2.2.41.1 # If you have not already loaded the Oscar package, you should type "using Oscar;" before running the code below. # Some of these functions may take a long time to compile (this depends on the state of your Julia REPL), and/or to execute (this depends on the field). # Define the number field: Qx, x = PolynomialRing(QQ); K, a = NumberField(x^2 - x - 10) # Defining polynomial: defining_polynomial(K) # Degree over Q: degree(K) # Signature: signature(K) # Discriminant: OK = ring_of_integers(K); discriminant(OK) # Ramified primes: prime_divisors(discriminant((OK))) # Autmorphisms: automorphisms(K) # Integral basis: basis(OK) # Class group: class_group(K) # Unit group: UK, fUK = unit_group(OK) # Unit rank: rank(UK) # Generator for roots of unity: torsion_units_generator(OK) # Fundamental units: [K(fUK(a)) for a in gens(UK)] # Regulator: regulator(K) # Analytic class number formula: # self-contained Oscar code snippet to compute the analytic class number formula Qx, x = PolynomialRing(QQ); K, a = NumberField(x^2 - x - 10); OK = ring_of_integers(K); DK = discriminant(OK); UK, fUK = unit_group(OK); clK, fclK = class_group(OK); r1,r2 = signature(K); RK = regulator(K); RR = parent(RK); hK = order(clK); wK = torsion_units_order(K); 2^r1 * (2*pi)^r2 * RK * hK / (wK * sqrt(RR(abs(DK)))) # Intermediate fields: subfields(K)[2:end-1] # Galois group: G, Gtx = galois_group(K); G, transitive_group_identification(G) # Frobenius cycle types: # to obtain a list of $[e_i,f_i]$ for the factorization of the ideal $p\mathcal{O}_K$ for $p=7$ in Oscar: p = 7; pfac = factor(ideal(ring_of_integers(K), p)); [(e, valuation(norm(pr),p)) for (pr,e) in pfac]