The topic of my Math Camp 2025 workshop is functions. Below
is a list of research topic suggestions related to functions. The list
is divided in half based on topics that have more of a "geometric" vs.
"algebraic" flavour.
As you know, the graph of a function
consists of the points
in
such that
.
There is a more general way of graphing functions. Take any function
.
Then, the equation
is called an implicit equation and one can graph the points
which solve this equation.
Note that taking
,
one can draw the graph of
as the graph of an implicit equation.
Implicit curves defined by degree 2 polynomials are the conic
sections
In degree 3 there starts to be more geometrically interesting
behaviour such as the "singularity" at the origin on the graph of
Fun fact: one could even say that understanding the geometry of
degree 3 curves played a major role in solving Fermat's Last
Theorem
Tangent lines
Given a function
and a fixed real number
,
it is interesting to try to find the tangent line to the graph
of
at the point
.
The tangent line is a line that touches the graph at
and is "pointed in the same direction" as the graph of
at that point.
When
is a polynomial function, there is an easy procedure for computing the
tangent line at
.
Firstly, the equation of a line through
is given by
where
is the slope of the line. Thus, we just need to decide what
should be. Here is how you do it: Remove the constant term in
and replace every monomial
by
to obtain a new polynomial
,
called the derivative of
.
Then, let
be the number you get by plugging
into the polynomial
.
Try finding the tangent line to the graph of some chosen polynomial
function at some chosen point using Desmos
Here is something harder but more informative: define a generic
parabola in Desmos by typing
and create sliders for
,
,
and
.
Then, draw the tangent to the parabola at
.
See how changing the sliders changes the tangent line. What patterns do
you spot? Ask for help if you get stuck at some point.
If some other student is reading about polynomial long division, you
can make your job easier by collaborating with them and finding the
tangent line by asking them to do polynomial long division as in this
post for you
Choose an interesting 2-variable polynomial and a point on the graph
of the implicit equation defined by the polynomial, then find the
tangent line to the graph at the point
This is not that straight-forward, and I haven't found accessible
explanations online explaining how to do this, so the only option you
have is to ask for someone to help you do this
(Suggested by Niklas) As you learnt in school, for any given 2nd degree polynomial
there is a formula for finding its roots. In fact, there are similar—although more complicated—formulas for
the roots of 3rd and 4th degree polynomials. But after mathematicians had been
trying for almost 300 years to find a similar formula for the roots of 5th degree polynomials, it was
proven that such a formula cannot exist altogether. Therefore,
since finding exact solutions to higher-degree polynomial equations is not possible in general,
the best we can do is find approximate solutions. Tangent lines to functions
provide a way of finding approximate solutions via Newton's method.
See this LibreTexts article for details.
This topic can be challenging, so you are encouraged to ask questions.
Polar coordinates
Recall that a function
can be graphed by drawing the point
in
for each value of
.
This depends on what we understand an expression
to represent. As you learned in school
means the point which is
units away from the
-axis
and
units away from the
-axis.
What we could do instead is say that
represents the point which has distance
from the origin and the angle between the line segment connecting the
point to the origin and the non-negative
-axis
is
.
We can try graphing
using this convention (i.e. looking at the point
)
to get different looking plots.
Try for example typing
for different values of
and the function will be plotted in polar coordinates
You can type
in the expression by simply typing: theta
Parametric equations
A parametrisation is a function of type
.
The graph of a function
can be "parametrised" by declaring the parametrisation to be
defined by
.
You should convince yourself that if you draw for each real number
a point at
,
then the resulting figure is precisely the graph of
.
Of course, parametrisations allow for more general graphs than just the
graphs of the functions
.
Explore the graphs of parametrisations using Desmos
Say you want to graph the parametrisation
.
Then, you would write
in Desmos. You will see that Desmos cannot actually graph the values of
the parametrisation at every real number, but only on some interval,
which you need to specify.
Symmetry is a very general phenomenon that appears in
different forms in various places. Taking symmetry into account is also
a surprisingly powerful method in solving challenging mathematical or
physical problems. Let us consider the familiar example of the
symmetries of a regular
-sided
polygon. One can imagine that the polygon consists of points in the
plane
.
Then, its symmetries are rotations or reflections that move the points
of the polygon back into itself. More specifically, a symmetry of a
regular
-gon
is a function
that either rotates every point about some fixed point or it reflects
every point across some line. Furthermore
must satisfy the requirement that if
is a point on the
-gon,
then
should also be on the
-gon.
Given two symmetries
,
one can combine them to form a new symmetry by applying the first
symmetry and the second symmetry right after. We can denote the obtained
symmetry by
.
For example take an equilateral triangle. One can rotate it by
,
and we can denote this symmetry by
.
Next, one can reflect the triangle along the vertical line of symmetry
and call the symmetry
.
It turns out that every other symmetry can be obtained by combining
and
with each other. For example, a
rotation is given by
.
The other two reflections are given by
and
.
Finally, denote by
the "identity function" which is defined by
.
These can be studied further by filling out the "multiplication table"
for the symmetries
Fill out the multiplication table above
Take some other regular
-gon
and list its symmetries. Let
be a rotation that is a symmetry of the
-gon
and
be a reflection of the
-gon.
Can you write all the other symmetries in terms of
and
?
A polynomial
is a function of the form
for some real numbers
.
Polynomials are interesting algebraically, because they can be added,
subtracted and multiplied together. However, dividing one polynomial by
another does not always result in a third polynomial. This is analogous
to how division of integers does not always result in an integer. The
fix is to consider division with remainder. The same can be done with
polynomials.
Given a polynomial, it is interesting to ask what are its roots, i.e.
the solutions in
to the equation
.
This question is related to the problem of factoring polynomials. There
is an important theoretical result regarding roots and factorisation,
called the fundamental theorem of algebra, which states that every
polynomial has a root, if you are willing to expand the definition of
"numbers".
Figure out how to do modular arithmetic with polynomials
I haven't found any accessible source for this on the internet, so
you would need to play around with polynomials and try to see if you can
figure it out yourself
You can of course ask me or anyone else to help
Learn a new factoring method you haven't seen before
An integer sequence can be thought of as a function of type
.
There are two general ways of defining integer sequences. One can define
a sequence by giving an explicit formula, for example the expression
would define the sequence of square numbers. Another way would be to
define a sequence via a recurrence relation. To do this, one
specifies the first value(s) of the sequence and then gives a formula
for
in terms of the previous values in the sequence. For example one could
define
,
and
for
.
This defines the famous Fibonacci
sequence. It is a challenging and interesting problem to ask if a
given recurrence relation can be given by an explicit formula.
Find an interesting integer sequence online. What properties does it
have?
Real sequences can be thought of as functions of type
.
Consider for example the following sequences.
The first sequences grows indefinitely while the second alternates
between
and
.
On the other hand, the sequences
and
begin as follows
You may be able to notice that these sequences "approach"
in some sense, while
does not actually appear in the sequence at any point. This phenomenon
is called convergence.
is the limit of these sequences and this can be denoted as
follows.
The sequences
and
do not converge.
Write down sequences that do not converge and sequences that
converge to a specific value, e.g. a sequence with limit
Addition, subtraction and multiplication can be thought of as
functions of the form
,
where
is any of
,
,
or
.
More specifically, one could identify addition with a function
such that
and similarly for subtraction and multiplication. In general, any
function of the form
is called a binary operation. Given a binary operation
it is common to use a symbol, e.g.
,
to write
.
When studying binary operations, one is interested in asking what
kinds of properties they have. Here are some commonly studied
properties:
Associativity. A binary operation
is associative, if for every elements
,
and
of
we have
Commutativity. A binary operation
is commutative, if for every
and
,
Identity. A binary operation
is said to have an identity element, if there is some
in
such that for every
in
,
we have
Inverses. A binary operation
with identity
is said to have inverses, if for every element
in
,
there is
such that
Which of the four properties do addition, subtraction and
multiplication have?
Come up with a new binary operation and think about what properties
it has
Try to come up with binary operations with different combinations of
properties, i.e. one with identity but no inverses
General functions
Functions between sets have general constructions and properties that
work for all functions. General functions can for example have the
properties of being injective, surjective, or
bijective. A function
is injective, if one cannot find elements
and
in
such that
but
.
is said to be surjective, if for every element
of
,
there is some
in
such that
.
Finally,
is bijective, if it is both injective and bijective. The meaning of
injectivity and surjectivity is likely easier to be understood from an
illustration like the one in this
Wikipedia article. Bijectivity is extremely important, because for
every bijection
,
there is a function
,
called the inverse of
,
such that for any
in
,
and for every
in
,
.
For example, the function
is the inverse of
.
An important construction of general functions is
composition. Suppose
and
are functions. Then, one can form the composition
by defining
This is expressed diagrammatically as follows.
For example one could take
,
,
and
and
,
and the composition will in this case be
To be able to study functions more effectively, it is useful to have
some set theoretical notation available. Here are some useful notations
If
is an element of
,
one writes
.
If
and
are two sets such that every element of
is an element of
,
then
is said to be a subset of
and one writes
.
If
is a subset of
but
,
one can write
.
With these notations, we can define images and
pre-images. If
is a function and
is a subset, then the image of
under
is the subset of
consisting the elements
such that there is
satisfying
.
The image is denoted by
.
For example, the image of
under the map
given by
is the subset of non-negative real numbers:
Next, if
is a subset of
,
then its pre-image under
is the subset of
consisting all
such that
.
The pre-image is denoted by
.
For example, the pre-image of the interval closed
under the map
is
Take your favourite functions and check if they are injective,
surjective, bijective, or neither
Take your favourite functions, choose subsets of domains and
codomains, and figure out what their images or pre-images are
Prove that if
and
are both injective, then so is their composition
.
Show that the same holds if "injective" is replaced by surjective or
bijective
Prove that if
and
are functions such that
is injective, then
is injective. Similarly, if
is surjective, then
is surjective
Prove that if
is a function and
is a subset, then
.
Find an example, where
Prove that if
is a function and
is a subset, then
Read about how bijections between infinite sets lets us compare the
sizes of infinities