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

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

""" 

Homset for Finite Fields 

 

This is the set of all field homomorphisms between two finite fields. 

 

EXAMPLES:: 

 

sage: R.<t> = ZZ[] 

sage: E.<a> = GF(25, modulus = t^2 - 2) 

sage: F.<b> = GF(625) 

sage: H = Hom(E, F) 

sage: f = H([4*b^3 + 4*b^2 + 4*b]); f 

Ring morphism: 

From: Finite Field in a of size 5^2 

To: Finite Field in b of size 5^4 

Defn: a |--> 4*b^3 + 4*b^2 + 4*b 

sage: f(2) 

2 

sage: f(a) 

4*b^3 + 4*b^2 + 4*b 

sage: len(H) 

2 

sage: [phi(2*a)^2 for phi in Hom(E, F)] 

[3, 3] 

 

We can also create endomorphisms:: 

 

sage: End(E) 

Automorphism group of Finite Field in a of size 5^2 

sage: End(GF(7))[0] 

Ring endomorphism of Finite Field of size 7 

Defn: 1 |--> 1 

sage: H = Hom(GF(7), GF(49, 'c')) 

sage: H[0](2) 

2 

""" 

 

from sage.rings.homset import RingHomset_generic 

from sage.rings.finite_rings.hom_finite_field import FiniteFieldHomomorphism_generic 

from sage.rings.integer import Integer 

from sage.structure.sequence import Sequence 

 

class FiniteFieldHomset(RingHomset_generic): 

""" 

Set of homomorphisms with domain a given finite field. 

""" 

# def __init__(self, R, S, category=None): 

# if category is None: 

# from sage.categories.finite_fields import FiniteFields 

# category = FiniteFields() 

# RingHomset_generic.__init__(self, R, S, category) 

 

def __call__(self, im_gens, check=True): 

""" 

Construct the homomorphism defined by ``im_gens``. 

 

EXAMPLES:: 

 

sage: R.<t> = ZZ[] 

sage: E.<a> = GF(25, modulus = t^2 - 2) 

sage: F.<b> = GF(625) 

sage: End(E) 

Automorphism group of Finite Field in a of size 5^2 

sage: list(Hom(E, F)) 

[Ring morphism: 

From: Finite Field in a of size 5^2 

To: Finite Field in b of size 5^4 

Defn: a |--> 4*b^3 + 4*b^2 + 4*b, 

Ring morphism: 

From: Finite Field in a of size 5^2 

To: Finite Field in b of size 5^4 

Defn: a |--> b^3 + b^2 + b] 

sage: [phi(2*a)^2 for phi in Hom(E, F)] 

[3, 3] 

sage: End(GF(7))[0] 

Ring endomorphism of Finite Field of size 7 

Defn: 1 |--> 1 

sage: H = Hom(GF(7), GF(49, 'c')) 

sage: H[0](2) 

2 

sage: Hom(GF(49, 'c'), GF(7)).list() 

[] 

sage: Hom(GF(49, 'c'), GF(81, 'd')).list() 

[] 

sage: H = Hom(GF(9, 'a'), GF(81, 'b')) 

sage: H == loads(dumps(H)) 

True 

""" 

if isinstance(im_gens, FiniteFieldHomomorphism_generic): 

return self._coerce_impl(im_gens) 

try: 

if self.domain().degree() == 1: 

from sage.rings.finite_rings.hom_prime_finite_field import FiniteFieldHomomorphism_prime 

return FiniteFieldHomomorphism_prime(self, im_gens, check=check) 

return FiniteFieldHomomorphism_generic(self, im_gens, check=check) 

except (NotImplementedError, ValueError) as err: 

try: 

return self._coerce_impl(im_gens) 

except TypeError: 

raise TypeError("images do not define a valid homomorphism") 

 

def _coerce_impl(self, x): 

