Open in TheBrain

Introduction and Invitation

Wild Egg mathematics courses

3.68K subscribers

SUBSCRIBED

Welcome to Six --- an Elementary Course in Pure Mathematics meant for a general lay audience with a minimal amount of mathematical prerequisites! In this video we introduce the basic objects: the symbols 1,2,3,4,5 and 6 along with the basic tools to create more complex mathematical objects from simpler ones --- the data structures LOMS, standing for Lists, Osets, Msets, and just Sets. (Osets are short for Ordered sets, while Msets are short for Multisets). With this rather modest starting point, we get right to work in building up some fundamental initial concepts that will play a central role in the course. If you have an interest in mathematics and would like to get some real insight into how pure mathematics works, why not roll up your sleaves and join the course? Screenshot PDFs for my videos are available at the website http://wildegg.com. These give you a concise overview of the contents of the lectures for various Playlists: great for review, study and summary. My research papers can be found at my Research Gate page, at https://www.researchgate.net/profile/My blog is at http://njwildberger.com/, where I will discuss lots of foundational issues, along with other things. Online courses will be developed at openlearning.com. The first one, already underway is Algebraic Calculus One at https://www.openlearning.com/courses/... Please join us for an exciting new approach to one of mathematics' most important subjects! If you would like to support these new initiatives for mathematics education and research, please consider becoming a Patron of this Channel at https://www.patreon.com/njwildberger Your support would be much appreciated.

00:02

[Music]

00:10

hello

00:11

and welcome to six

00:14

i'm noah barbara and this is my attempt

00:17

at introducing pure mathematical

00:21

thinking

00:22

to a very wide audience with minimal

00:26

prerequisites so this is going to be a

00:29

course

00:29

in pure mathematics which is going to

00:33

investigate an interesting area

00:36

that we can access in a very elementary

00:39

way

00:41

the audience is going to be

00:44

motivated high school students and

00:47

beyond

00:48

any lay people who are interested

00:51

in learning about pure mathematics

00:54

from the ground up the only

00:57

prerequisites

00:58

really at least to begin with are going

01:00

to be arithmetic with natural numbers

01:03

roughly what you would have learned from

01:05

primary school education

01:07

so very minimal prerequisites

01:10

okay and the aim of the

01:14

course is to illustrate what pure

01:17

mathematics research is really like

01:20

to give you a direct and tangible

01:22

experience

01:23

of this and

01:27

we're going to develop concentration

01:29

skills

01:30

logical reasoning careful organization

01:34

and hopefully a love of mathematics

01:40

now usually in order to access pure

01:43

mathematics which is a rather esoteric

01:45

and

01:46

usually thought of as difficult subject

01:48

you require

01:49

many years of undergraduate education

01:51

followed by graduate school we're

01:54

circumventing all of that

01:55

and we're doing it in a way that

01:59

doesn't really connect with any other

02:02

things so we're just going to

02:03

investigate

02:04

some independent very elementary

02:08

situation and we're going to explore

02:10

this really

02:11

interesting landscape around it and

02:14

perhaps we're going to meet all kinds of

02:16

interesting things

02:17

so our aim is actually not to get to any

02:20

particular point okay

02:22

i'm going to just going to be explaining

02:25

a

02:26

branch of pure mathematics which is all

02:28

about

02:29

the number six so it's mathematical

02:32

content

02:33

which you're really not going to find

02:35

anywhere else

02:36

but ultimately we will be i can promise

02:39

you touching base with

02:40

really classical and lovely

02:44

19th century mathematics that actually

02:46

engaged the interest of a lot of really

02:49

prominent mathematicians

02:50

so there will be something at the end of

02:52

it that's going to be

02:54

really fascinating but that's not our

02:56

aim our aim is just

02:57

to explore so i hope you're going to

03:00

join me for this

03:01

i hope you'll take a notebook or maybe

03:04

your laptop or

03:06

ipad whatever and follow along and

03:09

listen carefully to everything that i do

03:12

and try to understand everything that i

03:14

say

03:15

and even if you're not used to enjoying

03:18

mathematics i hope you'll

03:19

get a sense of what the subject is

03:21

really about

03:23

careful definitions clear notation

03:27

and an organized approach to analyzing

03:30

patterns and

03:32

making connections so we are going to

03:35

start

03:36

by taking six objects

03:40

and we're going to consider these

03:42

objects to be the numbers one

03:44

two three four five and six so the

03:47

entire course

03:48

is going to be built up from these six

03:52

initial objects

03:56

we will generally write them in black so

03:59

whenever you see

04:00

numbers from one to six in black you

04:02

