Ramification at a prime in an extension of local or global fields for which the ramification index is prime to the residue characteristic p, yielding simpler inertia behavior and absence of nontrivial higher p‑power ramification phenomena.

Principle

When the ramification index is coprime to p, inertia is cyclic of order prime to p and higher ramification groups beyond the first are trivial; conductor exponents and Galois-module structure are governed by tame formulas.

Demonstration

An extension obtained by adjoining an nth root with n coprime to p (or an extension with ramification index not divisible by p) exhibits cyclic inertia, trivial higher ramification filtration, and conductors computable by tame ramification rules.

Misapplication

Assuming tame ramification whenever any mild ramification is present, or treating tame formulas as valid when p divides the ramification index, which leads to incorrect computation of conductors and local Galois action.

Consequence

Tame ramification simplifies analysis: conductors, discriminants, and local Galois representations are more tractable, and many classical local-to-global arguments and deformation techniques apply without extra p‑torsion complications.

Reversal

If the ramification index is divisible by the residue characteristic, the situation is wild rather than tame and higher ramification phenomena and p‑torsion must be considered.

Boundary

Applies only when the ramification index is coprime to the residue characteristic; does not cover wildly ramified primes or inseparable features in characteristic p where tame descriptions fail.

Semantic Tension

Arises in contrast to wild ramification: methods and formulas that succeed in the tame case break down in the wild case, creating different technical regimes in local arithmetic and representation theory.

Synthesis

Tame Ramification denotes the regime where index prime-to-p yields cyclic inertia, trivial higher ramification filtration, and predictable conductors; it provides a manageable local arithmetic framework that supports classical computations and lifting arguments.