This document provides a solution to Markov's problem regarding connected group topologies for abelian groups. The key points are:
1. The authors prove that every abelian M-group (a group where all proper unconditionally closed subgroups have index at least c) admits a densely pathwise connected and locally densely pathwise connected group topology.
2. This completes the solution to Markov's problem, as it shows that an abelian group admits a connected group topology if and only if it is an M-group.
3. The proof involves characterizing w-divisible groups (groups where all subgroups have the same cardinality) and using a classical construction to put connected topologies on homogeneous groups
A crystallographic group is a group acting on R^n that contains a translation subgroup Z^n as a finite index subgroup. Here we consider which Coxeter groups are crystallographic groups. We also expose the enumeration in dimension 2 and 3. Then we shortly give the principle under which the enumeration of N dimensional crystallographic groups is done.
This document provides background on ramification theory in infinite Galois extensions. It defines projective limits of groups and profinite groups, which are needed to define the Galois group of an infinite extension. The integral closure B of the domain A in an infinite Galois extension L|K is shown to be a 1-dimensional integrally closed domain, though not necessarily a Dedekind domain like in the finite case. Decomposition and inertia groups are defined for prime ideals of B over primes of A. The Galois group is shown to act transitively on primes above a given prime of A.
1. The document discusses groups, subgroups, cosets, normal subgroups, quotient groups, and homomorphisms.
2. It defines cosets, proves Lagrange's theorem that the order of a subgroup divides the order of the group, and provides examples of finding cosets.
3. Normal subgroups are introduced, and it is shown that the set of cosets of a normal subgroup forms a group under a defined operation, known as the quotient group. Homomorphisms between groups are defined, and examples are given.
THE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSESgraphhoc
This document summarizes research on calculating the Grundy number of fat-extended P4-laden graphs. It begins by introducing the Grundy number and discussing that it is NP-complete to calculate for general graphs. It then presents previous work that has found polynomial time algorithms to calculate the Grundy number for certain graph classes. The main results are that the document proves that the Grundy number can be calculated in polynomial time, specifically O(n3) time, for fat-extended P4-laden graphs by traversing their modular decomposition tree. This implies the Grundy number can also be calculated efficiently for several related graph classes that are contained within fat-extended P4-laden graphs.
Group Theory and Its Application: Beamer Presentation (PPT)SIRAJAHMAD36
This document provides an overview of a seminar presentation on group theory and its applications. The presentation covers topics such as the definition of groups, order of groups and group elements, modular arithmetic, subgroups, Lagrange's theorem, and Sylow's theorems. It also discusses some examples of groups and applications of group theory in fields like algebraic topology, number theory, and physics. The presentation aims to introduce fundamental concepts in modern algebra through group theory.
1. The document introduces groups and related concepts in mathematics.
2. It defines a group as a set with a binary operation that satisfies associativity, identity, and inverse properties. Abelian groups are groups where the binary operation is commutative.
3. Examples of groups include the complex numbers under multiplication, rational numbers under addition, and translations of the plane under composition. Subgroups are subsets of a group that are also groups under the same binary operation.
A crystallographic group is a group acting on R^n that contains a translation subgroup Z^n as a finite index subgroup. Here we consider which Coxeter groups are crystallographic groups. We also expose the enumeration in dimension 2 and 3. Then we shortly give the principle under which the enumeration of N dimensional crystallographic groups is done.
This document provides background on ramification theory in infinite Galois extensions. It defines projective limits of groups and profinite groups, which are needed to define the Galois group of an infinite extension. The integral closure B of the domain A in an infinite Galois extension L|K is shown to be a 1-dimensional integrally closed domain, though not necessarily a Dedekind domain like in the finite case. Decomposition and inertia groups are defined for prime ideals of B over primes of A. The Galois group is shown to act transitively on primes above a given prime of A.
1. The document discusses groups, subgroups, cosets, normal subgroups, quotient groups, and homomorphisms.
2. It defines cosets, proves Lagrange's theorem that the order of a subgroup divides the order of the group, and provides examples of finding cosets.
3. Normal subgroups are introduced, and it is shown that the set of cosets of a normal subgroup forms a group under a defined operation, known as the quotient group. Homomorphisms between groups are defined, and examples are given.
THE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSESgraphhoc
This document summarizes research on calculating the Grundy number of fat-extended P4-laden graphs. It begins by introducing the Grundy number and discussing that it is NP-complete to calculate for general graphs. It then presents previous work that has found polynomial time algorithms to calculate the Grundy number for certain graph classes. The main results are that the document proves that the Grundy number can be calculated in polynomial time, specifically O(n3) time, for fat-extended P4-laden graphs by traversing their modular decomposition tree. This implies the Grundy number can also be calculated efficiently for several related graph classes that are contained within fat-extended P4-laden graphs.
Group Theory and Its Application: Beamer Presentation (PPT)SIRAJAHMAD36
This document provides an overview of a seminar presentation on group theory and its applications. The presentation covers topics such as the definition of groups, order of groups and group elements, modular arithmetic, subgroups, Lagrange's theorem, and Sylow's theorems. It also discusses some examples of groups and applications of group theory in fields like algebraic topology, number theory, and physics. The presentation aims to introduce fundamental concepts in modern algebra through group theory.
1. The document introduces groups and related concepts in mathematics.
2. It defines a group as a set with a binary operation that satisfies associativity, identity, and inverse properties. Abelian groups are groups where the binary operation is commutative.
3. Examples of groups include the complex numbers under multiplication, rational numbers under addition, and translations of the plane under composition. Subgroups are subsets of a group that are also groups under the same binary operation.
BCA_Semester-II-Discrete Mathematics_unit-i Group theoryRai University
This document provides an introduction to group theory, including definitions of key concepts such as binary operations, groups, abelian groups, subgroups, cyclic groups, and permutation groups. It defines what constitutes a group and subgroup. Theorems covered include Lagrange's theorem about the order of subgroups dividing the group order, and that every subgroup of a cyclic group is cyclic. Examples are provided of groups defined by binary operations and permutation groups. Exercises at the end involve applying the concepts to specific groups and proving properties of groups.
The document discusses group rings and zero divisors in group rings. Some key points:
- A group ring K[G] is a vector space over a field K with basis G, where elements are finite formal sums of terms with coefficients in K. Multiplication is defined distributively using the group multiplication in G.
- If G contains an element of finite order, then K[G] will contain zero divisors. However, if G has no elements of finite order, it is not clear if K[G] contains zero divisors.
- The document proves a theorem: K[G] is prime (has no zero divisors) if and only if G has no non-identity finite normal subgroups.
1. The document discusses the probability that an element of a metacyclic 2-group of positive type fixes a set. It defines metacyclic groups and the concept of a group acting on a set.
2. Previous work on the commutativity degree and the probability that a group element fixes a set is summarized. It was shown that this probability equals the number of conjugacy classes divided by the total number of sets.
3. The main results compute the probability that an element of a metacyclic 2-group of positive type fixes a set, by considering the action of the group on the set of commuting element pairs through conjugation.
sarminIJMA1-4-2015 forth paper after been publishingMustafa El-sanfaz
This document discusses the probability that a group element fixes a set and its application to generalized conjugacy class graphs. It begins with background on commutativity degree and graph theory concepts. It then reviews previous work calculating the probability for various groups and defining generalized conjugacy class graphs. The main results calculate the probability for semi-dihedral and quasi-dihedral groups as 1/2 and 1/3 respectively, and determine that the corresponding generalized conjugacy class graphs are K2 and Ke (empty graph).
This document discusses the probability that an element of a metacyclic 2-group of positive type fixes a set. It provides background on metacyclic groups and previous work calculating fixing probabilities for other groups. The main results of the paper calculate the fixing probability for positive type metacyclic 2-groups and apply the results to generalized conjugacy class graphs.
1. The document discusses the relationship between multicommodity flow problems and polyhedra related to Seymour's conjecture on binary clutters.
2. Seymour's conjecture states that a binary clutter is weakly bipartite if and only if it does not contain a forbidden minor like K5.
3. Weak bipartiteness of a signed graph is related to the cut condition being sufficient for the existence of multicommodity flows. If the signed graph is weakly bipartite, the cut condition is sufficient.
This document summarizes the concept of bidimensionality and how it can be used to design subexponential algorithms for graph problems on planar and other graph classes. It discusses how bidimensionality can be defined for parameters that are closed under minors or contractions by relating their behavior on grid graphs. It presents examples like vertex cover and dominating set that are bidimensional. It also discusses how bidimensionality can be extended to bounded genus graphs and H-minor free graphs using grid-minor/contraction theorems.
Polyadic systems and their representations are reviewed and a classification of general polyadic systems is presented. A new multiplace generalization of associativity preserving homomorphisms, a 'heteromorphism' which connects polyadic systems having unequal arities, is introduced via an explicit formula, together with related definitions for multiplace representations and multiactions. Concrete examples of matrix representations for some ternary groups are then reviewed.
MSC classes: 16T05, 16T25, 17A42, 20N15, 20F29, 20G05, 20G42, 57T05
This document discusses the probability that an element of a metacyclic 2-group fixes a set. It begins by providing background information on metacyclic groups and related concepts such as commutativity degree. It then summarizes previous works that have studied the probability of a group element fixing a set. The main results presented calculate the probability for various metacyclic 2-groups of negative type with nilpotency class of at least two. In particular, it determines the probability for metacyclic 2-groups of negative type with nilpotency class of at least three. It also calculates the probability for other specific metacyclic 2-group structures.
This document summarizes research on algebraic elements in group algebras. It begins by defining a group algebra k[G] over a commutative ring k. An element of k[G] is algebraic if it satisfies a non-constant polynomial. The document discusses tools for studying algebraic elements like partial augmentations corresponding to conjugacy classes. It also summarizes results on idempotents, including Kaplansky's theorem that the trace of an idempotent is real and rational. The author's past work on dimension subgroups is also briefly outlined.
On The Properties of Finite Nonabelian Groups with Perfect Square Roots Using...inventionjournals
In this paper we determine some internal properties of non abelian groups where the centre Z(G) takes its maximum size. With this restriction we discover that the group G is necessarily a group with perfect square root as shown in our results. We also show that the property of Z(G) is inherited by direct product of groups. Furthermore groups whose centre is as large as possible were constructed.
The document discusses weighted secure domination in graphs. It begins by defining domination number and weighted domination number. It proposes a greedy algorithm that provides a 1 + log(n) approximation for weighted domination number. The algorithm works by iteratively selecting the unselected vertex with the minimum ratio of weight to number of uncovered neighbors. This achieves an approximation ratio of H(n), which is at most 1 + log(n). The algorithm runs in polynomial time.
Some Fixed Point Theorems of Expansion Mapping In G-Metric Spacesinventionjournals
Over the past two decades the development of fixed point theory in metric spaces has attracted
considerable attention due to numerous applications in areas such as variation and linear inequalities,
optimization and approximation theory. Therefore, different Authors proved many fixed points results for self
mapping defined on complete G-Metric space. The objectives of this study are to prove fixed point results for
mapping satisfying expansion conditions.
Some fixed point theorems of expansion mapping in g-metric spacesinventionjournals
Over the past two decades the development of fixed point theory in metric spaces has attracted
considerable attention due to numerous applications in areas such as variation and linear inequalities,
optimization and approximation theory. Therefore, different Authors proved many fixed points results for self
mapping defined on complete G-Metric space. The objectives of this study are to prove fixed point results for
mapping satisfying expansion conditions.
The document provides an overview of modular arithmetic and its applications to finding square roots in modular arithmetic. It defines congruences and properties of modular arithmetic. It discusses cyclic groups and their relationship to integers and modular addition/multiplication. It introduces concepts like the order of an element, Lagrange's theorem, and Sylow theorems. It also defines quadratic residues, Legendre symbols, and provides an example of finding a square root in a finite field.
The degree equitable connected cototal dominating graph 퐷푐 푒 (퐺) of a graph 퐺 = (푉, 퐸) is a graph with 푉 퐷푐 푒 퐺 = 푉(퐺) ∪ 퐹, where F is the set of all minimal degree equitable connected cototal dominating sets of G and with two vertices 푢, 푣 ∈ 푉(퐷푐 푒 (퐺)) are adjacent if 푢 = 푣 푎푛푑 푣 = 퐷푐 푒 is a minimal degree equitable connected dominating set of G containing u. In this paper we introduce this new graph valued function and obtained some results
The document discusses the concepts of rigidity and tensegrity structures. It defines rigidity as being determined by the materials, external forces, topology, and geometry of a structure. Tensegrity structures use a combination of tension and compression elements to achieve rigidity. The document outlines methods for analyzing rigidity, including using equilibrium stresses, stress matrices, and Henneberg transformations to build globally rigid structures.
The document provides instructions for requesting writing assistance from HelpWriting.net. It outlines a 5-step process: 1) Create an account with a password and email. 2) Complete an order form with instructions, sources, and deadline. 3) Review bids from writers and choose one. 4) Receive the paper and authorize payment if satisfied. 5) Request revisions until fully satisfied, with a refund option for plagiarized work.
Learn How To Tell The TIME Properly In English 7ESLLisa Muthukumar
The document discusses Toyota's recall issues from 2009-2010. Toyota recalled millions of vehicles
due to unintended acceleration problems. The recalls cost Toyota billions of dollars and damaged its
reputation for quality and safety. Federal regulators heavily fined Toyota for its handling of the
recalls.
More Related Content
Similar to A Complete Solution Of Markov S Problem On Connected Group Topologies
BCA_Semester-II-Discrete Mathematics_unit-i Group theoryRai University
This document provides an introduction to group theory, including definitions of key concepts such as binary operations, groups, abelian groups, subgroups, cyclic groups, and permutation groups. It defines what constitutes a group and subgroup. Theorems covered include Lagrange's theorem about the order of subgroups dividing the group order, and that every subgroup of a cyclic group is cyclic. Examples are provided of groups defined by binary operations and permutation groups. Exercises at the end involve applying the concepts to specific groups and proving properties of groups.
The document discusses group rings and zero divisors in group rings. Some key points:
- A group ring K[G] is a vector space over a field K with basis G, where elements are finite formal sums of terms with coefficients in K. Multiplication is defined distributively using the group multiplication in G.
- If G contains an element of finite order, then K[G] will contain zero divisors. However, if G has no elements of finite order, it is not clear if K[G] contains zero divisors.
- The document proves a theorem: K[G] is prime (has no zero divisors) if and only if G has no non-identity finite normal subgroups.
1. The document discusses the probability that an element of a metacyclic 2-group of positive type fixes a set. It defines metacyclic groups and the concept of a group acting on a set.
2. Previous work on the commutativity degree and the probability that a group element fixes a set is summarized. It was shown that this probability equals the number of conjugacy classes divided by the total number of sets.
3. The main results compute the probability that an element of a metacyclic 2-group of positive type fixes a set, by considering the action of the group on the set of commuting element pairs through conjugation.
sarminIJMA1-4-2015 forth paper after been publishingMustafa El-sanfaz
This document discusses the probability that a group element fixes a set and its application to generalized conjugacy class graphs. It begins with background on commutativity degree and graph theory concepts. It then reviews previous work calculating the probability for various groups and defining generalized conjugacy class graphs. The main results calculate the probability for semi-dihedral and quasi-dihedral groups as 1/2 and 1/3 respectively, and determine that the corresponding generalized conjugacy class graphs are K2 and Ke (empty graph).
This document discusses the probability that an element of a metacyclic 2-group of positive type fixes a set. It provides background on metacyclic groups and previous work calculating fixing probabilities for other groups. The main results of the paper calculate the fixing probability for positive type metacyclic 2-groups and apply the results to generalized conjugacy class graphs.
1. The document discusses the relationship between multicommodity flow problems and polyhedra related to Seymour's conjecture on binary clutters.
2. Seymour's conjecture states that a binary clutter is weakly bipartite if and only if it does not contain a forbidden minor like K5.
3. Weak bipartiteness of a signed graph is related to the cut condition being sufficient for the existence of multicommodity flows. If the signed graph is weakly bipartite, the cut condition is sufficient.
This document summarizes the concept of bidimensionality and how it can be used to design subexponential algorithms for graph problems on planar and other graph classes. It discusses how bidimensionality can be defined for parameters that are closed under minors or contractions by relating their behavior on grid graphs. It presents examples like vertex cover and dominating set that are bidimensional. It also discusses how bidimensionality can be extended to bounded genus graphs and H-minor free graphs using grid-minor/contraction theorems.
Polyadic systems and their representations are reviewed and a classification of general polyadic systems is presented. A new multiplace generalization of associativity preserving homomorphisms, a 'heteromorphism' which connects polyadic systems having unequal arities, is introduced via an explicit formula, together with related definitions for multiplace representations and multiactions. Concrete examples of matrix representations for some ternary groups are then reviewed.
MSC classes: 16T05, 16T25, 17A42, 20N15, 20F29, 20G05, 20G42, 57T05
This document discusses the probability that an element of a metacyclic 2-group fixes a set. It begins by providing background information on metacyclic groups and related concepts such as commutativity degree. It then summarizes previous works that have studied the probability of a group element fixing a set. The main results presented calculate the probability for various metacyclic 2-groups of negative type with nilpotency class of at least two. In particular, it determines the probability for metacyclic 2-groups of negative type with nilpotency class of at least three. It also calculates the probability for other specific metacyclic 2-group structures.
This document summarizes research on algebraic elements in group algebras. It begins by defining a group algebra k[G] over a commutative ring k. An element of k[G] is algebraic if it satisfies a non-constant polynomial. The document discusses tools for studying algebraic elements like partial augmentations corresponding to conjugacy classes. It also summarizes results on idempotents, including Kaplansky's theorem that the trace of an idempotent is real and rational. The author's past work on dimension subgroups is also briefly outlined.
On The Properties of Finite Nonabelian Groups with Perfect Square Roots Using...inventionjournals
In this paper we determine some internal properties of non abelian groups where the centre Z(G) takes its maximum size. With this restriction we discover that the group G is necessarily a group with perfect square root as shown in our results. We also show that the property of Z(G) is inherited by direct product of groups. Furthermore groups whose centre is as large as possible were constructed.
The document discusses weighted secure domination in graphs. It begins by defining domination number and weighted domination number. It proposes a greedy algorithm that provides a 1 + log(n) approximation for weighted domination number. The algorithm works by iteratively selecting the unselected vertex with the minimum ratio of weight to number of uncovered neighbors. This achieves an approximation ratio of H(n), which is at most 1 + log(n). The algorithm runs in polynomial time.
Some Fixed Point Theorems of Expansion Mapping In G-Metric Spacesinventionjournals
Over the past two decades the development of fixed point theory in metric spaces has attracted
considerable attention due to numerous applications in areas such as variation and linear inequalities,
optimization and approximation theory. Therefore, different Authors proved many fixed points results for self
mapping defined on complete G-Metric space. The objectives of this study are to prove fixed point results for
mapping satisfying expansion conditions.
Some fixed point theorems of expansion mapping in g-metric spacesinventionjournals
Over the past two decades the development of fixed point theory in metric spaces has attracted
considerable attention due to numerous applications in areas such as variation and linear inequalities,
optimization and approximation theory. Therefore, different Authors proved many fixed points results for self
mapping defined on complete G-Metric space. The objectives of this study are to prove fixed point results for
mapping satisfying expansion conditions.
The document provides an overview of modular arithmetic and its applications to finding square roots in modular arithmetic. It defines congruences and properties of modular arithmetic. It discusses cyclic groups and their relationship to integers and modular addition/multiplication. It introduces concepts like the order of an element, Lagrange's theorem, and Sylow theorems. It also defines quadratic residues, Legendre symbols, and provides an example of finding a square root in a finite field.
The degree equitable connected cototal dominating graph 퐷푐 푒 (퐺) of a graph 퐺 = (푉, 퐸) is a graph with 푉 퐷푐 푒 퐺 = 푉(퐺) ∪ 퐹, where F is the set of all minimal degree equitable connected cototal dominating sets of G and with two vertices 푢, 푣 ∈ 푉(퐷푐 푒 (퐺)) are adjacent if 푢 = 푣 푎푛푑 푣 = 퐷푐 푒 is a minimal degree equitable connected dominating set of G containing u. In this paper we introduce this new graph valued function and obtained some results
The document discusses the concepts of rigidity and tensegrity structures. It defines rigidity as being determined by the materials, external forces, topology, and geometry of a structure. Tensegrity structures use a combination of tension and compression elements to achieve rigidity. The document outlines methods for analyzing rigidity, including using equilibrium stresses, stress matrices, and Henneberg transformations to build globally rigid structures.
Similar to A Complete Solution Of Markov S Problem On Connected Group Topologies (20)
The document provides instructions for requesting writing assistance from HelpWriting.net. It outlines a 5-step process: 1) Create an account with a password and email. 2) Complete an order form with instructions, sources, and deadline. 3) Review bids from writers and choose one. 4) Receive the paper and authorize payment if satisfied. 5) Request revisions until fully satisfied, with a refund option for plagiarized work.
Learn How To Tell The TIME Properly In English 7ESLLisa Muthukumar
The document discusses Toyota's recall issues from 2009-2010. Toyota recalled millions of vehicles
due to unintended acceleration problems. The recalls cost Toyota billions of dollars and damaged its
reputation for quality and safety. Federal regulators heavily fined Toyota for its handling of the
recalls.
Where To Buy College Essay Of The Highest QualityLisa Muthukumar
This document provides instructions for purchasing a high-quality college essay from HelpWriting.net. It outlines a 5-step process: 1) Create an account with a password and email. 2) Complete a 10-minute order form providing instructions, sources, and deadline. 3) Choose a bid from writers based on qualifications. 4) Review the paper and authorize payment if pleased. 5) Request revisions to ensure satisfaction, with a full refund option for plagiarism. The purpose is to guide customers through purchasing original, customized essays from qualified writers on the site.
What Is A Reaction Essay. Reaction Essay. 2019-01-24Lisa Muthukumar
The document provides instructions for using the HelpWriting.net service to have papers written. It outlines a 5-step process: 1) Create an account with a password and email. 2) Complete an order form with instructions, sources, and deadline. 3) Review bids from writers and choose one. 4) Review the completed paper and authorize payment. 5) Request revisions until satisfied with the paper. It emphasizes that original, high-quality content is guaranteed or a full refund will be provided.
Writing A Strong Essay. Paper Rater Writing A Strong Essay. 2022-11-05.pdf Wr...Lisa Muthukumar
The Real Irish Republican Army (RIRA) broke away from the IRA in 1997 because the IRA called a ceasefire, while the RIRA wanted to continue fighting. The RIRA aims to remove British control of Northern Ireland and unify Ireland. It operates out of Northern Ireland, the Irish Republic, Britain, and parts of Europe, with several hundred members. The RIRA remains dedicated to its goals through militant and sometimes violent means.
List Of Transitional Words For Writing Essays. Online assignment writing serv...Lisa Muthukumar
The document provides a 5-step process for requesting and receiving writing assistance from HelpWriting.net. It outlines the registration, order placement, bidding, review, and revision steps. Customers can request revisions until satisfied with the original, plagiarism-free content provided by HelpWriting writers.
Galileo Galilei was an influential Italian scientist during the 1500s-1600s who made important contributions to the fields of motion, astronomy, and material strength classification. He accepted Copernicus' heliocentric model of the solar system and helped convert natural philosophy from a verbal to a more mathematical and experiment-based approach. The document provides biographical details about Galileo's background and career accomplishments as a philosopher, astronomer, and mathematician who helped advance scientific thought and methods.
How To Start Writing Essay About Yourself. How To StaLisa Muthukumar
PageNors Investments was founded in 2006 in Madison, Wisconsin by Sally Page and Jackson
Norstern to provide investment services to individuals in the Madison area. The firm aims to serve
clients in Madison and the surrounding communities of Dane County. Their website provides an
overview of the company's origins and services focused on the local market in Madison.
Writing A Summary In 3 Steps Summary Writing, TLisa Muthukumar
Penguins have thick layers of fat and feathers to insulate them from the extreme cold. Seals have blubber layers and dense fur to retain heat. Both penguins and seals have streamlined bodies for efficient swimming in icy waters. Antarctic krill and fish survive by producing antifreeze proteins in their blood that prevent freezing.
012 College Application Essay Examples About YoLisa Muthukumar
This document provides instructions for requesting writing assistance from HelpWriting.net. It outlines a 5-step process: 1) Create an account with a password and email. 2) Complete a 10-minute order form providing instructions, sources, deadline. 3) Review bids from writers and choose one based on qualifications. 4) Receive the paper and ensure it meets expectations before authorizing payment. 5) Request revisions to ensure satisfaction, and HelpWriting.net offers refunds for plagiarized work. The document explains how to obtain high-quality, original content through their writing assistance service.
Thanksgiving Writing Paper Free Printable - Printable FLisa Muthukumar
The document discusses a biology lab experiment on the effect of osmosis on potato cells placed in sucrose solutions of varying concentrations. Potato slices were placed in 0.0M, 0.1M, 0.2M, 0.3M, 0.4M, and 0.5M sucrose solutions for one hour. Their initial and final masses were measured and compared. In lower concentrations, the potato mass increased due to water entering the cells. In higher concentrations, the potato mass decreased as water left the cells. The results support the hypothesis that different sucrose concentrations impact potato cell mass through osmosis.
PPT - English Essay Writing Help Online PowerPoint Presentation, FreLisa Muthukumar
This document outlines a 5-step proposal for Sterling Marking Products to enter the UK market. It recommends establishing a wholly owned subsidiary to have full control over operations. Some key points:
1. Establish a wholly owned UK subsidiary to have full control over operations and avoid issues from current partnerships where control is shared.
2. Hire a general manager to oversee the subsidiary and hire local staff.
3. Use the subsidiary to target both large retailers and smaller shops to gain market share.
4. Consider Canada for future expansion but be cautious of strain on resources from expanding too quickly internationally.
5. Monitor subsidiary closely and reevaluate strategy after 3 years of operations.
Free Lined Writing Paper Printable - Printable TemplLisa Muthukumar
The document discusses the steps involved in requesting and receiving writing assistance from HelpWriting.net, including creating an account, submitting a request form with instructions and deadlines, reviewing bids from writers, authorizing payment upon approval of the completed paper, and having the option to request revisions. The process utilizes a bidding system where the requester can choose a writer based on qualifications and feedback to work on their assignment. HelpWriting.net promises original, high-quality content and refunds for plagiarized work.
Descriptive Essay College Writing Tutor. Online assignment writing service.Lisa Muthukumar
The document discusses the key steps involved in obtaining college writing assistance from HelpWriting.net:
1. Create an account with a password and email.
2. Complete a 10-minute order form providing instructions, sources, deadline and sample work.
3. Choose a writer based on their bid, qualifications, history and feedback to start the assignment.
4. Review the completed paper and authorize payment or request free revisions until satisfied.
9 Best Images Of Journal Writing Pap. Online assignment writing service.Lisa Muthukumar
The document provides instructions for creating an account and submitting assignment requests on the HelpWriting.net site. It explains the 5-step process: 1) Create an account with email and password. 2) Complete a form with assignment details. 3) Writers will bid on the request and the customer can choose a writer. 4) The customer receives the paper and can request revisions if needed. 5) HelpWriting guarantees original, high-quality work and refunds are offered for plagiarized content.
Divorce Agreement Template - Fill Out, Sign Online AndLisa Muthukumar
The document discusses the steps to request writing assistance from HelpWriting.net, including creating an account, completing an order form, and reviewing writer bids before selecting a writer and placing a deposit to start the assignment. The process also allows customers to request revisions and receives a refund if plagiarism is found. HelpWriting.net aims to fully meet customer needs for original, high-quality content.
Diversity On Campus Essay - Mfawriting515.Web.Fc2.ComLisa Muthukumar
This document provides instructions for creating an account on the website HelpWriting.net in order to request assistance with writing assignments. The process involves 5 steps: 1) Creating an account with a password and email, 2) Completing an order form with instructions and deadline, 3) Choosing a writer based on their bid, qualifications, and reviews, 4) Reviewing the completed paper and authorizing payment, 5) Requesting revisions until satisfied with the work. The website promises original, high-quality content and refunds for plagiarized work.
The document provides instructions for requesting an assignment writing service from HelpWriting.net, including creating an account, completing an order form with instructions and deadline, and reviewing writer bids before authorizing payment upon satisfactory completion of revisions. The process aims to ensure high-quality original content through a bidding system and free revisions until the customer is satisfied with the final work.
College Admission Essays That Worked - The OscillatiLisa Muthukumar
This document discusses the benefits of aerial photography for real estate properties. It states that an aerial view provides a unique perspective that gives buyers a better understanding of the land. This includes seeing the interior, exterior, and surrounding areas from various angles. Hiring an experienced professional for aerial photography can increase the property's resale value by effectively showcasing these features. An amateur photographer may degrade the value by failing to capture the right shots from above. Overall, aerial views are an important part of real estate photography and videography.
5 Steps To Write A Good Essay REssaysondemandLisa Muthukumar
Here is a 150-word introduction for the manuscript:
The tumor suppressor protein p53 plays a crucial role in regulating the cell cycle and preventing uncontrolled cell proliferation. In cells where p53 is absent or mutated, this loss of growth regulation allows tumors to form and progress. Traditionally, p53 was thought to suppress tumors through cell-autonomous mechanisms, inducing cell cycle arrest or apoptosis in cells experiencing DNA damage or other stresses. However, recent evidence suggests p53 can also exert non-cell autonomous tumor suppressive effects. This manuscript aims to review the emerging evidence that p53 induces cellular senescence in neighboring cells, which activates a senescence-associated secretory phenotype that influences the tumor microenvironment and limits tumor growth in
This document provides an overview of wound healing, its functions, stages, mechanisms, factors affecting it, and complications.
A wound is a break in the integrity of the skin or tissues, which may be associated with disruption of the structure and function.
Healing is the body’s response to injury in an attempt to restore normal structure and functions.
Healing can occur in two ways: Regeneration and Repair
There are 4 phases of wound healing: hemostasis, inflammation, proliferation, and remodeling. This document also describes the mechanism of wound healing. Factors that affect healing include infection, uncontrolled diabetes, poor nutrition, age, anemia, the presence of foreign bodies, etc.
Complications of wound healing like infection, hyperpigmentation of scar, contractures, and keloid formation.
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) CurriculumMJDuyan
(𝐓𝐋𝐄 𝟏𝟎𝟎) (𝐋𝐞𝐬𝐬𝐨𝐧 𝟏)-𝐏𝐫𝐞𝐥𝐢𝐦𝐬
𝐃𝐢𝐬𝐜𝐮𝐬𝐬 𝐭𝐡𝐞 𝐄𝐏𝐏 𝐂𝐮𝐫𝐫𝐢𝐜𝐮𝐥𝐮𝐦 𝐢𝐧 𝐭𝐡𝐞 𝐏𝐡𝐢𝐥𝐢𝐩𝐩𝐢𝐧𝐞𝐬:
- Understand the goals and objectives of the Edukasyong Pantahanan at Pangkabuhayan (EPP) curriculum, recognizing its importance in fostering practical life skills and values among students. Students will also be able to identify the key components and subjects covered, such as agriculture, home economics, industrial arts, and information and communication technology.
𝐄𝐱𝐩𝐥𝐚𝐢𝐧 𝐭𝐡𝐞 𝐍𝐚𝐭𝐮𝐫𝐞 𝐚𝐧𝐝 𝐒𝐜𝐨𝐩𝐞 𝐨𝐟 𝐚𝐧 𝐄𝐧𝐭𝐫𝐞𝐩𝐫𝐞𝐧𝐞𝐮𝐫:
-Define entrepreneurship, distinguishing it from general business activities by emphasizing its focus on innovation, risk-taking, and value creation. Students will describe the characteristics and traits of successful entrepreneurs, including their roles and responsibilities, and discuss the broader economic and social impacts of entrepreneurial activities on both local and global scales.
Level 3 NCEA - NZ: A Nation In the Making 1872 - 1900 SML.pptHenry Hollis
The History of NZ 1870-1900.
Making of a Nation.
From the NZ Wars to Liberals,
Richard Seddon, George Grey,
Social Laboratory, New Zealand,
Confiscations, Kotahitanga, Kingitanga, Parliament, Suffrage, Repudiation, Economic Change, Agriculture, Gold Mining, Timber, Flax, Sheep, Dairying,
How to Make a Field Mandatory in Odoo 17Celine George
In Odoo, making a field required can be done through both Python code and XML views. When you set the required attribute to True in Python code, it makes the field required across all views where it's used. Conversely, when you set the required attribute in XML views, it makes the field required only in the context of that particular view.
A Visual Guide to 1 Samuel | A Tale of Two HeartsSteve Thomason
These slides walk through the story of 1 Samuel. Samuel is the last judge of Israel. The people reject God and want a king. Saul is anointed as the first king, but he is not a good king. David, the shepherd boy is anointed and Saul is envious of him. David shows honor while Saul continues to self destruct.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UPRAHUL
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
Leveraging Generative AI to Drive Nonprofit InnovationTechSoup
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
Gender and Mental Health - Counselling and Family Therapy Applications and In...PsychoTech Services
A proprietary approach developed by bringing together the best of learning theories from Psychology, design principles from the world of visualization, and pedagogical methods from over a decade of training experience, that enables you to: Learn better, faster!
Gender and Mental Health - Counselling and Family Therapy Applications and In...
A Complete Solution Of Markov S Problem On Connected Group Topologies
1. A COMPLETE SOLUTION OF MARKOV’S PROBLEM ON
CONNECTED GROUP TOPOLOGIES
DIKRAN DIKRANJAN AND DMITRI SHAKHMATOV
Abstract. Every proper closed subgroup of a connected Hausdorff group must have index
at least c, the cardinality of the continuum. 70 years ago Markov conjectured that a group G
can be equipped with a connected Hausdorff group topology provided that every subgroup
of G which is closed in all Hausdorff group topologies on G has index at least c. Counter-
examples in the non-abelian case were provided 25 years ago by Pestov and Remus, yet
the problem whether Markov’s Conjecture holds for abelian groups G remained open. We
resolve this problem in the positive.
As usual, Z denotes the group of integers, Z(n) denotes the cyclic group of order n, N
denotes the set of natural numbers, P denotes the set of all prime numbers and c denotes
the cardinality of the continuum.
Let G be a group. For a cardinal σ, we use G(σ)
to denote the direct sum of σ many copies
of the group G. For m ∈ N, we let
mG = {mg : g ∈ G} and G[m] = {g ∈ G : mg = e},
where e is the identity element of G. When G is abelian, we use 0 instead of e. A group G
is bounded (or has finite exponent) if mG = {e} for some integer m ≥ 1; otherwise, G is said
to be unbounded. We denote by
(1) t(G) =
[
m∈N
G[m]
the torsion part of G. The group G is torsion if t(G) = G. When G is abelian, the torsion
part t(G) of G is a subgroup of G called the torsion subgroup of G.
As usual, we write G ∼
= H when groups G and H are isomorphic.
All topological groups and all group topologies are assumed to be Hausdorff.
1. Markov’s problem for abelian groups
Markov [21, 22] says that subset X of a group G is unconditionally closed in G if X is
closed in every Hausdorff group topology on G.
Every proper closed subgroup of a connected group must have index at least c.1
Therefore,
if a group admits a connected group topology, then all its proper unconditionally closed
2010 Mathematics Subject Classification. Primary: 22A05; Secondary: 20K25, 20K45, 54A25, 54D05,
54H11.
Key words and phrases. (locally) connected group, (locally) pathwise connected group, unconditionally
closed subgroup, Markov’s problem, Hartman-Mycielski construction, Ulm-Kaplanski invariants.
Corresponding author. Dmitri Shakhmatov.
1Indeed, if H is a proper closed subgroup of a connected group G, the the quotient space G/H is non-
trivial, connected and completely regular. Since completely regular spaces of size less than c are disconnected,
this shows that |G/H| ≥ c.
1
2. 2 D. DIKRANJAN AND D. SHAKHMATOV
subgroups necessarily have index at least c; see [23]. Markov [23, Problem 5, p. 271] asked
if the converse is also true.
Problem 1.1. If all proper unconditionally closed subgroups of a group G have index at
least c, does then G admit a connected group topology?
Definition 1.2. For brevity, a group satisfying Markov’s condition, namely having all proper
unconditionally closed subgroups of index at least c, shall be called an M-group (the abbre-
viation for Markov group).
Adopting this terminology, Markov’s Problem 1.1 reads: Does every M-group admit a
connected group topology?
A negative answer to Problem 1.1 was provided first by Pestov [24], then a much simpler
counter-example was found by Remus [25]. Nevertheless, the question remained open in
the abelian case, as explicitly stated in [25] and later in [2, Question 3.5.3] as well as in [1,
Question 3G.1 (Question 517)].
Question 1.3. Let G be an abelian group all proper unconditionally closed subgroups of
which have index at least c. Does G have a connected group topology?
Equivalent re-formulation of this question using the notion of an M-group reads: Does
every abelian M-group admit a connected group topology?
Since the notion of an unconditionally closed subset of a group G involves checking closed-
ness of this set in every Hausdorff group topology on G, in practice it is hard to decide if a
given subgroup of G is unconditionally closed in G or not. In other words, there is no clear
procedure that would allow one to check whether a given group is an M-group. Our next
proposition provides an easy algorithm for verifying whether an abelian group is an M-group.
Its proof, albeit very short, is based on the fundamental fact that all unconditionally closed
subsets of abelian groups are algebraic [10, Corollary 5.7].
Proposition 1.4. An abelian group G is an M-group if and only if, for every m ∈ N, either
mG = {0} or |mG| ≥ c. In particular, an abelian group G of infinite exponent is an M-group
precisely when |mG| ≥ c for all integers m ≥ 1.
Proof. According to [10, Corollary 5.7] and [11, Lemma 3.3], a proper unconditionally closed
subgroup H of G has the form H = G[m] for some m > 0. Since G/G[m] ∼
= mG, the index
of H coincides with |G/H| = |G/G[m]| = |mG|.
According to the Prüfer theorem [15, Theorem 17.2], a non-trivial abelian group G of
finite exponent is a direct sum of cyclic subgroups
(2) G =
M
p∈π(G)
mp
M
i=1
Z(pi
)(αp,i)
,
where π(G) is a non-empty finite set of primes and the cardinals αp,i are known as Ulm-
Kaplanski invariants of G. Note that while some of them may be equal to zero, the cardinals
αp,mp must be positive; they are called leading Ulm-Kaplanski invariants of G.
Based on Proposition 1.4, one can re-formulate the Markov property for abelian groups of
finite exponent in terms of their Ulm-Kaplanski invariants:
Proposition 1.5. A non-trivial abelian group G of finite exponent is an M-group if and
only if all leading Ulm-Kaplanski invariants of G are at least c.
3. A COMPLETE SOLUTION OF MARKOV’S PROBLEM 3
Proof. Write the group G as in (2) and let k =
Q
q∈π(G) qmq
be the exponent of G. In order
to compute the leading Ulm-Kaplanski invariant αp,mp for p ∈ π(G), let
kp =
k
p
= pmp−1
·
Y
q∈π(G){p}
qmq
.
Then kpG ∼
= Z(p)(αp,mp )
, so
(3) 1 |kpG| =
(
pαp,mp if αp,mp is finite
αp,mp if αp,mp is infinite.
If G is an M-group, then |kpG| ≥ c by (3) and Proposition 1.4, so αp,mp ≥ c as well.
Now suppose that all leading Ulm-Kaplanski invariants of G are at least c. Fix m ∈ N
with |mG| 1. There exists at least one p ∈ π(G) such that pmp
does not divide m. Let
d be the greatest common divisor of m and k. Then mG = dG, hence from now on we can
assume without loss of generality that m = d divides k. As pmp
does not divide m, it follows
that m divides kp. Therefore, kpG is a subgroup of mG, and so |mG| ≥ |kpG| = αp,mp ≥ c
by (3). This shows that, for every m ∈ N, either mG = {0} or |mG| ≥ c. Therefore, G is an
M-group by Proposition 1.4.
Kirku [20] characterized the abelian groups of finite exponent admitting connected group
topology.
Theorem 1.6. [20, Theorem on p. 71] If all leading Ulm-Kaplanski invariants of a non-
trivial abelian group G of finite exponent are at least c, then G admits a pathwise connected,
locally pathwise connected group topology.
In view of Proposition 1.5, Kirku’s theorem can be considered as a partial positive answer
to Question 1.3.
Corollary 1.7. Each abelian M-group of finite exponent admits a pathwise connected, locally
pathwise connected group topology.
Proof. Obviously, the only group topology on the trivial group is both pathwise connected
and locally pathwise connected. For a non-trivial abelian group of finite exponent, the
conclusion follows from Proposition 1.5 and Theorem 1.6.
The main goal of this paper is to offer a positive solution to Markov’s problem in the case
complementary to Corollary 1.7, namely, for the class of abelian groups of infinite exponent.
In order to formulate our main result, we shall need to introduce an intermediate property
between pathwise connectedness and connectedness.
Definition 1.8. We shall say that a space X is densely pathwise connected (abbreviated to
dp-connected) provided that X has a dense pathwise connected subspace.
Clearly,
(4) pathwise connected → dp-connected → connected.
Obviously, a topological group G is dp-connected if and only if the arc component of the
identity of G is dense in G.
As usual, given a topological property P, we say that a space X is locally P provided
that for every point x ∈ X and each open neighbourhood U of x one can find an open
4. 4 D. DIKRANJAN AND D. SHAKHMATOV
neighbourhood V of x such that the closure of V in X is contained in U and has property
P. It follows from this definition and (4) that
locally pathwise connected → locally dp-connected → locally connected.
Theorem 1.9. Every abelian M-group G of infinite exponent admits a dp-connected, locally
dp-connected group topology.
The proof of this theorem is postponed until Section 6. It is worth pointing out that not
only the setting of Theorem 1.9 is complimentary to that of Corollary 1.7 but also the proof
of Theorem 1.9 itself makes no recourse to Corollary 1.7.
The equivalence of items (i) and (ii) in our next corollary offers a complete solution of
Question 1.3.
Corollary 1.10. For an abelian group G, the following conditions are equivalent:
(i) G is an M-group;
(ii) G admits a connected group topology;
(iii) G admits a dp-connected, locally dp-connected group topology.
A classical theorem of Eilenberg and Pontryagin says that every connected locally compact
group has a dense arc component [26, Theorem 39.4(d)], so it is dp-connected. In [16], one
can find examples of pseudocompact connected abelian groups without non-trivial convergent
sequences, which obviously implies that their arc components are trivial (and so such groups
are very far from being dp-connected and locally dp-connected). Under CH, one can find
even a countably compact group with the same property [28]. (A rich supply of such groups
can also be found in [9].) Our next corollary is interesting in light of these results.
Corollary 1.11. If an abelian group admits a connected group topology, then it can be
equipped with a group topology which is both dp-connected and locally dp-connected.
Our last corollary characterizes subgroups H of a given abelian group G which can be
realized as the connected component of some group topology on G.
Corollary 1.12. For a subgroup H of an abelian group G the following conditions are
equivalent:
(i) G admits a group topology T such that H coincides with the connected component of
(G, T );
(ii) H admits a connected group topology;
(iii) H is an M-group.
Proof. The implications (i) → (ii) and (ii) → (iii) are clear. To check the implication
(iii) → (i), assume that H is an M-group. Applying the implication (i) → (ii) of Corol-
lary 1.10, we can find a connected group topology Tc on H. Let T be the group topology on
G obtained by declaring (H, Tc) to be an open subgroup of (G, T ). Then H is a clopen con-
nected subgroup of (G, T ), which implies that H coincides with the connected component
of (G, T ).
The paper is organized as follows. In Section 2 we recall the necessary background on
w-divisible groups, including a criterion for dense embeddings into powers of T. In Section
3 we show that uncountable w-divisible groups can be characterized by a property involving
large direct sums of unbounded groups; see Theorem 3.6. In Section 4 we use this theorem
to show that every w-divisible group of size at least c contains a c-homogeneous w-divisible
5. A COMPLETE SOLUTION OF MARKOV’S PROBLEM 5
subgroup of the same size; see Lemma 4.5. (A group G is c-homogeneous if G ∼
= G(c)
.)
The importance of the notion of c-homogeneity becomes evident in Section 5, where we
recall the classical construction, due to Hartman and Mycielski [18], assigning to every
group a pathwise connected and locally pathwise connected topological group. We establish
some additional useful properties of this construction and use them to prove that every c-
homogeneous group admits a pathwise connected, locally pathwise connected group topology;
see Corollary 5.3. In Section 6, we combine Lemma 4.5, Corollary 5.3 and dense embeddings
of w-divisible groups into powers of T to obtain the proof of Theorem 1.9. Finally, in Section
7 we introduce a new cardinal invariant useful in obtaining a characterization of countable
groups that contain infinite direct sums of unbounded groups, covering the case left open in
Theorem 3.6.
2. Background on w-divisible groups
We recall here two fundamental notions from [4].
Definition 2.1. [4] An abelian group G is called w-divisible if |mG| = |G| for all integers
m ≥ 1.
Definition 2.2. [4] For an abelian group G, the cardinal
(5) wd(G) = min{|nG| : n ∈ N {0}}
is called the divisible weight of G.2
Obviously, wd(G) ≤ |G|, and G is w-divisible precisely when wd(G) = |G|. Furthermore,
we mention here the following easy fact for future reference:
Fact 2.3. [4, p. 255] If m is a positive integer such that wd(G) = |mG|, then mG is a
w-divisible subgroup of G.
Using the cardinal wd(G), the last part of Proposition 1.4 can be re-stated as follows:
Fact 2.4. An abelian group G of infinite exponent is an M-group if and only if wd(G) ≥ c.
Fact 2.5. [4, Claim 3.6] Let n be a positive integer, let G1, G2, . . . , Gn be abelian groups, and
let G =
Ln
i=1 Gi.
(i) wd(G) = max{wd(Gi) : i = 1, 2, . . . , n}.
(ii) G is w-divisible if and only if there exists index i = 1, 2, . . . , n such that |G| = |Gi|
and Gi is w-divisible.
The abundance of w-divisible groups is witnessed by the following
Fact 2.6. [16, Lemma 4.1] Every abelian group G admits a decomposition G = K ⊕ M,
where K is a bounded torsion group and M is a w-divisible group.
An alternative proof of this fact can be found in [5]; a particular case is contained already
in [4].
The next fact describes dense subgroups of Tκ
in terms of the invariant wd(G). (Recall
that, for every cardinal κ, log κ = min{σ : κ ≤ 2σ
}.)
2This is a “discrete case” of a more general definition given in [4] involving the weight of a topological
group, which explains the appearance of the word “weight” in the term.
6. 6 D. DIKRANJAN AND D. SHAKHMATOV
Fact 2.7. For every cardinal κ ≥ c, an abelian group G is isomorphic to a dense subgroup
of Tκ
if and only if log κ ≤ wd(G) ≤ |G| ≤ 2κ
.
Proof. For κ = c, this is [13, Corollary 3.3], and for κ c this follows from the equivalence
of items (i) and (ii) in [12, Theorem 2.6] and (5).
Corollary 2.8. Let τ be an infinite cardinal. For every abelian group G satisfying τ ≤
wd(G) ≤ |G| ≤ 22τ
, there exists a monomorphism π : G → T2τ
such that π(G) is dense in
T2τ
.
Proof. Let κ = 2τ
. Then κ ≥ c and log κ ≤ τ ≤ wd(G) ≤ |G| ≤ 22τ
= 2κ
, so the conclusion
follows from Fact 2.7.
3. Finding large direct sums in uncountable w-divisible groups
For every p ∈ P, we use rp(G) to denote the p-rank of an abelian group G [15, Section 16],
while r0(G) denotes the free rank of G [15, Section 14].
Definition 3.1. Call an abelian group G strongly unbounded if G contains a direct sum
L
i∈I Ai such that |I| = |G| and all groups Ai are unbounded.
Remark 3.2. (i) If H is a subgroup of an abelian group G such that |H| = |G| and H is
strongly unbounded, then G is strongly unbounded as well.
(ii) An abelian group G satisfying r0(G) = |G| is strongly unbounded.
Lemma 3.3. A strongly unbounded abelian group is w-divisible.
Proof. Let G be a strongly unbounded abelian group. Then G contains a direct sum
L
i∈I Ai
as in Definition 3.1.
Let m be a positive integer. Clearly, each mAi is non-trivial, and mA =
L
i∈I mAi, so
|mG| ≥ |mA| ≥ |I| = |G|. The converse inequality |mG| ≤ |G| is trivial. Therefore, G is
w-divisible by Definition 2.1.
In the rest of this section we shall prove the converse of Lemma 3.3 for uncountable groups.
Lemma 3.4. Let p be a prime number and τ be an infinite cardinal. For every abelian
p-group G of cardinality τ, the following conditions are equivalent:
(i) G contains a subgroup algebraically isomorphic to L
(τ)
p , where Lp =
L
n∈N Z(pn
);
(ii) G is strongly unbounded;
(iii) rp(pn
G) ≥ τ for every n ∈ N;
(iv) rp(Sn) ≥ τ for each n ∈ N, where Sn = pn
G[pn+1
].
Proof. Since Lp is unbounded and |G| = τ, the implication (i) → (ii) follows from Definition
3.1.
(ii) → (iii) Let n ∈ N be arbitrary. Since G is strongly unbounded, G contains a direct
sum
L
i∈I Ai such that |I| = |G| = τ and all groups Ai are unbounded. Thus, the subgroup
pn
G of G contains the direct sum
L
i∈I pn
Ai of non-trivial p-groups pn
Ai. Since rp(pn
Ai) ≥ 1
for every i ∈ I, it follows that rp(pn
G) ≥ rp(
L
i∈I pn
Ai) ≥ |I| = τ.
(iii) → (iv) Note that (pn
G)[p] = Sn, so rp(pn
G) = rp(Sn) for every n ∈ N.
(iv) → (i) Note that each Sn+1 is a subgroup of the group Sn, and therefore, the quotient
group Sn/Sn+1 is well-defined. We consider two cases.
7. A COMPLETE SOLUTION OF MARKOV’S PROBLEM 7
Case 1. There exists a sequence 0 m1 m2 . . . mk . . . of natural numbers such
that |Smk−1/Smk
| ≥ τ for every k ∈ N. In this case for every k ∈ N one can find a subgroup
Vk of Smk−1 of size τ with Vk ∩Smk
= {0}. Then the family {Vk : k ∈ N} is independent; that
is, the sum
P
k∈N Vk is direct. Since Vk is a subgroup of Smk−1, one can find a subgroup Nk
of G such that Nk
∼
= Z(pmk )(τ)
and Nk[p] = Vk. Now the family {Nk : k ∈ N} is independent;
see [9, Lemma 3.12]. The subgroup N =
L
k∈N Nk of G is isomorphic to
L
k∈N Z(pmk )(τ)
, so
N contains a copy of L
(τ)
p .
Case 2. There exists m0 ∈ N such that |Sm/Sm+1| τ for all m ≥ m0. Note that in
this case |Sm0 /Sm0+k| τ for every k ∈ N. Since τ is infinite and rp(Sm0 ) ≥ τ by (iv),
we can fix an independent family V = {Vk : k ∈ N} in Sm0 such that Vk
∼
= Z(p)(τ)
for all
k ∈ N. For every k ∈ N consider the subgroup Wk = Vk ∩ Sm0+k of Vk. Since the family V
is independent, so is the family W = {Wk : k ∈ N}.
Let k ∈ N. The quotient group Vk/Wk is naturally isomorphic to a subgroup of Sm0 /Sm0+k,
and thus |Vk/Wk| ≤ |Sm0 /Sm0+k| τ. This yields Wk
∼
= Vk
∼
= Z(p)(τ)
. Since Wk is a
subgroup of Sm0+k, there exists a subgroup Nk of G such that Nk
∼
= Z(pm0+k+1
)(τ)
and
Nk[p] = Wk.
Since the family W is independent, the family N = {Nk : k ∈ N} is independent too; see
again [9, Lemma 3.12]. Therefore, N generates a subgroup
L
k∈N Nk of G isomorphic to
L
k∈N Z(pm0+k+1
)(τ)
. It remains only to note that the latter group contains an isomorphic
copy of the group L
(τ)
p .
Lemma 3.5. An uncountable torsion w-divisible group H is strongly unbounded.
Proof. Recall that H =
L
p∈P Hp, where each Hp is a p-group [15, Theorem 8.4]. Let τ = |H|
and σp = rp(H) = rp(Hp) for all p ∈ P. Since H is uncountable, τ = supp∈P σp. We consider
two cases.
Case 1. There exists a finite set F ⊆ P such that supp∈PF σp τ. In this case, H = G1 ⊕
G2, where G1 =
L
p∈F Hp and G2 =
L
p∈PF Hp. Note that |G2| ≤ ω+supp∈PF σp τ = |H|,
as H is uncountable. Since H = G1 ⊕G2 is w-divisible, from Fact 2.5 (ii) we conclude that G1
is w-divisible and |G1| = |H|. This implies that the finite set F is non-empty. Applying Fact
2.5 (ii) once again, we can find p ∈ F such that Hp is w-divisible and |Hp| = |G1| = |H| = τ.
Let n ∈ N. Since Hp is a w-divisible p-group, |pn
Hp| = |Hp| = τ. Since τ is uncountable
and pn
Hp is a p-group, rp(pn
Hp) = |Hp|. Applying the implication (iii)→(ii) of Lemma 3.4,
we obtain that Hp is strongly unbounded. Since |Hp| = τ = |H|, the group H is strongly
unbounded by Remark 3.2 (i).
Case 2. supp∈PF σp = τ for all finite sets F ⊆ P. For each p ∈ P choose a p-independent
subset Sp of Hp[p] with |Sp| = σp. Let S =
S
p∈P Sp. One can easily see that the assumption
of Case 2 implies the following property:
(6) If Y ⊆ S and |Y | τ, then the set {p ∈ P : Sp Y 6= ∅} is infinite.
By transfinite induction, we shall construct a family {Xα : α τ} of pairwise disjoint
countable subsets of S such that the set Pα = {p ∈ P : Xα ∩ Sp 6= ∅} is infinite for each
α τ.
Basis of induction. By our assumption, infinitely many of sets Sp are non-empty, so we
can choose a countable set X0 ⊆ S such that P0 is infinite.
8. 8 D. DIKRANJAN AND D. SHAKHMATOV
Inductive step. Let α be an ordinal such that 0 α τ, and suppose that we have already
defined a family {Xβ : β α} of pairwise disjoint countable subsets of S such that the set
Pβ is infinite for each β α. Since α τ and τ is uncountable, the set Y =
S
{Xβ : β α}
satisfies |Y | ≤ ω + |α| τ. Using (6), we can select a countable subset Xα of S Y which
intersects infinitely many Sp’s.
The inductive construction been complete, for every α τ, let Aα be the subgroup of H
generated by Xα. Since Pα is infinite, Aα contains elements of arbitrary large order, so Aα is
unbounded. Since the family {Xα : α τ} is pairwise disjoint, the sum
P
ατ Aα =
L
ατ Aα
is direct. Since |H| = τ, this shows that H is strongly unbounded.
Theorem 3.6. An uncountable abelian group is strongly unbounded if and only if it is w-
divisible.
Proof. The “only if” part is proved in Lemma 3.3. To prove the “if” part, assume that G is
an uncountable w-divisible group. If r0(G) = |G|, then G is strongly unbounded by Remark
3.2 (ii). Assume now that r0(G) |G|. Then |G| = |H| and |G/H| = r0(G) · ω |G|, where
H = t(G) is the torsion subgroup of G; see (1).
Let n be a positive integer. Since nH = H ∩ nG, the quotient group nG/nH = nG/(H ∩
nG) is isomorphic to a subgroup of the quotient group G/H, so |nG/nH| ≤ |G/H| |G|.
Since G is w-divisible, |G| = |nG| by Definition 2.1. Now |nG/nH| |nG| implies |nH| =
|nG|, as |nG| = |nH| · |nG/nH|. Since |nG| = |G| = |H|, this yields |nH| = |H|. Since this
equation holds for all n ∈ N {0}, H is w-divisible by Definition 2.1.
Since |H| = |G| and G is uncountable by our assumption, H is an uncountable torsion
group. Applying Lemma 3.5, we conclude that H is strongly unbounded. Since |H| = |G|,
G is also strongly unbounded by Remark 3.2 (i).
Since every unbounded abelian group contains a countable unbounded subgroup, from
Theorem 3.6 we obtain the following
Corollary 3.7. For every uncountable abelian group G, the following conditions are equiv-
alent:
(i) G is w-divisible;
(ii) G contains a direct sum
L
i∈I Ai of countable unbounded groups Ai such that |I| =
|G|.
Remark 3.8. The assumption that G is uncountable cannot be omitted either in Theorem
3.6 or in its Corollary 3.7; that is, the converse of Lemma 3.3 does not hold for count-
able groups. Indeed, the group Z of integer numbers is w-divisible, yet it is not strongly
unbounded. A precise description of countable strongly unbounded groups is given in Propo-
sition 7.5 below; see also Theorem 7.6 that unifies both the countable and uncountable cases.
4. σ-homogeneous groups
Definition 4.1. For an infinite cardinal σ, we say that an abelian group G is σ-homogeneous
if G ∼
= G(σ)
.
The relevance of this definition to the topic of our paper shall become clear from Corollary
5.3 below.
The straightforward proof of the next lemma is omitted.
Lemma 4.2. (i) The trivial group is σ-homogeneous for every cardinal σ.
9. A COMPLETE SOLUTION OF MARKOV’S PROBLEM 9
(ii) If κ, σ are cardinals with κ ≥ σ ≥ ω and A is an abelian group, then the group A(κ)
is σ-homogeneous.
(iii) Let σ be an infinite cardinal, and let {Gi : i ∈ I} be a non-empty family of σ-
homogeneous abelian groups. Then G =
L
i∈I Gi is σ-homogeneous.
Lemma 4.3. Let σ be an infinite cardinal. Every abelian bounded torsion group K admits
a decomposition K = L ⊕ N, where |L| σ and N is σ-homogeneous.
Proof. If K is trivial, then one can take L and N to be the trivial group. (Note that the
trivial group is σ-homogeneous for every cardinal σ.) Suppose now that K is non-trivial.
Then K admits a decomposition K =
Ln
i=1 K
(αi)
i , where n ∈ N {0}, α1, α2, . . . , αn are
cardinals and each Ki is isomorphic to Z(pki
i ) for some pi ∈ P and ki ∈ N. Let
(7) I = {i ∈ {1, 2, . . . , n} : αi σ} and J = {1, 2, . . . , n} I.
If I = ∅, we define L to be the trivial group. Otherwise, we let L =
L
i∈I K
(αi)
i . Since Ki
is finite and αi σ for every i ∈ I, and σ is an infinite cardinal, we conclude that |L| σ.
If J = ∅, we define N to be the trivial group and note that N is σ-homogeneous by
Lemma 4.2 (i). If J 6= ∅, we let N =
L
j∈J K
(αj)
j . Let i ∈ J be arbitrary. Since αi ≥ σ,
Lemma 4.2 (ii) implies that K
(αi)
i is σ-homogeneous. Now Lemma 4.2 (iii) implies that N is
σ-homogeneous as well.
The equality K = L ⊕ N follows from (7) and our definition of L and N.
For a cardinal σ, we use σ+
to denote the smallest cardinal bigger than σ.
Lemma 4.4. Let σ be an infinite cardinal. Every abelian group G satisfying wd(G) ≥ σ
admits a decomposition G = N ⊕ H such that N is a bounded σ+
-homogeneous group and
H is a w-divisible group with |H| = wd(G).
Proof. Let G = K ⊕ M be the decomposition as in Fact 2.6. Use (5) to fix an integer n ≥ 1
such that wd(G) = |nG|. Since K is a bounded group, mK = {0} for some positive integer
m. Now nmG = nmK ⊕ nmM = nmM, so |nmG| = |mnM| = |M|, as M is w-divisible.
Since nmG ⊆ nG, from the choice of n and (5), we get wd(G) ≤ |nmG| ≤ |nG| = wd(G).
This shows that wd(G) = |M|.
By Lemma 4.3, there exist a subgroup L of K satisfying |L| ≤ σ and a σ+
-homogeneous
subgroup N of K such that K = L⊕N. Since K is bounded, so is N. Clearly, G = K ⊕M =
L ⊕ N ⊕ M = N ⊕ H, where H = L ⊕ M. Since |M| = wd(G) ≥ σ ≥ |L| and σ is infinite,
|H| = |M|. In particular, |H| = wd(G). Since H = L ⊕ M, |H| = |M| and M is w-divisible,
H is w-divisible by Fact 2.5 (ii).
Lemma 4.5. Every w-divisible abelian group G of cardinality at least c contains a c-homo-
geneous w-divisible subgroup H such that |H| = |G|.
Proof. By Corollary 3.7, G contains a subgroup
(8) A =
M
i∈I
Ai,
where |I| = |G| and all Ai are countable and unbounded. In particular, |A| = |I| = |G|. By
the same corollary, A itself is w-divisible.
10. 10 D. DIKRANJAN AND D. SHAKHMATOV
Case 1. |G| c. Note that there are at most c-many countable groups, so the sum (8)
can be rewritten as
(9) A =
M
j∈J
A
(κj)
j
for a subset J of I with |J| ≤ c and a suitable family {κj : j ∈ J} of cardinals such that
|A| = supj∈J κj. Define S = {j ∈ J : κj c}. Then (9) becomes
(10) A =
M
j∈J
A
(κj)
j =
M
j∈S
A
(κj)
j
!
⊕
M
j∈JS
A
(κj)
j
.
Since κj c for all j ∈ S and |S| ≤ |J| ≤ c, we have
L
j∈S A
(κj)
j ≤ c. Since |A| = |G| c,
equation (10) implies that |G| = |H|, where
(11) H =
M
j∈JS
A
(κj)
j .
Let j ∈ J S be arbitrary. Since κj ≥ c by the choice of S, A
(κj)
j is c-homogeneous by
Lemma 4.2 (ii). From this, (11) and Lemma 4.2 (iii), we conclude that H is c-homogeneous
as well.
From (11), we conclude that H is a direct sum of |H|-many unbounded groups, so H is
w-divisible by Corollary 3.7.
Case 2. |G| = c. For any non-empty set P ⊆ P let
(12) SocP (T) =
M
p∈P
Z(p).
For every prime p ∈ P let Lp =
L
n∈N Z(pn
).
It is not hard to realize that every unbounded abelian group contains a subgroup isomor-
phic to one of the groups from the fixed family S = S1 ∪ S2 of unbounded groups, where
(13) S1 = {Z} ∪ {Z(p∞
) : p ∈ P} ∪ {Lp : p ∈ P} and S2 = {SocP (T) : P ∈ [P]ω
}.
(Here [P]ω
denotes the set of all infinite subsets of P.)
It is not restrictive to assume that, in the decomposition (8), Ai ∈ S for each i ∈ I. For
l = 1, 2 define Il = {i ∈ I : Ai ∈ Sl}. We consider two subcases.
Subcase A. |I1| = c. For every N ∈ S1, define EN = {i ∈ I1 : Ai
∼
= N}. Then I1 =
S
N∈S1
EN . Since the family S1 is countable, |I1| = c and cf(c) ω, there exists N ∈ S1 such
that |EN | = c. Then A (and thus, G) contains the direct sum
(14) H =
M
i∈EN
N ∼
= N(|EN |)
= N(c)
.
Clearly, H is c-homogeneous. Since |H| = c and H is a direct sum of c-many unbounded
groups, H is w-divisible by Corollary 3.7.
Subcase B. |I1| c. Since I = I1 ∪ I2 and |I| = c, this implies that |I2| = c. By discarding
Ai with i ∈ I1, we may assume, without loss of generality, that I = I2; that is, Ai ∈ S2 for
11. A COMPLETE SOLUTION OF MARKOV’S PROBLEM 11
all i ∈ I. From this, (12) and (13), we conclude that the direct sum (8) can be re-written as
(15) A =
M
p∈P
Z(p)(σp)
for a suitable family {σp : p ∈ P} of cardinals.
Claim 1. The set C = {p ∈ P : σp = c} is infinite.
Proof. Let P = {p1, p2, . . . , pk} be an arbitrary finite set. Define m = p1p2 . . . pk. From (15),
mA =
M
p∈PP
Z(p)(σp)
,
so
(16) sup{σp : p ∈ P P} = |mA| = |A| = c
as A is w-divisible. Note that (15) implies that σp ≤ |A| = c for every p ∈ P. Since cf(c) ω
and the set P P is countable, from (16) we conclude that σp = c for some p ∈ P P.
Therefore, C P 6= ∅. Since P is an arbitrary finite subset of P, this shows that the set
C = {p ∈ P : σp = c} is infinite.
By this claim, A (and thus, G) contains the direct sum
H =
M
p∈C
Z(p)(c) ∼
=
M
p∈C
Z(p)
!(c)
= SocC(T)(c)
.
Clearly, |H| = c. Finally, since SocC(T)(c)
is unbounded, H is w-divisible by Corollary
3.7.
5. The Hartman-Mycielski construction
Let G be an abelian group, and let I be the unit interval [0, 1]. As usual, GI
denotes the
set of all functions from I to G. Clearly, GI
is a group under the coordinate-wise operations.
For g ∈ G and t ∈ (0, 1] let gt ∈ GI
be the function defined by
gt(x) =
g if x t
e if x ≥ t,
where e is the identity element of G. For each t ∈ (0, 1], Gt = {gt : g ∈ G} is a subgroup of GI
isomorphic to G. Therefore, HM(G) =
P
t∈(0,1] Gt is a subgroup of GI
. It is straightforward
to check that this sum is direct, so that
(17) HM(G) =
M
t∈(0,1]
Gt.
Since Gt
∼
= G for each t ∈ (0, 1], from (17) we conclude that HM(G) ∼
= G(c)
. It follows from
this that HM(G) is divisible and abelian whenever G is. Thus, we have proved the following:
Lemma 5.1. For every group G, the group HM(G) is algebraically isomorphic to G(c)
. Fur-
thermore, if G is divisible and abelian, then so is HM(G).
12. 12 D. DIKRANJAN AND D. SHAKHMATOV
In general even a group G with |G| ≥ c need not be isomorphic to HM(G). Indeed, as
shown in [18], G is contained in HM(G) and splits as a semidirect addend. So any group G
indecomposable into a non-trivial semi-direct product fails to be algebraically isomorphic to
HM(G).
When G is a topological group, Hartman and Mycielski [18] equip HM(G) with a topology
making it pathwise connected and locally pathwise connected. Let µ be the standard prob-
ability measure on I. The Hartman-Mycielski topology on the group HM(G) is the topology
generated by taking the family of all sets of the form
(18) O(U, ε) = {g ∈ GI
: µ({t ∈ I : g(t) 6∈ U}) ε},
where U is an open neighbourhood U of the identity e in G and ε 0, as the base at the
identity function of HM(G).
The next lemma lists two properties of the functor G 7→ HM(G) that are needed for our
proofs.
Lemma 5.2. Let G be a topological group.
(i) HM(G) is pathwise connected and locally pathwise connected.
(ii) If D is a dense subgroup of G, then HM(D) is a dense subgroup of HM(G).
Proof. (i) For every g ∈ G and t ∈ (0, 1], the map f : [0, t] → HM(G) defined by f(s) = gs
for s ∈ [0, t] is a continuous injection, so f([0, t]) is a path in HM(G) connecting f(0) = e
and f(t) = gt. Combining this with (17), one concludes that HM(G) is pathwise connected.
To check that HM(G) is locally pathwise connected, it suffices to show that every set of
the form O(U, ε) as in (18) is pathwise connected. Let U be an open neighbourhood of the
identity e in G and let ε 0. Fix an arbitrary h ∈ O(U, ε) {e}. For each s ∈ [0, 1], define
hs(x) =
h(x) if x s
e if x ≥ s,
and note that hs ∈ O(U, ε). Therefore, the map ϕ : [0, 1] → HM(G) defined by ϕ(s) = hs for
s ∈ [0, t] is continuous, so ϕ([0, 1]) is a path in O(U, ε) connecting f(0) = e and f(1) = h.
(ii) Let D be a dense subgroup of G. First, from the definition of the topology of HM(G),
one easily sees that Dt is a dense subgroup of Gt for each t ∈ (0, 1]. Let g ∈ HM(G) be
arbitrary, and let W be an open subset of HM(G) containing g. By (17), g =
Pn
i=1(gi)ti
for some n ∈ N, g1, g2, . . . , gn ∈ G and t1, t2, . . . , tn ∈ (0, 1]. Since the group operation in
HM(G) is continuous, for every i = 1, 2, . . . , n we can fix an open neighbourhood Vi of (gi)ti
in HM(G) such that
Pn
i=1 Vi ⊆ W. For each i = 1, 2, . . . , n, we use the fact that Dti
is dense
in Gti
to select di ∈ Vi ∩ Dti
. Clearly, d =
Pn
i=1 di ∈
Pn
i=1 Vi ⊆ W. Since di ∈ Dti
⊆ HM(D)
for i = 1, 2, . . . , n, it follows that d ∈ HM(D). This shows that d ∈ HM(D) ∩ W 6= ∅.
Corollary 5.3. Every c-homogeneous group G admits a pathwise connected, locally pathwise
connected group topology.
Proof. Consider G with the discrete topology. By Lemma 5.2 (i), HM(G) is pathwise con-
nected and locally pathwise connected. Since HM(G) ∼
= G(c)
by Lemma 5.1, and G(c) ∼
= G
by our assumption, we can transfer the topology from HM(G) to G by means of the isomor-
phism HM(G) ∼
= G. Therefore, G admits a pathwise connected, locally pathwise connected
group topology.
13. A COMPLETE SOLUTION OF MARKOV’S PROBLEM 13
6. Proof of Theorem 1.9
Lemma 6.1. Let H be a subgroup of an abelian group G and K be a divisible abelian group
such that
(19) rp(H) rp(K) and rp(G) ≤ rp(K) for all p ∈ {0} ∪ P.
Then every monomorphism j : H → K can be extended to a monomorphism j′
: G → K.
Proof. Let us recall some notions used in this proof. Let G be an abelian group. A subgroup
H of G is is said to be essential in G provided that hxi∩H 6= {0} for every non-trivial cyclic
subgroup hxi of G. As usual, Soc(G) =
L
p∈P G[p] denotes the socle of G.
By means of Zorn’s lemma, we can find a maximal subgroup M of G with the property
(20) M ∩ H = {0}.
Then the subgroup H + M = H ⊕ M is essential in G. Indeed, if 0 6= x ∈ G with
(H + M) ∩ hxi = {0}, then also (hxi + M) ∩ H = {0}. Indeed, if
H ∋ h = kx + m ∈ hxi + M
for some k ∈ Z and m ∈ M, then
h − m = kx ∈ (H + M) ∩ hxi = {0};
so kx = 0 and h = m, which yields h = 0 in view of (20).
Fix a free subgroup F of M such that M/F is torsion. Then Soc(M) ⊕ F is an essential
subgroup of M. Let us see first that j can be extended to a monomorphism
(21) j1 : H ⊕ Soc(M) ⊕ F → K.
Since r0(H) r0(K) and r0(G) ≤ r0(K), we can find a free subgroup F′
of K such that
F′
∩ j(H) = {0} and r0(F′
) = r0(F). On the other hand, for every prime p ∈ P, rp(H)
rp(K) and rp(G) ≤ rp(K). Hence, we can find in K[p] a subgroup Tp of p-rank rp(M)
with Tp ∩ j(H)[p] = {0}. Since F′ ∼
= F and Tp
∼
= M[p] for every prime p, we obtain the
desired monomorphism j1 as in (21) extending j. Since the subgroup H ⊕ Soc(M) ⊕ F of
G is essential in G, any extension j′
: G → K of j1 will be a monomorphism as j1 is a
monomorphism. Such an extension j′
exists since K is divisible [15, Theorem 21.1].
Lemma 6.2. Every w-divisible abelian group of size at least c admits a dp-connected, locally
dp-connected group topology.
Proof. Let G be a w-divisible abelian group such that |G| = τ ≥ c. Use Lemma 4.5 to
find a w-divisible subgroup H of G such that |H| = τ and H ∼
= H(c)
. Since H is w-
divisible, wd(H) = |H| = τ. By Corollary 2.8 (applied to H), there exists a monomorphism
π : H → Tκ
such that D = π(H) is dense in Tκ
, where κ = 2τ
. By Lemma 5.2 (ii),
N = HM(D) is a dense subgroup of K = HM(Tκ
). By Lemma 5.2 (i), N is pathwise
connected and locally pathwise connected.
By our choice of H, H ∼
= H(c)
. Since π is a monomorphism, H ∼
= π(H) = D, so H(c) ∼
=
D(c)
. Finally, D(c) ∼
= HM(D) = N by Lemma 5.1. This allows us to fix a monomorphism
j : H → K such that j(H) = N.
Since Tκ
is a subgroup of K,
|G| = τ 2τ
= κ ≤ rp(Tκ
) ≤ rp(K) for all p ∈ {0} ∪ P.
14. 14 D. DIKRANJAN AND D. SHAKHMATOV
Clearly, rp(H) ≤ |H| ≤ |G| and rp(G) ≤ |G| for all p ∈ {0} ∪ P. Therefore, all assumptions
of Lemma 6.1 are satisfied, and its conclusion allows us to find a monomorphism j′
: G → K
extending j. Since G′
= j′
(G) contains j′
(H) = j(H) = N and N is dense in K, N is dense
also in G′
. Since N is pathwise connected and locally pathwise connected, we conclude that
G′
is dp-connected and locally dp-connected.
Finally, since j′
is an isomorphism between G and G′
, we can use it to transfer the subspace
topology which G′
inherits from K onto G.
Proof of Theorem 1.9. Let G be an M-group of infinite exponent. Then wd(G) ≥ c
by Fact 2.4. Therefore, we can apply Lemma 4.4 with σ = c to obtain a decomposition
G = N ⊕ H, where N is a bounded c+
-homogeneous group and H is a w-divisible group
such that |H| = wd(G) ≥ c. By Lemma 4.2 (ii), N is c-homogeneous as well. Corollary 5.3
guarantees the existence of a pathwise connected, locally pathwise connected group topology
TN on N, and Lemma 6.2 guarantees the existence of a dp-connected, locally dp-connected
group topology TH on H. The topology T of the direct product (N, TN ) × (H, TH) is
dp-connected and locally dp-connected. Since G = N ⊕ H and N × H are isomorphic, T is
the desired topology on G.
7. Characterization of countable strongly unbounded groups
The description of uncountable strongly unbounded groups obtained in Theorem 3.6 fails
for countable groups, as mentioned in Remark 3.8. For the sake of completeness, we provide
here a description of countable strongly unbounded groups.
Following [15], for an abelian group G, we let
r(G) = max
n
r0(G),
X
{rp(G) : p ∈ P}
o
.
The sum in this definition may differ from the supremum sup{rp(G) : p ∈ P}; the latter may
be strictly less than the sum, in case all p-ranks are finite and uniformly bounded.
Remark 7.1. (i) r(G) 0 if and only if G is non-trivial.
(ii) If r(G) ≥ ω, then r(G) = |G|.
(iii) If G is uncountable, then r(G) = |G|.
Replacing the cardinality |G| with the rank r(G) in Definition 2.2, one gets the following
“rank analogue” of the divisible weight:
Definition 7.2. For an abelian group G, call the cardinal
(22) rd(G) = min{r(nG) : n ∈ N {0}}
the divisible rank of G. We say that G is r-divisible if rd(G) = r(G).
The notion of divisible rank was defined, under the name of final rank, by Szele [27] for
(discrete) p-groups. The relevance of this notion to the class of strongly unbounded groups
will become clear from Proposition 7.5 below.
Let G be an abelian group. Observe that r(nG) ≤ |nG| ≤ |G| for every positive integer
n. Combining this with (5) and (22), we get
(23) rd(G) ≤ wd(G) ≤ |G|.
It turns out that the first inequality in (23) is strict precisely when G has finite divisible
rank. The algebraic structure of such groups is described in Proposition 7.7 below.
15. A COMPLETE SOLUTION OF MARKOV’S PROBLEM 15
Lemma 7.3. An abelian group G satisfies rd(G) wd(G) if and only if rd(G) is finite.
Proof. Assume first that rd(G) is finite. We shall show that rd(G) wd(G). If G is bounded,
then nG = {0} for some n ∈ N {0}. Therefore, rd(G) = 0 by (22), while wd(G) ≥ 1 by (5).
If G is unbounded, then nG must be infinite for every n ∈ N {0}, and so wd(G) ≥ ω by
(5). Since rd(G) ω, we get rd(G) wd(G) in this case as well.
Next, suppose that rd(G) is infinite. Let n ∈ N{0} be arbitrary. Then r(nG) ≥ rd(G) ≥ ω
by (22). Therefore, r(nG) = |nG| by Remark 7.1 (ii). Since this equality holds for every
n ∈ N {0}, from (5) and (22) we get rd(G) = wd(G).
The next lemma outlines the most important connections between the classes of strongly
unbounded, r-divisible and w-divisible groups.
Lemma 7.4. (i) If an abelian group G is strongly unbounded, then rd(G) = wd(G) =
|G|, so G is r-divisible and rd(G) ≥ ω.
(ii) Every r-divisible group G satisfying rd(G) ≥ ω is w-divisible.
(iii) If G is an uncountable w-divisible group, then G is r-divisible.
Proof. (i) If G is strongly unbounded, then G contains a direct sum
L
i∈I Ai of unbounded
groups Ai such that |I| = |G|; see Definition 3.1. Since for every integer n 0 the group
nAi remains unbounded, r(nAi) ≥ 1, so r(nG) = r(
L
i∈I nAi) ≥ |I| = |G|. This proves the
inequality rd(G) ≥ |G|. The rest follows from (23).
(ii) Since G is r-divisible, r(G) = rd(G) by Definition 7.2. Since rd(G) ≥ ω, |G| = r(G) by
Remark 7.1 (ii) and rd(G) = wd(G) by Lemma 7.3. Therefore, |G| = wd(G), which implies
that G is w-divisible.
(iii) If G is an uncountable w-divisible group, then for every integer n 0, |nG| = |G| is
uncountable, and so r(nG) = |nG| by Remark 7.1 (iii). So r(G) ≥ r(nG) = |nG| = |G| ≥
r(G), and consequently, r(nG) = r(G). This proves that G is r-divisible.
Clearly, a strongly unbounded group must be infinite. Our next proposition describes
countable strongly unbounded groups in terms of their divisible rank rd.
Proposition 7.5. A countable abelian group G is strongly unbounded if and only if rd(G) ≥
ω.
Proof. If G is strongly unbounded, then rd(G) ≥ ω by Lemma 7.4 (i).
Assume now that rd(G) ≥ ω. We shall prove that G is strongly unbounded.
If r0(G) is infinite, then r0(G) = |G| = ω, so G is strongly unbounded by Remark 3.2 (ii).
If π = {p ∈ P : rp(G) 0} is infinite, then G contains a subgroup isomorphic to the
strongly unbounded group H =
L
p∈π Z(p). (Indeed, if π =
S
{Si : i ∈ N} is a partition of
π into pairwise disjoint infinite sets Si, then H =
L
i∈N Ai, where each Ai =
L
p∈Si
Z(p) is
unbounded.) Since |G| = |H| = ω, Remark 3.2 (i) implies that G is strongly unbounded as
well.
From now on we shall assume that both r0(G) and π are finite. The former assumption
implies that r(mt(G)) = ω for every integer m 0. The latter assumption entails that
there exists p ∈ π such that r(mtp(G)) = rp(mtp(G)) is infinite for all integers m 0, where
tp(G) =
S
{G[pn
] : n ∈ N} is the p-torsion part of G. By the implication (iii) → (ii) of
Lemma 3.4, we conclude that tp(G) is strongly unbounded. As |G| = |tp(G)| = ω, Remark
3.2 (i) yields that G is strongly unbounded.
16. 16 D. DIKRANJAN AND D. SHAKHMATOV
Finally, we can unify the countable case considered above with Theorem 3.6 to obtain a
description of all strongly unbounded groups.
Theorem 7.6. For an abelian group G the following are equivalent:
(i) G is strongly unbounded;
(ii) G is r-divisible and rd(G) ≥ ω;
(iii) G is w-divisible and rd(G) ≥ ω.
Proof. The implication (i) → (ii) follows from Lemma 7.4 (i). The implication (ii) → (iii)
follows from Lemma 7.4 (ii). It remains to check the remaining implication (iii) → (i). For a
countable group G, it follows from Proposition 7.5. For an uncountable group G, Theorem
3.6 applies.
Our last proposition completely describes abelian groups of finite divisible rank.
Proposition 7.7. If G is an abelian group satisfying rd(G) ω, then G = G0 × D × B,
where G0 is a torsion-free group, D is a divisible torsion group and B is a bounded group
such that rd(G) = r0(G0) + r(D).
Proof. Since rd(G) ω, it follows from (22) that r(nG) ω for some integer n 0. Let
t(nG) = F × D, where D is a divisible group and F is a reduced group. Since r(F) ≤
r(t(nG)) ≤ r(nG) ω, the reduced torsion group F must be finite. Since D is divisible,
it splits as a direct summand of nG [15, Theorem 21.2]; that is, we can find a subgroup A
of nG containing F such that nG = A × D. Since t(A) ∼
= t(nG/D) ∼
= t(nG)/D ∼
= F is
finite, we deduce from [15, Theorem 27.5] that F splits in A; that is, A = F × H for some
torsion-free (abelian) group H. Now nG = F × H × D.
Let m be the exponent of the finite group F and let k = mn. Then kG = N × D, where
N = mH is a torsion-free group and D = mD is a divisible torsion group. In particular,
N ∼
= kG/D. Since divisible subgroups split, G = D × G1 for an appropriate subgroup G1
of G. Multiplying by k and taking into account that kD = D, we get kG = D × kG1.
This implies that the group kG1
∼
= kG/D ∼
= N is torsion-free. Hence, the torsion subgroup
t(G1) = G1[k] of G1 is bounded, so it splits by [15, Theorem 27.5]; that is, G1 = t(G1) × G0,
where G0 is a torsion-free group.
We now have obtained the decomposition G = G0 ×D×B, where B = t(G1) is a bounded
torsion group. Recalling (22), one easily sees that rd(G) = r0(G0) + r(D).
Remark 7.8. Let ϕ be a cardinal invariant of topological abelian groups. In analogy with
the divisible weight and the divisible rank, for every topological abelian group G, one can
define the cardinal
(24) ϕd(G) = min{ϕ(nG) : n ∈ N {0}}
and call G ϕ-divisible provided that ϕd(G) = ϕ(G). (This terminology is motivated by the
fact that divisible groups are obviously ϕ-divisible.) We will not pursue here a study of this
general cardinal invariant.
8. Open questions
We finish this paper with a couple of questions. Now that Question 1.3 is completely
resolved, one may try to look at variations of this question.
One such possible variation could be obtained by asking about the existence of a connected
group topology on abelian groups having some additional compactness-like properties. Going
17. A COMPLETE SOLUTION OF MARKOV’S PROBLEM 17
in this direction, abelian groups which admit a pseudocompact connected group topology
were characterized in [7, 8]; the necessary condition was independently established in [3].
Recently, the authors obtained complete characterizations of abelian groups which admit a
maximally almost periodic connected group topology, as well as abelian groups which admit
a minimal connected group topology.
Another possible variation of Question 1.3 is obtained by trying to ensure the existence of
a group topology with some stronger connectedness properties.
Question 8.1. Can every abelian M-group be equipped with a pathwise connected (and
locally pathwise connected) group topology?
One may wonder if Theorem 1.9 remains valid for groups which are close to being abelian.
Question 8.2. Can Theorem 1.9 be extended to all nilpotent groups?
Acknowledgments. The authors are grateful to the referee for careful reading of the man-
uscript and helpful suggestions. The first named author gratefully acknowledges a FY2013
Long-term visitor grant L13710 by the Japanese Society for the Promotion of Science (JSPS).
The second named author was partially supported by the Grant-in-Aid for Scientific Re-
search (C) No. 26400091 by the Japan Society for the Promotion of Science (JSPS).
References
[1] W. Comfort, Problems on topological groups and other homogeneous spaces, in: Open Problems in
Topology, J. van Mill and G. M. Reed (Eds.), North-Holland, Amsterdam, 1990, pp. 313–347.
[2] W. W. Comfort, K.-H. Hofmann, D. Remus, Topological groups and semigroups, in: Recent progress
in general topology (Prague, 1991), North-Holland, Amsterdam, 1992, pp. 57–144.
[3] W. W. Comfort, D. Remus, Imposing pseudocompact group topologies on abelian groups, Fund. Math.
142 (1993) 221–240.
[4] D. Dikranjan, A. Giordano Bruno, w-divisible groups, Topology Appl. 155 (2008) 252–272.
[5] D. Dikranjan, A. Giordano Bruno, A factorization theorem for topological abelian groups, Comm.
Algebra 43 (2015) 212–224.
[6] D. Dikranjan, I. Prodanov, L. Stoyanov, Topological groups (Characters, Dualities and Minimal group
topologies). Marcel Dekker, Inc., New York–Basel, 1990.
[7] D. Dikranjan, D. Shakhmatov, Pseudocompact topologies on groups, Topology Proc. 17 (1992) 335–342.
[8] D. Dikranjan, D. Shakhmatov, Algebraic structure of pseudocompact groups, Memoirs Amer. Math.
Soc. 133/633 (1998), 83 pp.
[9] D. Dikranjan, D. Shakhmatov, Forcing hereditarily separable countably compact group topologies on
Abelian groups, Topology Appl. 151 (2005) 2–54.
[10] D. Dikranjan, D. Shakhmatov, Reflection principle characterizing groups in which unconditionally closed
sets are algebraic, J. Group Theory 11 (2008) 421–442.
[11] D. Dikranjan, D. Shakhmatov, The Markov-Zariski topology of an abelian group, J. Algebra 324 (2010)
1125–1158.
[12] D. Dikranjan, D. Shakhmatov, Hewitt-Marczewski-Pondiczery type theorem for abelian groups and
Markov’s potential density, Proc. Amer. Math. Soc. 138 (2010) 2979–2990.
[13] D. Dikranjan, D. Shakhmatov, A Kronecker-Weyl theorem for subsets of abelian groups, Adv. Math.
226 (2011) 4776–4795.
[14] R. Engelking, General Topology, 2nd edition, Heldermann Verlag, Berlin 1989.
[15] L. Fuchs, Infinite Abelian groups, Vol. I, Academic Press, New York, 1970.
[16] J. Galindo, S. Macario, Pseudocompact group topologies with no infinite compact subsets, J. Pure Appl.
Algebra 215 (2011) 655–663.
[17] E. Hewitt, K. A. Ross, Abstract Harmonic Analysis, Springer Verlag, Berlin-Heidelberg-New York, 1970.
[18] S. Hartman, J. Mycielski, On the imbedding of topological groups into connected topological groups,
Colloq. Math. 5 (1958) 167–169.
18. 18 D. DIKRANJAN AND D. SHAKHMATOV
[19] K.-H. Hofmann, S.A. Morris, The structure of compact groups. A primer for the student—a handbook
for the expert, de Gruyter Studies in Mathematics, 25. Walter de Gruyter Co., Berlin, 1998.
[20] P. I. Kirku, A criterion for the connected topologizability of periodic abelian groups of finite period,
Mat. Issled. No. 118, Algebr. Strukt. i ikh Vzaimosvyazi (1990) 66–73 (in Russian).
[21] A. A. Markov, On unconditionally closed sets, Comptes Rendus Dokl. AN SSSR (N.S.) 44 (1944) 180–
181 (in Russian).
[22] A. A. Markov, On unconditionally closed sets, Mat. Sbornik 18 (1946), 3–28 (in Russian). English trans-
lation in: A. A. Markov, Three papers on topological groups: I. On the existence of periodic connected
topological groups, II. On free topological groups, III. On unconditionally closed sets. Amer. Math. Soc.
Translation 1950, (1950). no. 30, 120 pp.; yet another English translation in: Topology and Topological
Algebra, Translations Series 1, vol. 8, American Math. Society, 1962, pp. 273–304.
[23] A. A. Markov, On free topological groups, Izv. Akad. Nauk SSSR, Ser. Mat. 9 (1945), 3-64 (Russian);
English transi., Amer. Math. Soc. Transl. Ser. 1 8 (1962) 195–272.
[24] V. Pestov, On unconditionally closed sets and a conjecture of A.A. Markov, Sibirsk. Mat. Zh. 29 (1988)
124–132 (Russian); English transl., Siberian Math. J. 29 (1988) 260–266.
[25] D. Remus, A short solution of Markov’s problem on connected group topologies, Proc. Amer. Math.
Soc. 110 (1990) 1109–1110.
[26] M. Stropel, Locally compact groups, EMS Textbooks in Mathematics 3, European Mathematical Society
Publishing House, Zürich, 2006.
[27] T. Szele, On tbe basic subgroups of abelian p-groups, Acta Math. Acad. Sci. Hungar. 5 (1954) 129–l41.
[28] M. Tkachenko, Countably compact and pseudocompact topologies on free abelian groups, Izv. Vyssh.
Uchebn. Zaved. Mat. (1990) 68–75 (in Russian); English transl. in: Soviet Math. (Iz. VUZ) 34 (1990)
79–86.
(D. Dikranjan)
Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100
Udine, Italy
E-mail address: dikran.dikranjan@uniud.it
(D. Shakhmatov)
Division of Mathematics, Physics and Earth Sciences, Graduate School of Science and
Engineering, Ehime University, Matsuyama 790-8577, Japan
E-mail address: dmitri.shakhmatov@ehime-u.ac.jp