should think of them as being our

04:04

initial objects and we're going to be

04:05

thinking about

04:06

having containers for these six so we

04:08

have a container of ones a container of

04:10

twos and so on

04:12

and we're able to take uh numbers

04:15

uh from these containers and combine

04:17

them to create

04:19

more complicated objects okay

04:22

so that's the the initial thrust is

04:25

we're going to be

04:26

creating objects from these six numbers

04:30

and we are then going to look at the

04:33

patterns that we can form

04:34

from these now i want to stress that

04:38

the actual arithmetic associated with

04:40

these

04:41

six numbers is going to be irrelevant so

04:44

we're not going to be adding or

04:45

multiplying or doing any kind of

04:47

arithmetic with these objects

04:49

you can think about these as just sort

04:51

of short forms for the names

04:53

of six things so i could have used pens

04:56

or

04:57

coins or any number of things but it's

05:00

convenient

05:00

to use these things because they're all

05:02

very familiar and because there's a

05:04

natural order to them

05:06

which will be useful to us later on

05:10

so what our aim is at first is to create

05:13

expressions

05:14

just involving grouping or arranging

05:16

these kinds of objects

05:18

in various ways and when we group

05:22

these basic objects together we have

05:25

some choices whether we're going to

05:27

create

05:28

patterns or groupings which are ordered

05:32

or unordered and another

05:35

choice that we can make is whether

05:37

repetitions are going to be allowed

05:40

or not allowed

05:43

so this is a very important kind of

05:45

distinction and this is going to

05:47

provide sort of a theoretical framework

05:49

for us moving forward

05:51

we have to talk about how to organize

05:55

data or information in

05:58

various ways ordered or unordered

06:02

repetitions allowed or not allowed

06:06

so let's talk about the very important

06:07

idea of organizing

06:09

mathematical objects in mathematics

06:12

there are generally

06:13

four different ways of organizing data

06:16

or other objects i like to call this the

06:18

loms

06:20

framework and there are four kinds of

06:22

objects

06:23

lists ordered sets multisets and

06:26

sets and let's talk about what these

06:30

things are

06:31

and the notation for them

06:35

notation is going to play a very

06:37

important role in this course

06:38

so we have to understand precisely

06:41

what it is that we're writing down and

06:44

what the meaning of the things that

06:45

we're writing down

06:46

so the first one a list a list is an

06:49

ordered

06:50

collection where repetitions are allowed

06:55

so it's ordered means there's a first

06:57

there's a second etc

06:58

and repetitions are allowed so here for

07:00

example is a list

07:02

it's first of all enclosed in these

07:04

square brackets

07:07

the entries are four and then three and

07:09

then three and then five

07:12

and they are ordered by the presence of

07:15

these commas

07:16

that separate subsequent elements so

07:19

first there's four

07:20

then there's a comma then there's three

07:21

then there's a comma then there's three

07:23

then there's another comma there's five

07:25

and we can see that repetitions are

07:27

allowed because there are two

07:29

threes notice that the objects that

07:32

we're actually using are all from our

07:34

fundamental

07:35

six allowed objects that's going to be

07:39

happening

07:40

throughout the course the actual

07:43

ingredients to everything are just one

07:46

of these six

07:47

starting numbers okay

07:50

now the next data structure is an

07:53

ordered set

07:54

or short o set should probably underline

07:58

that too because that's important

08:00

okay and oh set so what is an origin

08:03

it is a collection which is ordered

08:07

but now no repetitions are allowed

08:11

no duplication and the notation for that

08:15

is

08:15

these curve brackets sometimes called

08:18

braces

08:19

okay that kind of brace and

08:22

there's commas to indicate that things

08:25

are still

08:26

ordered so this is the ordered set 6

08:28

comma 1 comma 2.

08:32

our next data structure is a multi-set

08:36

or for short m set

08:39

it is unordered but repetitions

08:43

are allowed

08:47

it's unordered so there are

08:51

no commas that's the way we represent

08:54

an unordered collection

08:57

there are no commas that put the

09:00

elements in their proper place that

09:02

separate them and kind of lock them in

09:04

you can think about the contents here

09:06

like the contents of a box

09:08

the elements are allowed to move around

09:11

and the object itself is not

09:13

changing the brackets are the square

09:17

brackets the same kind of brackets

09:19

that we have in a list and that tells us

09:21

that repetitions

09:23

are allowed okay so the the brackets

09:26

tell us whether repetition

09:27

is allowed or not and the commas or

09:31

spaces

09:31

tell us whether the thing is ordered or

09:34

not

09:35

so multi-sets are unordered and

09:37

