Ivan Shishkin, Birch Grove

Increasing function

Concept history

A revision trail for this concept page.

4 revisions

Revision 821

8/1/2026, 7:10:50 PM · Sequoia

Concept edited

Recorded titleIncreasing function
Recorded typeDefinition
Compare with revision 8202 changed lines
1A [[Function|function]] $f:A \rightarrow \R$ defined on a subset $A\subseteq \R$ is increasing if, for every $x,y\in A$, whenever $x\leqslant y$, then $f(x)\leq f(y)$.
1A [[Function|function]] $f:A \rightarrow \R$ defined on a subset $A\subseteq \R$ is increasing if, for every $x,y\in A$, whenever $x\leqslant y$, then $f(x)\leqslant f(y)$.

Revision 820

8/1/2026, 7:10:38 PM · Sequoia

Concept edited

Compare with revision 6682 changed lines
1A [[Function|function]] $f:A \rightarrow \R$ defined on a subset $A\subseteq \R$ is increasing if, for every $x,y\in A$, whenever $x<y$, then $f(x)\leq f(y)$.
1A [[Function|function]] $f:A \rightarrow \R$ defined on a subset $A\subseteq \R$ is increasing if, for every $x,y\in A$, whenever $x\leqslant y$, then $f(x)\leq f(y)$.

Revision 668

7/27/2026, 1:01:51 PM · Ancient Tree

Concept edited

Compare with revision 6672 changed lines
1A function $f:A \rightarrow \R$ defined on a subset $A\subseteq \R$ is increasing if, for every $x,y\in A$, whenever $x<y$, then $f(x)\leq f(y)$.
1A [[Function|function]] $f:A \rightarrow \R$ defined on a subset $A\subseteq \R$ is increasing if, for every $x,y\in A$, whenever $x<y$, then $f(x)\leq f(y)$.

Revision 667

7/27/2026, 1:01:42 PM · Ancient Tree

Concept created

A function $f:A \rightarrow \R$ defined on a subset $A\subseteq \R$ is increasing if, for every $x,y\in A$, whenever $x<y$, then $f(x)\leq f(y)$.