@@ -41,7 +41,7 @@ def transitive_number(self, algorithm=None, recompute=False):
41
41
@lazy_attribute
42
42
def _gens (self ):
43
43
"""
44
- Return the generators of this Galois group as permutations of the roots.
44
+ The generators of this Galois group as permutations of the roots.
45
45
46
46
It is important that this be computed lazily, since it is
47
47
often possible to compute other attributes (such as the order
@@ -84,7 +84,7 @@ def __init__(self, field, algorithm=None, names=None, gc_numbering=False):
84
84
@lazy_attribute
85
85
def _deg (self ):
86
86
r"""
87
- Return the number of moved points in the permutation representation.
87
+ The number of moved points in the permutation representation.
88
88
89
89
This will be the degree of the original number field if `_gc_numbering``
90
90
is ``False``, or the degree of the Galois closure otherwise.
@@ -112,7 +112,7 @@ def _deg(self):
112
112
@lazy_attribute
113
113
def _domain (self ):
114
114
r"""
115
- Return the integers labeling the roots on which this Galois group acts.
115
+ The integers labeling the roots on which this Galois group acts.
116
116
117
117
EXAMPLES::
118
118
@@ -131,7 +131,7 @@ def _domain(self):
131
131
@lazy_attribute
132
132
def _domain_to_gap (self ) -> dict :
133
133
r"""
134
- Return the dictionary implementing the identity (used by PermutationGroup_generic).
134
+ The dictionary implementing the identity (used by PermutationGroup_generic).
135
135
136
136
EXAMPLES::
137
137
@@ -146,7 +146,7 @@ def _domain_to_gap(self) -> dict:
146
146
@lazy_attribute
147
147
def _domain_from_gap (self ) -> dict :
148
148
r"""
149
- Return the dictionary implementing the identity (used by PermutationGroup_generic).
149
+ The dictionary implementing the identity (used by PermutationGroup_generic).
150
150
151
151
EXAMPLES::
152
152
0 commit comments