repetitions are allowed and the final

09:38

one

09:39

which is actually in modern mathematics

09:42

by far

09:43

the most familiar and widely used

09:47

is the set which is unordered

09:50

and repetitions are not allowed

09:54

and our notation for a set is going to

09:56

be consistent with what we've said up

09:58

here

09:59

the fact that it's unordered means that

10:02

there's no commas

10:04

separating the elements just

10:07

spaces and the fact that no repetitions

10:11

are allowed

10:12

is the same as for an o set these are

10:15

these

10:16

brace brackets so we can

10:19

look at these four kinds of data

10:21

structures and we can tell

10:23

just from the form whether we're talking

10:26

about a list

10:27

an ordered set an m set or a set

10:33

now in classical mathematics sets

10:36

are dominant but for us

10:40

that's not going to be the case we are

10:42

going to maintain

10:44

uh flexibility and in fact a kind of a

10:48

feeling of equality between these

10:51

four different ways of organizing things

10:54

that's going to be very important so

10:57

it's crucial

10:58

that you spend some time staring at this

11:01

and

11:02

get yourself used to the notation that

11:04

we're going to be using

11:06

now in my math foundation series i talk

11:09

quite

11:09

extensively about these data structures

11:12

and in my

11:13

algebraic calculus course we actually

11:15

use them so you may have had some

11:17

experience with that if you watch some

11:18

of my other videos

11:20

and if you want a little bit more

11:21

information you can go to the math

11:22

foundations

11:23

series and find out more about these but

11:25

this is really

11:26

all you really need to know is what

11:28

these four types of

11:30

ways of organizing mathematical objects

11:32

are and how the notation

11:35

tells us which one is in front of us at

11:37

any given time

11:38

so just to reinforce that let me put all

11:42

that information in a little array

11:45

with four boxes and over here we have

11:49

the ordered

11:50

objects and the unordered objects in

11:53

this first row and then in the second

11:55

row

11:56

so the list and the ordered set are

11:57

ordered the multi-set or m

12:00

set and the set are unordered

12:04

and over here in the columns the columns

12:06

represent whether

12:07

repetitions are allowed here they're

12:10

allowed

12:10

and over here they're not allowed so

12:13

there's a list there's an example of a

12:15

list

12:16

it's ordered and repetitions are allowed

12:19

here's an o

12:19

set there's an example of it

12:23

the uh it's it's ordered

12:26

because of the commas

12:29

and its repetitions not being allowed in

12:32

this case

12:32

as you can see by the type of brackets

12:36

over here is an m set or a multi-set

12:38

it's

12:39

unordered and repetitions are allowed

12:41

unordered because the spaces

12:43

uh between them replace the commas so

12:45

spaces means that you can move things

12:47

around it's unordered

12:49

and these brackets tell us that

12:51

repetitions are okay

12:52

just like in the list and finally the

12:54

set

12:55

has these braces telling us that

12:57

repetitions are not

12:59

allowed but it's unordered as we can see

13:02

by

13:03

the spaces between elements instead of

13:06

commas so for example with this set you

13:09

could

13:10

change the position of the six and the

13:13

four

13:14

and it would be the same set

13:20

with the ordered set you're not allowed

13:22

to change the

13:24

the positions of say the two and the

13:25

three that would be a different ordered

13:27

set

13:28

over here you're allowed to change the

13:30

one and the two you could move that one

13:32

there and move the two over there

13:33

that would be the same m set

13:36

so one more important aspect of these

13:39

things is

13:40

a measure of how many elements there are

13:43

in them

13:44

okay so this uh

13:47

this thing here has five elements one

13:49

two three four five we're counting

13:52

this one has four elements this one has

13:54

three elements this one has four

13:55

elements

13:55

we can make that part of the

13:58

the name okay by adding the number of

14:02

elements

14:02

in front of the data structure so for

14:05

example

14:06

here's another example of a list the

14:08

list two

14:09

four four this is a three list

14:12

it's a three list because it has three

14:14

elements

14:16

here's an ordered set or an o set it's a

14:19

2-0 set we write it like this 2-0 set

14:22

because it has two elements

14:24

here is a 5-m set it's an m-set

14:28

with five elements and here is a four

14:31

set it's a set with four elements

14:36

so let me emphasize that this notation

14:40

this setup is very logical

14:42

okay but it's different from what often

14:45

is done because

14:47

classically the emphasis is on sets and

14:50

usually we don't write sets this way we

14:52

write them in classical mathematics with

14:54

commas

14:55

so we are separating our usage here from

14:59

the classical one

15:00

you have to remember that okay so when

15:02

we write something like this you have to

