Bsrgvty

Is it tax fraud for an individual to declare non-taxable revenue as taxable income? (US tax laws)

Are tax years 2016 & 2017 back taxes deductible for tax year 2018?

How old can references or sources in a thesis be?

Is there a familial term for apples and pears?

Could a US political party gain complete control over the government by removing checks & balances?

If Manufacturer spice model and Datasheet give different values which should I use?

Can Medicine checks be used, with decent rolls, to completely mitigate the risk of death from ongoing damage?

Why are 150k or 200k jobs considered good when there are 300k+ births a month?

Shell script can be run only with sh command

Why did the Germans forbid the possession of pet pigeons in Rostov-on-Don in 1941?

I see my dog run

black dwarf stars and dark matter

Set-theoretical foundations of Mathematics with only bounded quantifiers

What are these boxed doors outside store fronts in New York?

whey we use polarized capacitor?

What is the offset in a seaplane's hull?

New order #4: World

How can the DM most effectively choose 1 out of an odd number of players to be targeted by an attack or effect?

How does one intimidate enemies without having the capacity for violence?

Do airline pilots ever risk not hearing communication directed to them specifically, from traffic controllers?

A newer friend of my brother's gave him a load of baseball cards that are supposedly extremely valuable. Is this a scam?

Why is "Reports" in sentence down without "The"

When blogging recipes, how can I support both readers who want the narrative/journey and ones who want the printer-friendly recipe?

Why is the design of haulage companies so “special”?

Infinite Abelian subgroup of infinite non Abelian group example

Conjugacy in Infinite GroupsUsing semiproduct to construct a non-abelian group.When can an infinite abelian group be embedded in the multiplicative group of a field?A group is generated by two elements of order $2$ is infinite and non-abelianProve that any subgroup of a free Abelian group of rank $r$ is free Abelian of rank at most $r$.Does there exist an infinite non-abelian group such that all of its proper subgroups become cyclic?Showing a group is Abelian using its presentation.Noncyclic (infinite) group with totally ordered subgroup latticeNon-split central extension of Z by a finite simple non-abelian groupA group with an infinite cyclic normal subgroup that has a finite cyclic quotient is abelian

7

$begingroup$

My thought is that we may take GL(2,F) as the group and this is obviously infinite and non abelian since matrix multiplication does not commute. Then I thought that if we make $langle grangle$, for some $g$ in $mathrmGL(2,F)$, which will be cyclic and hence Abelian, for instance:
$ g=
bigg[
beginmatrix
1&0\0&2
endmatrix
bigg]
$. Then $g^n$ will be in the form $ g^n=
bigg[
beginmatrix
1&0\0&2^n
endmatrix
bigg]
$. This is obviously infinite since $g^n=e Leftrightarrow n = 0$.
Would this example work? Much thanks in advance!

abstract-algebra group-theory

share|cite|improve this question

edited Apr 4 at 12:36

user1729

17.7k64294

asked Apr 4 at 12:18

JustWanderingJustWandering

692

$endgroup$

