Completely nontrivial functional dependence
In a functional dependence, let R(U) be the relation pattern on the property set U, and X and Y be a set of U. If X→Y (Y depends on X), and Y is not a sub-set of X (this is a non-trivial functional dependence), and for any proper sub-set X'of X, X' cannot determine Y (that is, the property of complete functional dependence), then Y is said to be completely non-trivial functional dependence on X. For example, in a relationship model (student number, course number) → grade, grade depends non-trivial on (student number, course number), and neither student number nor course number alone can determine grade. This is a completely non-trivial functional dependence. The Extraordinary Ordinary Life novel is equally exciting. Everyone is welcome to click and read it!
trivial and nontrivial functional dependence
If in a functional dependence, the attributes in the right attribute set are all a sub-set of the left attribute set, this functional dependence is called a trivial functional dependence. Conversely, if at least one attribute in the right attribute set is not a sub-set of the left attribute set, it is called a non-trivial functional dependence. For example, in the relation pattern R(A,B,C), if A→A exists, it is a trivial functional dependence, because A on the right is a sub-set of A on the left; if A→B exists, it is a non-trivial functional dependence, because B is not a sub-set of A. The concept of functional dependence was very important in the field of database design. It was an important basis for operations such as the normalisation of the relationship model. The Extraordinary Ordinary Life novel is equally exciting. Everyone is welcome to click and read it!
Non-trivial functional dependence and trivial functional dependence
Let X and Y be the attributes of a relation, and X→Y. If Y is contained in X, then X→Y is called a trivial functional dependence. If Y is not contained in X, then X→Y is called a non-trivial functional dependence. The trivial functional dependence was automatically established because it was determined by the reflexive nature of the functional dependence. The functional dependence that was generally studied was mostly non-trivial functional dependence. The Extraordinary Ordinary Life novel is equally exciting. Everyone is welcome to click and read it!
How to understand partial functional dependence
Let X and Y be the two sets of attributes of relation R. If X→Y exists, and when X 'is a true set of X, X' →Y exists, then Y is said to be partially dependent on X. Simply put, Y could be obtained by depending on X, but Y was not completely dependent on X. There was a proper set of X that could also be obtained by Y. This situation was partial functional dependence. The Extraordinary Ordinary Life novel is equally exciting. Everyone is welcome to click and read it!
What are the non-trivial functional dependence?
Let a relation be R(U), and X and Y be the sets of attributes U. If X→Y and X does not contain Y, then X→Y is called a non-trivial functional dependence. For example,(student number, course number) → personal score was a non-trivial functional dependence. The Extraordinary Ordinary Life novel is equally exciting. Everyone is welcome to click and read it!
Ordinary Dependence and Extraordinary Dependence
Ordinary dependence refers to the dependence of a certain attribute set on itself in the relationship. For example, in a set composed of attributes A and B, the dependence of A and B on themselves (A→A and B→B) is trivial dependence. In a table that stores student performance information, the set of attributes {SNo, CNo, Score},{SNo} → SNo,{CNo, Score} → Score, etc. are also trivial dependence. Nontrivial dependence is if X → Y holds and Y does not belong to X. For example, in a student's report card,{SNo, CNo} → Score is a non-trivial dependence because Score does not belong to the combination key {SNo, CNo}. The Extraordinary Ordinary Life novel is equally exciting. Everyone is welcome to click and read it!
Nontrivial subspace property
A non-trivial subspace is a subspace other than {0} and the space itself (set to V(F)). Let V be a linear space over the number field F, and W be a non-trivial subspace of V. If W is a non-trivial subspace of V, the following properties must be satisfied: 1. Adductive closure: For any two elements in W, their sum is still in W. 2. Number multiplication closure: For any element a and any scaler k in W, their number multiplication k a is still in W. 3. The subspace W must be a linear space, and the linear operation of W on Vn(F) is closed, which means that the operation of W must still exist in this linear space. These properties ensured the relative independence and operational closure of the non-trivial subspace in the original linear space, making it important in applications such as signal processing, machine learning, image processing, and so on. The Extraordinary Ordinary Life novel is equally exciting. Everyone is welcome to click and read it!
The definition of nontrivial subclass
Let N be a subclass of the group G. If N is a nontrivial subclass of G, then N is a nontrivial subclass of G. Where,{e} and {G} are the ordinary normal subgroups of {G}(where {e} is the unit of the group}). The Extraordinary Ordinary Life novel is equally exciting. Everyone is welcome to click and read it!
The difference between ordinary dependence and extraordinary dependence
Ordinary Dependence referred to the fact that a certain attribute in the attribute set depended on itself and did not need to obtain information from other attributes. For example, in a table containing the property set {SNo, CNo, Score},{SNo} → SNo, {CNo, Score} → Score is a trivial dependence. A non-trivial dependence is a non-trivial dependence if X → Y is true and Y does not belong to X. For example, in the student report,{SNo, CNo} → Score is a non-trivial dependence, because the score Score does not belong to the combination key {SNo, CNo}. In summary, the main difference between the two was that ordinary dependence was the dependence of attributes on themselves, while non-ordinary dependence was the dependence of an attribute (set) on another attribute (set) that did not belong to itself. The Extraordinary Ordinary Life novel is equally exciting. Everyone is welcome to click and read it!
There must be a nontrivial normal subclass
Just the phrase "there must be a non-trivial normal subclass" did not clarify the specific direction of the problem. If one were to discuss whether there must be a non-trivial normal subclass under a specific group structure, different groups would have different situations. For example, for some simple groups, the circular group of the number of elements has no normal subclass other than the trivial subclass (because the subclass of the prime order group only consists of the trivial subclass of the unit element and itself). However, in some special classes of groups such as solvable groups, it could be proved that there were non-trivial normal subgroups by definition or related theorem. If it was in a limited group, based on factors such as the order of the group, some theories (such as the Syro theorem and other related tools) could be used to determine whether there was a non-trivial normal subclass. If he could give a more specific group or more context information, he would be able to answer more accurately. The Extraordinary Ordinary Life novel is equally exciting. Everyone is welcome to click and read it!
An example of a nontrivial linear map
The following are some examples of nontrivial linear maps: 1. On the two-dimensional plane, let the space of the two dimensions be the space V = mathbb{R}^2, and define the linear map T: mathbb{R}^2> rightarrowmathbb {R}^2> as T(x,y)=(x + y,x - y). It could be verified that it satisfied the properties of a linear map: - For addition: \(T((x_1,y_1)+(x_2,y_2)) = T(x_1 + x_2,y_1 + y_2)=(x_1 + x_2+y_1 + y_2,x_1 + x_2-(y_1 + y_2))=(x_1 + y_1,x_1 - y_1)+(x_2 + y_2,x_2 - y_2)=T(x_1,y_1)+T(x_2,y_2)\)。 - For the multiplication: T(c(x,y)) = T(cx,cy)=(cx+cy, cx-cy)=c(x + y, x-y)=cT(x,y). 2. Consider the projection map from the\(n\) dimensional space\(V=\mathbb{R}^n\) to the\(m\) dimensional space\(W = \mathbb{R}^m\)(\(n\neq m\)). For example, the map from <<mathbb{R}^3>> to <<mathbb{R}^2>>> is <P: <mathbb{R}^3> rightarrow <mathbb {R}^2>>,<P(x,y,z)=(x,y)>. The linear property could also be verified: - For the addition method: <P((x1, y1, z1)+(x2, y2, z2)) = P(x1 + x2, y1 + y2, z1 + z2)=(x1 + x2, y1 + y2)=P(x1, y1, z1)+P(x1, y1, z1)> - For the multiplication of numbers: P(c(x,y,z)) = P(cx,cy,cz)=(cx,cy)=c(x,y)=cP(x,y,z). The Extraordinary Ordinary Life novel is equally exciting. Everyone is welcome to click and read it!