15:04

recognize this as a set

15:06

when we introduce commas that means

15:08

we're introducing an

15:09

ordering does that make sense i hope

15:12

it's sort of logical

15:13

it is logical and it's sort of

15:15

consistent

15:16

but it's something that you have to

15:18

remember

15:20

all right so let's use these data

15:22

structures to create

15:24

some new objects out of our six

15:27

initial objects first

15:30

let's give our initial objects a name

15:34

okay we are going to call them these

15:37

primary objects one two three four five

15:39

six we're gonna call them

15:41

nodes have a look nodes

15:44

right so this is a node that's a node so

15:46

this is just a terminology that we're

15:48

introducing we're gonna agree

15:50

that node where it might have some other

15:53

prior meaning in ordinary life

15:55

for us node is going to refer to one of

15:58

these

15:58

six objects and to emphasize the fact

16:03

that

16:03

this is very specific usage of this

16:06

terminology i'm going to introduce

16:08

what i call german notation

16:12

i'm going to capitalize the first

16:15

letter of this word that's going to

16:21

immediately remind us that this is a

16:24

fundamental kind of object

16:26

now what is this six that's floating

16:29

beyond here

16:30

this six is in blue it's not a black

16:33

six so it's not the same as this 6 here

16:36

this 6

16:36

is telling us how many nodes there

16:40

are we have a very simple world here

16:44

so one of the things that we're going to

16:46

be doing at least is

16:48

counting things when we create them

16:51

okay so there are six nulls

16:55

okay now it's time to introduce some new

16:58

objects

17:00

and the first thing that we're going to

17:01

introduce are the edges the

17:04

new objects are going to be called edges

17:07

and

17:08

what they are are two sets

17:11

of nodes two sets of notes

17:15

what does that mean it means it's a set

17:16

with two elements

17:18

so it looks like this has this brace

17:20

kind of uh you know

17:21

brackets and there's no commas

17:24

separating elements and there's going to

17:25

be two elements

17:27

and these elements have to be themselves

17:29

nodes

17:30

in other words they have to be amongst

17:33

our basic nodes

17:36

and we're going to introduce some

17:39

abbreviated notation because we're in

17:43

this happy situation where

17:45

we're always only going to be using

17:46

these six numbers

17:48

and that means we can save ourselves

17:51

quite a little bit of work by being

17:53

judicious

17:53

about our notation it's going to be very

17:57

important for us

17:58

okay so instead of writing set a

18:01

b i'm just going to write a followed by

18:04

b so in this world

18:08

the world of this course a b does not

18:11

mean the product of a

18:12

and b it means the two set

18:16

whose elements are a and b

18:19

but with a further proviso that we're

18:21

going to arrange things

18:23

so that a is less than b

18:29

right a and b are both elements in here

18:31

they're amongst these notes

18:34

and while the set

18:37

is unchanged if we permute

18:41

the elements we are going to write it

18:44

so that the smaller

18:47

entry of the smaller node comes first

18:52

okay so what effectively do these edges

18:54

look like

18:55

well the simplest edge is one two

18:58

okay one two that's our short form

19:02

for the two set whose elements are one

19:05

and two

19:06

and then there's one three that's the

19:08

next

19:09

kind of logical one and then there's one

19:11

four

19:12

and then there's one five and then one

19:14

six and then

19:15

two three two four two five two six

19:19

three four three five three six four

19:23

five four six

19:24

five six notice that i've listed them

19:29

in a somewhat logical order starting

19:32

with the

19:34

simpler the smaller first

19:37

element in this representation

19:42

so i'm using the natural ordering on on

19:45

the six elements

19:46

to list these 15 edges

19:49

in a reasonably sort of consistent

19:52

pattern

19:53

and there are 15 of them because it's 1

19:55

2 3 4

19:56

5 6 7 8 9 10 11

19:59

12 13 14 15 such

20:04

edges

20:07

so this is um i hope you see what we're

20:10

kind of doing is we're taking planet

20:12

earth

20:12

okay with all the you know complexity

20:16

and and human interactions and all kinds

20:18

of you know things

20:19

and we're we're taking a rocket ship and

20:21

we're leaving planet earth far behind

20:23

we're not aiming towards applications

20:26

okay we're now on this distant planet

20:29

and there's nothing there except for

20:31

these sort of six nodes

20:33

actually we have these containers of six

20:36

nodes so we have lots of good nodes

20:38

and we're just going to create stuff

20:40

okay

20:41

and that is going to be our our pure

20:44

mathematical exercise

20:47

very abstract very unconnected with

20:51

applications okay we're just wanting to

20:54

explore

