Centralizer-large subgroups permute and their product and intersection are centralizer-large

From Groupprops

Statement

Suppose is a group of prime power order and are Centralizer-large subgroup (?)s of . Then, , and both and are both centralizer-large subgroups of .

Related facts

Facts used

  1. Product formula

Proof

Given: A group of prime power order, centralizer-large subgroups of .

To prove: , and both and are also centralizer-large subgroups.

Proof: Note that if and only if it is a subgroup, if and only if it is equal to . In general, we have .

By fact (1), we have:

Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \left| \langle A,B \rangle \right| \ge |AB| = \frac{|A||B|}{|A \cap B|} \tag{(*)}}

and:

Failed to parse (unknown function "\tag"): {\displaystyle \left| \langle C_P(A),C_P(B) \rangle \right| \ge |C_P(A)C_P(B)| = \frac{|C_P(A)||C_P(B)|}{|C_P(A) \cap C_P(B)|} \tag{(*)}}


Also, we have:

Failed to parse (unknown function "\tag"): {\displaystyle C_P(C_P(A) \cap C_P(B)) \ge \langle A,B \rangle \tag{(**)}}

and:

Failed to parse (unknown function "\tag"): {\displaystyle C_P(A \cap B) \ge \langle C_P(A),C_P(B)\rangle \tag{(***)}} .

Denote by the value . Then, combining (*) and (**), we see that:

with equality holding in all the inequalities. But and maximize , hence equality must hold. Thus, , . Also, and by definition. Thus, the subgroups and are centralizer-large.

Since is maximized for and , we must have equality. Hence . Moreover, we get that and .

References

Journal references