Mathematics for Applied Sciences (Osnabrück 2023-2024)/Part I/Exercise sheet 3/refcontrol

From Wikiversity
Jump to navigation Jump to search



Exercises

Exercise Create referencenumber

Determine for the sets

the following sets.

  1. ,
  2. ,
  3. ,
  4. ,
  5. ,
  6. ,
  7. ,
  8. .


Exercise Create referencenumber

Let denote the set of capital letters in the Latin alphabet, the set of capital letters in the Greek alphabet and the set of capital letters in the Russian alphabet. Determine the following sets.

  1. .
  2. .
  3. .
  4. .
  5. .


Exercise Create referencenumber

Let and denote sets. Prove the identity


Exercise Create referencenumber

Let and denote sets. Prove the following identities.


Exercise Create referencenumber

Prove the following (settheoretical versions of) syllogisms of Aristotle. Let denote sets.

  1. Modus Barbara: and imply .
  2. Modus Celarent: and imply .
  3. Modus Darii: and imply .
  4. Modus Ferio: and imply .
  5. Modus Baroco: and imply .


Exercise Create referencenumber

Does the "subtraction rule“ hold for the union of sets, i.e., can we infer from that holds?


Exercise Create referencenumber

Let denote sets. Show that the following statements are equivalent.

  1. .
  2. .


Exercise Create referencenumber

Sketch the product setMDLD/product set as a subset of .


Exercise Create referencenumber

Describe for any choice of two of the following geometric sets its product set (including the case where a set is taken twice).

  1. A line segment .
  2. A circle (circumference) .
  3. A disk .
  4. A parabola .

Which of these product sets can be realized within space, which can't?


Exercise Create referencenumber

Sketch the following subsets in .

  1. ,
  2. ,
  3. ,
  4. .


Exercise Create referencenumber

  1. Sketch the set and the set .
  2. Determine the intersection geometrically and arithmetically.


We recommend illustrating the formulated set identities of the following exercises.

Exercise Create referencenumber

Let and denote sets and let and be subsets. Show the identity


Exercise Create referencenumber

Let and denote sets and let and be subsets. Show the identity


Exercise Create referencenumber

Let be a set of people and the set of the first names and the set of the surnames of these people. Define natural mappings from to , to and to and discuss them using the relevant notions for mappings.


Exercise Create referencenumber

Dr. Peter Klamser
Dr. Peter Klamser

Determine for the following diagrams which empirical mappings they describe. What is in each case the source, the target, which units are used? Does each image represent one or more mappings? Do they really represent mappings? What information is conveyed beyond the mapping? Is there some kind of mathematical modelling for these empirical mappings?


Exercise Create referencenumber

Give examples of mappingsMDLD/mappings

such that is injective,MDLD/injective but not surjective,MDLD/surjective and is surjective, but not injective.


Exercise Create referencenumber

Show that there exists a bijectionMDLD/bijection between and .


Exercise Create referencenumber

Establish, for each , whether the function

is injectiveMDLD/injective and/or surjective.MDLD/surjective


Exercise Create referencenumber

Which graphsMDLD/graphs (map) of a function do you know from school?


Exercise Create referencenumber

How can we recognize by looking at the graphMDLD/graph (map) of a mapping

whether is injectiveMDLD/injective or surjective?MDLD/surjective


Exercise Create referencenumber

Which bijectiveMDLD/bijective functions (or between subsets of ) do you know from school? What is the name of the inverse function?MDLD/inverse function


Exercise Create referencenumber

Let and denote sets. Show that the mapping

is a bijective mappingMDLD/bijective mapping between the product sets and .


Exercise Create referencenumber

Let and be sets and let

be a function. Let

be another function such that and . Show that is the inverseMDLD/inverse (map) of .


Exercise Create referencenumber

We consider the sets

and the mappings and which are given by the value tables

and

respectively.

  1. Determine a value table for .
  2. Are the mappings , , injective?
  3. Are the mappings , , surjective?


Exercise Create referencenumber

Determine the composite functionsMDLD/composite functions and for the functionsMDLD/functions , defined by


Exercise Create referencenumber

  1. Can a constant mapping be bijective?
  2. Is the composition of a constant mapping with an arbitrary mapping (the constant map first) constant?
  3. Is the composition of an arbitrary mapping with a constant mapping (the constant map last) constant?


===Exercise Exercise 3.27

change===

Let and be sets and let

and

be functions.MDLD/functions Show that


Exercise Create referencenumber

Let and denote sets and let

and

be mappingsMDLD/mappings with the compositionMDLD/composition

Show the following properties.

  1. If and are injective,MDLD/injective then also is injective.
  2. If and are surjective,MDLD/surjective then also is surjective.
  3. If and are bijective,MDLD/bijective then also is bijective.


Exercise * Create referencenumber

Let be sets and let

be functionsMDLD/functions with their compositionMDLD/composition

Show that if is injective,MDLD/injective then also is injective.




Hand-in-exercises

Exercise (4 marks) Create referencenumber

Let and be sets. Show that the following facts are equivalent.

  1. ,
  2. ,
  3. ,
  4. There exists a set such that ,
  5. There exists a set such that .


Exercise (2 marks) Create referencenumber

Sketch the following subsets in .

  1. ,
  2. ,
  3. ,
  4. .


Exercise (3 marks) Create referencenumber

Let be sets and let

be functionsMDLD/functions with their compositeMDLD/composite

Show that if is surjective,MDLD/surjective then also is surjective.


Exercise (4 marks) Create referencenumber

We consider a computer with only two memory units, each can represent a natural number. At the start of every program (a sequence of commands), the initial entries are . The computer can empty a memory unit, it can increase a memory unit by , it can jump to another command (unconditional Goto) and it can compare the two entries of the two memory units. Moreover, it can jump to another command in case the comparing condition is fulfilled (conditional Goto). There is a printing command which prints the entries at the moment. Write a computer-program such that every pair is printed exactly once.


Exercise (4 marks) Create referencenumber

Determine the compositionsMDLD/compositions and for the mappingsMDLD/mappings given by


Exercise (3 marks) Create referencenumber

Consider the set and the function

defined by the following table

Compute , that is the -rd composition (or iteration) of with itself.



<< | Mathematics for Applied Sciences (Osnabrück 2023-2024)/Part I | >>
PDF-version of this exercise sheet
Lecture for this exercise sheet (PDF)