Ph. D. & Dr. Sc. Lev Gelimson's General Problem Solving Strategy Theory in Fundamental Science on General Problem Solving Strategy

General Problem Solving Strategy Theory in Fundamental Science on General Problem Solving Strategy

© Ph. D. & Dr. Sc. Lev Gelimson

Academic Institute for Creating Fundamental Sciences (Munich, Germany)

Mathematical Journal

of the "Collegium" All World Academy of Sciences

Munich (Germany)

11 (2011), 32

Introduction

In classical philosophy and mathematics, some problem solving stages such as problem analysis, synthesis, and transformation, solving method selection and application, problem solution test (check) and estimation are well-known. But in classical mathematics [1], there is no sufficiently general concept of a quantitative mathematical problem. For problem analysis and synthesis, the usual concepts of real and cardinal numbers (whose sets cannot represent many urgent quantities), of a Cantor set (which ignores element quantities and cannot represent many urgent unions of objects with quantities), of at most countable operation ignoring operand quantities, etc. cannot be applied to very many types of urgent problems, nothing to say on adequacy [2-5]. Known equivalent transformations applied to contradictory problems can lead to results with no objective sense [2-5]. The only known method applicable to contradictory (e.g., overdetermined) problems is the least square method (LSM) [1] by Legendre and Gauss. Overmathematics [2-4] and the system of fundamental sciences on general problems [5] have discovered many principal shortcomings of this method with no problem solution test (check) and estimation and no objective sense of the result. The same [2-5] holds for such well-known problem solution estimators as the absolute and relative errors [1].

General Problem

General problem type and setting theory (GPTST) in fundamental science on general problem essence [5] defines a general quantitative mathematical problem, or simply a general problem, to be a quantisystem [2-5] (former hypersystem) P which includes unknown quantisubsystems and possibly includes its general subproblems.

In particular, a general problem can be a quantiset

_q(λ)R_λ{_φ∈Φ _r(φ)f_φ[_ω∈Ω _s(ω)z_ω]} (λ∈Λ)

