• KidnappedByKitties@lemm.ee
      link
      fedilink
      English
      arrow-up
      7
      ·
      8 months ago

      This is such an understated but useful description in this context. It’s also how I understood algebra for applied matrix computation.

      • Leate_Wonceslace@lemmy.dbzer0.com
        link
        fedilink
        English
        arrow-up
        5
        arrow-down
        1
        ·
        edit-2
        8 months ago

        I was just coming down from THC when I wrote this, so I’m extra jazzed you liked it. 😁

        Edit: also, love the username.

    • Gnome Kat@lemmy.blahaj.zone
      link
      fedilink
      English
      arrow-up
      4
      ·
      8 months ago

      Its the algebraic properties that are important, not all vectors are n-tuples, eg the set of polynomials of degree less than n.

      You need a basis to coordinate a vector, you can work with vectors without doing that and just deal with the algebraic properties. The coordinate representation is dependent on the basis chosen and isn’t fundamental to the vector. So calling them n-tuples isn’t technically correct.

      You can turn them into a set of coordinates if you have a basis, but the fact that you can do that is because of the algebraic properties so it’s those properties which define what a vector is.

      • Leate_Wonceslace@lemmy.dbzer0.com
        link
        fedilink
        English
        arrow-up
        1
        arrow-down
        1
        ·
        edit-2
        8 months ago

        I think a better example to show how vectors don’t necessarily need to be what people conceptualize as n-tuples would have been the real numbers. (Of course, these can be considered 1-tuples, but the same can be said of any arbitrary set element that is not itself a tuple with more entries.) A cooler example would have been R[x] (the ring of real-valued polynomials of a single variable) especially since an isomorphic ring using n-tuples would be a more cumbersome representation of the algebra.