Just a quick progress report. I am still just about keeping up with the work but I can see that next week I will probably get behind because of the Christmas holidays. Never mind.
Book 5 of mathematical logic (formal proof) was fine, just a bit boring, but there was nothing in it that caused too much hair pulling. Previously in book 4 we set about constructing a language of proof that had a specific structure that could be checked mechanically. That book was about taking a restricted set of basic symbols (the alphabet, if you like) and deciding what were terms and formulas (the equivalent of words and sentences). A term is an expression in mathematics, something like (x+y) and formulas are based around atomic formulas such as x=y that are then linked with the connectives such as or, and, implies etc. This is all very well, but a long string of symbols has to mean something (much as a sentence in English has to make sense). Meaning is obtained from interpreting the symbols (i.e. + means add!) and determining truth or falsity of formulas depending on their interpretations and the domains on which they operate. Some formulas are always true because of the logical construction of their connectives (what they call tautology) , others will depend on the given interpretation. An important idea is logical consequence - that a formula is true because it is true in every interpretation that certain other formulas are true.
Book 5 moves on to how we can construct proofs from formulas. Now we have something that looks more like sentences making up paragraphs and paragraphs making up chapters etc. With the aim of making everything systematic, formulas are arranged like lines of a basic computer program. In order to 'derive' one line from another we need certain rules of proof and these rules are introduced by analogy with everyday mathematics. For example, we need to start by making certain assumptions so there is a rule for introducing a formula that is an assumption. The difficulty for the new initiate is that it all looks like gobbledygook at the moment. You can follow the rules and do the exercises but it doesn't really make much sense yet. That will happen in the next two books when we try to get all this working for proofs in number theory.
In the mean time I have begun the geometry book GE3 on two-dimensional lattices. It's a bit of light relief to think about parallelograms and vectors.
I am looking forward to the next number theory/logic tutorial at the beginning of January but I must try and get that TMA written up so that I can hand it in then!
Thursday 19 December 2013
Monday 9 December 2013
Over halfway
I have just passed the halfway point of these two courses now. Perhaps it will feel more like downhill from now on. I hope so!
Having finished GR3 from M336 I switched back to Number Theory and went through book NT5 on multiplicative functions. The main multiplicative functions discussed were τ, σ and Euler's φ function. τ(n) is the number of distinct divisors of n, σ(n) is the sum of these distinct divisors of n and φ(n) is the number of positive integers not exceeding n which are coprime to n. Whenever I foray into number theory I always feel more at home. I love the eclectic mixture of puzzles and theories.
I then went back to completing GE2 from M336 on periodic and transitive tilings. This finally gave me the chance to thrash through some of the cards and overlays in the geometry envelope! A periodic tiling is just a tiling that has a translation subgroup that is generated by two independent non-zero translations (a so called wallpaper group). A transitive tiling is one where the symmetry group of the tiling acting on the tiling itself generates a single orbit. In essence, any tile can be mapped to any other tile by an element of the symmetry group of the whole tiling.
I quite liked this book. We delved into translational tilings and orbits of tiles, edges and vertices. We drew orbit diagrams and eventually pondered over the Grunbaum-Shephard classification of transitive tilings.
Now I have returned to unit 5 of Mathematical logic - Formal Proof - and I am beginning to feel that things are getting heavy again! In the mean time as Christmas is rushing up towards us I have been trying to get the next two TMAs completed. This I have nearly done. I have had my results for the first two and I scored a double 100, which surprised me a bit. My nerdy record at the OU is beginning to be a bit worrying because in the 21 assignments I have completed since 2009, I have only dropped 1 mark!
Having finished GR3 from M336 I switched back to Number Theory and went through book NT5 on multiplicative functions. The main multiplicative functions discussed were τ, σ and Euler's φ function. τ(n) is the number of distinct divisors of n, σ(n) is the sum of these distinct divisors of n and φ(n) is the number of positive integers not exceeding n which are coprime to n. Whenever I foray into number theory I always feel more at home. I love the eclectic mixture of puzzles and theories.
I then went back to completing GE2 from M336 on periodic and transitive tilings. This finally gave me the chance to thrash through some of the cards and overlays in the geometry envelope! A periodic tiling is just a tiling that has a translation subgroup that is generated by two independent non-zero translations (a so called wallpaper group). A transitive tiling is one where the symmetry group of the tiling acting on the tiling itself generates a single orbit. In essence, any tile can be mapped to any other tile by an element of the symmetry group of the whole tiling.
I quite liked this book. We delved into translational tilings and orbits of tiles, edges and vertices. We drew orbit diagrams and eventually pondered over the Grunbaum-Shephard classification of transitive tilings.
Now I have returned to unit 5 of Mathematical logic - Formal Proof - and I am beginning to feel that things are getting heavy again! In the mean time as Christmas is rushing up towards us I have been trying to get the next two TMAs completed. This I have nearly done. I have had my results for the first two and I scored a double 100, which surprised me a bit. My nerdy record at the OU is beginning to be a bit worrying because in the 21 assignments I have completed since 2009, I have only dropped 1 mark!
Subscribe to:
Posts (Atom)