""" 

Coercion of other morphisms. 

 

EXAMPLES:: 

 

sage: k.<a> = GF(25) 

sage: l.<b> = GF(625) 

sage: H = Hom(k, l) 

sage: G = loads(dumps(H)) 

sage: H is G 

True 

sage: G.coerce(list(H)[0]) # indirect doctest 

Ring morphism: 

From: Finite Field in a of size 5^2 

To: Finite Field in b of size 5^4 

Defn: a |--> 4*b^3 + 4*b^2 + 4*b + 3 

""" 

if not isinstance(x, FiniteFieldHomomorphism_generic): 

raise TypeError 

if x.parent() is self: 

return x 

if x.parent() == self: 

return FiniteFieldHomomorphism_generic(self, x.im_gens()) 

raise TypeError 

 

def _repr_(self): 

""" 

Return a string representation of ``self``. 

 

EXAMPLES:: 

 

sage: Hom(GF(4, 'a'), GF(16, 'b'))._repr_() 

'Set of field embeddings from Finite Field in a of size 2^2 to Finite Field in b of size 2^4' 

sage: Hom(GF(4, 'a'), GF(4, 'c'))._repr_() 

'Set of field embeddings from Finite Field in a of size 2^2 to Finite Field in c of size 2^2' 

sage: Hom(GF(4, 'a'), GF(4, 'a'))._repr_() 

'Automorphism group of Finite Field in a of size 2^2' 

""" 

D = self.domain() 

C = self.codomain() 

if C == D: 

return "Automorphism group of %s"%D 

else: 

return "Set of field embeddings from %s to %s"%(D, C) 

 

def is_aut(self): 

""" 

Check if ``self`` is an automorphism 

 

EXAMPLES:: 

 

sage: Hom(GF(4, 'a'), GF(16, 'b')).is_aut() 

False 

sage: Hom(GF(4, 'a'), GF(4, 'c')).is_aut() 

False 

sage: Hom(GF(4, 'a'), GF(4, 'a')).is_aut() 

True 

""" 

return self.domain() == self.codomain() 

 

def order(self): 

""" 

Return the order of this set of field homomorphisms. 

 

EXAMPLES:: 

 

sage: K.<a> = GF(125) 

sage: End(K) 

Automorphism group of Finite Field in a of size 5^3 

sage: End(K).order() 

3 

sage: L.<b> = GF(25) 

sage: Hom(L, K).order() == Hom(K, L).order() == 0 

True 

""" 

try: 

return self.__order 

except AttributeError: 

pass 

n = len(self.list()) 

self.__order = n 

return n 

 

def __len__(self): 

""" 

Return the number of elements of ``self``. 

 

EXAMPLES:: 

 

sage: K.<a> = GF(25) 

sage: len(End(K)) 

2 

""" 

return self.order() 

 

def list(self): 

""" 

Return a list of all the elements in this set of field homomorphisms. 

 

EXAMPLES:: 

 

sage: K.<a> = GF(25) 

sage: End(K) 

Automorphism group of Finite Field in a of size 5^2 

sage: list(End(K)) 

[Ring endomorphism of Finite Field in a of size 5^2 

Defn: a |--> 4*a + 1, 

Ring endomorphism of Finite Field in a of size 5^2 

Defn: a |--> a] 

sage: L.<z> = GF(7^6) 

sage: [g for g in End(L) if (g^3)(z) == z] 

[Ring endomorphism of Finite Field in z of size 7^6 

Defn: z |--> z, 

Ring endomorphism of Finite Field in z of size 7^6 

Defn: z |--> 5*z^4 + 5*z^3 + 4*z^2 + 3*z + 1, 

Ring endomorphism of Finite Field in z of size 7^6 

Defn: z |--> 3*z^5 + 5*z^4 + 5*z^2 + 2*z + 3] 

 

Between isomorphic fields with different moduli:: 

 

sage: k1 = GF(1009) 

sage: k2 = GF(1009, modulus="primitive") 

sage: Hom(k1, k2).list() 

[ 

Ring morphism: 

From: Finite Field of size 1009 

To: Finite Field of size 1009 

Defn: 1 |--> 1 

] 

sage: Hom(k2, k1).list() 

[ 

Ring morphism: 

From: Finite Field of size 1009 

To: Finite Field of size 1009 

Defn: 11 |--> 11 

] 

 

sage: k1.<a> = GF(1009^2, modulus="first_lexicographic") 

sage: k2.<b> = GF(1009^2, modulus="conway") 

sage: Hom(k1, k2).list() 

[ 

Ring morphism: 

From: Finite Field in a of size 1009^2 

To: Finite Field in b of size 1009^2 

Defn: a |--> 290*b + 864, 

Ring morphism: 

From: Finite Field in a of size 1009^2 

To: Finite Field in b of size 1009^2 

Defn: a |--> 719*b + 145 

] 

 

TESTS: 

 

Check that :trac:`11390` is fixed:: 

 

sage: K = GF(1<<16,'a'); L = GF(1<<32,'b') 

sage: K.Hom(L)[0] 

Ring morphism: 

From: Finite Field in a of size 2^16 

To: Finite Field in b of size 2^32 

Defn: a |--> b^29 + b^27 + b^26 + b^23 + b^21 + b^19 + b^18 + b^16 + b^14 + b^13 + b^11 + b^10 + b^9 + b^8 + b^7 + b^6 + b^5 + b^2 + b 

""" 

