Marius Furter
Marius Furter
  • 81
  • 266 878
Logic & Foundations with Haskell: Haskell 14 :: Rational and Complex Numbers / Polynomials
We look at three modules that include Rational and Complex numbers as well as Polynomials. We use these to implement Newton's method. All code can be found in the course git repository github.com/MariusFurter/MAT605-haskell-FS23
00:00 Introduction
00:35 Data.Rational
05:55 Newton's method
27:02 Data.Complex
30:38 Data.Poly
The playlist for the course can be found here: ua-cam.com/video/0HImO-me_sg/v-deo.html
Переглядів: 529

Відео

Logic & Foundations with Haskell :: Axiomatic Set Theory
Переглядів 496Рік тому
We build the foundations of set theory using the Zermelo-Fraenkel axioms with choice (ZFC). The material follows the first chapter of Thomas Jech's "Set Theory". 00:00 Introduction 01:10 Overview of the ZFC axioms 10:50 The language of sets 13:29 Classes 18:41 Axiom: Extensionality 20:36 Axiom: Pairing 22:32 Singleton sets and ordered pairs 25:17 Axiom: Separation 29:19 Subclasses of sets are s...
Logic & Foundations with Haskell :: Naive Set Theory
Переглядів 281Рік тому
We cover the basic definitions of set theory in preparation for understanding the ZFC axioms. 00:00 Introduction 00:17 Definition: Sets 04:55 Definition: Empty set 06:44 Definition: Subsets 08:55 Definition: Set comprehension 09:27 Definition: Union, intersection, difference 12:53 Definition: Power set 15:29 Definition: Cartesian product 18:36 Prop: Identities for set-theoretic operations 24:56...
Logic & Foundations with Haskell: Haskell 13 :: Integers from Natural Numbers
Переглядів 206Рік тому
We implements datatypes for integers based in the natural numbers. Correction: At 04:50 I forgot the case ( ) (Neg Z) (Pos Z) = True. All code can be found in the course git repository github.com/MariusFurter/MAT605-haskell-FS23 00:00 Introduction 00:57 Integers as disjoint union of Nat 05:56 Integers as difference classes of Nat 12:36 Defining addition The playlist for the course can be found ...
Logic & Foundations with Haskell: Haskell 12 :: Typeclasses for Natural Numbers
Переглядів 131Рік тому
We implement the typeclasses Ord, Enum, Num, Real and Integral for the natural numbers. This allows us to use all standard functions for these typeclasses on our natural number datatype. All code can be found in the course git repository github.com/MariusFurter/MAT605-haskell-FS23 00:00 Introduction 01:51 data Nat 02:38 foldn 04:56 Typeclass Ord 12:50 Typeclass Enum 20:47 Typeclass Num 30:13 Ty...
Logic & Foundations with Haskell: Haskell 11 :: Partial and Multivalued Functions
Переглядів 152Рік тому
I show how the Maybe datatype and lists can be used to deal with functions that return either zero or multiple values. All code can be found in the course git repository github.com/MariusFurter/MAT605-haskell-FS23 00:00 Introduction 00:26 Maybe datatype 04:05 Using lists for partial and multivalued functions 07:53 Lifting functions to Maybe and Lists 14:51 Lifting elements to Maybe and Lists 16...
Logic & Foundations with Haskell: Haskell 10 :: Folding over Lists
Переглядів 176Рік тому
We discuss how the foldr and foldl patterns can be used for very compact implementations. All code can be found in the course git repository github.com/MariusFurter/MAT605-haskell-FS23 00:00 Introduction 00:10 foldr 03:30 maximum 08:43 and / or 11:52 sum / prod 13:50 length / elem / filter 23:29 reverse 27:22 foldl 29:34 efficient reverse The playlist for the course can be found here: ua-cam.co...
Logic & Foundations with Haskell: Logic 9 :: Completeness of Natural Deduction for LP
Переглядів 376Рік тому
We prove completeness of the natural deduction proof calculus for propositional logic. 00:00 Introduction 02:12 Definition: reduced LP 03:13 Definition: Syntactic consistency 05:37 Lemma: If every syntactically consistent set has a model, then ND is complete. 12:48 Definition: Hintikka sets 16:38 Lemma: Every Hintikka set has a model 33:35 Lemma: Every syntactically consistent set can be extend...
Logic & Foundation with Haskell: Haskell 9 :: Natural Numbers
Переглядів 243Рік тому
We implement natural numbers, arithmetic and comparison using an inductive datatype. All code can be found in the course git repository github.com/MariusFurter/MAT605-haskell-FS23 00:00 Introduction 00:14 data Nat 03:10 Conversion functions 10:14 Arithmetic functions 21:21 Comparison functions 30:46 Folding over Nat The playlist for the course can be found here: ua-cam.com/video/0HImO-me_sg/v-d...
Logic & Foundations with Haskell: Logic 8 :: Soundness of Natural Deduction for Propositional Logic
Переглядів 379Рік тому
We show that the natural deduction proof calculus is sound for propositional logic, meaning that it only proves true formulas given true assumptions. 00:00 Introduction 00:33 Definition: Model for a set of formulas, semantic sequents 03:45 Thm: Soundness of natural deduction 05:30 Proof of soundness theorem The playlist for the course can be found here: ua-cam.com/video/0HImO-me_sg/v-deo.html
Logic & Foundations with Haskell: Logic 7 :: Semantics for Propositional Logic
Переглядів 250Рік тому
We cover the semantic definitions for propositional logic which assign formulas truth values in a sigma-structure. 00:00 Introduction 00:23 Definition: sigma-structure 01:35 Definition: Truth values for LP formulas 08:47 Definition: Models, tautologies, consistency and contradictions 14:32 Definition: Logical equivalence The playlist for the course can be found here: ua-cam.com/video/0HImO-me_s...
Logic & Foundations with Haskell: Haskell 8 :: Implementing Functions
Переглядів 221Рік тому
We implement functions as sets of pairs. All code can be found in the course git repository github.com/MariusFurter/MAT605-haskell-FS23 00:00 Introduction 00:18 Definition: Function 05:38 Definition: Image 06:39 Definition: Injective 09:39 Definition: Surjective 11:58 Definition: Bijective 13:51 Importing SetList 16:31 Datatype for functions 25:28 Check if Fun is actually a function 41:28 Get i...
Logic & Foundations with Haskell: Logic 6 :: Language of Propositional Logic
Переглядів 320Рік тому
We formally define the syntax of propositional logic and prove a unique parsing theorem for its formulas. 00:00 Introduction 00:14 Definition: Signature 02:48 Definition: LP(sigma) 03:36 Definition: Formulas 07:18 Definition: Head of formula 10:28 Example: Parsing tree for formula 16:25 Definition: Complexity of formula 17:26 Definition: Initial segments and depth 22:36 Lemma: Every formula has...
Logic & Foundations with Haskell: Haskell 7 :: Implementing Relations
Переглядів 262Рік тому
We cover the basic definitions for relations and implement them in code. All code can be found in the course git repository github.com/MariusFurter/MAT605-haskell-FS23 00:00 Introduction 00:08 Definition: Relation 03:15 Definition: Relation composition 07:08 Definition: Domain / Range of a relation 08:48 Definition: Reflexive, symmetric, transitive 14:06 Importing modules 18:03 Datatypes for re...
Logic & Foundations with Haskell: Haskell 6 :: Sets
Переглядів 315Рік тому
In this video we implement sets and associated functions. All code can be found in the course git repository github.com/MariusFurter/MAT605-haskell-FS23 00:00 Introduction 00:38 Defining data Set 10:32 Converting sets to lists 13:23 Converting lists to sets 18:12 Checking elements 22:58 Checking subsets 41:18 Defining equality for sets 45:53 Union 49:51 Intersection The playlist for the course ...
Logic & Foundations with Haskell: Logic 5 :: Natural Deduction
Переглядів 455Рік тому
Logic & Foundations with Haskell: Logic 5 :: Natural Deduction
Logic & Foundations with Haskell: Haskell 5 :: Implementing Logical Functions
Переглядів 362Рік тому
Logic & Foundations with Haskell: Haskell 5 :: Implementing Logical Functions
Logic & Foundations with Haskell: Logic 4 :: Informal Proof Theory
Переглядів 497Рік тому
Logic & Foundations with Haskell: Logic 4 :: Informal Proof Theory
Logic & Foundations with Haskell: Haskell 4 :: Functions
Переглядів 393Рік тому
Logic & Foundations with Haskell: Haskell 4 :: Functions
Logic & Foundations with Haskell: Haskell 3 :: Types and Typeclasses
Переглядів 522Рік тому
Logic & Foundations with Haskell: Haskell 3 :: Types and Typeclasses
Logic & Foundations with Haskell: Logic 3 :: Naive First Order Logic
Переглядів 515Рік тому
Logic & Foundations with Haskell: Logic 3 :: Naive First Order Logic
Logic & Foundations with Haskell: Haskell 2 :: Basic Operations
Переглядів 548Рік тому
Logic & Foundations with Haskell: Haskell 2 :: Basic Operations
Logic & Foundations with Haskell: Haskell 1 :: Setup
Переглядів 584Рік тому
Logic & Foundations with Haskell: Haskell 1 :: Setup
Logic & Foundations with Haskell: Logic 2 :: Naive Propositional Logic
Переглядів 729Рік тому
Logic & Foundations with Haskell: Logic 2 :: Naive Propositional Logic
Logic & Foundations with Haskel: Logic 1 :: Introduction
Переглядів 1,2 тис.Рік тому
Logic & Foundations with Haskel: Logic 1 :: Introduction
Logic & Foundations with Haskell: Course Intro
Переглядів 9 тис.Рік тому
Logic & Foundations with Haskell: Course Intro
Lens Dynamics 4: Building a biological oscillator
Переглядів 366Рік тому
Lens Dynamics 4: Building a biological oscillator
Impossible Geometric Constructions
Переглядів 493Рік тому
Impossible Geometric Constructions
Topology Lecture 24: Closed Map Lemma
Переглядів 1,7 тис.Рік тому
Topology Lecture 24: Closed Map Lemma
Topology Lecture 23: Compactness III
Переглядів 1,7 тис.2 роки тому
Topology Lecture 23: Compactness III