of indexed known quantirelations _q(λ)R_λ (with their own, or individual, quantities q(λ)) [2-5] over indexed unknown quantifunctions (dependent variables), or simply unknowns (with their own, or individual, quantities r(φ)), _r(φ)f_φ , of indexed independent known quantivariables _s(ω)z_ω (with their own, or individual, quantities s(ω), all of them belonging to their possibly individual vector spaces, in their initial forms without any further transformations

where

R_λ is a known relation with index λ from an index set Λ ;

f_φ is an unknown function (dependent variable) with index φ from an index set Φ ;

z_ω is a known independent variable with index ω from an index set Ω ;

[_ω∈Ω _s(ω)z_ω]

is a quantiset of indexed quantielements _s(ω)z_ω .

Nota bene: Own, or individual, quantities play the roles of the weights of quantiset elements. In particular, q(λ) is the own, or individual, quantity (former hyperquantity) [2-5] as a weight of relation R_λwith index λ in a quantiset

_q(λ)R_λ{_φ∈Φ _r(φ)f_φ[_ω∈Ω _s(ω)z_ω]} (λ∈Λ).

Replace all the unknown quantisubsystems, or simply unknown variables, or unknowns (in the above particular case, unknown quantifunctions), with their possible ”values” which are known quantisubsystems (in the above particular case, some known quantifunctions). Then a general problem which is a quantisystem [2-5] (former hypersystem) P including unknown quantisubsystems becomes the corresponding known quantisystem without any unknowns. To conserve the quantisystem form, let us use the same designations for these known quantisystem and quantisubsystems, too. This known quantisystem can be further estimated qualitatively and (or) quantitatively discretely (e.g., either true or false) or continuously (e.g., via absolute and relative errors [1], unierrors, reserves, reliabilities, and risks [2-5]). If a quantisystem of pseudosolutions to a general problem transforms this problem into a known true quantisystem, then this pseudosolutions quantisystem (or simply a pseudosolution by obviously using the system meta-level) is a solutions quantisystem (or simply a solution by obviously using the system meta-level) to this general problem.

In quantitative mathematical problems, namely equations and inequations are the most typical relations.

General Problem Pseudosolution

General problem pseudosolution theory (GPPST) in fundamental science of general problem pseudosolution defines both a pseudosolution to a general problem and arts (particular cases) of a pseudosolution which are conditional pseudosolutions.

Further we need some useful definitions and agreements [2-5].

A pseudosolution to a general problem is an arbitrary quantisystem of such values of all the corresponding variables that, after replacing each variable with its value, the general problem becomes a determinable (e.g., true or false) known quantisystem. In the above particular case, this is a known quantiset of relations containing known elements only, and each of its relations becomes determinable (e.g., true or false).

A (precise) solution to a general problem is an arbitrary quantisystem of such values of all the corresponding variables that, after replacing each variable with its value, the general problem becomes a true known quantisystem. In the above particular case, this is a known quantiset of relations containing known elements only, and each of its relations becomes true.

A quasisolution to a general problem by a specific realization of a certain method or theory is a pseudosolution (to this general problem) which has the least unierror and/or the greatest reserve (by this realization of this method or theory) among all the pseudosolutions to this general problem.

Nota bene: A quasisolution is not necessarily a solution, which is especially important in contradictory general problems that have no solutions in principle but can possess quasisolutions.

A supersolution to a general problem by a specific realization of a certain method or theory is a solution (to this general problem) which has the greatest reserve (by this realization of this method or theory) among all the solutions to this general problem.

Nota bene: A supersolution a general problem not necessarily coincides with its quasisolution because the set of the solutions is a subset of the set of the pseudosolutions. If the both exist, then the quasisolution (which is not necessarily a solution) has a not less reserve in comparison with the supersolution. If in the last comparison, namely the strict inequality holds, then the quasisolution is certainly no solution.

An antisolution to a general problem by a specific realization of a certain method or theory is a pseudosolution (to this general problem) which has the greatest unierror and/or the least reserve (by this realization of this method or theory) among all the pseudosolutions to this general problem.

Notata bene:

1. Quasisolutions and supersolutions, as well as antisolutions, not necessarily exist because a set of unierrors or reserves not necessarily contains its greatest lower bound and its least upper one, respectively.

2. The concepts of conditional pseudosolutions (in particular, quasisolutions, supersolutions, and antisolutions) are relative depending not only on the corresponding condition, criterion, method, or theory, but also on the precise setting of a general problem. For example, a quasisolution to a contradictory general problem is namely a quasisolution if the precise setting of a general problem is precisely satisfying all the contradictory conditions of a given general problem. But the same quasisolution becomes a precise solution to the same contradictory general problem by its other setting when general problem contradictoriness measure minimization (instead of precisely satisfying all the contradictory conditions of a given general problem) is required (desired). All the more, an antisolution to a contradictory general problem is namely an antisolution if the precise setting of a general problem is precisely satisfying all the contradictory conditions of a given general problem. But the same antisolution becomes a precise solution to the same contradictory general problem by its other setting when general problem contradictoriness measure maximization (instead of precisely satisfying all the contradictory conditions of a given general problem) is required (desired).

General Problem Solving Strategy

General problem solving strategy theory (GPSST) in fundamental science on general problem solving strategy gives a synergetic strategy of solving any general problems via applying overmathematics [2-4] and the system of fundamental sciences on general problems [5] to general problem analysis, synthesis, and transformation, solving method selection and application, general problem pseudosolution test (check) and estimation. In particular, this theory applies:

uninumbers, quantisets, quantisystems, and uniquantities [2-5] to general problem analysis and synthesis;

invariant general problem transformations [2-5];

both known (by adequacy) and new universal and adequate solving theories and methods [2-5];

invariant distances and new universal and adequate unierrors and reserves [2-5] to general subproblem pseudosolution test (check) and estimation;

quantibounds [2-5] and other universal and adequate functions of distances, unierrors and reserves along with the moduli of their differences to general problem pseudosolution test (check) and estimation.

General Problem Analysis and Synthesis

To provide general problem analysis, suppose (which is typical) that a general problem P consists of separate general subproblems (e.g., relations) P_β with their own positive quantities q(β)

P = {_β∈Β _q(β)P_β}

(where index β belongs to index set Β)

and there is a nonnegative estimator E [2-5]

E(P_β) ≥ 0 (β∈Β)

(e.g., distance which is invariant by coordinate system rotations, unierror, etc.) common for all these general subproblems.

To provide general problem synthesis, explicitly give some suitable nonnegative subproblems estimations unification functions F of all

E(P_β) ≥ 0 (β∈Β)

with the same own quantities q(β). Each of such functions has to provide applying nonnegative estimator E to the whole general problem P with building its nonnegative total estimation

E(P) = F[_β∈Β _q(β)E(P_β)] ≥ 0.

General problem solving strategy theory (GPSST) in fundamental science on general problem solving strategy is very efficient by solving many urgent (including contradictory) problems.

Acknowledgements to Anatolij Gelimson for our constructive discussions on coordinate system transformation invariances and his very useful remarks.

References

[1] Encyclopaedia of Mathematics. Ed. M. Hazewinkel. Volumes 1 to 10. Kluwer Academic Publ., Dordrecht, 1988-1994

[2] Lev Gelimson. Elastic Mathematics. General Strength Theory. The ”Collegium” International Academy of Sciences Publishers, Munich, 2004

[3] Lev Gelimson. Providing Helicopter Fatigue Strength: Flight Conditions. In: Structural Integrity of Advanced Aircraft and Life Extension for Current Fleets – Lessons Learned in 50 Years After the Comet Accidents, Proceedings of the 23rd ICAF Symposium, Dalle Donne, C. (Ed.), 2005, Hamburg, Vol. II, 405-416

[4] Lev Gelimson. Overmathematics: Fundamental Principles, Theories, Methods, and Laws of Science. The ”Collegium” All World Academy of Sciences Publishers, Munich, 2010

[5] Lev Gelimson. General Problem Fundamental Sciences System. The ”Collegium” All World Academy of Sciences Publishers, Munich, 2011