The Radical and Quotients of Semilocal Rings
Lam (20.7): for a semilocal ring the radical of any quotient is the image of the radical, and quotients stay semilocal. Includes the general one-sided containment, why it can be…
Engineering articles and subject areas in the KEVOS knowledge library. 2176 pages.
Lam (20.7): for a semilocal ring the radical of any quotient is the image of the radical, and quotients stay semilocal. Includes the general one-sided containment, why it can be…
Lam 4.12 and 4.13: in a left artinian ring the Jacobson radical is nilpotent and is the largest nilpotent one-sided ideal, so every nil left ideal is nilpotent. Covers the desce…
The radical of a module: its definition as an intersection of maximal submodules, its identification with the sum of all small submodules, behaviour under submodules and direct …
Lam's Proposition 4.6: when an ideal A lies inside the Jacobson radical of R, the radical of R/A is the image of rad R. Covers the correspondence proof, semiprimitivity of R mod…
For an algebra over a field, an element of the Jacobson radical is algebraic if and only if it is nilpotent. The consequence for algebraic algebras: the radical is the largest n…
The radical of an ideal in a noncommutative ring: the m-system definition, the theorem identifying it with the intersection of all primes above the ideal, why it is an ideal, an…
How the Jacobson radical behaves under two well-behaved ring constructions: full matrix rings, where it is computed entrywise, and formal power series rings, where it is the pre…
The Jacobson radical under scalar extension of a k-algebra to a field extension K: contraction and extension inclusions, nilness in the transcendental case, the trace-form argum…
A comparison of the prime, Levitzki, upper nil and Jacobson radicals of a ring: the chain of inclusions, the hypotheses that collapse it, explicit rings separating each pair, an…
The reduced norm of a cyclic algebra, defined as the determinant of right multiplication on the algebra viewed as a K-space. Its polynomial version on the skew polynomial ring p…
The socle of a module: the sum of its simple submodules, the largest semisimple submodule, the intersection of the essential submodules, the socle of a ring as a two-sided ideal…
Theorem (8.1) of Lam: the Wedderburn decomposition of kG modulo its radical, the isotypic decomposition of the regular module, the dimension formulas relating the simple modules…
The unipotent radical of a linear group: existence and uniqueness of a largest normal unipotent subgroup, its characterisation by trivial action on composition factors and by th…
The upper nilradical as the largest nil ideal of a ring, its position between the lower nilradical and the Jacobson radical, and Koethe's Conjecture together with its equivalent…
The Wedderburn-Artin Theorem: every left semisimple ring is a finite product of matrix rings over division rings, with the endomorphism-ring proof, the uniqueness statement, the…
A dependency map for noncommutative ring theory: the prerequisites and consumers of Wedderburn-Artin, Schur, the Density Theorem, Hopkins-Levitzki, Nakayama, Krull-Schmidt, Bass…
The triangular ring built from two rings and a bimodule: its multiplication, the complete description of its left, right and two-sided ideals, its Jacobson radical, and the theo…
Formal Laurent series with the twisted multiplication x a = sigma(a) x form a division ring. Computing its centre gives the first known centrally infinite division ring and, whe…
Unipotent and lambda-potent linear transformations, the identification of unipotent elements with p-elements in characteristic p, and the Lie-Kolchin-Suprunenko triangularisatio…
Lam (3.8) and (3.9): decompositions of a ring into indecomposable two-sided ideals are unique as ideals, the isotypic sums of minimal left ideals are ideals that annihilate one …
Character-theoretic arithmetic applied to integral group rings: central torsion units are trivial up to a root of unity, the centre of a finite group is determined by its integr…
Von Neumann regular rings: the five equivalent conditions of Lam's theorem, left-right symmetry, the sandwich between semisimple and semiprimitive rings, the theorem that noethe…
Wedderburn's factorisation theorem: the minimal polynomial of an algebraic conjugacy class of a division ring splits into linear factors with roots drawn from that class, togeth…
Wedderburn's Little Theorem: every finite division ring is a field. The class-equation proof with cyclotomic polynomials, the corollary that finite subrings of division rings ar…
Well-ordered subsets of a totally ordered set are characterised by the descending chain condition and by the existence of nondecreasing subsequences. In an ordered group they ar…
Two idempotents of a ring generate isomorphic principal right modules exactly when one is a product ab and the other is ba. This page proves that criterion, derives the induced …
When a group algebra is a local ring: the augmentation ideal of a p-group in characteristic p is nilpotent, the resulting equivalences for kG, the extension to group rings over …
Abelian groups: axioms, standard examples, and why the commutative case is sufficient for computational number theory.
Algebraic against geometric multiplicity: degree of the characteristic polynomial, the bound on eigenspace dimension, eigenvalue counts and defective matrices.
Algebraic numbers, minimal polynomials, algebraic integers, and the computational tests that distinguish them.
Algebras as rings carrying a compatible module structure, and the examples that matter computationally.
The notation, cost model and complexity conventions used throughout this collection, including the sub-exponential L-function.
Cost analysis of Berlekamp's algorithm and the variants that improve its dependence on field size.
The complete Cantor-Zassenhaus factorisation algorithm, its three stages, and its overall cost.
Solving integer linear systems, computing indices and intersections, and testing module membership using the Hermite normal form.
Estimating a quantity by sampling, the sample size required, and the resulting confidence guarantee.
Implementation concerns for multiprecision arithmetic: memory management, algorithm dispatch, and constant-time requirements.
A catalogue of canonical worked linear systems, matrices and transformations, each fully analysed, designed so paired entries isolate a single structural variable.
Multiplicative arithmetic functions, Dirichlet convolution, the Mobius function and the inversion formula.
The M(n) abstraction, the hierarchy of multiplication algorithms, and why downstream bounds are quoted in terms of M(n) rather than fixed exponents.
Big-O, Omega, Theta and little-o notation, the conventions that make them precise, and the pitfalls of using them carelessly.
ECPP: using complex multiplication to construct curves of known order, avoiding point counting entirely.
A basis is a linearly independent spanning set: enough raw material to build every vector, and no more. Standard bases, unique coordinates and verification.
The columns of a square matrix form a basis of C^m exactly when the matrix is nonsingular, and every vector then has a unique representation in that basis.
Stack a spanning set as the rows of a matrix and row-reduce: the non-zero rows are a basis for the span. The method, its canonical output and an equality test.
Representation of polynomials, addition, multiplication and division costs, and the dense versus sparse choice.
Degree, leading coefficients, the ring structure of R[X], and when it is an integral domain.
Berlekamp's algorithm: the Berlekamp subalgebra, the kernel computation, and splitting by gcds.