Skip to main content

Algebras Over A Field

  • Chapter
Foundations of Linear Algebra

Part of the book series: Kluwer Texts in the Mathematical Sciences ((TMS,volume 11))

Abstract

Up to now we have not considered the possibility of multiplying two vectors to obtain another vector, though we have noted that this is possible in certain cases. For example, we can multiply elements of the vector space n×n (F) over a field F. A vector space V over a field F is an algebra over F if and only if there exists a bilinear transformation (v, w)vw from V × V to V satisfying the following additional conditions:

$${\text{u(v + w) = uv + uw}}$$
((1))
$${\text{(u + v)w = uw + vw; and}}$$
((2))
$${\text{a(vw) = v(aw) = (av)w}}$$
((3))

for all a ∈ F and all u, v, w ∈ V. In case the additional condition

$${\text{u}}\left( {{\text{uw}}} \right){\text{ }} = {\text{ }}\left( {{\text{uv}}} \right){\text{w}}$$
((4))

is satisfied for all u, v, w ∈ V the algebra V is associative. A subspace of V which is closed under this multiplication is called a subalgebra of V.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Golan, J.S. (1995). Algebras Over A Field. In: Foundations of Linear Algebra. Kluwer Texts in the Mathematical Sciences, vol 11. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8502-6_18

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-8502-6_18

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4592-8

  • Online ISBN: 978-94-015-8502-6

  • eBook Packages: Springer Book Archive

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us

Policies and ethics