How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The annihilator of a subgroup
Definition
Let be an abelian topological group (Topological group: multiplication and inversion are continuous) written additively, with Pontryagin dual carrying the compact-open topology and pointwise multiplication (The Pontryagin dual with the compact-open topology), and let be a subgroup (Subgroup).
The annihilator of is the set of characters trivial on : It is a subgroup of : it contains the identity character ; if for all then and for all , because multiplication and inversion in are pointwise (The compact-open character group is a Hausdorff topological abelian group). Moreover is exactly the kernel of the restriction homomorphism , , which is a continuous group homomorphism by the functoriality of the dual under pullback along the inclusion (Dual homomorphisms: continuity, and the annihilator of a closed subgroup, Monoid homomorphism and group homomorphism). Consequently is a closed subgroup of : it is the kernel of a continuous homomorphism between Hausdorff topological groups, and is Hausdorff (The compact-open character group is a Hausdorff topological abelian group). In particular the closedness of holds whenever is closed in , and no closedness of is needed for it.
Annihilators in the dual and in the bidual. Let be a subgroup of the dual. Its annihilator is The definition uses only the evaluation pairing and makes no isomorphism claim. Two conventions are recorded and used throughout this page.
- for every subgroup . Indeed a character is continuous, so it is trivial on if and only if it is trivial on the closure of ; equivalently, is trivial on exactly when its kernel, a closed subgroup, contains . The convention lets every annihilator be computed with closed subgroups.
- For a closed subgroup the subgroup is closed by the kernel argument above. If is locally compact Hausdorff abelian and the Axiom of Choice is assumed (The Axiom of Choice), then is LCA by The dual of a locally compact abelian group is locally compact abelian, and its closed subgroup is LCA by A locally compact subgroup of a Hausdorff topological group is closed. Its own annihilator in the bidual is written and is identified with a subgroup of through the evaluation map of Pontryagin biduality: the evaluation map is a topological isomorphism when that identification is available.
Forming the annihilator and proving its subgroup and closedness properties use no choice principle. The additional local-compactness assertion in convention 2 assumes AC as stated.
Depends on
- The Axiom of Choice
- Monoid homomorphism and group homomorphism
- The Pontryagin dual with the compact-open topology
- Subgroup
- Topological group: multiplication and inversion are continuous
- The compact-open character group is a Hausdorff topological abelian group
- Dual homomorphisms: continuity, and the annihilator of a closed subgroup
- A locally compact subgroup of a Hausdorff topological group is closed
- The dual of a locally compact abelian group is locally compact abelian
Used by
- Annihilators of closed subgroups of Euclidean space Example
- Annihilators reverse inclusions and the double annihilator closes the subgroup Lemma
- Biduality commutes with products, closed subgroups and quotients Lemma
- Characters of a closed subgroup extend to the ambient LCA group Lemma
- The dual of a closed subgroup is a quotient of the dual Theorem
- The dual of a quotient is the annihilator Theorem
Dependency tree · two levels
46 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- T. W. Koerner, Topological Groups (author lecture notes) (standard reference, not scraped)
- Manfred Einsiedler and Thomas Ward, Ergodic Theory with a View Towards Number Theory, Appendix C (course-hosted full text) (standard reference, not scraped)