In linear algebra, how do we define direct sum between two sets if we choose an expression like A + B = A +...












-2












$begingroup$


in linear algebra, we define the direct sum between two sets like this :
A +* B = if and only if (A + B = C and A ∩ B = {0}).



How do we define A +* B = A +* B ? I mean : is it always true or only when A ∩ B = {0} ? In this case, that mean that A * B = A * B in general is not always true ?



Thanks`










share|cite|improve this question









$endgroup$



closed as unclear what you're asking by Dietrich Burde, David C. Ullrich, Lord Shark the Unknown, Pacciu, Nosrati Jan 20 at 11:37


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.














  • 1




    $begingroup$
    Is what always true? We can always define $A + B = lbrace a + b,vert, ain A,bin Brbrace$ (if this is what you mean) for subsets $A,Bsubset V$ (where $V$ is a vector space over some field $k$). And yes, this operation is well-defined: $A + B = A + B$. What distinguishes a direct sum (written $Aoplus B$, or perhaps A +* B in your notation) from a (regular) sum $A + B$ is that (i) we require that $A$ and $B$ are subspaces of $V$ and (ii) we require that $Acap B = lbrace 0rbrace$.
    $endgroup$
    – o.h.
    Jan 19 at 15:30












  • $begingroup$
    A +* B = A +* B
    $endgroup$
    – John Hammond
    Jan 19 at 15:31
















-2












$begingroup$


in linear algebra, we define the direct sum between two sets like this :
A +* B = if and only if (A + B = C and A ∩ B = {0}).



How do we define A +* B = A +* B ? I mean : is it always true or only when A ∩ B = {0} ? In this case, that mean that A * B = A * B in general is not always true ?



Thanks`










share|cite|improve this question









$endgroup$



closed as unclear what you're asking by Dietrich Burde, David C. Ullrich, Lord Shark the Unknown, Pacciu, Nosrati Jan 20 at 11:37


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.














  • 1




    $begingroup$
    Is what always true? We can always define $A + B = lbrace a + b,vert, ain A,bin Brbrace$ (if this is what you mean) for subsets $A,Bsubset V$ (where $V$ is a vector space over some field $k$). And yes, this operation is well-defined: $A + B = A + B$. What distinguishes a direct sum (written $Aoplus B$, or perhaps A +* B in your notation) from a (regular) sum $A + B$ is that (i) we require that $A$ and $B$ are subspaces of $V$ and (ii) we require that $Acap B = lbrace 0rbrace$.
    $endgroup$
    – o.h.
    Jan 19 at 15:30












  • $begingroup$
    A +* B = A +* B
    $endgroup$
    – John Hammond
    Jan 19 at 15:31














-2












-2








-2





$begingroup$


in linear algebra, we define the direct sum between two sets like this :
A +* B = if and only if (A + B = C and A ∩ B = {0}).



How do we define A +* B = A +* B ? I mean : is it always true or only when A ∩ B = {0} ? In this case, that mean that A * B = A * B in general is not always true ?



Thanks`










share|cite|improve this question









$endgroup$




in linear algebra, we define the direct sum between two sets like this :
A +* B = if and only if (A + B = C and A ∩ B = {0}).



How do we define A +* B = A +* B ? I mean : is it always true or only when A ∩ B = {0} ? In this case, that mean that A * B = A * B in general is not always true ?



Thanks`







linear-algebra






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 19 at 15:26









John HammondJohn Hammond

1




1




closed as unclear what you're asking by Dietrich Burde, David C. Ullrich, Lord Shark the Unknown, Pacciu, Nosrati Jan 20 at 11:37


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.









