1. Introduction
The notion of formal computation was introduced in [
1].
Definition 1. The definition of is recursive. ,
.
Definition 2. The definition of is recursive. .
.
,
Use to represent the set , to represent the set .
Use the auxiliary form: .
Definition 3. =Number of .
Definition 4. =Number of , =Number of .
Obviously:.
Use the auxiliary form and each
cannot be exchanged, [
1] draws conclusions:
,
,
.
, is defined as .
For example:
.
.
.
.
. There are recursive relationships:
-
,
.
-
,
.
-
,
.
Consider the general two-dimensional second-order linear recursive equations:
.
It can also be calculated in a similar way to
, which is easier to understand.
itself requires
and can’t change the sign, so that three forms exist. Many conclusions have been drawn [
1]:
- 1.
.
- 2.
. .
- 3.
- 4.
- 5.
.
- 6.
.
Recurrence relations → 1), inversion → 2). 1) → 3)4)5). 5) is the basis of .
6) show that can be great than 1. Regardless of the practical implications, we can make the definition domain of PT extend to .
When , so only the case needs to be dealt with. In this paper, if not specified, the default is . .
Definition 5. , .
Definition 6. , .
, is unsigned stirling number of the first kind.
, is stirling number of the second kind.
2. Properties of H(g)
In the calculation of , .
Definition 7. .
Also define .
Theorem 1.
- 1.
.
- 2.
.
- 3.
.
- 4.
.
- 5.
.
- 6.
.
Proof.
. Using induction to prove 2).
.
in has three sources.
(*)
.
(*).
5) and 6) are definitions.
□
Theorem 2. ,
.
.
.
.
3. Symmetric Expressions in H(g)
. It can be inferred from the definition of that can exchange orders. . It is clearly a symmetric function of , we also reached the same conclusion. are also symmetric functions, and there’s no factors.
Definition 8. .
Obviously:
.
.
.
.
.
.
Theorem 3. , .
Proof.
. It’s holds when .
.
is a symmetric function
.
.
The rest only need to consider terms that multiply with .
.
.
the conclusion. □
Definition 9. .
Obviously: . is Eulerian number.
Definition 10. .
Theorem 4. , ,
.
Proof. The coefficient before is obvious, so can be written in that form.
.
.
.
.
□
Similarly, , then are symmetric functions of .
Theorem 5. , .
Theorem 6. , ,
.
Proof.
.
.
.
.
□
4. Properties of Extended Numbers
Theorem 7.
.
.
Proof.
2).
□
because .
Theorem 8.
.
Proof.
.
Based on Crammer’s law,
. [
1]
1), 2).
□
Theorem 9. . .
Proof. 1) is to prove: .
.
Prove 2) in a similar way.
□
By recurrence relation:
Theorem 10. .
Theorem 11.
.
Proof. Based on Crammer’s law,
. [
1]
.
.
1), 2).
□
.
Theorem 12. . .
Proof.
1).
2).
□
is a constant, 1 or 2, there are M-1 intervals between factors. is defined as continuity, is defined as discontinuity.
Definition 11. , count of discontinuities=g.
Obviously, , have items.
,
,
By definition:
Theorem 13. ,
.
.
.
=Changed . Select M-g from M factors, change i to (T-i).
.
=Changed . Select M-g from M factors, change i to (T+i-1).
.
For example, express the product in terms of ():
,
.
,
.
5. The Formulas for Symmetric Functions
If
and
,
. 1 → [
1]:
.
.
1 →, 3→
Theorem 14. .
.
.
.
.
1 →, 5→
Theorem 15. .
Compared to 14, this is a little different.
Theorem 16. ,
.
.
.
Proof. By the definition of , there clearly is:
.
Let , 1→ the rest.
□
Special:
.
.
From , it’s easy to get:
. .
The extension can be obtained with .
,
Theorem 17. .
.
.
Proof. Proof of the third equation. From and the first equation,
it can be seen that and have the same thing:
11 the expression.
The same conclusion can be obtained by combining definition of and 11.
□
,
Theorem 18. ,
.
.
,
Theorem 19. .
.
,
Theorem 20. ,
.
.
Theorem 21. ,
.
Proof.
,
.
.
.
□
.
.
.
6. PT=PS and Its Promotion
, promoting it:
Theorem 22. , then
,,
, .
Proof.
Using induction and the recurrence relationship one can obtain .
, 2→
.
.
can be obtained from the definition. .
□
Theorem 23. , then
, ,
.
Proof. 2 & 22 .
. Recurrence relation & induction on p .
can be obtained from the definition. .
□
Using similar methods:
Theorem 24. ,
, then
, ,
,
.
7. Transformation of SUM(N)
.
No need to know the value of . Any polynomial can be converted to .
By choosing and appropriately, can be converted to . However, it is generally necessary to solve higher-order equations to solve for . But specifies that every nested sum can be flattened, converting to .
,, , can be converted to . . It is only necessary to solve the system of linear equations to find . so them can also be converted to .
Special:
.
.
.
can also be converted to .
.
Special: .
References
- Peng Ji. Formal calculation. https://www.preprints.org/manuscript/202305.0311/v3. 2023. [CrossRef]
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).