Global Information Lookup Global Information

Linearly disjoint information


In mathematics, algebras A, B over a field k inside some field extension of k are said to be linearly disjoint over k if the following equivalent conditions are met:

  • (i) The map induced by is injective.
  • (ii) Any k-basis of A remains linearly independent over B.
  • (iii) If are k-bases for A, B, then the products are linearly independent over k.

Note that, since every subalgebra of is a domain, (i) implies is a domain (in particular reduced). Conversely if A and B are fields and either A or B is an algebraic extension of k and is a domain then it is a field and A and B are linearly disjoint. However, there are examples where is a domain but A and B are not linearly disjoint: for example, A = B = k(t), the field of rational functions over k.

One also has: A, B are linearly disjoint over k if and only if subfields of generated by , resp. are linearly disjoint over k. (cf. Tensor product of fields)

Suppose A, B are linearly disjoint over k. If , are subalgebras, then and are linearly disjoint over k. Conversely, if any finitely generated subalgebras of algebras A, B are linearly disjoint, then A, B are linearly disjoint (since the condition involves only finite sets of elements.)

and 27 Related for: Linearly disjoint information

Request time (Page generated in 0.8472 seconds.)

Linearly disjoint

Last Update:

some field extension Ω {\displaystyle \Omega } of k are said to be linearly disjoint over k if the following equivalent conditions are met: (i) The map...

Word Count : 329

Tensor product

Last Update:

and Y {\displaystyle Y} are T {\displaystyle T} -linearly disjoint if and only if for all linearly independent sequences x 1 , … , x m {\displaystyle...

Word Count : 8640

Tensor product of fields

Last Update:

theory.) Subfields K and L of M are linearly disjoint (over a subfield N) when in this way the natural N-linear map of K ⊗ N L {\displaystyle K\otimes...

Word Count : 1826

Linear separability

Last Update:

{\displaystyle x} . Equivalently, two sets are linearly separable precisely when their respective convex hulls are disjoint (colloquially, do not overlap). In simple...

Word Count : 1355

Tensor product of algebras

Last Update:

Extension of scalars Tensor product of modules Tensor product of fields Linearly disjoint Multilinear subspace learning Kassel (1995), p. 32. Lang 2002, pp...

Word Count : 1061

Total order

Last Update:

a total order is a totally ordered set; the terms simply ordered set, linearly ordered set, and loset are also used. The term chain is sometimes defined...

Word Count : 3094

Regular extension

Last Update:

k} (that is, to say, L , k ¯ {\displaystyle L,{\overline {k}}} are linearly disjoint over k). Regularity is transitive: if F/E and E/K are regular then...

Word Count : 341

Separable extension

Last Update:

is a separable extension of F, E p {\displaystyle E^{p}} and F are linearly disjoint over F p , {\displaystyle F^{p},} F 1 / p ⊗ F E {\displaystyle F^{1/p}\otimes...

Word Count : 3073

Glossary of field theory

Last Update:

closure of F in E is purely inseparable over F; equivalently, E is linearly disjoint from the separable closure of F. Purely transcendental extension An...

Word Count : 2063

Injective tensor product

Last Update:

and Y {\displaystyle Y} are T {\displaystyle T} -linearly disjoint if and only if for all linearly independent sequences x 1 , … , x m {\displaystyle...

Word Count : 8577

Glossary of commutative algebra

Last Update:

of any composition series. linearly disjoint Two subfields of a field extension K over a field k are called linearly disjoint if the natural map from their...

Word Count : 9767

Field of definition

Last Update:

k(V) that is linearly independent over k is also linearly independent over kalg. In other words those extensions of k are linearly disjoint. André Weil...

Word Count : 1617

Symmetric product of an algebraic curve

Last Update:

level of function fields it is possible to construct J by taking linearly disjoint copies of the function field of C, and within their compositum taking...

Word Count : 582

Path graph

Last Update:

the trees in which no vertex has degree 3 or more. A disjoint union of paths is called a linear forest. Paths are fundamental concepts of graph theory...

Word Count : 288

Bayesian linear regression

Last Update:

\gamma )} . The latter part is usually ignored under the assumption of disjoint parameter sets. More so, under classic assumptions X {\displaystyle \mathbf...

Word Count : 3170

Linearly ordered group

Last Update:

In mathematics, specifically abstract algebra, a linearly ordered or totally ordered group is a group G equipped with a total order "≤" that is translation-invariant...

Word Count : 1425

Matroid

Last Update:

the matroid whose underlying set is the disjoint union of E and F, and whose independent sets are the disjoint unions of an independent set of M with an...

Word Count : 8751

Primary extension

Last Update:

inseparable over K. An extension L/K is primary if and only if it is linearly disjoint from the separable closure of K over K. A subextension of a primary...

Word Count : 145

Order topology

Last Update:

open intervals and rays. A topological space X is called orderable or linearly orderable if there exists a total order on its elements such that the order...

Word Count : 2107

Connected space

Last Update:

topological space that cannot be represented as the union of two or more disjoint non-empty open subsets. Connectedness is one of the principal topological...

Word Count : 3815

Amalgamation property

Last Update:

structures has the strong amalgamation property (SAP), also called the disjoint amalgamation property (DAP), if for every amalgam with A,B,C ∈ K there...

Word Count : 817

Eulerian path

Last Update:

connected graph is Eulerian if and only if it is the disjoint union of some cycles. Hierholzer developed a linear time algorithm for constructing an Eulerian tour...

Word Count : 3269

List of data structures

Last Update:

K-ary tree And–or tree (a,b)-tree Link/cut tree SPQR-tree Spaghetti stack Disjoint-set data structure (Union-find data structure) Fusion tree Enfilade Exponential...

Word Count : 911

Maximum disjoint set

Last Update:

In computational geometry, a maximum disjoint set (MDS) is a largest set of non-overlapping geometric shapes selected from a given set of candidate shapes...

Word Count : 4745

Linear continuum

Last Update:

order theory, a continuum or linear continuum is a generalization of the real line. Formally, a linear continuum is a linearly ordered set S of more than...

Word Count : 1370

Time complexity

Last Update:

O(n)} . Informally, this means that the running time increases at most linearly with the size of the input. More precisely, this means that there is a...

Word Count : 5004

Riesz space

Last Update:

}}y} in a vector lattice X {\displaystyle X} are said to be lattice disjoint or disjoint if inf { | x | , | y | } = 0 , {\displaystyle \inf\{|x|,|y|\}=0,}...

Word Count : 5296

PDF Search Engine © AllGlobal.net