Misplaced Pages

In mathematics, an argument of a function is a value provided to obtain the function's result. It is also called an independent variable.

For example, the binary function ${\displaystyle f(x,y)=x^{2}+y^{2}}$ has two arguments, ${\displaystyle x}$ and ${\displaystyle y}$, in an ordered pair ${\displaystyle (x,y)}$. The hypergeometric function is an example of a four-argument function. The number of arguments that a function takes is called the arity of the function. A function that takes a single argument as input, such as ${\displaystyle f(x)=x^{2}}$, is called a unary function. A function of two or more variables is considered to have a domain consisting of ordered pairs or tuples of argument values. The argument of a circular function is an angle. The argument of a hyperbolic function is a hyperbolic angle.

A mathematical function has one or more arguments in the form of independent variables designated in the definition, which can also contain parameters. The independent variables are mentioned in the list of arguments that the function takes, whereas the parameters are not. For example, in the logarithmic function ${\displaystyle f(x)=\log _{b}(x),}$ the base ${\displaystyle b}$ is considered a parameter.

Sometimes, subscripts can be used to denote arguments. For example, we can use subscripts to denote the arguments with respect to which partial derivatives are taken.

The use of the term "argument" in this sense developed from astronomy, which historically used tables to determine the spatial positions of planets from their positions in the sky (ephemerides). These tables were organized according to measured angles called arguments, literally "that which elucidates something else."

See also

• Domain of a function – Mathematical concept
• Function prototype – Declaration of a function's name and type signature but not body
• Parameter (computer programming) – Input provided to a function/subroutine
• Propositional function
• Type signature – Defines the inputs and outputs for a function, subroutine or method
• Value (mathematics) – Notion in mathematics

References

1. Bronshtein, I.N.; Semendyayev, K.A.; Musiol, G.; Muehlig, H. (2007). Handbook of Mathematics (5th ed.). Berlin Heidelberg New York: Springer. p. 47. ISBN 978-3-540-72121-5.
2. Aleksandrov, A. D.; Kolmogorov, A. N.; Lavrent'ev, M. A., eds. (1963). Mathematics: Its Content, Methods and Meaning. Vol. Two. Translated by S. H. Gould. The MIT Press. p. 121.
3. Lo Bello, Anthony (2013). Origins of Mathematical Words.
4. Craig, John (1858). A New Universal Etymological, Technological, and Pronouncing Dictionary of the English Language.

External links

• Weisstein, Eric W. "Argument". MathWorld.
• Argument at PlanetMath.

v t e Mathematical logic
General	Axiom list Cardinality First-order logic Formal proof Formal semantics Foundations of mathematics Information theory Lemma Logical consequence Model Theorem Theory Type theory
Theorems (list)  and paradoxes	Gödel's completeness and incompleteness theorems Tarski's undefinability Banach–Tarski paradox Cantor's theorem, paradox and diagonal argument Compactness Halting problem Lindström's Löwenheim–Skolem Russell's paradox
Logics	Traditional Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram Propositional Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞ Predicate First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus
Set theory	Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities Types of sets Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps and cardinality Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary Set theories Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive
Formal systems (list), language and syntax	Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list Example axiomatic systems (list) of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica
Proof theory	Formal proof Natural deduction Logical consequence Rule of inference Sequent calculus Theorem Systems axiomatic deductive Hilbert list Complete theory Independence (from ZFC) Proof of impossibility Ordinal analysis Reverse mathematics Self-verifying theories
Model theory	Interpretation function of models Model equivalence finite saturated spectrum submodel Non-standard model of arithmetic Diagram elementary Categorical theory Model complete theory Satisfiability Semantics of logic Strength Theories of truth semantic Tarski's Kripke's T-schema Transfer principle Truth predicate Truth value Type Ultraproduct Validity
Computability theory	Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision problem decidable undecidable P NP P versus NP problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory
Related	Abstract logic Algebraic logic Automated theorem proving Category theory Concrete/Abstract category Category of sets History of logic History of mathematical logic timeline Logicism Mathematical object Philosophy of mathematics Supertask
Mathematics portal

This mathematics-related article is a stub. You can help Misplaced Pages by expanding it.

• v
• t
• e

• Elementary mathematics
• Mathematics stubs