grounded relation

A grounded relation over a sequence of sets is a mathematical object consisting of two components. The first component is a subset of the cartesian product taken over the given sequence of sets, which sets are called the domains of the relation. The second component is just the cartesian product itself.

For example, if $L$ is a grounded relation over a finite sequence of sets, $X_{1},\\ldots,X_{k}$ , then $L$ has the form $L=(F(L),G(L))$ , where $F(L)\\subseteq G(L)=X_{1}\\times\\ldots\\times X_{k}$ .

1 Remarks

•
In various language that is used, $F(L)$ may be called the figure or the graph of $L$ , while $G(L)$ may be called the ground of $L$ .
•
The default assumption in almost all applications is that the domains of the grounded relation are nonempty sets, hence departures from this assumption need to be noted explicitly.
•
In many applications all relations are considered relative to explicitly specified grounds. In these settings it is conventional to refer to grounded relations somewhat more simply as “relations”.
•
One often hears or reads the usage $``L\\subseteq X_{1}\\times\\ldots\\times X_{k}"$ when the speaker or writer really means $``F(L)\\subseteq X_{1}\\times\\ldots\\times X_{k}"$ . Be charitable in your interpretations.
•
The cardinality of $G(L)$ is referred to as the adicity or the arity of the relation. For example, in the finite case, $L$ may be described as $k$ -adic or $k$ -ary.
•
The set $\\mathrm{dom}_{j}(L):=X_{j}$ is referred to as the $j^{\\mbox{\\small{th}}}$ domain of the relation.
•
In the special case where $k=2$ , the set $X_{1}$ is called “the domain” and the set $X_{2}$ is called “the codomain” of the relation.

单词	GroundedRelation
释义	grounded relation A grounded relation over a sequence of sets is a mathematical object consisting of two components. The first component is a subset of the cartesian product taken over the given sequence of sets, which sets are called the domains of the relation. The second component is just the cartesian product itself. For example, if $L$ is a grounded relation over a finite sequence of sets, $X_{1},\\ldots,X_{k}$ , then $L$ has the form $L=(F(L),G(L))$ , where $F(L)\\subseteq G(L)=X_{1}\\times\\ldots\\times X_{k}$ . 1 Remarks • In various language that is used, $F(L)$ may be called the figure or the graph of $L$ , while $G(L)$ may be called the ground of $L$ . • The default assumption in almost all applications is that the domains of the grounded relation are nonempty sets, hence departures from this assumption need to be noted explicitly. • In many applications all relations are considered relative to explicitly specified grounds. In these settings it is conventional to refer to grounded relations somewhat more simply as “relations”. • One often hears or reads the usage $``L\\subseteq X_{1}\\times\\ldots\\times X_{k}"$ when the speaker or writer really means $``F(L)\\subseteq X_{1}\\times\\ldots\\times X_{k}"$ . Be charitable in your interpretations. • The cardinality of $G(L)$ is referred to as the adicity or the arity of the relation. For example, in the finite case, $L$ may be described as $k$ -adic or $k$ -ary. • The set $\\mathrm{dom}_{j}(L):=X_{j}$ is referred to as the $j^{\\mbox{\\small{th}}}$ domain of the relation. • In the special case where $k=2$ , the set $X_{1}$ is called “the domain” and the set $X_{2}$ is called “the codomain” of the relation.
随便看	bibliography of many-valued logics and applications BichtelerDellacherieTheorem Bichteler-Dellacherie theorem Biconditional biconditional BicyclicSemigroup bicyclic semigroup BieberbachsConjecture Bieberbach’s conjecture BiextensionalCollapse biextensional collapse Bifurcation bifurcation BifurcationProblemWithSymmetryGroup bifurcation problem with symmetry group BiharmonicEquation biharmonic equation BiholomorphicallyEquivalent biholomorphically equivalent BiholomorphismsOfStronglyPseudoconvexDomainsExtendToTheBoundary biholomorphisms of strongly pseudoconvex domains extend to the boundary Bi-invertible maps Bijection bijection BijectionBetweenClosedAndOpenInterval