We will now discuss complex numbers and their properties. We will show how they can be represented as points in the plane and state the Fundamental Theorem of Algebra: that any polynomial equation with complex coefficients has a solution which is a complex number. We will also define the function exp of a complex variable.

Earlier we mentioned several sets of numbers, including Author(s):

## Exercise 4

Solve the following linear equations.

(a)Â Â 5

*x*+ 8 = âˆ’2(b)Â Â

The rational and irrational numbers together make up the **real** numbers. The set of real numbers is denoted by . Like rationals, irrational numbers can be represented by decimals, but unlike the decimals for rational numbers, those for irrationals are neither finite nor recurring. All such infinite non-recurr

We know that a polygon *X* is a surface and so each point *x* in *X* has a disc-like or half-disc-like neighbourhood. We shall show that a map *f* that identifies edges of a polygon to create an object *Y* automatically creates corresponding disc-like or half-disc-like neighbourhoods of each point *y* = *f*(*x*) of *Y*.

If *x* is in the interior of *X*, there is no difficulty: the point *x* has a disc-like neighbourhood *U*

*We check that T_{f} satisfies conditions (T1)â€“(T3) for a topology.*

*
*

*Since (T1)â€“(T3) are satisfied, T_{f} is a topology on I(X).*

*Thus ( I(X),T_{f}) is a topological space. We give the topology T_{f} a sp*

*5.2 The identification topology *

*Our aim is to show that the object that we produce when we identify some or all the edges of a polygon is a surface. Therefore, by the definition of a surface given in Section 2.5, we must show how it can be given the structure of a topological space, and that this space is Hausdorff. Furthermore, we must show that every point has *

*5.1 Identifying edges of a polygon *

*In this section, we revisit the construction of surfaces by identifying edges of polygons, as described in Section 2. Recall that, if we take any polygon in the plane and identify some of its edges in pairs, then we obtain a surface. When specifying how a given pair of edges is to be identified, we choose one of the two possible re*

By â€˜containsâ€™, we mean that we can find part of the surface that is homeomorphic to a MÃ¶bius band. The edge of the MÃ¶bius band does not need to correspond to an edge at the surface, so that a surface without boundary can be non-orientable (as we shall shortly see).

When seeking MÃ¶bius bands in a surface, it can be helpful to look at all possible closed curves on the surface and thicken these into bands.

Remember, fro

This theorem applies to

*all*surfaces and not just to surfaces in space.This theorem tells us that the boundary number is a

**topological invariant**for surfaces, i.e. a property that is invariant under homeomorphisms.It follows from the theorem that two surfaces with different boundary numbers cannot be homeomorphic. It does not follow that two surfaces with the same boundary number

*are*homeomorphic â€“

*Surfaces can be constructed in a similar way from plane figures other than polygons. For example, starting with a disc, we can fold the left-hand half over onto the right-hand half, and identify the edges labelled a, as shown in Figure 36; this is rather like zipping up a purse, or â€˜crimpingâ€™ a Cornish pasti*

*As the polygons become more complicated, so the identifications become more difficult to visualise. For example, what happens if we try to identify the edges of an octagon in pairs, as indicated by the edge labels and arrowheads in Figure 34? Author(s): *

*There are two other surfaces that can be obtained by identifying both pairs of opposite edges of a rectangle. In one of these, shown in Figure 31, we first identify the edges AB and A'B', labelled a, in the direction shown by the arrowheads. This gives us a cylinder, as before. We then try to ident*

*In Section 2 we start by introducing surfaces informally, considering several familiar examples such as the sphere, cube and MÃ¶bius band. We also illustrate how surfaces can be constructed from a polygon by identifying edges. A more formal approach to surfaces is presented at the end of the section.*

*Figure 3 shows*

*By the end of this unit you should be able to:*

*explain the terms**surface*,*surface in space*,*disc-like neighbourhood*and*half-disc-like neighbourhood*;*explain the terms**n-fold torus*,*torus with n holes*,*MÃ¶bius band*and*Klein bottle*;*explain what is meant by the**boundary*of a surface, and determine the*boundary number*of a given surface with boundary;*construct certa*

*This unit is concerned with a special class of topological spaces called surfaces. Common examples of surfaces are the sphere and the cylinder; less common, though probably still familiar, are the torus and the MÃ¶bius band. Other surfaces, such as the projective plane and the Klein bottle, may be unfamiliar, but they crop up in many places in mathematics. Our aim is to classify surfaces â€“ that is, to produce criteria that allow us to determine whether two given surfaces are h*

*The content acknowledged below is Proprietary (see terms and conditions) and is used under licence.*

All materials included in this unit are derived from content originated at the Open University.

*Modelling pollution in the Great Lakes: a review *

*The main teaching text of this unit is provided in the workbook below. The answers to the exercises that you'll find throughout the workbook are given in the answer book. You can access it by clicking on the link under the workbook. When prompted to watch the video for this unit, return to this page and watch the clips below. After you've watched the clips, return to the workbook.*

*Click 'View document' to open the workbook (PDF, 0.3 MB).*

*This is the fifth and final unit in the MSXR209 series on mathematical modelling. In this unit we revisit the model developed in the first unit of this series on pollution in the Great Lakes of North America. Here we evaluate and revise the original model by comparing its predictions against data from the lakes before finally reflecting on the techniques used.*

*This unit, the fifth in a series of five, builds on ideas developed and introduced in Modelling pollution in the Great Lakes *

**Studying mammals: The opportunists Many mammals are food specialists, with complex adaptations that gear them toward a particular food source. So how do the omnivores survive and prosper without these fancy evolutionary features? This free course, Studying mammals: The opportunists, examines the physiology, diet and strategies of some of these opportunistic feeders. It is the sixth course in the Studying mammals series.Author(s): **

**Studying mammals: Return to the water Some of the most unusual and versatile of all the mammals are the groups that live, feed and reproduce underwater. In this free course, Studying mammals: Return to the water, we will see how these formerly land-based mammals adapted to a return to the water, discussing such challenges as breathing, movement and communication. This is the seventh course in the Studying mammals series.Author(s): **

**
Pages
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833
Copyright 2009 University of Nottingham
**