Fundamental Math

Let's parent \(\tilde{P}\) having children \(P_1\) and \(P_2\), where at \(t_0\) the children started to communicate by repeating words from their parent such as \(w_1\), \(w_2\), \(w_3\) and so forth. Where those words point to actual entities such as: \(E_1\), \(E_2\), \(E_3\) and so forth. In this case, we can see that at \(t_0\), we identify a collection of words repeated by the children.

\[ C(w) = \{w_1, w_2, w_3, \cdots\} \]

We also identify a collection of entities such as

\[ C(E) = \{E_1, E_2, E_3, \cdots\} \]

As we can see the words from the collection of words are good words, where all of them point to actual entities. In terms of communication between the children to their parent \(\tilde{P}\), let's \(S_1(w)\) be a sentence repeated by the children.

\[ S_1(w) = w_1 + w_2 + w_3 + \cdots \]

We can see that the sentence is a good sentence and it is made of good words. Here, it does not matter, it can be one or more sentences repeated by the children to their parent. From that sentence, then we have the communication function in the form below.

\[ f(x) = A(P_1 + P_2 + \tilde{P})\,x \]

Here again, both children do not have to be a part of the communication. The communication function above can be a single child communicates with parent \(\tilde{P}\). Now, at \(t_1\), the children include bad words in the collection as shown below.

\[ \hat{C}(\bar{w}) = \{\bar{w}_1,\, w_2,\, \bar{w}_3,\, w_4,\, \cdots\} \]

From above, we can see that at \(C(w)\) which does not include bad words, where \(\hat{C}(\bar{w})\) which includes bad words. Now, at \(t_1\) let's represent a sentence from the children to their parent.

\[ S_2(\bar{w}) = \bar{w}_1 + w_2 + \bar{w}_3 + \cdots \]

From above, we can see that sentence includes bad words and it is a bad sentence. Where the communication function of that sentence is in the form of:

\[ f(\bar{x}) = -A(P_1 + P_2 + \tilde{P})\,x \]

Now, if we break the communication function above, we can see that

\[ f(\bar{x}) = -AP_1 x - AP_2 x - A\tilde{P}x \]

What is important here is that at \(t_0\), we have \(A\tilde{P}x\), where at \(t_1\) we have \(-A\tilde{P}x\). In this case, we can see that

\[ -Ax \neq Ax \]

Now, we can see that have a problem to solve. Because of the term above, there is ambiguity for the children to communicate with parent \(\tilde{P}\) or for the parent to understand the children. To solve this problem, we must remove bad words from the collection. In order to do so, we can look at the structure of the words at \(t_0\), where the words are identified as good words. In this case, we can see there is a similarity between them where we can use that structure to eliminate bad words from the collection. Refer to Understanding the Principles of Communication and Application Modeling Tutorial with Practical Examples Communication Domain Vol. II or Project Modeling Tutorial with Practical Examples Communication Domain Vol. II.

Explore More in Natural Dictionary

Practice word elimination and explore the full dictionary in our interactive app.

Open Natural Dictionary App