Hide keyboard shortcuts

Hot-keys on this page

r m x p   toggle line displays

j k   next/prev highlighted chunk

0   (zero) top of page

1   (one) first highlighted chunk

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

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

""" 

Base class for groups 

""" 

  

#***************************************************************************** 

# Copyright (C) 2005 William Stein <wstein@gmail.com> 

# 

# Distributed under the terms of the GNU General Public License (GPL) 

# 

# This code is distributed in the hope that it will be useful, 

# but WITHOUT ANY WARRANTY; without even the implied warranty of 

# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 

# General Public License for more details. 

# 

# The full text of the GPL is available at: 

# 

# http://www.gnu.org/licenses/ 

#***************************************************************************** 

from __future__ import absolute_import 

  

import random 

  

from sage.structure.parent cimport Parent 

from sage.rings.infinity import infinity 

from sage.rings.integer_ring import ZZ 

  

def is_Group(x): 

""" 

Return whether ``x`` is a group object. 

  

INPUT: 

  

- ``x`` -- anything. 

  

OUTPUT: 

  

Boolean. 

  

EXAMPLES:: 

  

sage: F.<a,b> = FreeGroup() 

sage: from sage.groups.group import is_Group 

sage: is_Group(F) 

True 

sage: is_Group("a string") 

False 

""" 

from sage.groups.old import Group as OldGroup 

return isinstance(x, (Group, OldGroup)) 

  

  

cdef class Group(Parent): 

""" 

Base class for all groups 

  

TESTS:: 

  

sage: from sage.groups.group import Group 

sage: G = Group() 

sage: TestSuite(G).run(skip = ["_test_an_element",\ 

"_test_associativity",\ 

"_test_elements",\ 

"_test_elements_eq_reflexive",\ 

"_test_elements_eq_symmetric",\ 

"_test_elements_eq_transitive",\ 

"_test_elements_neq",\ 

"_test_inverse",\ 

"_test_one",\ 

"_test_pickling",\ 

"_test_prod",\ 

"_test_some_elements"]) 

  

Generic groups have very little functionality:: 

  

sage: 4 in G 

Traceback (most recent call last): 

... 

NotImplementedError: cannot construct elements of <sage.groups.group.Group object at ...> 

""" 

def __init__(self, base=None, gens=None, category=None): 

""" 

The Python constructor 

  

TESTS:: 

  

sage: from sage.groups.group import Group 

sage: G = Group() 

sage: G.category() 

Category of groups 

sage: G = Group(category=Groups()) # todo: do the same test with some subcategory of Groups when there will exist one 

sage: G.category() 

Category of groups 

sage: G = Group(category = CommutativeAdditiveGroups()) 

Traceback (most recent call last): 

... 

ValueError: (Category of commutative additive groups,) is not a subcategory of Category of groups 

sage: G._repr_option('element_is_atomic') 

False 

  

Check for :trac:`8119`:: 

  

sage: G = SymmetricGroup(2) 

sage: h = hash(G) 

sage: G.rename('S2') 

sage: h == hash(G) 

True 

""" 

if gens is not None: 

from sage.misc.superseded import deprecation 

deprecation(22129, "gens keyword has been deprecated. Define a method gens() instead.") 

from sage.categories.groups import Groups 

if category is None: 

category = Groups() 

else: 

if not isinstance(category, tuple): 

category = (category,) 

if not any(cat.is_subcategory(Groups()) for cat in category): 

raise ValueError("%s is not a subcategory of %s"%(category, Groups())) 

Parent.__init__(self, base=base, category=category) 

  

def is_abelian(self): 

""" 

Test whether this group is abelian. 

  

EXAMPLES:: 

  

sage: from sage.groups.group import Group 

sage: G = Group() 

sage: G.is_abelian() 

Traceback (most recent call last): 

... 

NotImplementedError 

""" 

raise NotImplementedError 

  

def is_commutative(self): 

r""" 

Test whether this group is commutative. 

  

This is an alias for is_abelian, largely to make groups work 

well with the Factorization class. 

  

(Note for developers: Derived classes should override is_abelian, not 

is_commutative.) 

  

EXAMPLES:: 

  

sage: SL(2, 7).is_commutative() 

False 

""" 

return self.is_abelian() 

  

def order(self): 

""" 

Return the number of elements of this group. 

  

This is either a positive integer or infinity. 

  

EXAMPLES:: 

  

sage: from sage.groups.group import Group 

sage: G = Group() 

sage: G.order() 

Traceback (most recent call last): 

... 

NotImplementedError 

  

TESTS:: 

  

sage: H = SL(2, QQ) 

sage: H.order() 

+Infinity 

""" 

try: 

return self.cardinality() 

except AttributeError: 

raise NotImplementedError 

  

def is_finite(self): 

""" 

Returns True if this group is finite. 

  

EXAMPLES:: 

  

sage: from sage.groups.group import Group 

sage: G = Group() 

sage: G.is_finite() 

Traceback (most recent call last): 

... 

NotImplementedError 

""" 

return self.order() != infinity 

  

def is_multiplicative(self): 

""" 

Returns True if the group operation is given by \* (rather than 

+). 

  

Override for additive groups. 

  

EXAMPLES:: 

  

sage: from sage.groups.group import Group 

sage: G = Group() 

sage: G.is_multiplicative() 

True 

""" 

return True 

  

def _an_element_(self): 

""" 

Return an element 

  

OUTPUT: 

  

An element of the group. 

  

EXAMPLES: 

  

sage: G = AbelianGroup([2,3,4,5]) 

sage: G.an_element() 

f0*f1*f2*f3 

""" 

from sage.misc.all import prod 

return prod(self.gens()) 

  

def quotient(self, H): 

""" 

Return the quotient of this group by the normal subgroup 

`H`. 

  

EXAMPLES:: 

  

sage: from sage.groups.group import Group 

sage: G = Group() 

sage: G.quotient(G) 

Traceback (most recent call last): 

... 

NotImplementedError 

""" 

raise NotImplementedError 

  

cdef class AbelianGroup(Group): 

""" 

Generic abelian group. 

""" 

def is_abelian(self): 

""" 

Return True. 

  

EXAMPLES:: 

  

sage: from sage.groups.group import AbelianGroup 

sage: G = AbelianGroup() 

sage: G.is_abelian() 

True 

""" 

return True 

  

cdef class FiniteGroup(Group): 

""" 

Generic finite group. 

""" 

  

def __init__(self, base=None, gens=None, category=None): 

""" 

The Python constructor 

  

TESTS:: 

  

sage: from sage.groups.group import FiniteGroup 

sage: G = FiniteGroup() 

sage: G.category() 

Category of finite groups 

""" 

if gens is not None: 

from sage.misc.superseded import deprecation 

deprecation(22129, "gens keyword has been deprecated. Define a method gens() instead.") 

from sage.categories.finite_groups import FiniteGroups 

if category is None: 

category = FiniteGroups() 

else: 

if not isinstance(category, tuple): 

category = (category,) 

if not any(cat.is_subcategory(FiniteGroups()) for cat in category): 

raise ValueError("%s is not a subcategory of %s"%(category, FiniteGroups())) 

Parent.__init__(self, base=base, category=category) 

  

def is_finite(self): 

""" 

Return True. 

  

EXAMPLES:: 

  

sage: from sage.groups.group import FiniteGroup 

sage: G = FiniteGroup() 

sage: G.is_finite() 

True 

""" 

return True