从展示数学思维过程谈数学教学

从展示数学思维过程谈数学教学马华，翟宇毅（西安电子科技大学，西安７１００７１）高等数学是工科院校一门重要而难学的基础理论课，它不但为后继课程提供必需的基础知识，更重要的是，通过它的学习可以培养学生的能力，如逻辑推理能力、建立数学模型的能力、运算能力、...     

Expressing and Describing Experiences. A Case of Showing Versus Saying

Experiences are interpreted as conscious mental occurrences that are of phenomenal character. There is already a kind of (weak) intentionality involved with this phenomenal interpretation. A stricter conception of experiences distinguishes between purely phenomenal experiences and intentional experiences in a narrow sense. Wittgenstein’s account of psychological (experiential) verbs is taken over: Usually, expressing mental states verbally is not describing them. According to this, “I believe” can be seen as an expression of one’s own belief, but not as an expression of a belief about one’s belief. Hence, the utterance “I believe it is raining” shows that I believe that it is raining, although it is not said by these words that I believe that it is raining. Thinking thoughts such as “I believe it is raining, but it is not raining” (a variant of Moore’s paradox) is an absurdity between what is already said by silently uttering “It is not raining” and what is shown by silently uttering “I believe it is raining.” The paper agrees with a main result of Wittgenstein’s considerations of Moore’s paradox, namely the view that logical structure, deducibility, and consistency cannot be reduced solely to propositions—besides a logic of propositions, there is, for example, a logic of assertions and of imperatives, respectively.     

Classes characterized by best-possible approximation by spline functions

Certain classes of functions are introduced which are characterized by their best-possible approximation by splines.Translated from Matematicheskie Zametki, Vol. 8, No. 2, 137–148, August, 1970.     

Convexification of polygons by flips and by flipturns

Simple polygons can be made convex by a finite number of flips, or of flipturns. These results are extended to very general polygons.     

Approximation by chaotic operators and by conjugate classes

We show that every bounded linear operator on a separable, infinite-dimensional Hilbert space H is the sum of two operators in the norm-closure of the set of operators on H that are chaotic in the sense of Devaney. We also observe that the density of several classes of cyclic operators, with respect to the strong operator topology, may be derived from a result by Hadwin et al. (Proc Amer. Math. Soc. 76 (1979) 250-252).     

Algebras Generated by the Bergman and Anti-Bergman Projections and by Multiplications by Piecewise Continuous Functions

The C*-algebra generated by the Bergman and anti-Bergman projections and by the operators of multiplication by piecewise continuous functions on the Lebesgue space L²(Π) over the upper half-plane is studied. Making use of a local principle, limit operators techniques, and the Plamenevsky results on two-dimensional singular integral operators with coefficients admitting homogeneous discontinuities we reduce the study to simpler C*-algebras associated with points and pairs We construct a symbol calculus for unital C*-algebras generated by n orthogonal projections sum of which equals the unit and by m one-dimensional orthogonal projections. Such algebras are models of local algebras at points z ∈∂Π being the discontinuity points of coefficients. A symbol calculus for the C*- algebra and a Fredholm criterion for the operators are obtained. Finally, a C*-algebra isomorphism between the quotient algebra where is the ideal of compact operators, and its analogue for the unit disk is constructed.     

Algebraic structures determined by 3 by 3 matrix geometry

Using a ``3 by 3 matrix trick' we show that multiplication (an algebraic structure) in a *-algebra is determined by the geometry of the *-algebra of the 3 by 3 matrices with entries from , . This is an example of an algebra-geometry duality which, we claim, has applications.

     

Interpolation by neural network operators activated by ramp functions

In this paper, a family of interpolation neural network operators are introduced. Here, ramp functions as well as sigmoidal functions generated by central B-splines are considered as activation functions. The interpolation properties of these operators are proved, together with a uniform approximation theorem with order, for continuous functions defined on bounded intervals. The relations with the theory of neural networks and with the theory of the generalized sampling operators are discussed.     

Strict Betweennesses Induced by Posets as well as by Graphs

For a finite poset P = (V, ≤ ), let _s(P){\cal B}_s(P) consist of all triples (x,y,z) ∈ V ³ such that either x < y < z or z < y < x. Similarly, for every finite, simple, and undirected graph G = (V,E), let B_s(G){\cal B}_s(G) consist of all triples (x,y,z) ∈ V ³ such that y is an internal vertex on an induced path in G between x and z. The ternary relations B_s(P){\cal B}_s(P) and B_s(G){\cal B}_s(G) are well-known examples of so-called strict betweennesses. We characterize the pairs (P,G) of posets P and graphs G on the same ground set V which induce the same strict betweenness relation B_s(P)=B_s(G){\cal B}_s(P)={\cal B}_s(G).     

Solving Fredholm integral equations by approximating kernels by spline quasi-interpolants

We study two methods for solving a univariate Fredholm integral equation of the second kind, based on (left and right) partial approximations of the kernel K by a discrete quartic spline quasi-interpolant. The principle of each method is to approximate the kernel with respect to one variable, the other remaining free. This leads to an approximation of K by a degenerate kernel. We give error estimates for smooth functions, and we show that the method based on the left (resp. right) approximation of the kernel has an approximation order O(h ⁵) (resp. O(h ⁶)). We also compare the obtained formulae with projection methods.     

Approximation by antiderivatives

Let Ω ?C be an open set with simply connected components and suppose that the functionφ is holomorphic on Ω. We prove the existence of a sequence {φ ^(?n)} ofn-fold antiderivatives (i.e., we haveφ ⁽⁰⁾(z)∶=φ(z) andφ ^(?n)(z)=dφ ^(?n?1)(z)/dz for alln ∈ N₀ and z ∈ Ω) such that the following properties hold:

1. For any compact setB ?Ω with connected complement and any functionf that is continuous onB and holomorphic in its interior, there exists a sequence {n _k} such that {φ^?nk} converges tof uniformly onB.
2. For any open setU ?Ω with simply connected components and any functionf that is holomorphic onU, there exists a sequence {m _k} such that {φ^?mk} converges tof compactly onU.
3. For any measurable setE ?Ω and any functionf that is measurable onE, there exists a sequence {p _k} such that {φ ^(-Pk)} converges tof almost everywhere onE.

     

Intersections by hyperplanes

LetA be a finite nonempty family of nonempty disjoint closed and bounded sets in a Banach spaceE which is either separable and the conjugate of some Banach spaceX (i.e.E=X*) or, reflexive and locally uniformly convex. IfC denotes the weak*-closed convex hull of ∪ {A:A ∈A} then the set of points inE ∼C through which there is no hyperplane intersecting exactly one member ofA is discrete (or empty). This research was supported by the National Research Council of Canada, Grant A-3999.     

Approximation by circles

We derive algorithms which permit the inspection of plane hole patterns for their position tolerance. The entire hole pattern is measured by a coordinate measuring machine and then is fitted into the nominal pattern in such a way as to minimize the maximum of the distances between the nominal and the actual positions.

---

Zusammenfassung Wir entwickeln Algorithmen, mit deren Hilfe die Einhaltung der Positionstoleranzen ebener Lochbilder untersucht werden kann. Die Gruppe der Ist-Zentren wird dabei gegenüber der Gruppe der Soll-Zentren so eingepaßt, daß der maximale Abstand zwischen den Soll- und den Ist-Werten minimal ausfällt.