西罗定理是什么？
What are the Sylow theorems?
西罗定理刻画有限群中“最高次幂”的 p-子群（西罗 p-子群）的存在性与数量。它们是分类有限群、判断群是否单群的核心工具。
Sylow theorems describe the existence and number of maximal p-subgroups in a finite group; key for classifying finite groups and detecting simplicity.
难度 专业 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
D. S. Dummit 与 R. M. Foote《Abstract Algebra》，第 3 版，Wiley，2004，§4.5（The Sylow Theorems）
Dummit & Foote, Abstract Algebra, 3rd ed., Wiley, 2004, Sec. 4.5 (The Sylow Theorems)
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780135693025 (2004)
#群论 #西罗定理
有限单群分类定理是什么？
What is the classification of finite simple groups?
该定理把一切有限单群（不可再分解的“原子群”）归类为若干族（如素数阶循环群、交错群、李型群）加 26 个散在单群。证明长达上万页，是20世纪数学的宏篇。
The classification of finite simple groups shows every finite simple group belongs to certain families plus 26 sporadic groups; the proof spans tens of thousands of pages.
难度 专业 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
Dummit 与 Foote《Abstract Algebra》；Rotman《An Introduction to the Theory of Groups》
Dummit & Foote, Abstract Algebra; Rotman, An Introduction to the Theory of Groups
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780135693025 (2004)
#群论 #单群分类
环中的理想是什么？
What is an ideal in a ring?
理想是环 R 的一个子集 I，对加法封闭且被 R 中任意元素“乘”后仍落在 I 中。它是“可整除性”在一般环中的推广，也是代数数论与代数几何的基石。
An ideal is a subset of a ring closed under addition and under multiplication by any ring element; it generalizes divisibility and underlies algebraic number theory.
难度 专业 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
《近世代数》刘绍学
Abstract Algebra by Dummit and Foote
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780135693025 (2004)
#群论 #理想
伯恩赛德引理是什么？
What is Burnside's lemma?
伯恩赛德引理用群作用下的“不动点计数”来求在对称意义下不同的染色/排列方案数，即轨道数等于各群元素不动点数的平均值。它是组合计数利器。
Burnside's lemma counts distinct configurations under symmetry: the number of orbits equals the average number of fixed points of group elements—a staple of combinatorial counting.
难度 专业 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-11-02
来源 · Source
《组合数学》Brualdi
Introductory Combinatorics by Richard Brualdi
独立核验依据 · Independent verification: 核验依据 1 ISBN 9787111377870（豆瓣书目条目: 组合数学）
#群论 #伯恩赛德
为什么任何一个阶为 15 的群都必定是循环群？请用西罗定理论证。
Why must every group of order 15 be cyclic? Give the argument via Sylow's theorems.
设 |G|=15。西罗定理给出 n₅≡1(mod 5) 且整除 3，故 n₅=1；n₃≡1(mod 3) 且整除 5，故 n₃=1。两西罗子群因而唯一且正规，交集平凡。正规子群的换位子落在二者之交内，故元素彼此交换，G 为内直积：G≅C₃×C₅≅C₁₅。西罗计数把候选子群数压成 1，正规性随之免费获得。
Let |G| = 15. By Sylow, the number n₅ of Sylow 5-subgroups satisfies n₅ ≡ 1 (mod 5) and divides 3, so n₅ = 1; likewise n₃ ≡ 1 (mod 3) and divides 5, so n₃ = 1. Each Sylow subgroup is therefore unique and normal, with trivial intersection. The commutator of two normal subgroups lies in their intersection, so their elements commute and G is the internal direct product G ≅ C₃ × C₅ ≅ C₁₅. The point is that Sylow counting crushes the candidates down to one, delivering normality for free.
难度 专业 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
D. S. Dummit 与 R. M. Foote《Abstract Algebra》，第 3 版，Wiley，2004，§4.5（The Sylow Theorems）
Dummit & Foote, Abstract Algebra, 3rd ed., Wiley, 2004, Sec. 4.5 (The Sylow Theorems)
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780135693025 (2004)
#群论 #西罗定理 #有限群
拉格朗日定理说有限群 G 的子群 H 的阶必整除 |G|，其证明的核心机制是什么？能立刻推出哪条漂亮结论？
Lagrange's theorem says the order of a subgroup H of a finite group G divides |G|. What is the core mechanism of the proof, and what elegant corollary follows immediately?
核心机制是陪集分割。对 g∈G，陪集 gH = {gh : h∈H} 与 H 元素一样多，因左乘 g 只是重排元素；且两陪集共享一元素便完全重合，全体左陪集构成 G 的两两不相交的等大分块，故 |G| = [G:H]·|H|。立刻可得：素数阶群无非平凡子群，故必循环；且元素的阶整除群的阶——费马小定理即特例。
The core mechanism is the coset partition. For g∈G the left coset gH = {gh : h∈H} has exactly as many elements as H, since left multiplication by g merely permutes them; and two cosets sharing even one element coincide completely, so the left cosets tile G in pairwise disjoint blocks of equal size, giving |G| = [G:H]·|H|. Immediately: a group of prime order has no nontrivial subgroup and hence must be cyclic, and each element's order divides the group order — Fermat's little theorem is a special case.
难度 进阶 · 适合 初中(12-15)
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
D. S. Dummit 与 R. M. Foote《Abstract Algebra》（第3版），Wiley，2004，§3.8
D. S. Dummit & R. M. Foote, Abstract Algebra, 3rd ed., Wiley, 2004, §3.8
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780135693025 (2004)
#群论 #拉格朗日定理 #陪集
对称群 S_n 是什么？
What is the symmetric group S_n?
对称群 S_n 是由 n 个元素的全部 n! 个置换组成的群，群运算为置换的复合。它是最基本也最丰富的有限群，几乎所有有限群都能嵌入其中。
The symmetric group S_n consists of all n! permutations of n objects under composition; it is the prototypical finite group, and every finite group embeds in some S_n.
难度 入门 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
Dummit 与 Foote《Abstract Algebra》；Rotman《An Introduction to the Theory of Groups》
Dummit & Foote, Abstract Algebra; Rotman, An Introduction to the Theory of Groups
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780135693025 (2004)
#群论 #对称群