20:55

what we can actually say about six

20:57

things

20:58

and this is a good place to start with

21:01

our six

21:01

nodes and our 15 edges

21:05

okay so we're going to now want to

21:07

introduce one more

21:09

type of new objects and then we'll be in

21:11

a nice position to finish this first

21:13

lecture

21:14

and i'll give you some homework okay so

21:16

the

21:17

15 edges that we've just

21:20

written down if you stare at them you

21:23

might

21:23

realize that any two of them

21:27

have a possible connection so we're

21:30

going to introduce a definition we'll

21:32

say that two edges are

21:33

incident precisely when they

21:36

share an element after all an edge is

21:40

actually a two set

21:42

so if we have two edges we have two two

21:44

sets and we can ask

21:46

do these two two sets actually contain a

21:49

common element or a common node

21:53

so for example the edge one two and the

21:56

edge 2

21:57

5 are incident because

22:00

they share the node 2.

22:04

while the edges 3 6

22:07

and 1 4 are not incident because they

22:10

don't share

22:11

any common notes and now we're going to

22:14

introduce

22:15

new objects a little bit bigger and

22:18

better than edges

22:20

which are called meats okay i want some

22:22

meat

22:23

well a meat is a two set of

22:27

non-incident edges

22:32

so you may have to slow down and really

22:34

get your head around this

22:36

but it's possible to understand it

22:37

completely i want you to understand

22:39

completely what we're doing so this is a

22:41

two set

22:42

okay so it's a set with two things

22:45

inside and those two things are

22:48

each edges that we've just defined

22:52

but the two of them have to have this

22:53

property that they are non-incident

22:56

in other words the nodes that appear are

22:59

not overlapping

23:01

so for example here is an example of

23:04

a meat it's a two set

23:08

with well an edge there

23:11

and an edge there and these two edges

23:14

we've just seen

23:14

are not incident so this is a viable

23:18

meat now we're going to save ourselves a

23:22

little bit of time

23:24

by introducing more streamlined notation

23:27

we're going to exploit again the fact

23:29

that we can write

23:30

our edges rather compactly so we can

23:33

write this

23:34

to set compactly by

23:37

putting the edges together with a little

23:40

period or dot between them

23:42

but we're going to do it in such a way

23:44

that the

23:46

first element of the first edge is

23:49

less than the first element of the

23:51

second edge

23:53

so maybe i might say that okay here

23:56

where

23:58

by convention we're going to agree that

24:01

the the one here is actually less than 3

24:05

in the order of the nodes we're going to

24:08

do that so that we have a canonical way

24:10

of describing this object

24:12

because we could rewrite this 2 set by

24:15

interchanging these two elements

24:18

okay but by agreeing that

24:21

the first element of the first edge here

24:25

is going to be less than in the ordering

24:27

of the first element in the second edge

24:29

we guarantee that there's always a

24:31

canonical way of writing

24:33

a given mate and now i claim that there

24:36

are exactly

24:38

45 mates and

24:41

now we come to your first homework so

24:43

homework number one

24:44

is to list all 45 mates

24:48

same kind of way that i listed the 15

24:51

edges

24:52

i want you to list all the 45 meats and

24:54

hopefully

24:55

in an organized way in a systematic

25:00

way in a way that makes it easy for

25:02

somebody

25:03

to check that you've got all of them and

25:05

in which there's a pattern hopefully

25:07

that

25:07

it's pretty clear sort of how to keep

25:09

going

25:11

so this homework is too onerous

25:15

then probably this course is not for you

25:18

but if you can say ah yes this is not so

25:21

bad i'm going to organize

25:23

my thoughts i'm going to understand what

25:25

these words mean and i'm going to write

25:27

out all 45 of these meats and i'm going

25:29

to do it and i'm going to check that

25:31

it's correct

25:32

then you have a an orientation towards

25:36

thinking carefully thinking logically

25:39

thinking in an organized way

25:40

and those aspects are sort of at the

25:42

heart of doing

25:44

pure mathematics so to summarize what

25:48

we've done today

25:49

we've introduced using a prior

25:52

discussion

25:53

of data structures crucially

25:56

introducing lists ordered sets

25:59

multi-sets

26:00

and sets we've defined first of all our

26:03

fundamental nodes

26:04

and then 15 edges and then

26:07

45 meters so we already have now

26:10

the start of a a small landscape

26:14

all built up from our six

26:17

notes

26:21

so there's going to be lots of

26:23

interesting things happening

26:25

i hope you're going to be joining me for

26:26

the rest of this course

26:28

i'm dylan walberger thanks for listening

26:41

you

Attachments