In
mathematical logic
Mathematical logic is the study of Logic#Formal logic, formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory (also known as computability theory). Research in mathematical logic com ...
, an (induced) substructure or (induced) subalgebra is a
structure
A structure is an arrangement and organization of interrelated elements in a material object or system, or the object or system so organized. Material structures include man-made objects such as buildings and machines and natural objects such as ...
whose domain is a
subset
In mathematics, a Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they a ...
of that of a bigger structure, and whose functions and relations are restricted to the substructure's domain. Some examples of subalgebras are
subgroup
In group theory, a branch of mathematics, a subset of a group G is a subgroup of G if the members of that subset form a group with respect to the group operation in G.
Formally, given a group (mathematics), group under a binary operation  ...
s,
submonoid
In abstract algebra, a monoid is a set equipped with an associative binary operation and an identity element. For example, the nonnegative integers with addition form a monoid, the identity element being .
Monoids are semigroups with identity ...
s,
subrings,
subfields, subalgebras of
algebras over a field, or induced
subgraphs. Shifting the point of view, the larger structure is called an extension or a superstructure of its substructure.
In
model theory
In mathematical logic, model theory is the study of the relationship between theory (mathematical logic), formal theories (a collection of Sentence (mathematical logic), sentences in a formal language expressing statements about a Structure (mat ...
, the term "submodel" is often used as a synonym for substructure, especially when the context suggests a theory of which both structures are models.
In the presence of relations (i.e. for structures such as
ordered groups or
graphs, whose
signature
A signature (; from , "to sign") is a depiction of someone's name, nickname, or even a simple "X" or other mark that a person writes on documents as a proof of identity and intent. Signatures are often, but not always, Handwriting, handwritt ...
is not functional) it may make sense to relax the conditions on a subalgebra so that the relations on a weak substructure (or weak subalgebra) are ''at most'' those induced from the bigger structure. Subgraphs are an example where the distinction matters, and the term "subgraph" does indeed refer to weak substructures.
Ordered groups, on the other hand, have the special property that every substructure of an ordered group which is itself an ordered group, is an induced substructure.
Definition
Given two
structures ''A'' and ''B'' of the same
signature
A signature (; from , "to sign") is a depiction of someone's name, nickname, or even a simple "X" or other mark that a person writes on documents as a proof of identity and intent. Signatures are often, but not always, Handwriting, handwritt ...
σ, ''A'' is said to be a weak substructure of ''B'', or a weak subalgebra of ''B'', if
* the domain of ''A'' is a subset of the domain of ''B'',
* ''f
A'' = ''f
B'', ''
An'' for every ''n''-ary function symbol ''f'' in σ, and
* ''R
A''
''R
B''
''A
n'' for every ''n''-ary relation symbol ''R'' in σ.
''A'' is said to be a substructure of ''B'', or a subalgebra of ''B'', if ''A'' is a weak subalgebra of ''B'' and, moreover,
* ''R
A'' = ''R
B''
''A
n'' for every ''n''-ary relation symbol ''R'' in σ.
If ''A'' is a substructure of ''B'', then ''B'' is called a superstructure of ''A'' or, especially if ''A'' is an induced substructure, an extension of ''A''.
Examples

In the language consisting of the
binary operation
In mathematics, a binary operation or dyadic operation is a rule for combining two elements (called operands) to produce another element. More formally, a binary operation is an operation of arity two.
More specifically, a binary operation ...
s + and ×,
binary relation
In mathematics, a binary relation associates some elements of one Set (mathematics), set called the ''domain'' with some elements of another set called the ''codomain''. Precisely, a binary relation over sets X and Y is a set of ordered pairs ...
<, and constants 0 and 1, the structure (Q, +, ×, <, 0, 1) is a substructure of (R, +, ×, <, 0, 1). More generally, the substructures of an
ordered field
In mathematics, an ordered field is a field together with a total ordering of its elements that is compatible with the field operations. Basic examples of ordered fields are the rational numbers and the real numbers, both with their standard ord ...
(or just a
field) are precisely its subfields. Similarly, in the language (×,
−1, 1) of groups, the substructures of a
group are its
subgroup
In group theory, a branch of mathematics, a subset of a group G is a subgroup of G if the members of that subset form a group with respect to the group operation in G.
Formally, given a group (mathematics), group under a binary operation  ...
s. In the language (×, 1) of
monoids, however, the substructures of a group are its
submonoid
In abstract algebra, a monoid is a set equipped with an associative binary operation and an identity element. For example, the nonnegative integers with addition form a monoid, the identity element being .
Monoids are semigroups with identity ...
s. They need not be groups; and even if they are groups, they need not be subgroups.
Subrings are the substructures of
rings, and
subalgebras are the substructures of
algebras over a field.
In the case of
graphs (in the signature consisting of one binary relation),
subgraphs, and its weak substructures are precisely its subgraphs.
As subobjects
For every signature σ, induced substructures of σ-structures are the
subobject In category theory, a branch of mathematics, a subobject is, roughly speaking, an object that sits inside another object in the same category. The notion is a generalization of concepts such as subsets from set theory, subgroups from group theory ...
s in the
concrete category
In mathematics, a concrete category is a category that is equipped with a faithful functor to the category of sets (or sometimes to another category). This functor makes it possible to think of the objects of the category as sets with additional ...
of σ-structures and
strong homomorphisms (and also in the
concrete category
In mathematics, a concrete category is a category that is equipped with a faithful functor to the category of sets (or sometimes to another category). This functor makes it possible to think of the objects of the category as sets with additional ...
of σ-structures and σ-
embeddings). Weak substructures of σ-structures are the
subobject In category theory, a branch of mathematics, a subobject is, roughly speaking, an object that sits inside another object in the same category. The notion is a generalization of concepts such as subsets from set theory, subgroups from group theory ...
s in the
concrete category
In mathematics, a concrete category is a category that is equipped with a faithful functor to the category of sets (or sometimes to another category). This functor makes it possible to think of the objects of the category as sets with additional ...
of σ-structures and
homomorphisms in the ordinary sense.
Submodel
In model theory, given a structure ''M'' which is a model of a theory ''T'', a submodel of ''M'' in a narrower sense is a substructure of ''M'' which is also a model of ''T''. For example, if ''T'' is the theory of abelian groups in the signature (+, 0), then the submodels of the group of integers (Z, +, 0) are the substructures which are also abelian groups. Thus the natural numbers (N, +, 0) form a substructure of (Z, +, 0) which is not a submodel, while the even numbers (2Z, +, 0) form a submodel.
Other examples:
# The
algebraic numbers form a submodel of the
complex numbers
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the form a ...
in the theory of
algebraically closed field
In mathematics, a field is algebraically closed if every non-constant polynomial in (the univariate polynomial ring with coefficients in ) has a root in . In other words, a field is algebraically closed if the fundamental theorem of algebra ...
s.
# The
rational numbers
In mathematics, a rational number is a number that can be expressed as the quotient or fraction (mathematics), fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (for examp ...
form a submodel of the
real numbers
In mathematics, a real number is a number that can be used to measurement, measure a continuous variable, continuous one-dimensional quantity such as a time, duration or temperature. Here, ''continuous'' means that pairs of values can have arbi ...
in the theory of
fields.
# Every
elementary substructure of a model of a theory ''T'' also satisfies ''T''; hence it is a submodel.
In the
category of models of a theory and
embedding
In mathematics, an embedding (or imbedding) is one instance of some mathematical structure contained within another instance, such as a group (mathematics), group that is a subgroup.
When some object X is said to be embedded in another object Y ...
s between them, the submodels of a model are its
subobject In category theory, a branch of mathematics, a subobject is, roughly speaking, an object that sits inside another object in the same category. The notion is a generalization of concepts such as subsets from set theory, subgroups from group theory ...
s.
See also
*
Conservative extension (model theory)
*
Elementary substructure
*
End extension
In model theory and set theory, which are disciplines within mathematics, a model \mathfrak=\langle B, F\rangle of some axiom system of set theory T in the language of set theory is an end extension of \mathfrak=\langle A, E\rangle , in symbols \ ...
*
Löwenheim–Skolem theorem
*
Prime model
References
*
*
*
{{Mathematical logic
Mathematical logic
Model theory
Universal algebra