closed as unclear what you're asking by Dietrich Burde, David C. Ullrich, Lord Shark the Unknown, Pacciu, Nosrati Jan 20 at 11:37


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.










  • 1




    $begingroup$
    Is what always true? We can always define $A + B = lbrace a + b,vert, ain A,bin Brbrace$ (if this is what you mean) for subsets $A,Bsubset V$ (where $V$ is a vector space over some field $k$). And yes, this operation is well-defined: $A + B = A + B$. What distinguishes a direct sum (written $Aoplus B$, or perhaps A +* B in your notation) from a (regular) sum $A + B$ is that (i) we require that $A$ and $B$ are subspaces of $V$ and (ii) we require that $Acap B = lbrace 0rbrace$.
    $endgroup$
    – o.h.
    Jan 19 at 15:30












  • $begingroup$
    A +* B = A +* B
    $endgroup$
    – John Hammond
    Jan 19 at 15:31














  • 1




    $begingroup$
    Is what always true? We can always define $A + B = lbrace a + b,vert, ain A,bin Brbrace$ (if this is what you mean) for subsets $A,Bsubset V$ (where $V$ is a vector space over some field $k$). And yes, this operation is well-defined: $A + B = A + B$. What distinguishes a direct sum (written $Aoplus B$, or perhaps A +* B in your notation) from a (regular) sum $A + B$ is that (i) we require that $A$ and $B$ are subspaces of $V$ and (ii) we require that $Acap B = lbrace 0rbrace$.
    $endgroup$
    – o.h.
    Jan 19 at 15:30












  • $begingroup$
    A +* B = A +* B
    $endgroup$
    – John Hammond
    Jan 19 at 15:31








1




1




$begingroup$
Is what always true? We can always define $A + B = lbrace a + b,vert, ain A,bin Brbrace$ (if this is what you mean) for subsets $A,Bsubset V$ (where $V$ is a vector space over some field $k$). And yes, this operation is well-defined: $A + B = A + B$. What distinguishes a direct sum (written $Aoplus B$, or perhaps A +* B in your notation) from a (regular) sum $A + B$ is that (i) we require that $A$ and $B$ are subspaces of $V$ and (ii) we require that $Acap B = lbrace 0rbrace$.
$endgroup$
– o.h.
Jan 19 at 15:30






$begingroup$
Is what always true? We can always define $A + B = lbrace a + b,vert, ain A,bin Brbrace$ (if this is what you mean) for subsets $A,Bsubset V$ (where $V$ is a vector space over some field $k$). And yes, this operation is well-defined: $A + B = A + B$. What distinguishes a direct sum (written $Aoplus B$, or perhaps A +* B in your notation) from a (regular) sum $A + B$ is that (i) we require that $A$ and $B$ are subspaces of $V$ and (ii) we require that $Acap B = lbrace 0rbrace$.
$endgroup$
– o.h.
Jan 19 at 15:30














$begingroup$
A +* B = A +* B
$endgroup$
– John Hammond
Jan 19 at 15:31




$begingroup$
A +* B = A +* B
$endgroup$
– John Hammond
Jan 19 at 15:31










1 Answer
1






active

oldest

votes


















1












$begingroup$

In general it is not very meaningful to ask whether some object is equal to itself. However, a question that often appears is whether a definition makes sense (i.e. if some object is well-defined), insofar as it does not depend on arbitrary choices. If we are trying to show that some object (e.g. function) $T$ is well-defined, this is sometimes written $T = T$. But really that's an abuse of notation.



If $A,Bsubset C$ and $A + B = C$ (every element of $C$ can be written as a sum of elements of $A$ and $B$), then we write $C = Aoplus B$ if and only if $Acap B = lbrace 0rbrace$. The $oplus$-notation is a kind of shorthand for a sum of subspaces having this intersection property. We don't want to write "let $A,Bsubset C$ st. $A + B = C$ and $Acap B = 0$" everytime this situation occurs, because (a) it occurs often and (b) it has very important consequences (e.g. every element of $C$ can be written uniquely as a sum of elements of $A$ and $B$).






share|cite|improve this answer