• 
  
  
  

  
  3
  

  
  
  
  
  
  

  
  $begingroup$
  If $A$ is an infinite abelian group and $H$ is a finite, non-abelian group then $Atimes H$ works. [Also, you could take $F=mathbbZ$ in your example to get something easy to work with, but which isn't a field :-) ]
  $endgroup$
  – user1729
  Apr 4 at 12:32
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  A physical example: If you rotate a 3D object around the z-axis, those rotations are abelian. However, if you rotate it about both the z-axis and the x-axis, that's non-abelian.
  $endgroup$
  – Mateen Ulhaq
  2 days ago
  

  
  
  
  

add a comment | 

7

$begingroup$

My thought is that we may take GL(2,F) as the group and this is obviously infinite and non abelian since matrix multiplication does not commute. Then I thought that if we make $langle grangle$, for some $g$ in $mathrmGL(2,F)$, which will be cyclic and hence Abelian, for instance:
$ g=
bigg[
beginmatrix
1&0\0&2
endmatrix
bigg]
$. Then $g^n$ will be in the form $ g^n=
bigg[
beginmatrix
1&0\0&2^n
endmatrix
bigg]
$. This is obviously infinite since $g^n=e Leftrightarrow n = 0$.
Would this example work? Much thanks in advance!

abstract-algebra group-theory

share|cite|improve this question

edited Apr 4 at 12:36

user1729

17.7k64294

asked Apr 4 at 12:18

JustWanderingJustWandering

692

$endgroup$

• 
  
  
  

  
  3
  

  
  
  
  
  
  

  
  $begingroup$
  If $A$ is an infinite abelian group and $H$ is a finite, non-abelian group then $Atimes H$ works. [Also, you could take $F=mathbbZ$ in your example to get something easy to work with, but which isn't a field :-) ]
  $endgroup$
  – user1729
  Apr 4 at 12:32
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  A physical example: If you rotate a 3D object around the z-axis, those rotations are abelian. However, if you rotate it about both the z-axis and the x-axis, that's non-abelian.
  $endgroup$
  – Mateen Ulhaq
  2 days ago
  

  
  
  
  

add a comment | 

$begingroup$

My thought is that we may take GL(2,F) as the group and this is obviously infinite and non abelian since matrix multiplication does not commute. Then I thought that if we make $langle grangle$, for some $g$ in $mathrmGL(2,F)$, which will be cyclic and hence Abelian, for instance:
$ g=
bigg[
beginmatrix
1&0\0&2
endmatrix
bigg]
$. Then $g^n$ will be in the form $ g^n=
bigg[
beginmatrix
1&0\0&2^n
endmatrix
bigg]
$. This is obviously infinite since $g^n=e Leftrightarrow n = 0$.
Would this example work? Much thanks in advance!

abstract-algebra group-theory

share|cite|improve this question

edited Apr 4 at 12:36

user1729

17.7k64294

asked Apr 4 at 12:18

JustWanderingJustWandering

692

$endgroup$

share|cite|improve this question

edited Apr 4 at 12:36

user1729

17.7k64294

asked Apr 4 at 12:18

JustWanderingJustWandering

692

share|cite|improve this question

edited Apr 4 at 12:36

user1729

17.7k64294

asked Apr 4 at 12:18

JustWanderingJustWandering

692

edited Apr 4 at 12:36

user1729

17.7k64294

edited Apr 4 at 12:36

user1729

17.7k64294

asked Apr 4 at 12:18

JustWanderingJustWandering

692

asked Apr 4 at 12:18

JustWanderingJustWandering

692

5 Answers
5

active

oldest

votes

9

$begingroup$

The simplest example is $G=mathbb Z times S_3$ and $H=mathbb Z$.

share|cite|improve this answer

answered Apr 4 at 12:31

lhflhf

167k11172404

$endgroup$

• 
  
  
  

  
  11
  

  
  
  
  
  
  

  
  $begingroup$
  It's funny because the groups aren't simple.
  $endgroup$
  – Servaes
  Apr 4 at 12:34
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  That's math humor! :-)
  $endgroup$
  – alexis
  2 days ago
  

  
  
  
  

add a comment | 

8

$begingroup$

This example works indeed, if $F$ is infinite and $2^nneq1$ in $F$ for all non-zero $ninBbbZ$. This is satisfied for obvious candidates for $F$ such as $BbbR$, $BbbC$ and $BbbQ$, but fails for other candidates such as the finite fields $BbbF_q$, but also infinite fields of positive characteristic such as $BbbF_p(T)$.

Assuming $F$ is a field, the condition that $2^nneq1$ for all non-zero $ninBbbZ$ is equivalent to $operatornamecharF=0$, from which it follows that $F$ is infinite. So your example works if and only if $operatornamecharF=0$.

share|cite|improve this answer

answered Apr 4 at 12:22

ServaesServaes

30k342101

$endgroup$

add a comment | 

5

$begingroup$

Assuming that $Bbb F$ has characteristic $0,$ that definitely works. Nicely done!

It also allows you to prove an inclusion $Bbb Zhookrightarrow GL(2,Bbb F).$

share|cite|improve this answer

edited Apr 4 at 12:23

answered Apr 4 at 12:22

Cameron BuieCameron Buie

86.6k773161

$endgroup$

add a comment | 

1

$begingroup$

A simple example: let $G = S(mathbb Z)$, the group of all permutations of the integers. Let $A$ be the subgroup generated by the transpositions $, n in mathbb Z, n , rm even $. Since the generating transpositions are all pairwise disjoint, they trivially commute with each other.

share|cite|improve this answer

answered Apr 4 at 15:51

John ColemanJohn Coleman

4,00311224

$endgroup$

add a comment | 

-1

$begingroup$

Yes it works if you take $F$ to be an infinite field for example.

Although, as was pointed out by others even in this case you'll have to make some assumptions on $F$ to get your particular example working.

I guess it'd be more natural to consider the subset of all diagonal submatrices. It certainly is a subgroup as $mathrmdiag(x,y)^-1 = mathrmdiag(x^-1, y^-1)$.

This subgroup is isomorphic to $F^times oplus F^times$, which is abelian and infinite if $F$ is.

share|cite|improve this answer

edited Apr 4 at 12:27

answered Apr 4 at 12:21

lushlush

757116

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  It does not work for infinite fields such as $BbbF_p(T)$.
  $endgroup$
  – Servaes
  Apr 4 at 12:22
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  ah obviously yes.
  $endgroup$
  – lush
  Apr 4 at 12:23
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Changed it @Servaes, I had forgotten that he asked for a particular example to work.
  $endgroup$
  – lush
  Apr 4 at 12:34
  

  
  
  
  

add a comment | 

Your Answer

StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

Required, but never shown

StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3174561%2finfinite-abelian-subgroup-of-infinite-non-abelian-group-example%23new-answer', 'question_page');

);

Post as a guest

Name

Email

Required, but never shown

9

$begingroup$

The simplest example is $G=mathbb Z times S_3$ and $H=mathbb Z$.

share|cite|improve this answer

answered Apr 4 at 12:31

lhflhf

167k11172404

$endgroup$

• 
  
  
  

  
  11
  

  
  
  
  
  
  

  
  $begingroup$
  It's funny because the groups aren't simple.
  $endgroup$
  – Servaes
  Apr 4 at 12:34
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  That's math humor! :-)
  $endgroup$
  – alexis
  2 days ago
  

  
  
  
  

add a comment | 

9

$begingroup$

The simplest example is $G=mathbb Z times S_3$ and $H=mathbb Z$.

share|cite|improve this answer

answered Apr 4 at 12:31

lhflhf

167k11172404

$endgroup$

• 
  
  
  

  
  11
  

  
  
  
  
  
  

  
  $begingroup$
  It's funny because the groups aren't simple.
  $endgroup$
  – Servaes
  Apr 4 at 12:34
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  That's math humor! :-)
  $endgroup$
  – alexis
  2 days ago
  

  
  
  
  

add a comment | 

$begingroup$

The simplest example is $G=mathbb Z times S_3$ and $H=mathbb Z$.

share|cite|improve this answer

answered Apr 4 at 12:31

lhflhf

167k11172404

$endgroup$

share|cite|improve this answer

answered Apr 4 at 12:31

lhflhf

167k11172404

answered Apr 4 at 12:31

lhflhf

167k11172404

answered Apr 4 at 12:31

lhflhf

167k11172404

8

$begingroup$

This example works indeed, if $F$ is infinite and $2^nneq1$ in $F$ for all non-zero $ninBbbZ$. This is satisfied for obvious candidates for $F$ such as $BbbR$, $BbbC$ and $BbbQ$, but fails for other candidates such as the finite fields $BbbF_q$, but also infinite fields of positive characteristic such as $BbbF_p(T)$.

Assuming $F$ is a field, the condition that $2^nneq1$ for all non-zero $ninBbbZ$ is equivalent to $operatornamecharF=0$, from which it follows that $F$ is infinite. So your example works if and only if $operatornamecharF=0$.

share|cite|improve this answer

answered Apr 4 at 12:22

ServaesServaes

30k342101

$endgroup$

add a comment | 

8

$begingroup$

This example works indeed, if $F$ is infinite and $2^nneq1$ in $F$ for all non-zero $ninBbbZ$. This is satisfied for obvious candidates for $F$ such as $BbbR$, $BbbC$ and $BbbQ$, but fails for other candidates such as the finite fields $BbbF_q$, but also infinite fields of positive characteristic such as $BbbF_p(T)$.

Assuming $F$ is a field, the condition that $2^nneq1$ for all non-zero $ninBbbZ$ is equivalent to $operatornamecharF=0$, from which it follows that $F$ is infinite. So your example works if and only if $operatornamecharF=0$.

share|cite|improve this answer

answered Apr 4 at 12:22

ServaesServaes

30k342101

$endgroup$

add a comment | 

$begingroup$

This example works indeed, if $F$ is infinite and $2^nneq1$ in $F$ for all non-zero $ninBbbZ$. This is satisfied for obvious candidates for $F$ such as $BbbR$, $BbbC$ and $BbbQ$, but fails for other candidates such as the finite fields $BbbF_q$, but also infinite fields of positive characteristic such as $BbbF_p(T)$.

Assuming $F$ is a field, the condition that $2^nneq1$ for all non-zero $ninBbbZ$ is equivalent to $operatornamecharF=0$, from which it follows that $F$ is infinite. So your example works if and only if $operatornamecharF=0$.

share|cite|improve this answer

answered Apr 4 at 12:22

ServaesServaes

30k342101

$endgroup$

share|cite|improve this answer

answered Apr 4 at 12:22

ServaesServaes

30k342101

answered Apr 4 at 12:22

ServaesServaes

30k342101

answered Apr 4 at 12:22

ServaesServaes

30k342101

5

$begingroup$

Assuming that $Bbb F$ has characteristic $0,$ that definitely works. Nicely done!

It also allows you to prove an inclusion $Bbb Zhookrightarrow GL(2,Bbb F).$

share|cite|improve this answer

edited Apr 4 at 12:23

answered Apr 4 at 12:22

Cameron BuieCameron Buie

86.6k773161

$endgroup$

add a comment | 

5

$begingroup$

Assuming that $Bbb F$ has characteristic $0,$ that definitely works. Nicely done!

It also allows you to prove an inclusion $Bbb Zhookrightarrow GL(2,Bbb F).$

share|cite|improve this answer

edited Apr 4 at 12:23

answered Apr 4 at 12:22

Cameron BuieCameron Buie

86.6k773161

$endgroup$

add a comment | 

$begingroup$

Assuming that $Bbb F$ has characteristic $0,$ that definitely works. Nicely done!

It also allows you to prove an inclusion $Bbb Zhookrightarrow GL(2,Bbb F).$

share|cite|improve this answer

edited Apr 4 at 12:23

answered Apr 4 at 12:22

Cameron BuieCameron Buie

86.6k773161

$endgroup$

share|cite|improve this answer

edited Apr 4 at 12:23

answered Apr 4 at 12:22

Cameron BuieCameron Buie

86.6k773161

answered Apr 4 at 12:22

Cameron BuieCameron Buie

86.6k773161

answered Apr 4 at 12:22

Cameron BuieCameron Buie

86.6k773161

1

$begingroup$

A simple example: let $G = S(mathbb Z)$, the group of all permutations of the integers. Let $A$ be the subgroup generated by the transpositions $, n in mathbb Z, n , rm even $. Since the generating transpositions are all pairwise disjoint, they trivially commute with each other.

share|cite|improve this answer

answered Apr 4 at 15:51

John ColemanJohn Coleman

4,00311224

$endgroup$

add a comment | 

1

$begingroup$

A simple example: let $G = S(mathbb Z)$, the group of all permutations of the integers. Let $A$ be the subgroup generated by the transpositions $, n in mathbb Z, n , rm even $. Since the generating transpositions are all pairwise disjoint, they trivially commute with each other.

share|cite|improve this answer

answered Apr 4 at 15:51

John ColemanJohn Coleman

4,00311224

$endgroup$

add a comment | 

$begingroup$

A simple example: let $G = S(mathbb Z)$, the group of all permutations of the integers. Let $A$ be the subgroup generated by the transpositions $, n in mathbb Z, n , rm even $. Since the generating transpositions are all pairwise disjoint, they trivially commute with each other.

share|cite|improve this answer

answered Apr 4 at 15:51

John ColemanJohn Coleman

4,00311224

$endgroup$

share|cite|improve this answer

answered Apr 4 at 15:51

John ColemanJohn Coleman

4,00311224

answered Apr 4 at 15:51

John ColemanJohn Coleman

4,00311224

answered Apr 4 at 15:51

John ColemanJohn Coleman

4,00311224

-1

$begingroup$

Yes it works if you take $F$ to be an infinite field for example.

Although, as was pointed out by others even in this case you'll have to make some assumptions on $F$ to get your particular example working.

I guess it'd be more natural to consider the subset of all diagonal submatrices. It certainly is a subgroup as $mathrmdiag(x,y)^-1 = mathrmdiag(x^-1, y^-1)$.

This subgroup is isomorphic to $F^times oplus F^times$, which is abelian and infinite if $F$ is.

share|cite|improve this answer

edited Apr 4 at 12:27

answered Apr 4 at 12:21

lushlush

757116

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  It does not work for infinite fields such as $BbbF_p(T)$.
  $endgroup$
  – Servaes
  Apr 4 at 12:22
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  ah obviously yes.
  $endgroup$
  – lush
  Apr 4 at 12:23
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Changed it @Servaes, I had forgotten that he asked for a particular example to work.
  $endgroup$
  – lush
  Apr 4 at 12:34
  

  
  
  
  

add a comment | 

-1

$begingroup$

Yes it works if you take $F$ to be an infinite field for example.

Although, as was pointed out by others even in this case you'll have to make some assumptions on $F$ to get your particular example working.

I guess it'd be more natural to consider the subset of all diagonal submatrices. It certainly is a subgroup as $mathrmdiag(x,y)^-1 = mathrmdiag(x^-1, y^-1)$.

This subgroup is isomorphic to $F^times oplus F^times$, which is abelian and infinite if $F$ is.

share|cite|improve this answer

edited Apr 4 at 12:27

answered Apr 4 at 12:21

lushlush

757116

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  It does not work for infinite fields such as $BbbF_p(T)$.
  $endgroup$
  – Servaes
  Apr 4 at 12:22
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  ah obviously yes.
  $endgroup$
  – lush
  Apr 4 at 12:23
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Changed it @Servaes, I had forgotten that he asked for a particular example to work.
  $endgroup$
  – lush
  Apr 4 at 12:34
  

  
  
  
  

add a comment | 

$begingroup$

Yes it works if you take $F$ to be an infinite field for example.

Although, as was pointed out by others even in this case you'll have to make some assumptions on $F$ to get your particular example working.

I guess it'd be more natural to consider the subset of all diagonal submatrices. It certainly is a subgroup as $mathrmdiag(x,y)^-1 = mathrmdiag(x^-1, y^-1)$.

This subgroup is isomorphic to $F^times oplus F^times$, which is abelian and infinite if $F$ is.

share|cite|improve this answer

edited Apr 4 at 12:27

answered Apr 4 at 12:21

lushlush

757116

$endgroup$

share|cite|improve this answer

edited Apr 4 at 12:27

answered Apr 4 at 12:21

lushlush

757116

answered Apr 4 at 12:21

lushlush

757116

answered Apr 4 at 12:21

lushlush

757116