Homological algebra measures failure of exactness. Complexes, homology, derived constructions and cohomology turn extension and lifting problems into computable invariants, but the direction and degree of every map must be tracked carefully. This page consolidates the relevant material from the supplied algebra source into a stand-alone handbook chapter.
Learning pathHomological Algebra
LevelAdvanced
FormatHandbook guide
Read time10 min
Executive summary
This chapter develops crossed product algebras and spectral sequences as part of a connected advanced-algebra learning sequence. The emphasis is on definitions, hypotheses, structural results and repeatable methods rather than historical narrative.
The source material is theorem-rich. Accordingly, the handbook presentation separates vocabulary from results and then adds a verification workflow so that each statement can be applied safely. Mathematical examples in the source are treated as examples, not as universal rules.
Visual model: a filtered page of a spectral sequence
A spectral sequence arranges algebraic data by two indices. Successive pages retain classes that survive the current differential. The grid below is a conceptual reading aid rather than a numerical example.
q \ p
0
1
2
3
3
Eᵣ⁰,³
Eᵣ¹,³
Eᵣ²,³
Eᵣ³,³
2
Eᵣ⁰,²
Eᵣ¹,²
Eᵣ²,²
Eᵣ³,²
1
Eᵣ⁰,¹
Eᵣ¹,¹
Eᵣ²,¹
Eᵣ³,¹
0
Eᵣ⁰,⁰
Eᵣ¹,⁰
Eᵣ²,⁰
Eᵣ³,⁰
Source basis: supplied advanced algebra reference. Source-identifying authorship, publisher information, acknowledgements and biographical material are intentionally omitted. Mathematical terminology and results are retained in handbook form.
Problem-solving workflow
Write the complex or short exact sequence with every object and arrow.
Verify consecutive differentials compose to zero.
Compute cycles, boundaries and the quotient that defines homology.
When deriving a functor, choose the permitted resolution and track degrees consistently.
Use long exact sequences to transport information between related objects.
For cohomological classifications, distinguish cocycles, coboundaries and equivalence classes.
Core definitions
Definition
Given a normal separable extensions E/k with field-automorphism groups G = Aut_fld(E/k) and a factor set f : G × G →E×, define the crossed product algebra (E, G, f ) to be the vector space over E having basis all symbols {uσ : σ ∈G} and multiplication (auσ)(buτ) = abσ f (σ, τ)uστ for all a, b ∈E. If G is a cyclic group, then the crossed product algebra (E, G, f ) is called a cyclic algebra. Since every element in (E, G, f ) has a unique expression of the form aσuσ, the definition of multiplication extends by linearity to all of (E, G, f ). We note two special cases: uσb = bσuσ; uσuτ = f (σ, τ)uστ.
Definition
If K is a module, then a subquotient of K is a module isomorphic to S/T , where T ⊆S ⊆K are submodules. Thus, a subquotient of K is a quotient of a submodule.
Definition
Let R be a domain with Q = Frac(R). If M is an R-module, define rank(M) = dimQ(Q ⊗R M). For example, the rank of an abelian group G is defined as dimQ(Q ⊗Z G). Recall that if R is a domain, then an R-module M is torsion-free if it has no nonzero elements of finite order; that is, if r ∈R and m ∈M are nonzero, then rm is nonzero.
Principal results and structural facts
Key result
Let E/k be a normal separable extensions with field-automorphism groups G = Aut_fld(E/k). The multiplicative group E× is a kG-module, and H1(G, E×) = {0}.
Key result
implies Theorem 4.50, which describes the elements of norm 1 in a cyclic extension.
Key result
Let E/k be a normal separable extensions whose field-automorphism groups G = Aut_fld(E/k) is cyclic, say, with generator σ. If u ∈E×, then Nu = 1 if and only if there is v ∈E× with u = σ(v)v−1.
Key result
is one of the first results in what is called field-automorphism cohomology. Another early result is that Hn(G, E) = {0} for all n ≥1, where E (in contrast to E×) is the additive group of the normal separable extensions (this result follows easily from the normal basis theorem). No other examples of noncommutative division rings were known until cyclic algebras were found in the early 1900s, by J. Are there any division rings of prime characteristic? We begin with an elementary calculation. Suppose that V is a vector space over a field E having basis {uσ : σ ∈G} for some set G, so that each v ∈V has a unique expression Crossed Products as an E-linear combination v = σ aσuσ for aσ ∈E. For a function µ: V × V →V , with µ(uσ, uτ) denoted by uσuτ, define structure constants gσ,τ α ∈E by uσuτ = α∈G gσ,τ α uα. To have the associative law, we must have uσ(uτuω) = (uσuτ)uω; expanding this equation gives, for all indices, α,β gσ,τ α gα,ω β = γ,δ gτ,ω γ gσ,γ δ . Let us simplify these equations. Let G be a group and suppose that gσ,τ α = 0 unless α = στ; that is, uσuτ = f (σ, τ)uστ, where f (σ, τ) = gσ,τ στ . The function f : G × G →E×, given by f (σ, τ) = gσ,τ στ , satisfies the following equation for all σ, τ, ω ∈G: f (σ, τ) f (στ, ω) = f (τ, ω) f (σ, τω), an equation reminiscent of the cocycle identity written in multiplicative notation. This is why factor sets enter into the next definition. Let E/k be a normal separable extensions with Aut_fld(E/k) = G, and let f : G × G →E× be a factor set: In multiplicative notation f (σ, 1) = 1 = f (1, τ) for all σ, τ ∈G and, if we denote the action of σ ∈G on a ∈E× by aσ, then f (σ, τ) f (στ, ω) = f (τ, ω)σ f (σ, τω).
Key result
If E/k is a normal separable extensions with field-automorphism groups G = Aut_fld(E/k) and if f : G × G →E× is a factor set, then (E, G, f ) is a central simple k-algebra that is split by E.
Key result
Let k be a field. (i) The central-simple algebra class groups Br(k) is a torsion group. (ii) If A is a central simple k-algebra, then there is an integer n so that the tensor product of A with itself r times (where r is the order of [A] in Br(k)) is a matrix algebra: A ⊗k A ⊗k · · · ⊗k A ∼= Matn(k).
Key result
Let k be a field. If there is a cyclic normal separable extensions E/k such that the norm N : E× →k× is not surjective, then there exists a noncommutative k-division algebra.
Key result
If p is a prime, then there exists a noncommutative division algebra of characteristic p.
Key result
Let F : B →C and G : A →B be additive functors, where A, B, and C are module categories. If F is left exact and if E injective in A implies (Rm F)(GE) = {0} for all m > 0 (where Rm F are the right derived functors of F), then for every module A ∈A, there is a third quadrant spectral sequence E p,q = (R pF)(RqG(A)) ⇒Rn(FG)(A). The next result shows that if N is a normal subgroup of a group *, then the cohomology groups of N and of */N can be used to compute the cohomology groups of *.
Key result
Let * be a group with normal subgroup N. For each *-module A, there is a third quadrant spectral sequence with E p,q = H p(*/N, Hq(N, A)) ⇒Hn(*, A).
How to reason with these results
Most advanced-algebra problems become manageable when the representation is separated from the invariant structure. Begin with the definition, then decide whether the problem is asking for an elementwise calculation, a statement about a morphism, or a classification up to isomorphism. That choice determines the correct proof language.
When a theorem gives a structural conclusion, do not jump directly to the conclusion. Write the hypotheses next to the object you are studying and check them one by one. If a hypothesis fails, either strengthen the object, pass to a quotient or localisation where the theorem applies, or use a more elementary argument.
For computational work, record each transformation together with the equivalence relation it preserves. In algebra, row operations, similarity, quotienting, localisation and isomorphism preserve different kinds of information. A calculation is useful only when the preserved structure matches the question.
Common failure modes
Failure mode
Control
Forgetting to verify that a differential squares to zero.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Reversing homological and cohomological grading.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Confusing cycles with homology classes.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Using a resolution that lacks the required projective or injective property.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Dropping connecting morphisms from a long exact sequence.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Verification checklist
The ambient set, ring, field, group, module or category has been stated.
Every operation and map used is well-defined in that setting.
The hypotheses of each structural result have been checked before use.
Representatives, coordinates or generators have not been confused with the underlying object.
Existence and uniqueness have been separated where both matter.
The final result has been checked against the original defining relation or universal property.
Quick questions
What should I identify first in a problem about crossed product algebras and spectral sequences?
Start with the ambient algebraic structure, its operation or maps, and the exact hypotheses. Most incorrect solutions begin by using a familiar rule that is not valid in the stated structure.
How should definitions be used in proofs?
Expand the definition at the point where it becomes useful. Definitions are not background prose; they are the conditions that determine what must be proved and which implications are available.
When is a structural theorem safer than direct calculation?
Use a structural theorem when its hypotheses are satisfied and the calculation would otherwise depend on arbitrary coordinates, representatives or generators. The theorem usually identifies an invariant that survives those choices.
How can a final answer be checked?
Substitute the result back into the defining relation, verify any required closure or map property, and check edge cases such as zero, the identity, the empty object or degenerate quotients where relevant.
Connections within the handbook
Source basis: supplied advanced algebra reference. Source-identifying authorship, publication and biographical material has been intentionally omitted; the page retains the mathematical content needed for the handbook.