$endgroup$




















    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1












    $begingroup$

    In general it is not very meaningful to ask whether some object is equal to itself. However, a question that often appears is whether a definition makes sense (i.e. if some object is well-defined), insofar as it does not depend on arbitrary choices. If we are trying to show that some object (e.g. function) $T$ is well-defined, this is sometimes written $T = T$. But really that's an abuse of notation.



    If $A,Bsubset C$ and $A + B = C$ (every element of $C$ can be written as a sum of elements of $A$ and $B$), then we write $C = Aoplus B$ if and only if $Acap B = lbrace 0rbrace$. The $oplus$-notation is a kind of shorthand for a sum of subspaces having this intersection property. We don't want to write "let $A,Bsubset C$ st. $A + B = C$ and $Acap B = 0$" everytime this situation occurs, because (a) it occurs often and (b) it has very important consequences (e.g. every element of $C$ can be written uniquely as a sum of elements of $A$ and $B$).






    share|cite|improve this answer











    $endgroup$


















      1












      $begingroup$

      In general it is not very meaningful to ask whether some object is equal to itself. However, a question that often appears is whether a definition makes sense (i.e. if some object is well-defined), insofar as it does not depend on arbitrary choices. If we are trying to show that some object (e.g. function) $T$ is well-defined, this is sometimes written $T = T$. But really that's an abuse of notation.



      If $A,Bsubset C$ and $A + B = C$ (every element of $C$ can be written as a sum of elements of $A$ and $B$), then we write $C = Aoplus B$ if and only if $Acap B = lbrace 0rbrace$. The $oplus$-notation is a kind of shorthand for a sum of subspaces having this intersection property. We don't want to write "let $A,Bsubset C$ st. $A + B = C$ and $Acap B = 0$" everytime this situation occurs, because (a) it occurs often and (b) it has very important consequences (e.g. every element of $C$ can be written uniquely as a sum of elements of $A$ and $B$).






      share|cite|improve this answer











      $endgroup$
















        1












        1








        1





        $begingroup$

        In general it is not very meaningful to ask whether some object is equal to itself. However, a question that often appears is whether a definition makes sense (i.e. if some object is well-defined), insofar as it does not depend on arbitrary choices. If we are trying to show that some object (e.g. function) $T$ is well-defined, this is sometimes written $T = T$. But really that's an abuse of notation.



        If $A,Bsubset C$ and $A + B = C$ (every element of $C$ can be written as a sum of elements of $A$ and $B$), then we write $C = Aoplus B$ if and only if $Acap B = lbrace 0rbrace$. The $oplus$-notation is a kind of shorthand for a sum of subspaces having this intersection property. We don't want to write "let $A,Bsubset C$ st. $A + B = C$ and $Acap B = 0$" everytime this situation occurs, because (a) it occurs often and (b) it has very important consequences (e.g. every element of $C$ can be written uniquely as a sum of elements of $A$ and $B$).






        share|cite|improve this answer











        $endgroup$



        In general it is not very meaningful to ask whether some object is equal to itself. However, a question that often appears is whether a definition makes sense (i.e. if some object is well-defined), insofar as it does not depend on arbitrary choices. If we are trying to show that some object (e.g. function) $T$ is well-defined, this is sometimes written $T = T$. But really that's an abuse of notation.



        If $A,Bsubset C$ and $A + B = C$ (every element of $C$ can be written as a sum of elements of $A$ and $B$), then we write $C = Aoplus B$ if and only if $Acap B = lbrace 0rbrace$. The $oplus$-notation is a kind of shorthand for a sum of subspaces having this intersection property. We don't want to write "let $A,Bsubset C$ st. $A + B = C$ and $Acap B = 0$" everytime this situation occurs, because (a) it occurs often and (b) it has very important consequences (e.g. every element of $C$ can be written uniquely as a sum of elements of $A$ and $B$).







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Jan 19 at 15:49

























        answered Jan 19 at 15:39









        o.h.o.h.

        4616




        4616















            Popular posts from this blog

            MongoDB - Not Authorized To Execute Command

            How to fix TextFormField cause rebuild widget in Flutter

            in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith