Vicipaedia

Quantum redactiones paginae "Functio" differant

Browse history interactively
← Differentia superiorDifferentia proxima →
Content deleted Content added
VisualWikitext
m →‎Bibliographia: use character instead of entity for u-umlaut
m +Refs
Linea 1:
[[Fasciculus:Graph of example function.svg|thumb|Charta functionis exemplaris,<br /> <math>\begin{align}&\scriptstyle \\ &\textstyle f(x) = \frac{(4x^3-6x^2+1)\sqrt{x+1}}{3-x}\end{align}</math><br /> <!--Both the domain and the range in the picture are the set of real numbers between &minus;1 and 1.5.--> ]]
'''Functio''' est congruentia inter duas [[copia]]s, quae determinat unum secondaesecundae copiae elementum
ad elementum quemque primae copiae.<ref>Behnke et al, p. 64.</ref> Prima copia dicitur
''dominium,'' altera ''codominium.'' Si <math>x</math>
nominat''dominium''&thinsp;; elementumaltera, ''codominium.'' Si <math>x</math> nominat quendamquoddam primae copiae elementum, <math>x</math> est ''variabilis dependens. Si <math>f</math> est functio, possumus scribere <math>y = f(x)</math>, quod significat "'y' est Sielementum codominii ad x elementum dominii respondens." Deinde <math>fy</math> est variabilis independens.
est functio, possumus scribere <math>y = f(x)</math>, quod significat ''y est elementum codominii
ad x elementum dominii respondens.'' Deinde <math>y</math> est ''variabilis independens.''
 
Si sunt plures quantitates <math>y</math> ad x elementum respondentes, congruentia ''non'' est
functio. Exempli gratia: sit <math>f(x) = \pm \sqrt{x}</math>, et sint dominium et codominium copia
[[numerus|numerorum]] realium <math>\mathbb{R}</math>. Haec congruentia non est functio, quod ad elementum <math>x</math> (sicut 4) respondent duae elementa (sicut 2, -2). Sed si codominium est copia numerorum realium non-negativorum, vel si functio est <math>f(x) = + \sqrt{x}</math>, haec congruentia functio est.
(sicut 4) respondent duae elementa (sicut 2, -2). Sed si codominium est copia numerorum realium non-negativorum,
vel si functio est <math>f(x) = + \sqrt{x}</math>, haec congruentia functio est.
 
Licet functio definire per formulam aut regulam aut tabulam, dum sit modo unum elementum codominii quod ad elementum quemque dominii respondat.
elementum quemque dominii respondat.
 
[[Analysis]] est theoria functionum. Analysis numerorum realium est theoria functionum quarum dominium (et codominium) est <math>\mathbb{R}</math>; [[complexorum numerorum analysis|analysis numerorum complexorum]], earum quarum dominium est <math>\mathbb{C}</math>. G. H. Hardy dicit, "Haec notio, ut quantitas variabilis dependet ex alia, est fortasse notio maximi momenti per totam rem mathematicam."<ref>Hardy, p. 40.</ref>
(et codominium) est <math>\mathbb{R}</math>; [[complexorum numerorum analysis|analysis numerorum complexorum]],
earum quarum dominium est <math>\mathbb{C}</math>. G. H. Hardy dicit, "Haec notio, ut quantitas variabilis dependet ex alia, est fortasse notio maximi momenti per totam rem mathematicam."<ref>Hardy, p. 40</ref>
 
Si dominium est copia quantitatum binarum, sicut <math>\mathbb{R}^2</math>, functio habet duas variabiles dependentes. Exempli gratia, <math>f(x, y) = x^2 + y^2</math>. Hac functione <math>f</math> par <math>(x, y)</math> ad unum elementum codominii (quod est <math>\mathbb{R}</math>) congruit, sicut par <math>(2, 3)</math> cum <math>2^2 + 3^2 = 4 + 9 = 13</math> congruit. Possumus habere functiones trium, quattuor, vel plurimorum variabilum dependentium.
Exempli gratia, <math>f(x, y) = x^2 + y^2</math>. Hac functione <math>f</math> par <math>(x, y)</math> ad
unum elementum codominii (quod est <math>\mathbb{R}</math>) congruit, sicut par <math>(2, 3)</math> congruit
ad <math>2^2 + 3^2 = 4 + 9 = 13</math>. Possumus habere functiones trium, quattuor, vel plurimorum variabilum
dependentium.
 
Altera notatio functionum est ''notatio lambda,'' quae nominat variabiles dependentesdependentis post lambda litteram. Scribimus: <math>f = \lambda(x).x^2</math> vel <math>f(x) = x^2</math> ad eandem functionem describendam. Forma sicut <math>\lambda(x).x^2</math> est [[combinator]].
Forma sicut <math>\lambda(x).x^2</math> est [[combinator]].
 
Si ad elementum quendam <math>y</math> codominii respondat aut nullum aut unum modo elementum <math>x</math> dominii, functio est [[functio iniectiva]], aut functio unum elementum ad unum elementum attribuens. Si omne elementum <math>y</math> codominii habet elementum <math>x</math> (aut plura elementa <math>x_1, x_2, x_3,</math> ...) dominii quod ad <math>y</math> correspondet, functio est [[functio suriectiva]]. Functio et iniectiva et suriectiva est [[functio biiectiva]].
functio est [[functio iniectiva]], aut functio unum elementum ad unum elementum attribuens. Si omne elementum
<math>y</math> codominii habet elementum <math>x</math> (aut plura elementa <math>x_1, x_2, x_3,</math> ...) dominii
quod ad <math>y</math> correspondet, functio est [[functio suriectiva]]. Functio et iniectiva et suriectiva est
[[functio biiectiva]].
 
Si functio <math>f</math> est biiectiva, habet [[functio inversa|functionem inversam]] <math>f^{-1}</math>, cuius dominium est codominium functionis <math>f</math>, et codominium est dominium functionis <math>f</math>. Si <math>f(x) = y</math>, est ergo <math>f^{-1}y = x</math>. Exempli gratia, sit <math>f(x) = x/2</math>; deinde functio inversa <math>f^{-1}(x) = 2x</math>. Saepius difficile est scribere formulae functionis inversae.
<math>f(x) = y</math>, est ergo <math>f^{-1}y = x</math>. Exempli gratia, sit <math>f(x) = x/2</math>; deinde
functio inversa <math>f^{-1}(x) = 2x</math>. Saepius difficile est scribere formulae functionis inversae.
 
''Compositio'' functionum est nova functio per quam elementum dominii primae functionis correspondit cum elemento codominii secundae functionis. Si <math>y = f(x), y = g(x)</math> sunt functiones, et si dominum functionis <math>f</math> est (aut continet) codominium functionis <math>g</math>, possumus scribere <math>f \circ g = f(g(x))</math>. Exempli gratia, sint <math>f(x) = x^2, g(x) = \sin(x)</math>. Deinde <math>f \circ g = f(g(x)) = (\sin(x))^2</math>, et <math>g \circ f = g(f(x)) = \sin(x^2)</math>. Non sunt eaedem functiones: si <math>x = \pi, f(g(x)) = (\sin(\pi))^2 = 1</math>, sed <math>g(f(x)) = \sin(\pi^2) \approx -0.43</math>.▼
''Compositio'' functionum est nova functio per quam elementum dominii primae functionis correspondit cum elemento
▲codominii secundae functionis. Si <math>y = f(x), y = g(x)</math> sunt functiones, et si dominum functionis <math>f</math> est (aut continet) codominium functionis <math>g</math>, possumus scribere <math>f \circ g = f(g(x))</math>. Exempli gratia, sint <math>f(x) = x^2, g(x) = \sin(x)</math>. Deinde <math>f \circ g = f(g(x)) = (\sin(x))^2</math>, et <math>g \circ f = g(f(x)) = \sin(x^2)</math>. Non sunt eaedem functiones: si <math>x = \pi, f(g(x)) = (\sin(\pi))^2 = 1</math>, sed <math>g(f(x)) = \sin(\pi^2) \approx -0.43</math>.
 
Copia omnium functionum invertibilium quarum dominium et codominium est eadem copia est [[caterva_(mathematica)|caterva]]. Idemfactor catervae est functio quae ad omne elementum idem elementum coniungit, <math>f(x) = x</math>; operatio catervae est compositio.
<math>f(x) = x</math>; operatio catervae est compositio.
 
==Notae==
Line 48 ⟶ 28:
 
==Bibliographia==
* {{Citation |last=Anton |first=Howard |title=Calculus with Analytical Geometry |year=1980 |publisher=[[John Wiley & Sons|Wiley]] |isbn=978-0-471-03248-9}}
H. Behnke, F. Bachmann, K. Fladt, W. Süss, ed. ''Fundamentals of Mathematics,'' vol 1: ''Foundations
* {{Citation |last=Bartle |first=Robert G. |title=The Elements of Real Analysis |edition=2nd |year=1976 |publisher=Wiley |isbn=978-0-471-05464-1}}
of Mathematics: The Real Number System and Algebra.'' trans. S. H. Gould. Cambridge, MA: MIT Press, 1974.
*Behnke, H., F. Bachmann, K. Fladt, et W. Süss, eds. [[1974]]. ''Fundamentals of Mathematics,'' vol 1: ''Foundations of Mathematics: The Real Number System and Algebra.'' Convertit S. H. Gould. Cantabrigiae Massachusettae: MIT Press.
*Hardy, G. H. Hardy[[1952]]. ''A Course of Pure Mathematics,.'' editioEditio 10a. Cambridge, UKCantabrigiae: Cambridge University Press, 1952.▼
* {{Citation |last=Husch |first=Lawrence S. |title=Visual Calculus |year=2001 |publisher=[[University of Tennessee]] |url=http://archives.math.utk.edu/visual.calculus/ |accessdate=2007-09-27}}
* {{Citation |last=Katz |first=Robert |title=Axiomatic Analysis |year=1964 |publisher=[[D. C. Heath and Company]]}}.
* {{Citation |last=Ponte |first=João Pedro |title=The history of the concept of function and some educational implications |journal=The Mathematics Educator |year=1992 |volume=3 |pages=3–8 |url=http://www.math.tarleton.edu/Faculty/Brawner/550%20MAED/History%20of%20functions.pdf |issue=2}}
* {{Citation |last1=Thomas |first1=George B. |last2=Finney |first2=Ross L. |title=Calculus and Analytic Geometry |edition=9th |year=1995 |publisher=[[Addison-Wesley]] |isbn=978-0-201-53174-9}}
*{{Citation|title=The concept of function up to the middle of the 19th century|first=A. P.|last=Youschkevitch|journal=Archive for History of Exact Sciences|volume=16|issue=1|year=1976|pages=37–85|doi=10.1007/BF00348305}}.
*{{Citation|title=The concept of function in the 19th and 20th centuries, in particular with regard to the discussions between Baire, Borel and Lebesgue|first=A. F.|last=Monna|journal=Archive for History of Exact Sciences|volume=9|issue=1|year=1972|pages=57–84|doi=10.1007/BF00348540}}.
*{{Citation|title=Evolution of the Function Concept: A Brief Survey|first=Israel|last=Kleiner|journal=The College Mathematics Journal|volume=20|issue=4|year=1989|pages=282–300|doi=10.2307/2686848|jstor=2686848|publisher=Mathematical Association of America}}.
*{{Citation|last=Ruthing|first=D.|title=Some definitions of the concept of function from Bernoulli, Joh. to Bourbaki, N.|journal=Mathematical Intelligencer|volume=6|issue=4|pages=72–77|year=1984}}.
*{{Citation|title=The Concept of Function: Aspects of Epistemology and Pedagogy|publisher=Mathematical Association of America|year=1992|first1=Ed|last1=Dubinsky|first2=Guershon|last2=Harel|isbn=0883850818}}.
*{{Citation|title=Historical and pedagogical aspects of the definition of function|last=Malik|first=M. A.|journal=International Journal of Mathematical Education in Science and Technology|volume=11|issue=4|year=1980|pages=489–492|doi=10.1080/0020739800110404}}.
* Boole, George (1854), ''An Investigation into the Laws of Thought on which are founded the Laws of Thought and Probabilities", Walton and Marberly, London UK; Macmillian and Company, Cambridge UK. Republished as a googlebook.
* {{Citation |last=Eves |first=Howard. |title=Foundations and Fundamental Concepts of Mathematics: Third Edition |year=1990 |publisher=Dover Publications, Inc. Mineola, NY |isbn=0-486-69609-X (pbk) }}
* {{Citation |last= Frege |first= Gottlob. |title=Begriffsschrift: eine der arithmetischen nachgebildete Formelsprache des reinen Denkens |year=1879 |publisher=Halle}}
* {{Citation |last=Grattan-Guinness, Ivor and Bornet, Gérard |title=George Boole: Selected Manuscripts on Logic and its Philosophy |year=1997 |publisher=Springer-Verlag, Berlin |isbn=3-7643-5456-9 (Berlin...)}}
* Halmos, Paul R. [[1970]]. ''Naive Set Theory'', Springer-Verlag, New York, ISBN 0-387-90092-6.
* {{Citation |last=Hardy |first=Godfrey Harold |title=A Course of Pure Mathematics |year=1908 |publication-date=1993 |publisher=[[Cambridge University Press]] |isbn=978-0-521-09227-2}}
* Reichenbach, Hans. [[1947]]. ''Elements of Symbolic Logic'', Dover Publishing Inc., New York NY, ISBN 0-486-24004-5.
* Russell, Bertrand. [[1903]]. ''The Principles of Mathematics: Vol. 1'', Cambridge at the University Press, Cambridge, UK, republished as a googlebook.
* Russell, Bertrand. [[1920]]. ''Introduction to Mathematical Philosophy'' (second edition), Dover Publishing Inc., New York NY, ISBN 0-486-27724-0 (pbk).
* Suppes, Patrick. [[1960]]. ''Axiomatic Set Theory'', Dover Publications, Inc, New York NY, ISBN 0-486-61630-4. cf his ''Chapter 1 Introduction''.
* Tarski, Alfred. [[1946]]/ ''Introduction to Logic and to the Methodolgy of Deductive Sciences'', republished 1195 by Dover Publications, Inc., New York, NY ISBN 0-486-28462-x
* Venn, John. [[1881]]. ''Symbolic Logic'', Macmillian and Co., London UK. Republished as a googlebook.
* [[Jean van Heijenoort|van Heijenoort, Jean]] (1967, 3rd printing 1976), ''From Frege to Godel: A Source Book in Mathematical Logic, 1879–1931'', Harvard University Press, Cambridge, MA, ISBN 0-674-32449-8 (pbk)
** Gottlob Frege (1879) ''Begriffsschrift, a formula language, modeled upon that of arithmetic, for pure thought'' with commentary by van Heijenoort, pages 1–82
** Giuseppe Peano (1889) ''The principles of arithmetic, presented by a new method'' with commentary by van Heijenoort, pages 83–97
** Bertrand Russell (1902) ''Letter to Frege'' with commentary by van Heijenoort, pages 124–125. Wherein Russell announces his discovery of a "paradox" in Frege's work.
** Gottlob Frege (1902) ''Letter to Russell'' with commentary by van Heijenoort, pages 126–128.
** David Hilbert (1904) ''On the foundations of logic and arithmetic'', with commentary by van Heijenoort, pages 129–138.
** Jules Richard (1905) ''The principles of mathematics and the problem of sets, with commentary by van Heijenoort, pages 142–144. The [[Richard paradox]].
** Russell, Bertrand. [[1908a]]. ''Mathematical logic as based on the theory of types'', with commentary by [[Willard Quine]], pages 150–182.
** Ernst Zermelo (1908) ''A new proof of the possibility of a well-ordering'', with commentary by van Heijenoort, pages 183–198. Wherein Zermelo rails against Poincaré's (and therefore Russell's) notion of [[impredicative]] definition.
** Ernst Zermelo (1908a) ''Investigations in the foundations of set theory I'', with commentary by van Heijenoort, pages 199–215. Wherein Zermelo attempts to solve Russell's paradox by structuring his axioms to restrict the universal domain B (from which objects and sets are pulled by ''definite properties'') so that it itself cannot be a set, i.e., his axioms disallow a universal set.
** Norbert Wiener (1914) ''A simplification of the logic of relations'', with commentary by van Heijenoort, pages 224–227
** Thoralf Skolem. [[1922]]. ''Some remarks on axiomatized set theory'', with commentary by van Heijenoort, pages 290–301. Wherein Skolem defines Zermelo's vague "definite property".
** Moses Schönfinkel. [[1924]]. ''On the building blocks of mathematical logic'', with commentary by Willard Quine, pages 355–366. The start of ''combinatory logic''.
** John von Neumann. [[1925]]. ''An axiomatization of set theory'', with commentary by van Heijenoort , pages 393–413. Wherein von Neumann creates "classes" as distinct from "sets" (the "classes" are Zermelo's "definite properties"), and now there is a universal set, etc.
** Hilbert, David. [[1927]]. ''The foundations of mathematics'' by van Heijenoort, with commentary, pages 464–479.
* Whitehead, Alfred North, et Bertrand Russell. [[1913]], [[1962]]. ''Principia Mathematica to *56''. Cantabrigiae: at the University Press, Londinii.
 
[[Categoria:Coniunctiones mathematicae]]<!-- = Mathematical relations (or for coniunctiones, read: rationes?)-->
▲G. H. Hardy. ''A Course of Pure Mathematics,'' editio 10a. Cambridge, UK: Cambridge University Press, 1952.
[[Categoria:Mathematica elementaria]]▼
 
[[Categoria:1000 paginae]]<!--Ex en: + Functions and mappings | Basic concepts in set theory-->
▲[[Categoria:Mathematica]]
[[Categoria:1000 paginae]]
 
[[en:Function_(Mathematics)]]
Receptum de "https://la.wikipedia.org/wiki/Functio"