1974
DOI: 10.1016/0016-660x(74)90005-1
|View full text |Cite
|
Sign up to set email alerts
|

Free topological groups

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0
1

Year Published

1976
1976
2019
2019

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 39 publications
(5 citation statements)
references
References 11 publications
0
4
0
1
Order By: Relevance
“…It is worthwhile to note that connected torsion groups of bounded order, as hypothesized in Theorem 3.25, do exist. Here we give two quite different proofs that for 0 < n < ω there is a nontrivial connected torsion group of exponent n. Of these (A), as remarked by the referee, uses the construction given in Theorem 3.20; while (B), drawing freely on the expositions [37] and [2](2.3-2.4), derives from the "free topological group" constructions first given by Markov [25], [26] and Graev [21].…”
Section: Proofmentioning
confidence: 99%
“…It is worthwhile to note that connected torsion groups of bounded order, as hypothesized in Theorem 3.25, do exist. Here we give two quite different proofs that for 0 < n < ω there is a nontrivial connected torsion group of exponent n. Of these (A), as remarked by the referee, uses the construction given in Theorem 3.20; while (B), drawing freely on the expositions [37] and [2](2.3-2.4), derives from the "free topological group" constructions first given by Markov [25], [26] and Graev [21].…”
Section: Proofmentioning
confidence: 99%
“…Alternate latter-day constructions abound, some achieved independently of [82][83][84][85] and some based on those works, some with algebraic emphasis [86,87], [2] (8.8,8.9), [24] (2.3-2.5), some topological [88][89][90], some functorial or categorical [91]. See [92] ( §4) for a comprehensive introduction to the groups FX and FAX, and see [62] for generalizations to "free P-spaces" for some other classes P.…”
Section: Characterizations Of Fx and Faxmentioning
confidence: 99%
“…These two facts imply that L(Y ) can be identified with L(Y, X). Since Y is closed in X we can repeat word for word the proof of [16,Proposition 3.8]…”
Section: Question 23mentioning
confidence: 99%