Testwiki:Reference desk/Archives/Mathematics/2013 September 2

From testwiki
Revision as of 15:49, 25 February 2022 by imported>MalnadachBot (Fixed Lint errors. (Task 12))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Error:not substituted

{| width = "100%"

|- ! colspan="3" align="center" | Mathematics desk |- ! width="20%" align="left" | < September 1 ! width="25%" align="center"|<< Aug | September | Oct >> ! width="20%" align="right" |Current desk > |}

Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


September 2

order of intersection of cyclic subgroups

Hi,

I recently came across the claim that if G is a cyclic group and A,BG are subgroups with orders a,b respectively, then the order of AB is gcd(a,b).

I first tried to prove that AB was cyclic in the hope that it would make things easier. This wasn't too difficult. I first proved that any subgroup of a cyclic group is cyclic, then the fact followed since AB, being the intersection of two subgroups is itself a subgroup.

I then showed that if G is generated by g, and n,m are the smallest positive integers such that gn,gm generate A and B respectively then the smallest power of g that generates AB was equal to the lowest common multiple of m and n, but this approach has got me nowhere.

Help please?

Neuroxic (talk) 11:20, 2 September 2013 (UTC)

|G|=k(a/gcd(a,b))(b/gcd(a,b))gcd(a,b), for some integer k. So n=kb/gcd(a,b), and m=ka/gcd(a,b).
So lcm(n,m)=klcm(b/gcd(a,b),a/gcd(a,b)). But these are relatively prime, so lcm(n,m)=k(a/gcd(a,b))(b/gcd(a,b)). So lcm(n,m)gcd(a,b)=|G|. From this it follows that glcm(n,m) generates a group of order gcd(a,b).--80.109.106.49 (talk) 12:45, 2 September 2013 (UTC)

Minimizing the largest eigenvalue

Given

an,

b,

A0,,An𝕊n×n.

Show that

minxnsupunuT(A0+x1A1++xnAn)u(aTx+b)uTu=minxnsupunuT(1aTxbA0+x1A1++xnAn)uuTu

(assuming I've done my preliminary calculations correctly)

AnalysisAlgebra (talk) 16:01, 2 September 2013 (UTC)