KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesPrime Decomposition when p Does Not Divide the IndexEngineering · Engineering MathematicsLesson 792/884← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin Joginprime decompositionDedekind theorempolynomial factorisationindex
On this page

Ask about this page

KEVOS AIPrime Decomposition when p Does Not Divide the Index

KEVOS knowledge first · trusted web sources when needed

Orders, Ideals and Prime Decomposition

Prime Decomposition when p Does Not Divide the Index

Decomposing a prime that does not divide the index, by factoring the defining polynomial modulo that prime.

Engineering / MathematicsOrders, Ideals and Prime Decomposition2 min readKV-MATH-0590

When a prime does not divide the index of the equation order in the maximal order, its decomposition is read directly off the factorisation of the defining polynomial modulo that prime. This covers almost every prime.

The theorem

Factor the defining polynomial modulo p into irreducible factors with multiplicities. Each factor corresponds to a prime ideal above p, with residue degree the factor's degree and ramification index its multiplicity.

T(X) = product of t_i(X)^e_i (mod p) => P_i = (p, t_i(a)), f_i = deg(t_i)Valid when p does not divide the index.

Prime decomposition in the simple case

  1. Verify the conditionConfirm p does not divide the index — equivalently, that p squared does not divide the polynomial discriminant, or use the Dedekind criterion.
  2. Factor modulo pUsing the finite field pipeline — see factorisation strategy.
  3. Build the idealsEach prime is generated by p and the lift of the corresponding factor evaluated at the generator.
  4. Record e and fMultiplicity and degree of each factor.
  5. VerifyConfirm the sum of e times f equals the field degree.

Key point

The output is naturally in two-element form, with p as the rational generator. No module computation is required at all, which is why this case is so much cheaper than the general one.

Checking the condition

Testing whether the simple method applies
TestCostConclusiveness
p squared does not divide the polynomial discriminantRequires the discriminant onlySufficient, not necessary
p does not divide the indexRequires the maximal orderExact
Dedekind criterionOne polynomial GCD computation modulo pExact, and does not need the maximal order

Note

The Dedekind criterion is the practical choice: it decides p-maximality of the equation order from a modular computation alone, so the simple method can be applied or rejected without first knowing the maximal order.

Ramification detection

A repeated factor modulo p indicates ramification. Since repeated factors are found by squarefree factorisation, the ramification structure emerges from the first stage of the factorisation pipeline at no extra cost.

When it fails

Caution

For a prime dividing the index this method produces ideals that are not the primes above p, and the degree relation typically fails. Those primes require Buchmann-Lenstra or Newton polygon methods — and note that some primes divide the index for every choice of defining polynomial, the essential discriminant divisors.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 4.8.2. Structural reference unverified: the source file was not available during authoring; chapter and section numbers are taken from the published edition and have not been checked against a physical copy.

Related pages

  • Chinese Remainder Theorem Algorithms
  • Squarefree Factorisation of Polynomials
  • Prime Decomposition: Theory and Ramification
  • Essential Discriminant Divisors

Continue learning

Prime Decomposition: Theory and RamificationArticle · Engineering MathematicsNEXT LESSON →Essential Discriminant DivisorsArticle · Engineering MathematicsIdeal Norm ComputationArticle · Engineering MathematicsValuations and UniformisersArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®