MHB Submodules A + B and A intersect B .... Blyth Ch. 2

  • Thread starter Thread starter Math Amateur
  • Start date Start date
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading T. S. Blyth's book "Module Theory: An Approach to Linear Algebra" ... ... and am currently focussed on Chapter 2: Submodules; Intersections and Sums ... ...

I need help with understanding two claims that Blyth makes concerning submodules ...

The relevant text is as follows: ( see end of post for other text that may be relevant)https://www.physicsforums.com/attachments/5891I have two questions concerning the above text ... ...
Question 1In the above text we read:

" ... ... We know that $$A + B$$ is the smallest submodule of $$M$$ that contains both $$A$$ and $$B$$, ... ... "My question is: how exactly do we know this ... ? How would we formally and rigorously prove this ... ?
Question 2In the above text we read:

" ... ... and that $$A \cap B$$ is the largest submodule contained in both $$A$$ and $$B$$, ... ... "
My question is: how exactly do we know this ... ? How would we formally and rigorously prove this ... ?Hope that someone can help with the above two questions ...

PeterPS Just in case readers need to reference some of Blyth's definitions or theorems in Chapter 2, I am providing the relevant text as follows:
https://www.physicsforums.com/attachments/5892
View attachment 5893
View attachment 5894
View attachment 5895
View attachment 5896
 
Last edited:
Physics news on Phys.org
Hi Peter,

Peter said:
Question 1

In the above text we read:

" ... ... We know that $$A + B$$ is the smallest submodule of $$M$$ that contains both $$A$$ and $$B$$, ... ... "My question is: how exactly do we know this ... ? How would we formally and rigorously prove this ... ?
Question 2In the above text we read:

" ... ... and that $$A \cap B$$ is the largest submodule contained in both $$A$$ and $$B$$, ... ... "
My question is: how exactly do we know this ... ? How would we formally and rigorously prove this ... ?

For Question 1, let $K$ be any submodule of $M$ that contains both $A$ and $B$. Then $A\cup B\subseteq K$, so that $A+B=\langle A\cup B\rangle\subseteq \langle K\rangle =K$. Since $K$ was arbitrary, the statement follows.

For Question 2, let $K$ be any submodule contained in both $A$ and $B$. Then $K\subseteq A\cap B$ and it's known from a theorem in the text you posted that $A\cap B$ is a submodule contained in $A$ and $B.$ Since $K$ was arbitrary, the statement follows.
 
GJA said:
Hi Peter,
For Question 1, let $K$ be any submodule of $M$ that contains both $A$ and $B$. Then $A\cup B\subseteq K$, so that $A+B=\langle A\cup B\rangle\subseteq \langle K\rangle =K$. Since $K$ was arbitrary, the statement follows.

For Question 2, let $K$ be any submodule contained in both $A$ and $B$. Then $K\subseteq A\cap B$ and it's known from a theorem in the text you posted that $A\cap B$ is a submodule contained in $A$ and $B.$ Since $K$ was arbitrary, the statement follows.

Thanks GJA ... appreciate your help

Peter
 
Question 1: $A+B$ is the smallest submoduie of $M$ that contains both $A$ and $B$

Of course $A\subset A+B$ and $B\subset A+B$.
Suppose $X$ is a submodule of $M$ that contains both $A$ and $B$: $A\subset X$ and $B\subset X$.
Then $A+B\subset X$.
Thus, $X$ is larger (or equal) than $A+B$.

Question 2: $A\cap B$ is the largest submodule of $M$ contained in both $A$ and $B$

Of course $A\cap B\subset A$ and $A\cap B\subset B$
Suppose $X$ is a submodule of $M$ contained in both $A$ and $B$: $X\subset A$ and $X\subset B$.
Then $X \subset A\cap B$.
Thus, $X$ is smaller (or equal) than $A\cap B$.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
Back
Top