Author: Florent Hivert <florent.hivert@univ-rouen.fr> et al.
This tutorial is an introduction to basic programming in Python/Sage. The reader is supposed to know the elementary notions of programming but is not supposed to be familiar with the Python language. The memo given here are far from being exhaustive. In case you need a more complete tutorial, you can have a look at the Python Tutorial. Also Python’s documentation and in particular the standard library can be useful.
A more advanced tutorial presents the notions of objects and classes in Python.
Here is a further list of resources for people wanting to learn Python:
In Python, typing is dynamic; there is no such thing as declaring variables. The function type returns the type of an object obj. To convert an object to a type typ just write typ(obj) as in int("123"). The command isinstance(ex, typ) returns whether the expression ex is of type typ. Specifically, any value is an instance of a class and there is no difference between classes and types.
The symbol = denotes the affectation to a variable; it should not be confused with == which denotes mathematical equality. Inequality is !=.
The standard types are bool, int, list, tuple, set, dict, str.
The type bool (Booleans) takes two values: True and False. The boolean operator are denoted by their names or, and, not.
Sage uses exact arithmetic on the integers. For performance reason, it uses its own type named Integer (whereas python uses the types int and long).
A list is a data structure which groups values. It is constructed using brackets as in [1, 3, 4]. The range function creates integer lists. One can also create lists using list comprehension:
[ <expr> for <name> in <iterable> (if <condition>) ]
For example:
A tuple is very similar to a list; it is constructed using parentheses. The empty tuple is obtained by () or by the constructor tuple(). If there is only one element, one has to write (a,). A tuple is immutable (one cannot change it) but it is hashable (see below). One can also create tuples using comprehensions:
A set is a data structure which contains values without multiplicities or order. One creates it from a list (or any iterable) with the constructor set(). The elements of a set must be hashable:
A dictionary is an association table, which associate values to keys. Keys must be hashable. One creates dictionaries using the constructor dict, or using the syntax:
{key1 : value1, key2 : value2 ...}
For example:
Quotes (simple ' ' or double " ") encloses character strings. One can concatenate them using +.
For lists, tuples, strings, and dictionaries, the indexing operator is written l[i]. For lists, tuples, and strings one can also uses slices as l[:], l[:b], l[a:], or l[a:b]. Negative indices start from the end.
The len function returns the number of elements of a list, a tuple, a set, a string, or a dictionary. One writes x in C to tests whether x is in C.
Finally there is a special value called None to denote the absence of a value.
In Python, there is no keyword for the beginning and the end of an instructions block. Blocks are delimited thanks to indentation. Most of the time a new block is introduced by :. Python has the following control structures:
Conditional instruction:
if <condition>:
<instruction sequence>
[elif <condition>:
<instruction sequence>]*
[else:
<instruction sequence>]
Inside expression exclusively, one can write:
<value> if <condition> else <value>
Iterative instructions:
for <name> in <iterable>:
<instruction sequence>
[else:
<instruction sequence>]
while <condition>:
<instruction sequence>
[else:
<instruction sequence>]
The else bloc is executed at the end of the loop if the loop is ended normally, that is neither by a break nor an exception.
In a loop, continue jumps to the next iteration.
An iterable is an object which can be iterated through. Iterable types include lists, tuples, dictionaries, and strings.
An error (also called exception) is raised by:
raise <ErrorType> [, error message]
Usual errors includes ValueError and TypeError.
Note
Python functions vs. mathematical functions
In what follows, we deal with functions is the sense of programming languages. Mathematical functions are handled by sage in a different way. In particular it doesn’t make sense to do mathematical manipulation such as additions or derivations on Python functions.
One defines a function using the keyword def as
def <name>(<argument list>):
<instruction sequence>
The result of the function is given by the instruction return. Very short functions can be created anonymously using lambda (remark that there is no return here):
lambda <arguments>: <expression>
Note
(functional programming)
Functions are objects as any other objects. One can assign them to variables or return them.
Example:
Exercise: Create the list ![[63, 12, -10, 'a', 12]](_images/math/c9f3c7f81c4ec7d3bb61fca52cb9b8f08f12684b.png)
, assign it to
the variable L, and print the list.
Exercise: Create the empty list (you will often need to do this).
The range function provides an easy way to construct a list of integers. Here is the documentation of the range function:
range([start,] stop[, step]) -> list of integers
Return a list containing an arithmetic progression of integers.
range(i, j) returns [i, i+1, i+2, ..., j-1]; start (!) defaults to 0.
When step is given, it specifies the increment (or decrement). For
example, range(4) returns [0, 1, 2, 3]. The end point is omitted!
These are exactly the valid indices for a list of 4 elements.
Exercise: Use range to construct the list ![[1,2,\ldots,50]](_images/math/e03125a1c7bc131925b2596bbe47e96d9860ecdb.png)
.
Exercise: Use range to construct the list of even numbers between 1 and 100 (including 100).
Exercise: The step argument for the range command can be negative. Use
range to construct the list ![[10, 7, 4, 1, -2]](_images/math/ab89d518382daa42f0affe3b98ad870f7e76be02.png)
.
List comprehensions provide a concise way to create lists from other lists (or other data types).
Example We already know how to create the list ![[1, 2, \dots, 16]](_images/math/6e447553c856a1add1524b3a8b328722eb2777de.png)
:
Using a list comprehension, we can now create the list
![[1^2, 2^2, 3^2, \dots, 16^2]](_images/math/9ff970b64aedca8b881e7c6a66e04c63f209e599.png)
as follows:
Exercice:
The sum of the squares of the first ten natural numbers is
The square of the sum of the first ten natural numbers is
Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is
Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
A list can be filtered using a list comprehension.
Example: To create a list of the squares of the prime numbers between 1 and 100, we use a list comprehension as follows.
Exercise: Use a list comprehension to list all the natural numbers below 20 that are multiples of 3 or 5. Hint:
List comprehensions can be nested!
Examples:
Exercise:
A Pythagorean triple is a triple 
of positive integers satisfying
. The Pythagorean triples whose components are at most 
are:
![[(3, 4, 5), (4, 3, 5), (6, 8, 10), (8, 6, 10)]\,.](_images/math/85101d2cf002d6235fc372643d4556a165d88bbf.png)
Using a filtered list comprehension, construct the list of Pythagorean triples
whose components are at most 
.
To access an element of the list, use the syntax L[i], where 
is the
index of the item.
Exercise:
Construct the list L = [1,2,3,4,3,5,6]. What is L[3]?
{{{id=23| # edit here /// }}}What is L[1]?
{{{id=24| # edit here /// }}}What is the index of the first element of L?
{{{id=25| # edit here /// }}}What is L[-1]? What is L[-2]?
{{{id=26| # edit here /// }}}What is L.index(2)? What is L.index(3)?
{{{id=27| # edit here /// }}}
To change the item in position i of a list L:
To append an object to a list:
To extend a list by another list:
To concatenate two lists, add them with the operator +. This is not a commutative operation....
You can slice a list using the syntax L[start : stop : step]. This will return a sublist of L.
Exercise: Below are some examples of slicing lists. Try to guess what the output will be before evaluating the cell.
Advanced exercise: The following function combines a loop with the some of the list operations above. What does the function do?
A tuple is an immutable list. That is, it cannot be changed once it is created. To create a tuple, use parentheses instead of brackets:
We can create a tuple from a list, or vice-versa.
Tuples behave like lists in many respects:
| Operation | Syntax for lists | Syntax for tuples |
|---|---|---|
| Accessing a letter | list[3] | tuple[3] |
| Concatenation | list1 + list2 | tuple1 + tuple2 |
| Slicing | list[3:17:2] | tuple[3:17:2] |
| A reversed copy | list[::-1] | tuple[::-1] |
| Length | len(list) | len(tuple) |
Trying to modify a tuple will fail.
“Tuple-comprehension” does not exist. The syntax produces something called a generator. A generator allows you to process a sequence of items one at a time. Each item is created when it is needed, and then forgotten. This can be very efficient if we only need to use each item once.
g is now empty.
A nice ‘pythonic’ trick is to use generators as argument of functions. We do not need double parentheses for this.
A dictionary is another built-in data type. Unlike lists, which are indexed by a range of numbers, dictionaries are indexed by keys, which can be any immutable object. Strings and numbers can always be keys (because they are immutable). Dictionaries are sometimes called “associative arrays” in other programming languages.
There are several ways to define dictionaries. One method is to use braces, {}, with comma-separated entries given in the form key:value:
A second solution for creating a dictionary is to use the function dict which admits a list of 2-tuples (key, value) (actually any iterable):
Dictionaries behave as lists and tuples for several important operations.
| Operation | Syntax for lists | Syntax for dictionaries |
|---|---|---|
| Accessing elements | list[3] | D["key"] |
| Length | len(list) | len(D) |
| Modifying | L[3] = 17 | D["key"] = 17 |
| Deleting items | del L[3] | del D["key"] |
A dictionary can have the same value multiple times, but each key must only appear once and must be immutable.
Another way to add items to a dictionary is with the update() method which updates the dictionnary from another dictionnary:
We can iterate through the keys, or values, or both, of a dictionary.
Exercise: Consider the following directed graph.
Create a dictionary whose keys are the vertices of the above directed graph, and whose values are the lists of the vertices that it points to. For instance, the vertex 1 points to the vertices 2 and 3, so the dictionary will look like:
d = { ..., 1:[2,3], ... }
Then try
Example: Construct a 
matrix whose 
entry is the
rational number 
. The integer generated by range are
python int. As a consequence, dividing them does euclidian division.
Whereas Dividing sage Integer gives a fraction
Try to predict the results of the following commands.
Now try these:
You can use the command deepcopy to avoid these issues.
The same issues occur with dictionaries.
For more verbose explanation of what’s going on here, a good place to look is at the following section of the Python tutorial: http://docs.python.org/tutorial/controlflow.html
While loops tend not to be used nearly as much as for loops in Python code.
Note that the truth value expression in the while loop is evaluated using bool().
Here is a basic for loop iterating over all of the elements in the list l:
The range function is very useful when you want to generate arithmetic progressions to loop over. Note that the end point is never included:
sage: range?
You can use the continue keyword to immediately go to the next item in the loop:
If you want to break out of the loop, use the break keyword:
If you need to keep track of both the position in the list and its value, one (not so elegant) way would be to do the following:
It’s cleaner to use enumerate which provides the index as well as the value:
You could make something similary to the enumerate function by using zip to zip two lists together:
For loops work using Python’s iterator protocol. This allows all sorts of different objects to be looped over. For example,
How does it work?
..skip
sage: R = GF(5)
... R.__iter__??
yield provides a very convient way to produce iterators. We’ll see more about it in a bit.
TODO: Finish the translation!
For each of the following sets, compute the list of its elements and their sum. Use two different ways, if possible: with a loop and using lists comprehension:
- n premiers termes de la série harmonique
- les entiers impair entre 1 et n;
- les n premiers entiers impairs;
- les entiers entre 1 et n et qui ne sont divisibles ni par 2 ni par 3 ni par 5;
- les n premiers entiers qui ne sont divisibles ni par 2 ni par 3 ni par 5.
Functions are defined using the def statement, and values are returned using the return keyword:
Functions are first class objects like any other. For example, they can be passed in as arguments to other functions:
.. link
You can give default values for arguments in functions:
You can return multiple things from a function:
You can also take variable number of arguments and keyword arguments in a function:
Let’s use the yield instruction to make an generator for the Fibonacci numbers up to n:
- Write a function is_even returning True if n is even and False otherwise.
- Write a function every_other which takes a list l and returns a list containing every other element of l
- Write a function computing the n-th Fibonacci number. Try to improve performance.