try: 

return self.__list 

except AttributeError: 

pass 

D = self.domain() 

C = self.codomain() 

if D.characteristic() == C.characteristic() and Integer(D.degree()).divides(Integer(C.degree())): 

f = D.modulus() 

g = C['x'](f) 

r = g.roots() 

v = [self(D.hom(a, C)) for a, _ in r] 

v = Sequence(v, immutable=True, cr=True) 

else: 

v = Sequence([], immutable=True, cr=False) 

self.__list = v 

return v 

 

def __getitem__(self, n): 

""" 

EXAMPLES:: 

 

sage: H = Hom(GF(32, 'a'), GF(1024, 'b')) 

sage: H[1] 

Ring morphism: 

From: Finite Field in a of size 2^5 

To: Finite Field in b of size 2^10 

Defn: a |--> b^7 + b^5 

sage: H[2:4] 

[ 

Ring morphism: 

From: Finite Field in a of size 2^5 

To: Finite Field in b of size 2^10 

Defn: a |--> b^8 + b^6 + b^2, 

Ring morphism: 

From: Finite Field in a of size 2^5 

To: Finite Field in b of size 2^10 

Defn: a |--> b^9 + b^7 + b^6 + b^5 + b^4 

] 

""" 

return self.list()[n] 

 

def index(self, item): 

""" 

Return the index of ``self``. 

 

EXAMPLES:: 

 

sage: K.<z> = GF(1024) 

sage: g = End(K)[3] 

sage: End(K).index(g) == 3 

True 

""" 

return self.list().index(item) 

 

def _an_element_(self): 

""" 

Return an element of ``self``. 

 

TESTS:: 

 

sage: Hom(GF(3^3, 'a'), GF(3^6, 'b')).an_element() 

Ring morphism: 

From: Finite Field in a of size 3^3 

To: Finite Field in b of size 3^6 

Defn: a |--> 2*b^5 + 2*b^4 

 

sage: Hom(GF(3^3, 'a'), GF(3^2, 'c')).an_element() 

Traceback (most recent call last): 

... 

EmptySetError: no homomorphisms from Finite Field in a of size 3^3 to Finite Field in c of size 3^2 

 

.. TODO:: 

 

Use a more sophisticated algorithm; see also :trac:`8751`. 

 

""" 

K = self.domain() 

L = self.codomain() 

if K.degree() == 1: 

return L.coerce_map_from(K) 

elif not K.degree().divides(L.degree()): 

from sage.categories.sets_cat import EmptySetError 

raise EmptySetError('no homomorphisms from %s to %s' % (K, L)) 

return K.hom([K.modulus().any_root(L)]) 

 

 

from sage.structure.sage_object import register_unpickle_override 

register_unpickle_override('sage.rings.finite_field_morphism', 'FiniteFieldHomset', FiniteFieldHomset)