КОМЕНТАРІ

  • @ivonneortiz2480
    @ivonneortiz2480 24 дні тому

    This lecture is infnitely beautiful, Brilliant presentation.

  • @XrcyhikUbhdfbjdf
    @XrcyhikUbhdfbjdf 26 днів тому

    Davis Susan Martinez Jennifer Rodriguez Nancy

  • @elsurexiste
    @elsurexiste 27 днів тому

    Didn't follow the argument about continuity that well. I was kind of expecting a measure to be introduced but I may be too stuck in my metric space ways.

  • @XrcyhikUbhdfbjdf
    @XrcyhikUbhdfbjdf Місяць тому

    Moore James Lopez Laura Wilson Anthony

  • @Adamsee1
    @Adamsee1 Місяць тому

    Thanks for the videos, helped me a lot.

  • @ChrisRossaroGG
    @ChrisRossaroGG Місяць тому

    12:35 I was trying to prove the lemma by my self, wondering why I should take a finite union of open sets U_p_i (actually a union was also an open set). Then I thought about the intersection of sets V_p_i, which is open only if finite and everything became clear.

  • @ChrisRossaroGG
    @ChrisRossaroGG Місяць тому

    55:15 one should show that P is closed.

  • @ChrisRossaroGG
    @ChrisRossaroGG Місяць тому

    29:57 the symbol ought to be \in and not =.

  • @ChrisRossaroGG
    @ChrisRossaroGG Місяць тому

    28:48 here one starts from two manifolds with boundaries (which are not manifolds) and eventually ends up with a manifold; impressive.

  • @ChrisRossaroGG
    @ChrisRossaroGG Місяць тому

    22:30 this is the "Vel" symbol, the "Wedge" symbol is the Vel turned upside down.

  • @ChrisRossaroGG
    @ChrisRossaroGG Місяць тому

    4:08 here is said that a point in A can have multiple values in f(A), how is that possible if f is a function?

  • @fernandojosegarcia7619
    @fernandojosegarcia7619 Місяць тому

    You forgot to show that the topology is unique in the porosition that starts at 20:20. Great videos!💪👍🖖

  • @ChrisRossaroDidatticaDigitale
    @ChrisRossaroDidatticaDigitale Місяць тому

    10:41 in the definition of subset topology there's written V subset of X, but I reckon you meant V element of the topology of X.

  • @ChrisRossaroDidatticaDigitale
    @ChrisRossaroDidatticaDigitale Місяць тому

    I was thinking: since topological manifold with boundaries are not manifolds, one cannot define an atlas on them. If so, it would be composed of coordinate charts made out of different coordinate domains. Does this make any sense?

  • @ChrisRossaroDidatticaDigitale
    @ChrisRossaroDidatticaDigitale Місяць тому

    20:20. Quick and easy explanation. Just one question: where the uniqueness of topology is proven? Moreover, in the converse implication where the hypothesis of unique topology is used? Thanks in advance.

  • @abhigyanganguly4720
    @abhigyanganguly4720 Місяць тому

    Great lecture! I've been following it very closely and had one doubt. Would be grateful if someone could help. At 37:41, you prove that f(|V) ^(-1) (U) i.e. the purple set is open because it is the pre-image of U (an open set) under a restrictive function f which you assumed to be continuous. I'm assuming you draw this conclusion from the proposition (c) proved at 24:32 If so, doesn't this require f^(-1) (U) to be an open set first (as mentioned in the proposition) ? Since it is not an iff statement, we can't draw any reverse conclusions. Thanks

  • @ChrisRossaroDidatticaDigitale
    @ChrisRossaroDidatticaDigitale Місяць тому

    16:27 I reckon you meant one point Hausdorff space is closed.

  • @petermerrill9803
    @petermerrill9803 Місяць тому

    This is a fascinating subject! Are you going to do the next in the series on inference? I sure hope so.

  • @ChrisRossaroDidatticaDigitale
    @ChrisRossaroDidatticaDigitale Місяць тому

    16:20, if we defined U=f^{-1}(V) by (*) U is open, then f^{-1}(V) is open; why writing f^{-1}(V)=f^{-1}(f(f^{-1}(V)))=...?

    • @abhigyanganguly1988
      @abhigyanganguly1988 Місяць тому

      Agreed. Even I felt that the proof was more convoluted than it should've been

  • @ChrisRossaroDidatticaDigitale
    @ChrisRossaroDidatticaDigitale Місяць тому

    You talk about balls in a general topological space (X, T), could you define a ball supposing the topology is not induced by a metric? I head your answer at 10:16, now it's clear.

  • @sathyas3729
    @sathyas3729 2 місяці тому

    Each connected component is only closed need not be open??

  • @Garfield_Minecraft
    @Garfield_Minecraft 2 місяці тому

    Finally an exciting stuff

  • @forheuristiclifeksh7836
    @forheuristiclifeksh7836 2 місяці тому

    1:00

  • @Matias-vj8so
    @Matias-vj8so 2 місяці тому

    Wouldn´t be better to say that (X,T) is a topological space rather than just X?

    • @minamur
      @minamur Місяць тому

      i don't think so. if X is a topological space then there's some T that is a topology for it-- you'd only need to mention T if you're referring to it later, otherwise i don't see what difference it'd make.

  • @עמיתלרמן
    @עמיתלרמן 3 місяці тому

    That's a great video. Just a thing that bothered me, in the omega example. Youve drawn a set u that does not contain [0]=[1] on the unit circle. But for some reason its inverse under omega contained both the points 1 and 0. But it's my first time studying topology, and im kind of suprised that i can comprehend all of that without having to rewing every two minutes like most complicated topics. So from lack of experience in other learning sources i can't really judge but i would say you are doing a great job!

  • @tylerbakeman
    @tylerbakeman 3 місяці тому

    0:50, Your T looks like S-bar, and your P also looks like S-bar, or possibly a T but with more of a Disney font. Impressive…

  • @tylerbakeman
    @tylerbakeman 3 місяці тому

    34:15, does anyone else hear Kermit the Frog talking about Epsilons?

    • @tylerbakeman
      @tylerbakeman 3 місяці тому

      No offense. Your voice is beautiful. It’s late, and all I hear is frogs..

  • @slenbisoobeliut
    @slenbisoobeliut 3 місяці тому

    Thanks for the series mate, I finally understood that I need to selfstudy more intense)

  • @slenbisoobeliut
    @slenbisoobeliut 3 місяці тому

    That was a tough one, thanks) I've got a question about real analysis: which course/book/source would you recommend for it? I just don't have this one at uni but I studied complex analysis so I am little dummy at this one)

  • @CherithLavisetty
    @CherithLavisetty 3 місяці тому

    How is N an open set? It can be neither open nor close depending on the topology chosen right

  • @matheusjahnke8643
    @matheusjahnke8643 3 місяці тому

    18:32 "why is this?"... because picking any point p ∈ X \ {f0}, it is proven that p is in the interior of X \ {f0} (as in, there's a neighborhood of p completely contained in X \ {f0})... which means the interior of X \ {f0} is equal to X \ {f0}... which means X \ {f0} is open;

  • @slenbisoobeliut
    @slenbisoobeliut 3 місяці тому

    Hi mate, I didn't get the thing about 'yota-s': is this about sequences of subspace S?

    • @mariusfurter
      @mariusfurter 3 місяці тому

      It should be the inclusion map of S into X, i.e. the function that sends each s in S to itself, viewed as an element of the larger space.

    • @slenbisoobeliut
      @slenbisoobeliut 3 місяці тому

      @@mariusfurter oh, now I see the picture, thanks mate, you help me a lot for a research project because I don't have the module in uni)

  • @matheusjahnke8643
    @matheusjahnke8643 3 місяці тому

    One thing; I think the topological definition might be redundant; The (i) axiom is redundant if we consider intersections and unions over no sets; Intersection over (no sets) = Universe set = X Union over (no sets) = Empty set (ii) and (iii) imply (i)

  • @richardchapman1592
    @richardchapman1592 3 місяці тому

    Wondering if these morphing spaces are used by orian to track down the power of money counter accumulation on the black markets.

  • @xanderlewis
    @xanderlewis 4 місяці тому

    These are some of the most thorough and clear videos (on any topic) I've seen so far. I'm amazed this one only has 267 views after three years.

  • @adokwuondoma37
    @adokwuondoma37 4 місяці тому

    I have followed your lectures carefully until now but you didn't explain the meaning of COUNTABLE

    • @mariusfurter
      @mariusfurter 4 місяці тому

      A set X is said to be countably infinite iff there is a bijection f: N -> X from the natural numbers to X. A set is said to be countable iff it is finite or countably infinite. Intuitively, countable sets are ones in which you can list all the elements one by one in a (possibly infinite) list. Some sets, like the real numbers are too large to be listed in this way.

    • @adokwuondoma37
      @adokwuondoma37 4 місяці тому

      @@mariusfurter so nice and easy. I guess it was so easy that you you overlooked it. Thanks

  • @Maria-yx4se
    @Maria-yx4se 4 місяці тому

    I started learning this subject because I thought it was about donuts, turns out its just set theory on steroids, much like abstract algebra. Now I understand the importance of set theory as a foundation for these fields

  • @danielc.martin
    @danielc.martin 4 місяці тому

    Cool!

  • @Artist-Lover
    @Artist-Lover 5 місяців тому

    I think G in the last example is not continuous because the sphere is open and the cube is not. You should change the max to be < 1

    • @Sprechta
      @Sprechta Місяць тому

      I think you are getting the sphere confused with the balls from the previous example. In this case both sets are closed. The example is talking about the surfaces of the shapes not their interiors.

  • @Maria-yx4se
    @Maria-yx4se 5 місяців тому

    thank you for this.

  • @braindead3201
    @braindead3201 5 місяців тому

    For the final example about the connected set that is not path connected, I was having trouble figuring out the detail in the extra notes about the existence of the minimum value a. I managed to figured out a proof which might help others understand. The claim is that there is a minimum a such that g(a)=(0,y). Notice that any value t which satisfies g(t)=(0,y) equivalently satisfies (fg)(t)=0, where f is the projection function along the first coordinate. Hence the set of such t is exactly the set of zeroes for the composite function fg. We know the projection function is continuous and g is continuous by assumption, so fg is also continuous. An important fact to know is that the zeroes of a continuous real function form a closed set. This set is a subset of [0,1], so it is bounded below. This and the fact that it’s closed implies that the set of zeroes contains its infimum. We take this infimum to be the value of a.

  • @braindead3201
    @braindead3201 6 місяців тому

    I don’t think the wedge sum example quite works because we don’t know if the singleton {y0} is closed in Y. If it is closed, we can make the wedge sum, but I don’t think this works for a general topology Y.

    • @mariusfurter
      @mariusfurter 5 місяців тому

      The wedge sum is always defined as X+Y/~ where + denotes the disjoint union space and ~ is the equivalence relation that identifies a point x_0 in X with y_0 in Y. If X and Y are not Hausdorff, the wedge sum may behave unexpectedly. I think the correct statement you want to make is that the wedge sum is not a special case of an adjunction space in general because the conditions on the attaching map could fail if the basepoints are not closed.

  • @youregonnaletityeetyouaway2882
    @youregonnaletityeetyouaway2882 6 місяців тому

    love your videos! 1 question, on the basis criterion proof , <= direction, why is it not enough to use the definition of open set that every point in the set has a neighbourhood contained in the set? with B_p as the neighbourhood?

    • @mariusfurter
      @mariusfurter 6 місяців тому

      Thanks! I understand the confusion. In a general topological space, open sets are primitives (i.e they are part of the data of the space). Hence in that case, we need to prove that the basis criterion holds (a set U is open iff you can find a basis element contained in it). Oftentimes, however, one defines a topology on a space by using a basis (e.g. open intervals on R). In that case the basis criterion holds by definition. But not all topologies are defined in this way. The implication is not trivial because it holds for any basis for a given topology, regardless how that topology was defined.

  • @braindead3201
    @braindead3201 6 місяців тому

    Awesome video. I just have one nitpick. Whenever you talk about open sets in the product topology, like in 15:50, you write the open sets as unions of open sets in the component spaces. I don’t think it’s necessary to do all that given that each union would be an open set in each component space already. All you really need is that U=U1xU2.

    • @mariusfurter
      @mariusfurter 6 місяців тому

      It's possible I missed some opportunities to simplify. But beware: Open sets in the product topology are not all of the form U1 x U2 for opens U1, U2 in the component spaces. Such products U1 x U2 only form a basis for the product topology, so opens in the product topology are in general unions of such sets. For instance, in R^2 the open unit ball B_1(0) is not of this form.

    • @braindead3201
      @braindead3201 6 місяців тому

      @@mariusfurterThat’s a good point. I had not thought about that.

  • @nektariosorfanoudakis2270
    @nektariosorfanoudakis2270 6 місяців тому

    For a less intuitive but simpler version we can take the identity function from a space to itself, but with two different topologies; the topology in the domain being strictly finer than the one in the codomain. For example X is a space with at least two points, the discrete topology in the domain, the trivial topology in the codomain. This example is the same, we can change the topology in the interval so that it becomes homeomorphic to the circle, but it won't be the subspace topology in R^2!

  • @sidharthdembi4400
    @sidharthdembi4400 6 місяців тому

    Great set of videos. Thanks.

  • @braindead3201
    @braindead3201 6 місяців тому

    At 32:40 you should not assume that the points are not colinear.

  • @dutonic
    @dutonic 6 місяців тому

    the textbook I'm using says the open cover only needs to contain the space X. Not that it needs to equal it.

    • @mariusfurter
      @mariusfurter 6 місяців тому

      Yes, there are two possible definitions. For all practical purposes, they are equivalent. If you have an open cover containing X, you can get one equal to X by intersecting it with X. Conversely, every open cover that equals X also contains X. In proofs one usually goes back and forth between both options, depending on what's most convenient.

  • @sidharthdembi4400
    @sidharthdembi4400 6 місяців тому

    Wonderful explanations Thx

  • @Shubham-ic5tx
    @Shubham-ic5tx 6 місяців тому

    Thank you professor ❤