forked from ScriptRaccoon/CatDat
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFinGrp.sql
More file actions
121 lines (121 loc) · 3.77 KB
/
FinGrp.sql
File metadata and controls
121 lines (121 loc) · 3.77 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
INSERT INTO category_property_assignments (
category_id,
property_id,
is_satisfied,
reason
)
VALUES
(
'FinGrp',
'locally small',
TRUE,
'It is a full subcategory of $\mathbf{Grp}$, which is locally small.'
),
(
'FinGrp',
'pointed',
TRUE,
'The trivial group is a zero object.'
),
(
'FinGrp',
'essentially countable',
TRUE,
'The underlying set of a finite structure can be chosen to be a subset of $\mathbb{N}$.'
),
(
'FinGrp',
'epi-regular',
TRUE,
'This holds since every epimorphism is surjective (see below), and a surjective homomorphism $A \to B$ is the coequalizer of its kernel pair $A \times_B A \rightrightarrows A$.'
),
(
'FinGrp',
'mono-regular',
TRUE,
'See Prop. 4.2 at the <a href="https://ncatlab.org/nlab/show/regular+monomorphism#Examples" target="_blank">nLab</a>. The proof also works for finite groups.'
),
(
'FinGrp',
'coequalizers',
TRUE,
'The quotient group of a finite group is still finite.'
),
(
'FinGrp',
'Malcev',
TRUE,
'A direct argument is possible, but this can also be derived from the observation that $\mathbf{FinGrp}$ is the category of group objects in $(\mathbf{FinSet},\times)$ and Example 2.2.16 in <a href="https://ncatlab.org/nlab/show/Malcev,+protomodular,+homological+and+semi-abelian+categories" target="_blank">Malcev, protomodular, homological and semi-abelian categories</a>.'
),
(
'FinGrp',
'Barr-exact',
TRUE,
'The category is Malcev and hence finitely complete, and it has all coequalizers. The regular epimorphisms coincide with the surjective group homomorphisms (see below), hence are clearly stable under pullbacks. This shows the category is regular. For exactness, quotients of equivalence relations are inherited from Group, with a quotient of a finite group clearly being finite as well.'
),
(
'FinGrp',
'conormal',
TRUE,
'Since epimorphisms are surjective (see below), this is the first isomorphism theorem for finite groups.'
),
(
'FinGrp',
'ℵ₁-accessible',
TRUE,
'The proof works exactly as for the <a href="/category/FinSet">category of finite sets</a>.'
),
(
'FinGrp',
'normal',
FALSE,
'Every non-normal subgroup of a finite group provides a counterexample.'
),
(
'FinGrp',
'cogenerator',
FALSE,
'We apply <a href="/lemma/missing_cogenerator">this lemma</a> to the collection of finite simple groups: Any non-trivial homomorphism from a finite simple group to a finite group must be injective, and for every $n \in \mathbb{N}$ there is a finite simple group of size $\geq n$ (for example, the alternating group on $n+5$ elements).'
),
(
'FinGrp',
'skeletal',
FALSE,
'This is trivial.'
),
(
'FinGrp',
'binary copowers',
FALSE,
'Assume that $C_2 \sqcup C_2$ exists. This is a finite group, say of order $N$, with two involutions $u,v$ such that for every finite group $G$ with two involutions $a,b$ there is a unique homomorphism $\varphi : C_2 \sqcup C_2 \to G$ with $\varphi(u)=a$ and $\varphi(v)=2$. In particular, when $G$ is generated by $a,b$, then $\mathrm{ord}(G) \leq N$. But then the dihedral group $G := D_N$ of order $2N$ yields a contradiction.'
),
(
'FinGrp',
'small',
FALSE,
'Even the collection of trivial groups is not small.'
),
(
'FinGrp',
'generator',
FALSE,
'If $A,B$ are finite groups whose orders are coprime, then we know that $\hom(A,B)$ is trivial. But a generator would admit a non-trivial homomorphism to any other non-trivial finite group.'
),
(
'FinGrp',
'countable powers',
FALSE,
'If countable powers exist, then by <a href="/lemma/hilberts_hotel">Hilbert''s Hotel</a> there is some object $P$ with $P \cong C_2 \times P$. If $P$ has $n$ elements, this means $n = 2n$, i.e. $n = 0$, a contradiction.'
),
(
'FinGrp',
'sequential colimits',
FALSE,
'This follows from <a href="/lemma/special_sequential_colimits">this lemma</a>.'
),
(
'FinGrp',
'countable',
FALSE,
'This is trivial.'
);