{
 "plan": "b6c1892d081a163dc6406be02a14ddbbf7303af42a9bbfb62514883df2e0e35a",
 "gemaakt": "2026-10-29T13:29:22.079Z",
 "telling": {
  "sleutels": 452,
  "opgelost": 446,
  "oud": 412,
  "oud_met_pad2": 412,
  "nieuw_titels": 5,
  "nieuw_knopen": 7,
  "verzoeken": 10,
  "afgeknepen": 0
 },
 "plekken": [
  {
   "sleutel": "Lebombo bone",
   "citaten": [
    {
     "hoofdstuk": "Numbers and foundations",
     "nr": 2,
     "bronregel": "Wikipedia, Lebombo bone"
    }
   ],
   "wikipedia": "Lebombo bone",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Babylonian cuneiform numerals",
   "citaten": [
    {
     "hoofdstuk": "Numbers and foundations",
     "nr": 8,
     "bronregel": "Wikipedia, Babylonian cuneiform numerals"
    }
   ],
   "wikipedia": "Babylonian cuneiform numerals",
   "via": "exact",
   "oud": {
    "id": 4436647,
    "titel": "Babylonian cuneiform numerals",
    "adres1": "11622675997@26",
    "pad2": "+-+++-+--0-+-0++-+----+-",
    "lead": "Assyro-Chaldean Babylonian cuneiform numerals were written in cuneiform, using a wedge-tipped reed stylus to make a mark on a soft clay tablet which would be exposed in the sun to harden to create a permanent record."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "0",
   "citaten": [
    {
     "hoofdstuk": "Numbers and foundations",
     "nr": 12,
     "bronregel": "Wikipedia, 0"
    }
   ],
   "wikipedia": "0",
   "via": "exact",
   "oud": {
    "id": 4374242,
    "titel": "0",
    "adres1": "25735970190106@33",
    "pad2": "+--+++-00-++-+-00--+0-+0",
    "lead": "0 (zero) is a number representing an empty quantity. In place-value notation such as the Hindu–Arabic numeral system, 0 also serves as a placeholder numerical digit, which works by multiplying digits to the left of 0 by the radix, usually by 10. As a number, 0 fulfills a central role in mathematics as the additive identity of the integers, real numbers, and other algebraic structures."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Square root of 2",
   "citaten": [
    {
     "hoofdstuk": "Numbers and foundations",
     "nr": 13,
     "bronregel": "Wikipedia, square root of 2"
    }
   ],
   "wikipedia": "Square root of 2",
   "via": "exact",
   "oud": {
    "id": 4488619,
    "titel": "Square root of 2",
    "adres1": "2859307290577@33",
    "pad2": "+-0+++---+0+-+-0------++",
    "lead": "The square root of 2 (approximately 1.4142) is a positive real number that, when multiplied by itself, equals the number 2. It may be written in mathematics as or , and is an algebraic number. Technically, it should be called the principal square root of 2, to distinguish it from the negative number with the same property. Sequence in the On-Line Encyclopedia of Integer Sequences consists of the digits in the decimal expansion of the square root of 2, here truncated to 65 decimal places: 1.41421356237309504880168872420969807856967187537694807317667973799"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Complex number",
   "citaten": [
    {
     "hoofdstuk": "Numbers and foundations",
     "nr": 20,
     "bronregel": "Wikipedia, complex number"
    },
    {
     "hoofdstuk": "Complex analysis",
     "nr": 1,
     "bronregel": "Wikipedia, Complex number"
    }
   ],
   "wikipedia": "Complex number",
   "via": "exact",
   "oud": {
    "id": 4361528,
    "titel": "Complex number",
    "adres1": "143489890@22",
    "pad2": "+-+++0++0+0+-+00-+-0--0+",
    "lead": "In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted i, called the imaginary unit and satisfying the equation ; every complex number can be expressed in the form , where a and b are real numbers. Because no real number satisfies the above equation, i was called an imaginary number by René Descartes. For the complex number , a is called the real part, and b is called the imaginary part. The set of complex numbers is denoted by either of the symbols or C. Despite the historical nomenclature \"imaginary\", complex numbers are regarded in the mathematical sciences as just as \"real\" as the real numbers and are fundamental in"
   },
   "reden_oud": null,
   "nieuw": [
    "complex"
   ]
  },
  {
   "sleutel": "Georg Cantor's first set theory article",
   "citaten": [
    {
     "hoofdstuk": "Numbers and foundations",
     "nr": 29,
     "bronregel": "Wikipedia, Georg Cantor’s first set theory article"
    }
   ],
   "wikipedia": "Cantor's first set theory article",
   "via": "doorverwijzing",
   "oud": {
    "id": 5820978,
    "titel": "Cantor's first set theory article",
    "adres1": "694024821856792@38",
    "pad2": "+-++0++0-+-++-+-00---0+-",
    "lead": "Cantor's first set theory article contains Georg Cantor's first theorems of transfinite set theory, which studies infinite sets and their properties. One of these theorems is his \"revolutionary discovery\" that the set of all real numbers is uncountably, rather than countably, infinite. This theorem is proved using Cantor's first uncountability proof, which differs from the more familiar proof using his diagonal argument. The title of the article, \"On a Property of the Collection of All Real Algebraic Numbers\" (\"Ueber eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen\"), refers to its first theorem: the set of real algebraic numbers is countable. Cantor's article was publishe"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Cantor's diagonal argument",
   "citaten": [
    {
     "hoofdstuk": "Numbers and foundations",
     "nr": 30,
     "bronregel": "Wikipedia, Cantor’s diagonal argument"
    }
   ],
   "wikipedia": "Cantor's diagonal argument",
   "via": "exact",
   "oud": {
    "id": 4381061,
    "titel": "Cantor's diagonal argument",
    "adres1": "2824688166139@31",
    "pad2": "+-++0+++-+0++-+----0-+-+",
    "lead": "In set theory, Cantor's diagonal argument, also called the diagonalisation argument, the diagonal slash argument, the anti-diagonal argument, the diagonal method, and Cantor's diagonalization proof, was published in 1891 by Georg Cantor as a mathematical proof that there are infinite sets which cannot be put into one-to-one correspondence with the infinite set of natural numbers. Such sets are now known as uncountable sets, and the size of infinite sets is now treated by the theory of cardinal numbers which Cantor began."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Euclid's theorem",
   "citaten": [
    {
     "hoofdstuk": "Number theory",
     "nr": 5,
     "bronregel": "Wikipedia, Euclid’s theorem"
    }
   ],
   "wikipedia": "Euclid's theorem",
   "via": "exact",
   "oud": {
    "id": 4894214,
    "titel": "Euclid's theorem",
    "adres1": "2859308293024@33",
    "pad2": "+-++0++--+-+--+-++-0--+-",
    "lead": "Euclid's theorem is a fundamental statement in number theory that asserts that there are infinitely many prime numbers. It was first proved by Euclid in his work Elements. There are several proofs of the theorem."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Proofs of Fermat's little theorem",
   "citaten": [
    {
     "hoofdstuk": "Number theory",
     "nr": 15,
     "bronregel": "Wikipedia, proofs of Fermat’s little theorem"
    }
   ],
   "wikipedia": "Proofs of Fermat's little theorem",
   "via": "exact",
   "oud": {
    "id": 4397724,
    "titel": "Proofs of Fermat's little theorem",
    "adres1": "317700805456@31",
    "pad2": "+-++0+++-+0+--++-0+0-+-0",
    "lead": "This article collects together a variety of proofs of Fermat's little theorem, which states that for every prime number p and every integer a (see modular arithmetic)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Quadratic reciprocity",
   "citaten": [
    {
     "hoofdstuk": "Number theory",
     "nr": 22,
     "bronregel": "Wikipedia, quadratic reciprocity"
    }
   ],
   "wikipedia": "Quadratic reciprocity",
   "via": "exact",
   "oud": {
    "id": 4370368,
    "titel": "Quadratic reciprocity",
    "adres1": "388013257@24",
    "pad2": "+-++0++0000+++---+--00-+",
    "lead": "In number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. Due to its subtlety, it has many formulations, but the most standard statement is: Law of quadratic reciprocity — Let p and q be distinct odd prime numbers, and define the Legendre symbol as: Then: indeed, This formula only works if it is known in advance that is a quadratic residue, which can be checked using the law of quadratic reciprocity."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Dirichlet's theorem on arithmetic progressions",
   "citaten": [
    {
     "hoofdstuk": "Number theory",
     "nr": 26,
     "bronregel": "Wikipedia, Dirichlet’s theorem on arithmetic progressions"
    }
   ],
   "wikipedia": "Dirichlet's theorem on arithmetic progressions",
   "via": "exact",
   "oud": {
    "id": 4399083,
    "titel": "Dirichlet's theorem on arithmetic progressions",
    "adres1": "14368600@20",
    "pad2": "+-++0+++++-++-+0-+---+++",
    "lead": "In number theory, Dirichlet's theorem, also called the Dirichlet prime number theorem, states that for any two positive coprime integers a and d, there are infinitely many primes of the form a + nd, where n is also a positive integer. In other words, there are infinitely many primes that are congruent to a modulo d. The numbers of the form a + nd form an arithmetic progression"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Prime number theorem",
   "citaten": [
    {
     "hoofdstuk": "Number theory",
     "nr": 32,
     "bronregel": "Wikipedia, prime number theorem"
    },
    {
     "hoofdstuk": "Series and summability",
     "nr": 41,
     "bronregel": "Wikipedia, Prime number theorem"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 64,
     "bronregel": "Wikipedia, Prime number theorem"
    }
   ],
   "wikipedia": "Prime number theorem",
   "via": "exact",
   "oud": {
    "id": 4369556,
    "titel": "Prime number theorem",
    "adres1": "18530236901512243@39",
    "pad2": "+-++0++0-+0+--++--+00+++",
    "lead": "In mathematics, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs. The theorem was proved independently by Jacques Hadamard and Charles Jean de la Vallée Poussin in 1896 using ideas introduced by Bernhard Riemann (in particular, the Riemann zeta function)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Weil conjectures",
   "citaten": [
    {
     "hoofdstuk": "Number theory",
     "nr": 43,
     "bronregel": "Wikipedia, Weil conjectures"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 103,
     "bronregel": "Wikipedia, Weil conjectures"
    }
   ],
   "wikipedia": "Weil conjectures",
   "via": "exact",
   "oud": {
    "id": 4464432,
    "titel": "Weil conjectures",
    "adres1": "694811656749331@38",
    "pad2": "+-++0+++0+0++-+--+0--+-+",
    "lead": "In mathematics, the Weil conjectures were highly influential proposals by André Weil. They led to a successful multi-decade program to prove them, in which many leading researchers developed the framework of modern algebraic geometry and number theory."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Modularity theorem",
   "citaten": [
    {
     "hoofdstuk": "Number theory",
     "nr": 54,
     "bronregel": "Wikipedia, modularity theorem"
    }
   ],
   "wikipedia": "Modularity theorem",
   "via": "exact",
   "oud": {
    "id": 4444213,
    "titel": "Modularity theorem",
    "adres1": "313939915831@29",
    "pad2": "+-++0++-+-+-+-0--+0+0+-+",
    "lead": "The modularity theorem (formerly called the Taniyama–Shimura conjecture, Taniyama-Weil conjecture or modularity conjecture for elliptic curves) states that elliptic curves over the field of rational numbers are related to modular forms. Andrew Wiles proved the modularity theorem for semistable elliptic curves, which was enough to imply Fermat's Last Theorem. Later, a series of papers by Wiles's former students Brian Conrad, Fred Diamond and Richard Taylor, culminating in a joint paper with Christophe Breuil, extended Wiles's techniques to prove the full modularity theorem in 2001."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Ribet's theorem",
   "citaten": [
    {
     "hoofdstuk": "Number theory",
     "nr": 58,
     "bronregel": "Wikipedia, Ribet’s theorem"
    }
   ],
   "wikipedia": "Ribet's theorem",
   "via": "exact",
   "oud": {
    "id": 4566530,
    "titel": "Ribet's theorem",
    "adres1": "8474192442775@32",
    "pad2": "+-++0++-+++++-+--+--++-+",
    "lead": "Ribet's theorem (earlier called the epsilon conjecture or ε-conjecture) is part of number theory. It concerns properties of Galois representations associated with modular forms. It was proposed by Jean-Pierre Serre and proven by Ken Ribet. The proof was a significant step towards the proof of Fermat's Last Theorem (FLT). As shown by Serre and Ribet, the Taniyama–Shimura conjecture (whose status was unresolved at the time) and the epsilon conjecture together imply that FLT is true."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Plimpton 322",
   "citaten": [
    {
     "hoofdstuk": "Geometry",
     "nr": 4,
     "bronregel": "Wikipedia, Plimpton 322"
    },
    {
     "hoofdstuk": "History of mathematics",
     "nr": 2,
     "bronregel": "Wikipedia, Plimpton 322"
    }
   ],
   "wikipedia": "Plimpton 322",
   "via": "exact",
   "oud": {
    "id": 4877287,
    "titel": "Plimpton 322",
    "adres1": "77201281039870@36",
    "pad2": "+---++-+-+0+--+++-+-+0+-",
    "lead": "Plimpton 322 is a Babylonian clay tablet, notable as containing an example of Babylonian mathematics. It has number 322 in the G.A. Plimpton Collection at Columbia University. This tablet, believed to have been written about 1800 BC, has a table of four columns and 15 rows of numbers in the cuneiform script of the period."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Method of exhaustion",
   "citaten": [
    {
     "hoofdstuk": "Geometry",
     "nr": 13,
     "bronregel": "Wikipedia, method of exhaustion"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 66,
     "bronregel": "Wikipedia, Method of exhaustion"
    }
   ],
   "wikipedia": "Method of exhaustion",
   "via": "exact",
   "oud": {
    "id": 4723257,
    "titel": "Method of exhaustion",
    "adres1": "315017559928@31",
    "pad2": "+----0-+++++-++0--++---+",
    "lead": "The method of exhaustion (Latin: methodus exhaustionibus; French: méthode des anciens) is a method of finding the area of a shape by inscribing inside it a sequence of polygons whose areas converge to the area of the containing shape. If the sequence is correctly constructed, the difference in area between the nth polygon and the containing shape will become arbitrarily small as n becomes large. As this difference becomes arbitrarily small, the possible values for the area of the shape are systematically \"exhausted\" by the lower bound areas successively established by the sequence members."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Conics (Apollonius)",
   "citaten": [
    {
     "hoofdstuk": "Geometry",
     "nr": 16,
     "bronregel": "Wikipedia, Conics (Apollonius)"
    }
   ],
   "wikipedia": "Apollonius of Perga",
   "via": "doorverwijzing",
   "oud": {
    "id": 4467816,
    "titel": "Apollonius of Perga",
    "adres1": "941433581692@30",
    "pad2": "+---0-0----+--+---+--++-",
    "lead": "Apollonius of Perga (Greek: Ἀπολλώνιος ὁ Περγαῖος, translit. Apollṓnios ho Pergaîos; Latin: Apollonius Pergaeus; c. 240 BCE/BC – c. 190 BCE/BC) was an Ancient Greek geometer and astronomer known for his work on conic sections. Beginning from the contributions of Euclid and Archimedes on the topic, he brought them to the state prior to the invention of analytic geometry. His definitions of the terms ellipse, parabola, and hyperbola are the ones in use today. Gottfried Wilhelm Leibniz stated “He who understands Archimedes and Apollonius will admire less the achievements of the foremost men of later times.”"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Geometrization conjecture",
   "citaten": [
    {
     "hoofdstuk": "Geometry",
     "nr": 47,
     "bronregel": "Wikipedia, geometrization conjecture"
    }
   ],
   "wikipedia": "Geometrization conjecture",
   "via": "exact",
   "oud": {
    "id": 4457834,
    "titel": "Geometrization conjecture",
    "adres1": "143511211@22",
    "pad2": "+-++0++0+++++----0+--+-+",
    "lead": "In mathematics, Thurston's geometrization conjecture states that each of certain three-dimensional topological spaces has a unique geometric structure that can be associated with it. It is an analogue of the uniformization theorem for two-dimensional surfaces, which states that every simply connected Riemann surface can be given one of three geometries (Euclidean, spherical, or hyperbolic).In three dimensions, it is not always possible to assign a single geometry to a whole topological space. Instead, the geometrization conjecture states that every closed 3-manifold can be decomposed in a canonical way into pieces that each have one of eight types of geometric structure. The conjecture was p"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Babylonian mathematics",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 4,
     "bronregel": "Wikipedia, Babylonian mathematics"
    }
   ],
   "wikipedia": "Babylonian mathematics",
   "via": "exact",
   "oud": {
    "id": 4960212,
    "titel": "Babylonian mathematics",
    "adres1": "315016457671@29",
    "pad2": "+-+++0++0+-+--++-+----0-",
    "lead": "Babylonian mathematics (also known as Assyro-Babylonian mathematics) are the mathematics developed or practiced by the people of Mesopotamia, from the days of the early Sumerians to the centuries following the fall of Babylon in 539 BC. Babylonian mathematical texts are plentiful and well edited. With respect to time they fall in two distinct groups: one from the Old Babylonian period (1830–1531 BC), the other mainly Seleucid from the last three or four centuries BC. With respect to content, there is scarcely any difference between the two groups of texts. Babylonian mathematics remained constant, in character and content, for nearly two millennia."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Al-Jabr",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 6,
     "bronregel": "Wikipedia, Al-Jabr"
    }
   ],
   "wikipedia": "Al-Jabr",
   "via": "exact",
   "oud": {
    "id": 4679274,
    "titel": "Al-Jabr",
    "adres1": "2066632224049657@37",
    "pad2": "+----0++-0+0+++0+0--+-0-",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Omar Khayyam",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 10,
     "bronregel": "Wikipedia, Omar Khayyam"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 26,
     "bronregel": "Wikipedia, Omar Khayyam"
    }
   ],
   "wikipedia": "Omar Khayyam",
   "via": "exact",
   "oud": {
    "id": 4395344,
    "titel": "Omar Khayyam",
    "adres1": "76573277565274@34",
    "pad2": "++--+--+---0-++--+--+---",
    "lead": "Ghiyāth al-Dīn Abū al-Fatḥ ʿUmar ibn Ibrāhīm Nīsābūrī (18 May 1048 – 4 December 1131), commonly known as Omar Khayyam (Persian: عمر خیّام), was a Khorasani polymath, known for his contributions to mathematics, astronomy, philosophy, and Persian poetry. He was born in Nishapur, the initial capital of the Seljuk Empire. As a scholar, he was contemporary with the rule of the Seljuk dynasty around the time of the First Crusade."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Cubic equation",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 13,
     "bronregel": "Wikipedia, cubic equation"
    }
   ],
   "wikipedia": "Cubic equation",
   "via": "exact",
   "oud": {
    "id": 4446446,
    "titel": "Cubic equation",
    "adres1": "2859307295752@33",
    "pad2": "+-+++0++-+0+-+---+-----0",
    "lead": "In algebra, a cubic equation in one variable is an equation of the form in which a is nonzero. The solutions of this equation are called roots of the cubic function defined by the left-hand side of the equation. If all of the coefficients a, b, c, and d of the cubic equation are real numbers, then it has at least one real root (this is true for all odd-degree polynomial functions). All of the roots of the cubic equation can be found by the following means:"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Quartic equation",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 14,
     "bronregel": "Wikipedia, quartic equation"
    }
   ],
   "wikipedia": "Quartic equation",
   "via": "exact",
   "oud": {
    "id": 4466276,
    "titel": "Quartic equation",
    "adres1": "2859307235983@33",
    "pad2": "+-+++0++0+-+-++0-+--0-++",
    "lead": "In mathematics, a quartic equation is one which can be expressed as a quartic function equaling zero. The general form of a quartic equation is where a ≠ 0. The quartic is the highest order polynomial equation that can be solved by radicals in the general case (i.e., one in which the coefficients can take any value)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Rafael Bombelli",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 17,
     "bronregel": "Wikipedia, Rafael Bombelli"
    }
   ],
   "wikipedia": "Rafael Bombelli",
   "via": "exact",
   "oud": {
    "id": 4698399,
    "titel": "Rafael Bombelli",
    "adres1": "145260784@24",
    "pad2": "+++++0-++--+++0+-+--0+0-",
    "lead": "Rafael Bombelli (baptised on 20 January 1526; died 1572) was an Italian mathematician. Born in Bologna, he is the author of a treatise on algebra and is a central figure in the understanding of imaginary numbers. He was the one who finally managed to address the problem with imaginary numbers. In his 1572 book, L'Algebra, Bombelli solved equations using the method of del Ferro/Tartaglia. He introduced the rhetoric that preceded the representative symbols +i and -i and described how they both worked."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Fundamental theorem of algebra",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 21,
     "bronregel": "Wikipedia, fundamental theorem of algebra"
    }
   ],
   "wikipedia": "Fundamental theorem of algebra",
   "via": "exact",
   "oud": {
    "id": 4381055,
    "titel": "Fundamental theorem of algebra",
    "adres1": "435801394@25",
    "pad2": "+-++0++-++0++-+--0+--+-0",
    "lead": "The fundamental theorem of algebra, also known as d'Alembert's theorem, or the d'Alembert–Gauss theorem, states that every non-constant single-variable polynomial with complex coefficients has at least one complex root. This includes polynomials with real coefficients, since every real number is a complex number with its imaginary part equal to zero. Equivalently (by definition), the theorem states that the field of complex numbers is algebraically closed."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "History of group theory",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 26,
     "bronregel": "Wikipedia, history of group theory"
    }
   ],
   "wikipedia": "History of group theory",
   "via": "exact",
   "oud": {
    "id": 5595953,
    "titel": "History of group theory",
    "adres1": "1501564310103355786@43",
    "pad2": "+-+++00-++-0--+--+-0-+++",
    "lead": "The history of group theory, a mathematical domain studying groups in their various forms, has evolved in various parallel threads. There are three historical roots of group theory: the theory of algebraic equations, number theory and geometry. Joseph Louis Lagrange, Niels Henrik Abel and Évariste Galois were early researchers in the field of group theory."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Abel–Ruffini theorem",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 27,
     "bronregel": "Wikipedia, Abel–Ruffini theorem"
    }
   ],
   "wikipedia": "Abel–Ruffini theorem",
   "via": "exact",
   "oud": {
    "id": 4436736,
    "titel": "Abel–Ruffini theorem",
    "adres1": "435847231@25",
    "pad2": "+-++0++-+--+0+---0-0000+",
    "lead": "In mathematics, the Abel–Ruffini theorem (also known as Abel's impossibility theorem) states that there is no solution in radicals to general polynomial equations of degree five or higher with arbitrary coefficients. Here, general means that the coefficients of the equation are viewed and manipulated as indeterminates. The theorem is named after Paolo Ruffini, who made an incomplete proof in 1799, (which was refined and completed in 1813 and accepted by Cauchy) and Niels Henrik Abel, who provided a proof in 1824."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Cayley's theorem",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 34,
     "bronregel": "Wikipedia, Cayley’s theorem"
    }
   ],
   "wikipedia": "Cayley's theorem",
   "via": "exact",
   "oud": {
    "id": 4400871,
    "titel": "Cayley's theorem",
    "adres1": "8474064498415@32",
    "pad2": "+-++0++-+++++0+--+--0+++",
    "lead": "In group theory, Cayley's theorem, named in honour of Arthur Cayley, states that every group G is isomorphic to a subgroup of a symmetric group. More specifically, G is isomorphic to a subgroup of the symmetric group whose elements are the permutations of the underlying set of G.Explicitly, * for each , the left-multiplication-by-g map sending each element x to gx is a permutation of G, and * the map sending each element g to is an injective homomorphism, so it defines an isomorphism from G onto a subgroup of . When G is infinite, is infinite, but Cayley's theorem still applies."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hilbert's basis theorem",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 39,
     "bronregel": "Wikipedia, Hilbert’s basis theorem"
    }
   ],
   "wikipedia": "Hilbert's basis theorem",
   "via": "exact",
   "oud": {
    "id": 4365044,
    "titel": "Hilbert's basis theorem",
    "adres1": "77201295390982@36",
    "pad2": "+-++0++-++0++0+0-0+--+--",
    "lead": "In mathematics, specifically commutative algebra, Hilbert's basis theorem says that a polynomial ring over a Noetherian ring is Noetherian."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Lasker–Noether theorem",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 42,
     "bronregel": "Wikipedia, Lasker–Noether theorem"
    },
    {
     "hoofdstuk": "Unifying structures",
     "nr": 11,
     "bronregel": "Wikipedia, Lasker–Noether theorem"
    }
   ],
   "wikipedia": "Primary decomposition",
   "via": "doorverwijzing",
   "oud": {
    "id": 4650472,
    "titel": "Primary decomposition",
    "adres1": "123083800871737059496@49",
    "pad2": "+-------000+00----++00++",
    "lead": "In mathematics, the Lasker–Noether theorem states that every Noetherian ring is a Lasker ring, which means that every ideal can be decomposed as an intersection, called primary decomposition, of finitely many primary ideals (which are related to, but not quite the same as, powers of prime ideals). The theorem was first proven by Emanuel Lasker for the special case of polynomial rings and convergent power series rings, and was proven in its full generality by Emmy Noether."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Noetherian ring",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 43,
     "bronregel": "Wikipedia, Noetherian ring"
    }
   ],
   "wikipedia": "Noetherian ring",
   "via": "exact",
   "oud": {
    "id": 4382913,
    "titel": "Noetherian ring",
    "adres1": "145282492@24",
    "pad2": "+-++0++00+++--0--++--+-+",
    "lead": "In mathematics, a Noetherian ring is a ring that satisfies the ascending chain condition on left and right ideals; if the chain condition is satisfied only for left ideals or for right ideals, then the ring is said left-Noetherian or right-Noetherian respectively. That is, every increasing sequence of left (or right) ideals has a largest element; that is, there exists an n such that: Equivalently, a ring is left-Noetherian (resp. right-Noetherian) if every left ideal (resp. right-ideal) is finitely generated. A ring is Noetherian if it is both left- and right-Noetherian."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Moderne Algebra",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 46,
     "bronregel": "Wikipedia, Moderne Algebra"
    },
    {
     "hoofdstuk": "Unifying structures",
     "nr": 15,
     "bronregel": "Wikipedia, Moderne Algebra"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 49,
     "bronregel": "Wikipedia, Moderne Algebra"
    }
   ],
   "wikipedia": "Moderne Algebra",
   "via": "exact",
   "oud": {
    "id": 6344109,
    "titel": "Moderne Algebra",
    "adres1": "2393978063216278700325349@56",
    "pad2": "+-++00+-+-++0----+-0---0",
    "lead": "Moderne Algebra is a two-volume German textbook on graduate abstract algebra by Bartel Leendert van der Waerden , originally based on lectures given by Emil Artin in 1926 and by Emmy Noether from 1924 to 1928. The English translation of 1949–1950 had the title Modern algebra, though a later, extensively revised edition in 1970 had the title Algebra. In 1975 van der Waerden described the sources he drew upon to write the book. In 1997 Saunders Mac Lane recollected the book's influence:"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Vector space",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 48,
     "bronregel": "Wikipedia, vector space"
    }
   ],
   "wikipedia": "Vector space",
   "via": "exact",
   "oud": {
    "id": 4373503,
    "titel": "Vector space",
    "adres1": "43106527@21",
    "pad2": "+-0+++--+-++0+--+----+++",
    "lead": "In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called vectors, may be added together and multiplied (\"scaled\") by numbers called scalars. Scalars are often real numbers, but can be complex numbers or, more generally, elements of any field. The operations of vector addition and scalar multiplication must satisfy certain requirements, called vector axioms. The terms real vector space and complex vector space are often used to specify the nature of the scalars: real coordinate space or complex coordinate space."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Cayley–Hamilton theorem",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 51,
     "bronregel": "Wikipedia, Cayley–Hamilton theorem"
    },
    {
     "hoofdstuk": "Linear algebra",
     "nr": 11,
     "bronregel": "Wikipedia, Cayley–Hamilton theorem"
    }
   ],
   "wikipedia": "Cayley–Hamilton theorem",
   "via": "exact",
   "oud": {
    "id": 4443895,
    "titel": "Cayley–Hamilton theorem",
    "adres1": "8577921887263@34",
    "pad2": "+-++0++-+++++0+--+--++++",
    "lead": "In linear algebra, the Cayley–Hamilton theorem (named after the mathematicians Arthur Cayley and William Rowan Hamilton) states that every square matrix over a commutative ring (such as the real or complex numbers or the integers) satisfies its own characteristic equation."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Feit–Thompson theorem",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 55,
     "bronregel": "Wikipedia, Feit–Thompson theorem"
    }
   ],
   "wikipedia": "Feit–Thompson theorem",
   "via": "exact",
   "oud": {
    "id": 4714199,
    "titel": "Feit–Thompson theorem",
    "adres1": "6179276990929357@38",
    "pad2": "+-++0++-0+0+++0--0++-+--",
    "lead": "In mathematics, the Feit–Thompson theorem, or odd order theorem, states that every finite group of odd order is solvable. It was proved by Walter Feit and John Griggs Thompson ."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Classification of finite simple groups",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 56,
     "bronregel": "Wikipedia, classification of finite simple groups"
    }
   ],
   "wikipedia": "Classification of finite simple groups",
   "via": "exact",
   "oud": {
    "id": 4362223,
    "titel": "Classification of finite simple groups",
    "adres1": "282429536491@29",
    "pad2": "+-++++--+--++-+---++0+--",
    "lead": "In mathematics, the classification of the finite simple groups is a result of group theory stating that every finite simple group is either cyclic, or alternating, or it belongs to a broad infinite class called the groups of Lie type, or else it is one of twenty-six or twenty-seven exceptions, called sporadic. The proof consists of tens of thousands of pages in several hundred journal articles written by about 100 authors, published mostly between 1955 and 2004. Gorenstein (d.1992), Lyons, and Solomon are gradually publishing a simplified and revised version of the proof."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Vorlesungen über Zahlentheorie",
   "citaten": [
    {
     "hoofdstuk": "Algebra",
     "nr": 62,
     "bronregel": "Wikipedia, Vorlesungen über Zahlentheorie"
    }
   ],
   "wikipedia": "Vorlesungen über Zahlentheorie",
   "via": "exact",
   "oud": {
    "id": 4574759,
    "titel": "Vorlesungen über Zahlentheorie",
    "adres1": "3874802761@46",
    "pad2": "+-+++0++++-++0++-+-0-0--",
    "lead": "Vorlesungen über Zahlentheorie (German for Lectures on Number Theory) is the name of several different textbooks of number theory. The best known was written by Peter Gustav Lejeune Dirichlet and Richard Dedekind, and published in 1863. Others were written by Leopold Kronecker, Edmund Landau, and Helmut Hasse. They all cover elementary number theory, Dirichlet's theorem, quadratic fields and forms, and sometimes more advanced topics."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Cavalieri's principle",
   "citaten": [
    {
     "hoofdstuk": "Analysis",
     "nr": 11,
     "bronregel": "Wikipedia, Cavalieri’s principle"
    }
   ],
   "wikipedia": "Cavalieri's principle",
   "via": "exact",
   "oud": {
    "id": 5782747,
    "titel": "Cavalieri's principle",
    "adres1": "76549300521931@36",
    "pad2": "+-+++0+0+0-+0-+00---++0+",
    "lead": "In geometry, Cavalieri's principle, a modern implementation of the method of indivisibles, named after Bonaventura Cavalieri, is as follows: * 2-dimensional case: Suppose two regions in a plane are included between two parallel lines in that plane. If every line parallel to these two lines intersects both regions in line segments of equal length, then the two regions have equal areas. * 3-dimensional case: Suppose two regions in three-space (solids) are included between two parallel planes. If every plane parallel to these two planes intersects both regions in cross-sections of equal area, then the two regions have equal volumes."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Adequality",
   "citaten": [
    {
     "hoofdstuk": "Analysis",
     "nr": 13,
     "bronregel": "Wikipedia, adequality"
    }
   ],
   "wikipedia": "Adequality",
   "via": "exact",
   "oud": {
    "id": 6100344,
    "titel": "Adequality",
    "adres1": "945047896570@32",
    "pad2": "+------0-0000+--+0--+---",
    "lead": "Adequality is a technique developed by Pierre de Fermat in his treatise Methodus ad disquirendam maximam et minimam (a Latin treatise circulated in France c. 1636) to calculate maxima and minima of functions, tangents to curves, area, center of mass, least action, and other problems in calculus. According to André Weil, Fermat \"introduces the technical term adaequalitas, adaequare, etc., which he says he has borrowed from Diophantus. As Diophantus V.11 shows, it means an approximate equality, and this is indeed how Fermat explains the word in one of his later writings.\" (Weil 1973). Diophantus coined the word παρισότης (parisotēs) to refer to an approximate equality. Claude Gaspard Bachet de"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "History of the function concept",
   "citaten": [
    {
     "hoofdstuk": "Analysis",
     "nr": 18,
     "bronregel": "Wikipedia, history of the function concept"
    }
   ],
   "wikipedia": "History of the function concept",
   "via": "exact",
   "oud": {
    "id": 6318748,
    "titel": "History of the function concept",
    "adres1": "11667277855@26",
    "pad2": "+-+++0--++----++-0++0++-",
    "lead": "The mathematical concept of a function emerged in the 17th century in connection with the development of the calculus; for example, the slope of a graph at a point was regarded as a function of the x-coordinate of the point. Functions were not explicitly considered in antiquity, but some precursors of the concept can perhaps be seen in the work of medieval philosophers and mathematicians such as Oresme."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Fourier series",
   "citaten": [
    {
     "hoofdstuk": "Analysis",
     "nr": 20,
     "bronregel": "Wikipedia, Fourier series"
    },
    {
     "hoofdstuk": "Differential equations and dynamical systems",
     "nr": 13,
     "bronregel": "Wikipedia, Fourier series"
    }
   ],
   "wikipedia": "Fourier series",
   "via": "exact",
   "oud": {
    "id": 4384076,
    "titel": "Fourier series",
    "adres1": "8577921688237@34",
    "pad2": "+-0+++--+00+-+++-++--++-",
    "lead": "A Fourier series (/ˈfʊrieɪ, -iər/) is a summation of harmonically related sinusoidal functions, also known as components or harmonics. The result of the summation is a periodic function whose functional form is determined by the choices of cycle length (or period), the number of components, and their amplitudes and phase parameters. With appropriate choices, one cycle (or period) of the summation can be made to approximate an arbitrary function in that interval (or the entire function if it too is periodic). The number of components is theoretically infinite, in which case the other parameters can be chosen to cause the series to converge to almost any well behaved periodic function (see Pat"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Carleson's theorem",
   "citaten": [
    {
     "hoofdstuk": "Analysis",
     "nr": 46,
     "bronregel": "Wikipedia, Carleson’s theorem"
    }
   ],
   "wikipedia": "Carleson's theorem",
   "via": "exact",
   "oud": {
    "id": 5877767,
    "titel": "Carleson's theorem",
    "adres1": "500521636319525533@42",
    "pad2": "+-++0++-++-++-0-++--0+-+",
    "lead": "Carleson's theorem is a fundamental result in mathematical analysis establishing the pointwise (Lebesgue) almost everywhere convergence of Fourier series of L2 functions, proved by Lennart Carleson. The name is also often used to refer to the extension of the result by Richard Hunt to Lp functions for p ∈ (1, ∞] (also known as the Carleson–Hunt theorem) and the analogous results for pointwise almost everywhere convergence of Fourier integrals, which can be shown to be equivalent by transference methods."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Seven Bridges of Königsberg",
   "citaten": [
    {
     "hoofdstuk": "Topology",
     "nr": 2,
     "bronregel": "Wikipedia, Seven Bridges of Königsberg"
    },
    {
     "hoofdstuk": "General",
     "nr": 35,
     "bronregel": "Wikipedia, Seven Bridges of Königsberg"
    }
   ],
   "wikipedia": "Seven Bridges of Königsberg",
   "via": "exact",
   "oud": {
    "id": 4449885,
    "titel": "Seven Bridges of Königsberg",
    "adres1": "11622675934@26",
    "pad2": "+--0--0-+++0+-000--+-+-0",
    "lead": "The Seven Bridges of Königsberg is a historically notable problem in mathematics. Its negative resolution by Leonhard Euler in 1736 laid the foundations of graph theory and prefigured the idea of topology. The city of Königsberg in Prussia (now Kaliningrad, Russia) was set on both sides of the Pregel River, and included two large islands—Kneiphof and Lomse—which were connected to each other, and to the two mainland portions of the city, by seven bridges. The problem was to devise a walk through the city that would cross each of those bridges once and only once. are explicitly unacceptable."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Homology (mathematics)",
   "citaten": [
    {
     "hoofdstuk": "Topology",
     "nr": 13,
     "bronregel": "Wikipedia, homology (mathematics)"
    }
   ],
   "wikipedia": "Homology (mathematics)",
   "via": "exact",
   "oud": {
    "id": 4432659,
    "titel": "Homology (mathematics)",
    "adres1": "35303647744@29",
    "pad2": "+-++000-+--+0-0--++0-+--",
    "lead": "In mathematics, homology is a general way of associating a sequence of algebraic objects, such as abelian groups or modules, with other mathematical objects such as topological spaces. Homology groups were originally defined in algebraic topology. Similar constructions are available in a wide variety of other contexts, such as abstract algebra, groups, Lie algebras, Galois theory, and algebraic geometry."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Topological space",
   "citaten": [
    {
     "hoofdstuk": "Topology",
     "nr": 19,
     "bronregel": "Wikipedia, topological space"
    }
   ],
   "wikipedia": "Topological space",
   "via": "exact",
   "oud": {
    "id": 4372628,
    "titel": "Topological space",
    "adres1": "56279744340202549@42",
    "pad2": "+-+++0-0+++++---0--+-++-",
    "lead": "In mathematics, a topological space is, roughly speaking, a geometrical space in which closeness is defined but cannot necessarily be measured by a numeric distance. More specifically, a topological space is a set whose elements are called points, along with an additional structure called a topology, which can be defined as a set of neighbourhoods for each point that satisfy some axioms formalizing the concept of closeness. There are several equivalent definitions of a topology, the most commonly used of which is the definition through open sets, which is easier than the others to manipulate."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Eilenberg–Steenrod axioms",
   "citaten": [
    {
     "hoofdstuk": "Topology",
     "nr": 23,
     "bronregel": "Wikipedia, Eilenberg–Steenrod axioms"
    }
   ],
   "wikipedia": "Eilenberg–Steenrod axioms",
   "via": "exact",
   "oud": {
    "id": 4892048,
    "titel": "Eilenberg–Steenrod axioms",
    "adres1": "2066820515196859@39",
    "pad2": "+-++0++0++-++00-++0----+",
    "lead": "In mathematics, specifically in algebraic topology, the Eilenberg–Steenrod axioms are properties that homology theories of topological spaces have in common. The quintessential example of a homology theory satisfying the axioms is singular homology, developed by Samuel Eilenberg and Norman Steenrod. One can define a homology theory as a sequence of functors satisfying the Eilenberg–Steenrod axioms. The axiomatic approach, which was developed in 1945, allows one to prove results, such as the Mayer–Vietoris sequence, that are common to all homology theories satisfying the axioms."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "H-cobordism",
   "citaten": [
    {
     "hoofdstuk": "Topology",
     "nr": 25,
     "bronregel": "Wikipedia, h-cobordism"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 165,
     "bronregel": "Wikipedia, H-cobordism"
    }
   ],
   "wikipedia": "H-cobordism",
   "via": "exact",
   "oud": {
    "id": 4563525,
    "titel": "H-cobordism",
    "adres1": "953102410588@32",
    "pad2": "+-+++0-0+-++0---++--++-+",
    "lead": "In geometric topology and differential topology, an (n + 1)-dimensional cobordism W between n-dimensional manifolds M and N is an h-cobordism (the h stands for homotopy equivalence) if the inclusion maps are homotopy equivalences. The h-cobordism theorem gives sufficient conditions for an h-cobordism to be trivial, i.e., to be C-isomorphic to the cylinder M × [0, 1]. Here C refers to any of the categories of smooth, piecewise linear, or topological manifolds."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kervaire invariant",
   "citaten": [
    {
     "hoofdstuk": "Topology",
     "nr": 36,
     "bronregel": "Wikipedia, Kervaire invariant"
    }
   ],
   "wikipedia": "Kervaire invariant",
   "via": "exact",
   "oud": {
    "id": 5493811,
    "titel": "Kervaire invariant",
    "adres1": "9847727623493105837554@51",
    "pad2": "+-++0++-+0++--0--++-++-+",
    "lead": "In mathematics, the Kervaire invariant is an invariant of a framed -dimensional manifold that measures whether the manifold could be surgically converted into a sphere. This invariant evaluates to 0 if the manifold can be converted to a sphere, and 1 otherwise. This invariant was named after Michel Kervaire who built on work of Cahit Arf. In any given dimension, there are only two possibilities: either all manifolds have Arf–Kervaire invariant equal to 0, or half have Arf–Kervaire invariant 0 and the other half have Arf–Kervaire invariant 1."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Least squares",
   "citaten": [
    {
     "hoofdstuk": "Probability and statistics",
     "nr": 18,
     "bronregel": "Wikipedia, least squares"
    }
   ],
   "wikipedia": "Least squares",
   "via": "exact",
   "oud": {
    "id": 4391735,
    "titel": "Least squares",
    "adres1": "55590710704536727@40",
    "pad2": "+-0+++-0+++++00+-+-+---0",
    "lead": "The method of least squares is a standard approach in regression analysis to approximate the solution of overdetermined systems (sets of equations in which there are more equations than unknowns) by minimizing the sum of the squares of the residuals (a residual being the difference between an observed value and the fitted value provided by a model) made in the results of each individual equation. Polynomial least squares describes the variance in a prediction of the dependent variable as a function of the independent variable and the deviations from the fitted curve."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Pingala",
   "citaten": [
    {
     "hoofdstuk": "Combinatorics and graph theory",
     "nr": 2,
     "bronregel": "Wikipedia, Pingala"
    }
   ],
   "wikipedia": "Pingala",
   "via": "exact",
   "oud": {
    "id": 4642470,
    "titel": "Pingala",
    "adres1": "229719946014982@35",
    "pad2": "++--+-0---+++-++--+--++0",
    "lead": "Acharya Pingala (piṅgala; c. 3rd–2nd century BCE) was an ancient Indian poet and mathematician, and the author of the Chandaḥśāstra (also called the Pingala-sutras), the earliest known treatise on Sanskrit prosody."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Euler characteristic",
   "citaten": [
    {
     "hoofdstuk": "Combinatorics and graph theory",
     "nr": 8,
     "bronregel": "Wikipedia, Euler characteristic"
    }
   ],
   "wikipedia": "Euler characteristic",
   "via": "exact",
   "oud": {
    "id": 4434836,
    "titel": "Euler characteristic",
    "adres1": "3922231663@27",
    "pad2": "+-+++0++++-+-+00-+0-0+-+",
    "lead": "In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler number, or Euler–Poincaré characteristic) is a topological invariant, a number that describes a topological space's shape or structure regardless of the way it is bent. It is commonly denoted by (Greek lower-case letter chi)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Cayley's formula",
   "citaten": [
    {
     "hoofdstuk": "Combinatorics and graph theory",
     "nr": 15,
     "bronregel": "Wikipedia, Cayley’s formula"
    }
   ],
   "wikipedia": "Cayley's formula",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Szemerédi's theorem",
   "citaten": [
    {
     "hoofdstuk": "Combinatorics and graph theory",
     "nr": 28,
     "bronregel": "Wikipedia, Szemerédi’s theorem"
    }
   ],
   "wikipedia": "Szemerédi's theorem",
   "via": "exact",
   "oud": {
    "id": 4545357,
    "titel": "Szemerédi's theorem",
    "adres1": "55614364745198221@40",
    "pad2": "+-++0++-++0++-+--000-+-0",
    "lead": "In arithmetic combinatorics, Szemerédi's theorem is a result concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured that every set of integers A with positive natural density contains a k-term arithmetic progression for every k. Endre Szemerédi proved the conjecture in 1975."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Four color theorem",
   "citaten": [
    {
     "hoofdstuk": "Combinatorics and graph theory",
     "nr": 42,
     "bronregel": "Wikipedia, four color theorem"
    }
   ],
   "wikipedia": "Four color theorem",
   "via": "exact",
   "oud": {
    "id": 4363822,
    "titel": "Four color theorem",
    "adres1": "25429118636521@33",
    "pad2": "+-++0++-+++0+0+----+++++",
    "lead": "In mathematics, the four color theorem, or the four color map theorem, states that no more than four colors are required to color the regions of any map so that no two adjacent regions have the same color. Adjacent means that two regions share a common boundary curve segment, not merely a corner where three or more regions meet. It was the first major theorem to be proved using a computer. Initially, this proof was not accepted by all mathematicians because the computer-assisted proof was infeasible for a human to check by hand. The proof has gained wide acceptance since then, although some doubters remain."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kepler problem",
   "citaten": [
    {
     "hoofdstuk": "Differential equations and dynamical systems",
     "nr": 2,
     "bronregel": "Wikipedia, Kepler problem"
    }
   ],
   "wikipedia": "Kepler problem",
   "via": "exact",
   "oud": {
    "id": 4815059,
    "titel": "Kepler problem",
    "adres1": "229720252002526@37",
    "pad2": "+-0+++--++0+-++---+++++0",
    "lead": "In classical mechanics, the Kepler problem is a special case of the two-body problem, in which the two bodies interact by a central force F that varies in strength as the inverse square of the distance r between them. The force may be either attractive or repulsive. The problem is to find the position or speed of the two bodies over time given their masses, positions, and velocities. Using classical mechanics, the solution can be expressed as a Kepler orbit using six orbital elements."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Three-body problem",
   "citaten": [
    {
     "hoofdstuk": "Differential equations and dynamical systems",
     "nr": 8,
     "bronregel": "Wikipedia, Three-body problem"
    },
    {
     "hoofdstuk": "Mechanics",
     "nr": 28,
     "bronregel": "Wikipedia, Three-body problem"
    },
    {
     "hoofdstuk": "Astronomy",
     "nr": 27,
     "bronregel": "Wikipedia, Three-body problem"
    }
   ],
   "wikipedia": "Three-body problem",
   "via": "exact",
   "oud": {
    "id": 4650478,
    "titel": "Three-body problem",
    "adres1": "2059791154471342@37",
    "pad2": "+-+++0-+0+0++-----00-+0+",
    "lead": "In physics and classical mechanics, the three-body problem is the problem of taking the initial positions and velocities (or momenta) of three point masses and solving for their subsequent motion according to Newton's laws of motion and Newton's law of universal gravitation. The three-body problem is a special case of the n-body problem. Unlike two-body problems, no general closed-form solution exists, as the resulting dynamical system is chaotic for most initial conditions, and numerical methods are generally required."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "D'Alembert's formula",
   "citaten": [
    {
     "hoofdstuk": "Differential equations and dynamical systems",
     "nr": 11,
     "bronregel": "Wikipedia, d’Alembert’s formula"
    }
   ],
   "wikipedia": "D'Alembert's formula",
   "via": "exact",
   "oud": {
    "id": 5009954,
    "titel": "D'Alembert's formula",
    "adres1": "40694407994895299434@48",
    "pad2": "+-+++0+++0-+--+--++-0-+0",
    "lead": "In mathematics, and specifically partial differential equations (PDEs), d'Alembert's formula is the general solution to the one-dimensional wave equation (where subscript indices indicate partial differentiation, using the d'Alembert operator, the PDE becomes: ). The solution depends on the initial conditions at : and .It consists of separate terms for the initial conditions and : It is named after the mathematician Jean le Rond d'Alembert, who derived it in 1747 as a solution to the problem of a vibrating string."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Picard–Lindelöf theorem",
   "citaten": [
    {
     "hoofdstuk": "Differential equations and dynamical systems",
     "nr": 18,
     "bronregel": "Wikipedia, Picard–Lindelöf theorem"
    }
   ],
   "wikipedia": "Picard–Lindelöf theorem",
   "via": "exact",
   "oud": {
    "id": 4560980,
    "titel": "Picard–Lindelöf theorem",
    "adres1": "77201295371353@36",
    "pad2": "+-++0++-+++++-+--+++0+0+",
    "lead": "In mathematics – specifically, in differential equations – the Picard–Lindelöf theorem gives a set of conditions under which an initial value problem has a unique solution. It is also known as Picard's existence theorem, the Cauchy–Lipschitz theorem, or the existence and uniqueness theorem. The theorem is named after Émile Picard, Ernst Lindelöf, Rudolf Lipschitz and Augustin-Louis Cauchy."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Cauchy–Kovalevskaya theorem",
   "citaten": [
    {
     "hoofdstuk": "Differential equations and dynamical systems",
     "nr": 21,
     "bronregel": "Wikipedia, Cauchy–Kovalevskaya theorem"
    }
   ],
   "wikipedia": "Cauchy–Kovalevskaya theorem",
   "via": "exact",
   "oud": {
    "id": 6656407,
    "titel": "Cauchy–Kovalevskaya theorem",
    "adres1": "2856069224956@33",
    "pad2": "+-++0++-0+-++-+--++--+-+",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "George David Birkhoff",
   "citaten": [
    {
     "hoofdstuk": "Differential equations and dynamical systems",
     "nr": 27,
     "bronregel": "Wikipedia, George David Birkhoff"
    }
   ],
   "wikipedia": "George David Birkhoff",
   "via": "exact",
   "oud": {
    "id": 6111159,
    "titel": "George David Birkhoff",
    "adres1": "687151062441991@36",
    "pad2": "+-+++00-++-++--+-+---+--",
    "lead": "George David Birkhoff (March 21, 1884 – November 12, 1944) was an American mathematician best known for what is now called the ergodic theorem. Birkhoff was one of the most important leaders in American mathematics in his generation, and during his time he was considered by many to be the preeminent American mathematician. The George D. Birkhoff House, his residence in Cambridge, Massachusetts, has been designated a National Historic Landmark."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Ergodic theory",
   "citaten": [
    {
     "hoofdstuk": "Differential equations and dynamical systems",
     "nr": 28,
     "bronregel": "Wikipedia, Ergodic theory"
    }
   ],
   "wikipedia": "Ergodic theory",
   "via": "exact",
   "oud": {
    "id": 4467975,
    "titel": "Ergodic theory",
    "adres1": "48368449@23",
    "pad2": "+-+++0+++0-++++--+00-+-0",
    "lead": "Ergodic theory (Greek: ἔργον ergon \"work\", ὁδός hodos \"way\") is a branch of mathematics that studies statistical properties of deterministic dynamical systems; it is the study of ergodicity. In this context, statistical properties means properties which are expressed through the behavior of time averages of various functions along trajectories of dynamical systems. The notion of deterministic dynamical systems assumes that the equations determining the dynamics do not contain any random perturbations, noise, etc. Thus, the statistics with which we are concerned are properties of the dynamics."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Lorenz system",
   "citaten": [
    {
     "hoofdstuk": "Differential equations and dynamical systems",
     "nr": 34,
     "bronregel": "Wikipedia, Lorenz system"
    }
   ],
   "wikipedia": "Lorenz system",
   "via": "exact",
   "oud": {
    "id": 5091205,
    "titel": "Lorenz system",
    "adres1": "1501564979565958564@43",
    "pad2": "+-----0++--+--+++--+-+-+",
    "lead": "The Lorenz system is a system of ordinary differential equations first studied by mathematician and meteorologist Edward Lorenz. It is notable for having chaotic solutions for certain parameter values and initial conditions. In particular, the Lorenz attractor is a set of chaotic solutions of the Lorenz system. In popular media the \"butterfly effect\" stems from the real-world implications of the Lorenz attractor, namely that in a chaotic physical system, in the absence of perfect knowledge of the initial conditions (even the minuscule disturbance of the air due to a butterfly flapping its wings), our ability to predict its future course will always fail. This underscores that physical system"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Entscheidungsproblem",
   "citaten": [
    {
     "hoofdstuk": "Logic and computation",
     "nr": 20,
     "bronregel": "Wikipedia, Entscheidungsproblem"
    }
   ],
   "wikipedia": "Entscheidungsproblem",
   "via": "exact",
   "oud": {
    "id": 4363216,
    "titel": "Entscheidungsproblem",
    "adres1": "2824300699723@31",
    "pad2": "+-+++0-++0-++00-0-++++-+",
    "lead": "In mathematics and computer science, the Entscheidungsproblem (pronounced [ɛntˈʃaɪ̯dʊŋspʁoˌbleːm], German for 'decision problem') is a challenge posed by David Hilbert and Wilhelm Ackermann in 1928. The problem asks for an algorithm that considers, as input, a statement and answers \"Yes\" or \"No\" according to whether the statement is universally valid, i.e., valid in every structure satisfying the axioms."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Gödel's completeness theorem",
   "citaten": [
    {
     "hoofdstuk": "Logic and computation",
     "nr": 21,
     "bronregel": "Wikipedia, Gödel’s completeness theorem"
    }
   ],
   "wikipedia": "Gödel's completeness theorem",
   "via": "exact",
   "oud": {
    "id": 4364473,
    "titel": "Gödel's completeness theorem",
    "adres1": "1771471@20",
    "pad2": "+-++0++-0+-0+-+---+0-+-0",
    "lead": "Gödel's completeness theorem is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first-order logic. The completeness theorem applies to any first-order theory: If T is such a theory, and φ is a sentence (in the same language) and every model of T is a model of φ, then there is a (first-order) proof of φ using the statements of T as axioms. One sometimes says this as \"anything universally true is provable\". This is in contrast, but not contradiction, to Gödel's incompleteness theorems, in which a formula true in only some models may not be provable."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Curry–Howard correspondence",
   "citaten": [
    {
     "hoofdstuk": "Logic and computation",
     "nr": 29,
     "bronregel": "Wikipedia, Curry–Howard correspondence"
    }
   ],
   "wikipedia": "Curry–Howard correspondence",
   "via": "exact",
   "oud": {
    "id": 4467018,
    "titel": "Curry–Howard correspondence",
    "adres1": "228865554519400@35",
    "pad2": "+-++++++-+--+00--+-0++++",
    "lead": "In programming language theory and proof theory, the Curry–Howard correspondence (also known as the Curry–Howard isomorphism or equivalence, or the proofs-as-programs and propositions- or formulae-as-types interpretation) is the direct relationship between computer programs and mathematical proofs."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Resolution (logic)",
   "citaten": [
    {
     "hoofdstuk": "Logic and computation",
     "nr": 31,
     "bronregel": "Wikipedia, Resolution (logic)"
    }
   ],
   "wikipedia": "Resolution (logic)",
   "via": "exact",
   "oud": {
    "id": 4850544,
    "titel": "Resolution (logic)",
    "adres1": "502239960853899139@44",
    "pad2": "+-+++0000-0000+0+--0+0++",
    "lead": "In mathematical logic and automated theorem proving, resolution is a rule of inference leading to a refutation complete theorem-proving technique for sentences in propositional logic and first-order logic. For propositional logic, systematically applying the resolution rule acts as a decision procedure for formula unsatisfiability, solving the (complement of the) Boolean satisfiability problem. For first-order logic, resolution can be used as the basis for a semi-algorithm for the unsatisfiability problem of first-order logic, providing a more practical method than one following from Gödel's completeness theorem."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Lean (proof assistant)",
   "citaten": [
    {
     "hoofdstuk": "Logic and computation",
     "nr": 37,
     "bronregel": "Wikipedia, Lean (proof assistant)"
    }
   ],
   "wikipedia": "Lean (proof assistant)",
   "via": "exact",
   "oud": {
    "id": 7220701,
    "titel": "Lean (proof assistant)",
    "adres1": "21805794712304396895503134@58",
    "pad2": "+-++00+-+---+++++-+++--0",
    "lead": "Lean is a theorem prover and programming language. It is based on the calculus of constructions with inductive types. The Lean project is an open source project, hosted on GitHub. It was launched by Leonardo de Moura at Microsoft Research in 2013. Lean has an interface that differentiates it from other interactive theorem provers. Lean can be compiled to JavaScript and accessed in a web browser. It has native support for Unicode symbols. (These can be typed using LaTeX-like sequences, such as \"\\times\" for \"×\".) Lean also has an extensive support for meta-programming."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Measurement of a Circle",
   "citaten": [
    {
     "hoofdstuk": "Numerical mathematics",
     "nr": 4,
     "bronregel": "Wikipedia, Measurement of a Circle"
    }
   ],
   "wikipedia": "Measurement of a Circle",
   "via": "exact",
   "oud": {
    "id": 5655461,
    "titel": "Measurement of a Circle",
    "adres1": "55796528221817455@40",
    "pad2": "+-0+++--++0+-++-0+---++0",
    "lead": "Measurement of a Circle or Dimension of the Circle (Greek: Κύκλου μέτρησις, Kuklou metrēsis) is a treatise that consists of three propositions by Archimedes, ca. 250 BCE. The treatise is only a fraction of what was a longer work."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Methods of computing square roots",
   "citaten": [
    {
     "hoofdstuk": "Numerical mathematics",
     "nr": 8,
     "bronregel": "Wikipedia, Methods of computing square roots"
    }
   ],
   "wikipedia": "Square root algorithms",
   "via": "doorverwijzing",
   "oud": {
    "id": 4848181,
    "titel": "Square root algorithms",
    "adres1": "8577921884914@34",
    "pad2": "+-+++0++0+-+++-+-+----0+",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Liu Hui's π algorithm",
   "citaten": [
    {
     "hoofdstuk": "Numerical mathematics",
     "nr": 13,
     "bronregel": "Wikipedia, Liu Hui’s π algorithm"
    }
   ],
   "wikipedia": "Liu Hui's π algorithm",
   "via": "exact",
   "oud": {
    "id": 5642378,
    "titel": "Liu Hui's π algorithm",
    "adres1": "8505477843067@34",
    "pad2": "+-++++0-++++++++00+++++-",
    "lead": "Liu Hui's π algorithm was invented by Liu Hui (fl. 3rd century), a mathematician of the state of Cao Wei. Before his time, the ratio of the circumference of a circle to its diameter was often taken experimentally as three in China, while Zhang Heng (78–139) rendered it as 3.1724 (from the proportion of the celestial circle to the diameter of the earth, 92/29) or as . Liu Hui was not satisfied with this value. He commented that it was too large and overshot the mark. Another mathematician Wang Fan (219–257) provided π ≈ 142/45 ≈ 3.156. All these empirical π values were accurate to two digits (i.e. one decimal place). Liu Hui was the first Chinese mathematician to provide a rigorous algorithm "
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Horner's method",
   "citaten": [
    {
     "hoofdstuk": "Numerical mathematics",
     "nr": 16,
     "bronregel": "Wikipedia, Horner’s method"
    }
   ],
   "wikipedia": "Horner's method",
   "via": "exact",
   "oud": {
    "id": 4365286,
    "titel": "Horner's method",
    "adres1": "228768360397660@35",
    "pad2": "+-0+++-0++-+-+---0-+0+-+",
    "lead": "In mathematics and computer science, Horner's method (or Horner's scheme) is an algorithm for polynomial evaluation. Although named after William George Horner, this method is much older, as it has been attributed to Joseph-Louis Lagrange by Horner himself, and can be traced back many hundreds of years to Chinese and Persian mathematicians. After the introduction of computers, this algorithm became fundamental for computing efficiently with polynomials. The algorithm is based on Horner's rule:"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Runge–Kutta methods",
   "citaten": [
    {
     "hoofdstuk": "Numerical mathematics",
     "nr": 24,
     "bronregel": "Wikipedia, Runge–Kutta methods"
    }
   ],
   "wikipedia": "Runge–Kutta methods",
   "via": "exact",
   "oud": {
    "id": 4455933,
    "titel": "Runge–Kutta methods",
    "adres1": "35013124990@29",
    "pad2": "+-+++++0--0++0-+-+0+-+-0",
    "lead": "In numerical analysis, the Runge–Kutta methods (English: /ˈrʊŋəˈkʊtɑː/ RUUNG-ə-KUUT-tah) are a family of implicit and explicit iterative methods, which include the Euler method, used in temporal discretization for the approximate solutions of simultaneous nonlinear equations. These methods were developed around 1900 by the German mathematicians Carl Runge and Wilhelm Kutta."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Gaussian elimination",
   "citaten": [
    {
     "hoofdstuk": "Numerical mathematics",
     "nr": 26,
     "bronregel": "Wikipedia, Gaussian elimination"
    },
    {
     "hoofdstuk": "Linear algebra",
     "nr": 2,
     "bronregel": "Wikipedia, Gaussian elimination"
    }
   ],
   "wikipedia": "Gaussian elimination",
   "via": "exact",
   "oud": {
    "id": 4364757,
    "titel": "Gaussian elimination",
    "adres1": "941433567112@30",
    "pad2": "+-+++++0-+++++-+---0---+",
    "lead": "In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square matrix, and the inverse of an invertible matrix. The method is named after Carl Friedrich Gauss (1777–1855) although some special cases of the method—albeit presented without proof—were known to Chinese mathematicians as early as circa 179 AD."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Bernhard Riemann",
   "citaten": [
    {
     "hoofdstuk": "Unifying structures",
     "nr": 4,
     "bronregel": "Wikipedia, Bernhard Riemann"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 136,
     "bronregel": "Wikipedia, Bernhard Riemann"
    }
   ],
   "wikipedia": "Bernhard Riemann",
   "via": "exact",
   "oud": {
    "id": 4377441,
    "titel": "Bernhard Riemann",
    "adres1": "166771816996672981@41",
    "pad2": "+-+++0++++-+0----+---+--",
    "lead": "Georg Friedrich Bernhard Riemann (German: [ˈɡeːɔʁk ˈfʁiːdʁɪç ˈbɛʁnhaʁt ˈʁiːman]; 17 September 1826 – 20 July 1866) was a German mathematician who made contributions to analysis, number theory, and differential geometry. In the field of real analysis, he is mostly known for the first rigorous formulation of the integral, the Riemann integral, and his work on Fourier series. His contributions to complex analysis include most notably the introduction of Riemann surfaces, breaking new ground in a natural, geometric treatment of complex analysis. His 1859 paper on the prime-counting function, containing the original statement of the Riemann hypothesis, is regarded as a foundational paper of analy"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Felix Klein",
   "citaten": [
    {
     "hoofdstuk": "Unifying structures",
     "nr": 43,
     "bronregel": "Wikipedia, Felix Klein"
    }
   ],
   "wikipedia": "Felix Klein",
   "via": "exact",
   "oud": {
    "id": 4377406,
    "titel": "Felix Klein",
    "adres1": "313939738450@29",
    "pad2": "+---+-+--+-+++-0++++0+--",
    "lead": "Christian Felix Klein (German: [klaɪn]; 25 April 1849 – 22 June 1925) was a German mathematician and mathematics educator, known for his work with group theory, complex analysis, non-Euclidean geometry, and on the associations between geometry and group theory. His 1872 Erlangen program, classifying geometries by their basic symmetry groups, was an influential synthesis of much of the mathematics of the time."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Modular lattice",
   "citaten": [
    {
     "hoofdstuk": "Order and lattices",
     "nr": 8,
     "bronregel": "Wikipedia, Modular lattice"
    }
   ],
   "wikipedia": "Modular lattice",
   "via": "exact",
   "oud": {
    "id": 4630887,
    "titel": "Modular lattice",
    "adres1": "104618058166@28",
    "pad2": "+-+++0+-+0++0+++++-+--++",
    "lead": "In the branch of mathematics called order theory, a modular lattice is a lattice that satisfies the following self-dual condition, Modular lawa ≤ b implies a ∨ (x ∧ b) = (a ∨ x) ∧ b where x, a, b are arbitrary elements in the lattice, ≤ is the partial order, and ∨ and ∧ (called join and meet respectively) are the operations of the lattice. This phrasing emphasizes an interpretation in terms of projection onto the sublattice [a, b], a fact known as the diamond isomorphism theorem. An alternative but equivalent condition stated as an equation (see below) emphasizes that modular lattices form a variety in the sense of universal algebra."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Dedekind number",
   "citaten": [
    {
     "hoofdstuk": "Order and lattices",
     "nr": 9,
     "bronregel": "Wikipedia, Dedekind number"
    }
   ],
   "wikipedia": "Dedekind number",
   "via": "exact",
   "oud": {
    "id": 5773752,
    "titel": "Dedekind number",
    "adres1": "25733765260819@35",
    "pad2": "+-++0++00+0+-+++-++--+-0",
    "lead": "In mathematics, the Dedekind numbers are a rapidly growing sequence of integers named after Richard Dedekind, who defined them in 1897. The Dedekind number M(n) counts the number of monotone boolean functions of n variables. Equivalently, it counts the number of antichains of subsets of an n-element set, the number of elements in a free distributive lattice with n generators, or the number of abstract simplicial complexes with n elements."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hausdorff maximal principle",
   "citaten": [
    {
     "hoofdstuk": "Order and lattices",
     "nr": 14,
     "bronregel": "Wikipedia, Hausdorff maximal principle"
    }
   ],
   "wikipedia": "Hausdorff maximal principle",
   "via": "exact",
   "oud": {
    "id": 4365014,
    "titel": "Hausdorff maximal principle",
    "adres1": "2084434975563058@39",
    "pad2": "+-++0++0+++++-----++0+--",
    "lead": "In mathematics, the Hausdorff maximal principle is an alternate and earlier formulation of Zorn's lemma proved by Felix Hausdorff in 1914 (Moore 1982:168). It states that in any partially ordered set, every totally ordered subset is contained in a maximal totally ordered subset. The Hausdorff maximal principle is one of many statements equivalent to the axiom of choice over ZF (Zermelo–Fraenkel set theory without the axiom of choice). The principle is also called the Hausdorff maximality theorem or the Kuratowski lemma (Kelley 1955:33)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Knaster–Tarski theorem",
   "citaten": [
    {
     "hoofdstuk": "Order and lattices",
     "nr": 17,
     "bronregel": "Wikipedia, Knaster–Tarski theorem"
    }
   ],
   "wikipedia": "Knaster–Tarski theorem",
   "via": "exact",
   "oud": {
    "id": 4446675,
    "titel": "Knaster–Tarski theorem",
    "adres1": "55613517761701684@40",
    "pad2": "+-++0++-++0++++----+-+-+",
    "lead": "In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following: Let (L, ≤) be a complete lattice and let f : L → L be an monotonic function (w.r.t. ≤ ). Then the set of fixed points of f in L also forms a complete lattice under ≤ . It was Tarski who stated the result in its most general form, and so the theorem is often known as Tarski's fixed-point theorem. Some time earlier, Knaster and Tarski established the result for the special case where L is the lattice of subsets of a set, the power set lattice."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Szpilrajn extension theorem",
   "citaten": [
    {
     "hoofdstuk": "Order and lattices",
     "nr": 18,
     "bronregel": "Wikipedia, Szpilrajn extension theorem"
    }
   ],
   "wikipedia": "Szpilrajn extension theorem",
   "via": "exact",
   "oud": {
    "id": 5866935,
    "titel": "Szpilrajn extension theorem",
    "adres1": "76573415719432@36",
    "pad2": "+-++0++-+++++0+--+-+-+-+",
    "lead": "In order theory, the Szpilrajn extension theorem (also called the order-extension principle), proved by Edward Szpilrajn in 1930, states that every strict partial order is contained in a total order. Intuitively, the theorem says that any method of comparing elements that leaves some pairs incomparable can be extended in such a way that every pair becomes comparable. The theorem is one of many examples of the use of the axiom of choice in the form of Zorn's lemma to find a maximal set with certain properties."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Stone's representation theorem for Boolean algebras",
   "citaten": [
    {
     "hoofdstuk": "Order and lattices",
     "nr": 23,
     "bronregel": "Wikipedia, Stone’s representation theorem for Boolean algebras"
    }
   ],
   "wikipedia": "Stone's representation theorem for Boolean algebras",
   "via": "exact",
   "oud": {
    "id": 4548045,
    "titel": "Stone's representation theorem for Boolean algebras",
    "adres1": "76256118338941@34",
    "pad2": "+-++0++-++--+-+-+-0---0+",
    "lead": "In mathematics, Stone's representation theorem for Boolean algebras states that every Boolean algebra is isomorphic to a certain field of sets. The theorem is fundamental to the deeper understanding of Boolean algebra that emerged in the first half of the 20th century. The theorem was first proved by Marshall H. Stone. Stone was led to it by his study of the spectral theory of operators on a Hilbert space."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Birkhoff's representation theorem",
   "citaten": [
    {
     "hoofdstuk": "Order and lattices",
     "nr": 25,
     "bronregel": "Wikipedia, Birkhoff’s representation theorem"
    }
   ],
   "wikipedia": "Birkhoff's representation theorem",
   "via": "exact",
   "oud": {
    "id": 5736618,
    "titel": "Birkhoff's representation theorem",
    "adres1": "1793422@46",
    "pad2": "+-++0++-+++0+-+--+0-0+-+",
    "lead": "In mathematics, Birkhoff's representation theorem for distributive lattices states that the elements of any finite distributive lattice can be represented as finite sets, in such a way that the lattice operations correspond to unions and intersections of sets. The theorem can be interpreted as providing a one-to-one correspondence between distributive lattices and partial orders, between quasi-ordinal knowledge spaces and preorders, or between finite topological spaces and preorders. It is named after Garrett Birkhoff, who published a proof of it in 1937."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Dilworth's theorem",
   "citaten": [
    {
     "hoofdstuk": "Order and lattices",
     "nr": 31,
     "bronregel": "Wikipedia, Dilworth’s theorem"
    }
   ],
   "wikipedia": "Dilworth's theorem",
   "via": "exact",
   "oud": {
    "id": 4575163,
    "titel": "Dilworth's theorem",
    "adres1": "40525628080218542542@46",
    "pad2": "+-++0++-+++++----++0-++0",
    "lead": "In mathematics, in the areas of order theory and combinatorics, Dilworth's theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician Robert P. Dilworth. A version of the theorem for infinite partially ordered sets states that, when there exists a decomposition into finitely many chains, or when there exists a finite upper bound on the size of an antichain, the sizes of the largest antichain and of the smallest chain decomposition are again equal."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "1/3–2/3 conjecture",
   "citaten": [
    {
     "hoofdstuk": "Order and lattices",
     "nr": 35,
     "bronregel": "Wikipedia, 1/3–2/3 conjecture"
    }
   ],
   "wikipedia": "1/3–2/3 conjecture",
   "via": "exact",
   "oud": {
    "id": 6046011,
    "titel": "1/3–2/3 conjecture",
    "adres1": "11670623695@28",
    "pad2": "+-++++--+--+0-+--00--+-+",
    "lead": "In order theory, a branch of mathematics, the 1/3–2/3 conjecture states that, if one is comparison sorting a set of items then, no matter what comparisons may have already been performed, it is always possible to choose the next comparison in such a way that it will reduce the number of possible sorted orders by a factor of 2/3 or better. Equivalently, in every finite partially ordered set that is not totally ordered, there exists a pair of elements x and y with the property that at least 1/3 and at most 2/3 of the linear extensions of the partial order place x earlier than y."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Universal algebra",
   "citaten": [
    {
     "hoofdstuk": "Universal algebra",
     "nr": 1,
     "bronregel": "Wikipedia, Universal algebra"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 114,
     "bronregel": "Wikipedia, Universal algebra"
    }
   ],
   "wikipedia": "Universal algebra",
   "via": "exact",
   "oud": {
    "id": 4378778,
    "titel": "Universal algebra",
    "adres1": "11624209003@26",
    "pad2": "+-++0++-+--+0-+-+0+---00",
    "lead": "Universal algebra (sometimes called general algebra) is the field of mathematics that studies algebraic structures themselves, not examples (\"models\") of algebraic structures.For instance, rather than take particular groups as the object of study, in universal algebra one takes the class of groups as an object of study."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Variety (universal algebra)",
   "citaten": [
    {
     "hoofdstuk": "Universal algebra",
     "nr": 6,
     "bronregel": "Wikipedia, Variety (universal algebra)"
    }
   ],
   "wikipedia": "Variety (universal algebra)",
   "via": "exact",
   "oud": {
    "id": 4619729,
    "titel": "Variety (universal algebra)",
    "adres1": "10460355643@31",
    "pad2": "+-++0++0+-+++0+0000--0++",
    "lead": "In universal algebra, a variety of algebras or equational class is the class of all algebraic structures of a given signature satisfying a given set of identities. For example, the groups form a variety of algebras, as do the abelian groups, the rings, the monoids etc. According to , a class of algebraic structures of the same signature is a variety if and only if it is closed under the taking of homomorphic images, subalgebras and (direct) products. In the context of category theory, a variety of algebras, together with its homomorphisms, forms a category; these are usually called finitary algebraic categories."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Post's lattice",
   "citaten": [
    {
     "hoofdstuk": "Universal algebra",
     "nr": 9,
     "bronregel": "Wikipedia, Post’s lattice"
    }
   ],
   "wikipedia": "Post's lattice",
   "via": "exact",
   "oud": {
    "id": 5563459,
    "titel": "Post's lattice",
    "adres1": "214458593431879@40",
    "pad2": "+-0+++0-+++++0+-0+-+--+0",
    "lead": "In logic and universal algebra, Post's lattice denotes the lattice of all clones on a two-element set {0, 1}, ordered by inclusion. It is named for Emil Post, who published a complete description of the lattice in 1941. The relative simplicity of Post's lattice is in stark contrast to the lattice of clones on a three-element (or larger) set, which has the cardinality of the continuum, and a complicated inner structure. A modern exposition of Post's result can be found in Lau (2006)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Congruence-permutable algebra",
   "citaten": [
    {
     "hoofdstuk": "Universal algebra",
     "nr": 12,
     "bronregel": "Wikipedia, Congruence-permutable algebra"
    }
   ],
   "wikipedia": "Congruence-permutable algebra",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Malcev algebra",
   "citaten": [
    {
     "hoofdstuk": "Universal algebra",
     "nr": 17,
     "bronregel": "Wikipedia, Malcev algebra"
    },
    {
     "hoofdstuk": "Non-associative algebras",
     "nr": 27,
     "bronregel": "Wikipedia, Malcev algebra"
    }
   ],
   "wikipedia": "Malcev algebra",
   "via": "exact",
   "oud": {
    "id": 5073108,
    "titel": "Malcev algebra",
    "adres1": "40531110590756318221@46",
    "pad2": "+-++0++-0--+0-+--0-----+",
    "lead": "In mathematics, a Malcev algebra (or Maltsev algebra or Moufang–Lie algebra) over a field is a nonassociative algebra that is antisymmetric, so that and satisfies the Malcev identity They were first defined by Anatoly Maltsev (1955)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Clone (algebra)",
   "citaten": [
    {
     "hoofdstuk": "Universal algebra",
     "nr": 19,
     "bronregel": "Wikipedia, Clone (algebra)"
    }
   ],
   "wikipedia": "Clone (algebra)",
   "via": "exact",
   "oud": {
    "id": 5563436,
    "titel": "Clone (algebra)",
    "adres1": "228799350449362@35",
    "pad2": "+-+++0+-+-++0-+--0-----+",
    "lead": "In universal algebra, a clone is a set C of finitary operations on a set A such that * C contains all the projections πkn: An → A, defined by πkn(x1, …, xn) = xk, * C is closed under (finitary multiple) composition (or \"superposition\"): if f, g1, …, gm are members of C such that f is m-ary, and gj is n-ary for all j, then the n-ary operation h(x1, …, xn) := f(g1(x1, …, xn), …, gm(x1, …, xn)) is in C."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Jónsson term",
   "citaten": [
    {
     "hoofdstuk": "Universal algebra",
     "nr": 22,
     "bronregel": "Wikipedia, Jónsson term"
    }
   ],
   "wikipedia": "Jónsson term",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Constraint satisfaction problem",
   "citaten": [
    {
     "hoofdstuk": "Universal algebra",
     "nr": 30,
     "bronregel": "Wikipedia, Constraint satisfaction problem"
    }
   ],
   "wikipedia": "Constraint satisfaction problem",
   "via": "exact",
   "oud": {
    "id": 4455357,
    "titel": "Constraint satisfaction problem",
    "adres1": "18538109915542309@39",
    "pad2": "+-++0+++0+0-+0+-+-+++0-+",
    "lead": "Constraint satisfaction problems (CSPs) are mathematical questions defined as the set of objects whose state must satisfy a number of constraints or/ limitations. CSPs represent a entities in a problem as a homogeneous collection of finite constraints over variables, which is solved by constraint satisfaction methods. CSPs are the subject of research in both artificial intelligence and operations research, since the regularity in their formulation provides a common basis to analyze and solve problems of many seemingly unrelated families. CSPs often exhibit high complexity, requiring a combination of heuristics and combinatorial search methods to be solved in a reasonable time. Constraint pro"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Determinant",
   "citaten": [
    {
     "hoofdstuk": "Linear algebra",
     "nr": 4,
     "bronregel": "Wikipedia, Determinant"
    }
   ],
   "wikipedia": "Determinant",
   "via": "exact",
   "oud": {
    "id": 4362679,
    "titel": "Determinant",
    "adres1": "25733765130328@35",
    "pad2": "+-+++-++--0+-+-+----0+-+",
    "lead": "In mathematics, the determinant is a scalar value that is a function of the entries of a square matrix. It characterizes some properties of the matrix and the linear map represented by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible and the linear map represented by the matrix is an isomorphism. The determinant of a product of matrices is the product of their determinants (the preceding property is a corollary of this one).The determinant of a matrix A is denoted det(A), det A, or |A|. In the case of a 2 × 2 matrix the determinant can be defined as"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Cramer's rule",
   "citaten": [
    {
     "hoofdstuk": "Linear algebra",
     "nr": 5,
     "bronregel": "Wikipedia, Cramer’s rule"
    }
   ],
   "wikipedia": "Cramer's rule",
   "via": "exact",
   "oud": {
    "id": 4441210,
    "titel": "Cramer's rule",
    "adres1": "1296777529@26",
    "pad2": "+-+++0+0++-+-0---+-+++0+",
    "lead": "In linear algebra, Cramer's rule is an explicit formula for the solution of a system of linear equations with as many equations as unknowns, valid whenever the system has a unique solution. It expresses the solution in terms of the determinants of the (square) coefficient matrix and of matrices obtained from it by replacing one column by the column vector of right-sides of the equations. It is named after Gabriel Cramer (1704–1752), who published the rule for an arbitrary number of unknowns in 1750, although Colin Maclaurin also published special cases of the rule in 1748 (and possibly knew of it as early as 1729)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Matrix (mathematics)",
   "citaten": [
    {
     "hoofdstuk": "Linear algebra",
     "nr": 9,
     "bronregel": "Wikipedia, Matrix (mathematics)"
    }
   ],
   "wikipedia": "Matrix (mathematics)",
   "via": "exact",
   "oud": {
    "id": 5739022,
    "titel": "Matrix (mathematics)",
    "adres1": "2545397312824@31",
    "pad2": "+-+++0+0+-++-+-0-+-+--00",
    "lead": "In mathematics, a matrix (plural matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object. For example, is a matrix with two rows and three columns. This is often referred to as a \"two by three matrix\", a \"2×3-matrix\", or a matrix of dimension 2×3."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Jordan normal form",
   "citaten": [
    {
     "hoofdstuk": "Linear algebra",
     "nr": 12,
     "bronregel": "Wikipedia, Jordan normal form"
    }
   ],
   "wikipedia": "Jordan normal form",
   "via": "exact",
   "oud": {
    "id": 4480856,
    "titel": "Jordan normal form",
    "adres1": "105900254722@30",
    "pad2": "+-+++0+-++-+-+---000--++",
    "lead": "In linear algebra, a Jordan normal form, also known as a Jordan canonical form (JCF),is an upper triangular matrix of a particular form called a Jordan matrix representing a linear operator on a finite-dimensional vector space with respect to some basis. Such a matrix has each non-zero off-diagonal entry equal to 1, immediately above the main diagonal (on the superdiagonal), and with identical diagonal entries to the left and below them. The Jordan normal form is named after Camille Jordan, who first stated the Jordan decomposition theorem in 1870."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Singular value decomposition",
   "citaten": [
    {
     "hoofdstuk": "Linear algebra",
     "nr": 13,
     "bronregel": "Wikipedia, Singular value decomposition"
    }
   ],
   "wikipedia": "Singular value decomposition",
   "via": "exact",
   "oud": {
    "id": 4432582,
    "titel": "Singular value decomposition",
    "adres1": "532198@19",
    "pad2": "+-+++0+0++++++++---+---+",
    "lead": "In linear algebra, the singular value decomposition (SVD) is a factorization of a real or complex matrix. It generalizes the eigendecomposition of a square normal matrix with an orthonormal eigenbasis to any matrix. It is related to the polar decomposition. The SVD is not unique. It is always possible to choose the decomposition so that the singular values are in descending order. In this case, (but not U and V) is uniquely determined by M."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Perron–Frobenius theorem",
   "citaten": [
    {
     "hoofdstuk": "Linear algebra",
     "nr": 15,
     "bronregel": "Wikipedia, Perron–Frobenius theorem"
    }
   ],
   "wikipedia": "Perron–Frobenius theorem",
   "via": "exact",
   "oud": {
    "id": 4697492,
    "titel": "Perron–Frobenius theorem",
    "adres1": "8474193638398@32",
    "pad2": "+-++0++-++-++-+--++-0+--",
    "lead": "In matrix theory, the Perron–Frobenius theorem, proved by Oskar Perron and Georg Frobenius, asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding eigenvector can be chosen to have strictly positive components, and also asserts a similar statement for certain classes of nonnegative matrices. This theorem has important applications to probability theory (ergodicity of Markov chains); to the theory of dynamical systems (subshifts of finite type); to economics (Okishio's theorem, Hawkins–Simon condition);to demography (Leslie population age distribution model); to social networks (DeGroot learning process); to Internet search engi"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Permanent (mathematics)",
   "citaten": [
    {
     "hoofdstuk": "Linear algebra",
     "nr": 20,
     "bronregel": "Wikipedia, Permanent (mathematics)"
    }
   ],
   "wikipedia": "Permanent (mathematics)",
   "via": "exact",
   "oud": {
    "id": 4456561,
    "titel": "Permanent (mathematics)",
    "adres1": "2859307294969@33",
    "pad2": "+-+++0++++++--++-0+--0+-",
    "lead": "In linear algebra, the permanent of a square matrix is a function of the matrix similar to the determinant. The permanent, as well as the determinant, is a polynomial in the entries of the matrix. Both are special cases of a more general function of a matrix called the immanant."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Computational complexity of matrix multiplication",
   "citaten": [
    {
     "hoofdstuk": "Linear algebra",
     "nr": 23,
     "bronregel": "Wikipedia, Computational complexity of matrix multiplication"
    }
   ],
   "wikipedia": "Computational complexity of matrix multiplication",
   "via": "exact",
   "oud": {
    "id": 5877859,
    "titel": "Computational complexity of matrix multiplication",
    "adres1": "1094640870103584154102@49",
    "pad2": "+-++++--+--++0-0-+-+0--+",
    "lead": "In theoretical computer science, the computational complexity of matrix multiplication dictates how quickly the operation of matrix multiplication can be performed. Matrix multiplication algorithms are a central subroutine in theoretical and numerical algorithms for numerical linear algebra and optimization, so finding the right amount of time it should take is of major practical relevance."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kadison–Singer problem",
   "citaten": [
    {
     "hoofdstuk": "Linear algebra",
     "nr": 28,
     "bronregel": "Wikipedia, Kadison–Singer problem"
    },
    {
     "hoofdstuk": "Operator theory",
     "nr": 16,
     "bronregel": "Wikipedia, Kadison–Singer problem"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 159,
     "bronregel": "Wikipedia, Kadison–Singer problem"
    }
   ],
   "wikipedia": "Kadison–Singer problem",
   "via": "exact",
   "oud": {
    "id": 6745387,
    "titel": "Kadison–Singer problem",
    "adres1": "123083800871721645457@49",
    "pad2": "+-++++0-+++++++0-+++0+-+",
    "lead": "In mathematics, the Kadison–Singer problem, posed in 1959, was a problem in functional analysis about whether certain extensions of certain linear functionals on certain C*-algebras were unique. The uniqueness was proved in 2013."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Frobenius theorem (real division algebras)",
   "citaten": [
    {
     "hoofdstuk": "Associative rings and algebras",
     "nr": 4,
     "bronregel": "Wikipedia, Frobenius theorem (real division algebras)"
    }
   ],
   "wikipedia": "Frobenius theorem (real division algebras)",
   "via": "exact",
   "oud": {
    "id": 4968433,
    "titel": "Frobenius theorem (real division algebras)",
    "adres1": "2084434975025137@39",
    "pad2": "+-++0++-++-+0-+--+0--+-0",
    "lead": "In mathematics, more specifically in abstract algebra, the Frobenius theorem, proved by Ferdinand Georg Frobenius in 1877, characterizes the finite-dimensional associative division algebras over the real numbers. According to the theorem, every such algebra is isomorphic to one of the following: * R (the real numbers) * C (the complex numbers) * H (the quaternions). These algebras have real dimension 1, 2, and 4, respectively. Of these three algebras, R and C are commutative, but H is not."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Wedderburn's little theorem",
   "citaten": [
    {
     "hoofdstuk": "Associative rings and algebras",
     "nr": 6,
     "bronregel": "Wikipedia, Wedderburn’s little theorem"
    }
   ],
   "wikipedia": "Wedderburn's little theorem",
   "via": "exact",
   "oud": {
    "id": 5187662,
    "titel": "Wedderburn's little theorem",
    "adres1": "13675977874669357198@47",
    "pad2": "+-++0++-+++++-+---0--+0+",
    "lead": "In mathematics, Wedderburn's little theorem states that every finite domain is a field. In other words, for finite rings, there is no distinction between domains, division rings and fields. The Artin–Zorn theorem generalizes the theorem to alternative rings: every finite alternative division ring is a field."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Artin–Wedderburn theorem",
   "citaten": [
    {
     "hoofdstuk": "Associative rings and algebras",
     "nr": 7,
     "bronregel": "Wikipedia, Artin–Wedderburn theorem"
    }
   ],
   "wikipedia": "Wedderburn–Artin theorem",
   "via": "doorverwijzing",
   "oud": {
    "id": 4501720,
    "titel": "Wedderburn–Artin theorem",
    "adres1": "231603886168579@37",
    "pad2": "+-++0++-+++++-0---0--+-+",
    "lead": "In algebra, the Wedderburn–Artin theorem is a classification theorem for semisimple rings and semisimple algebras. The theorem states that an (Artinian) semisimple ring R is isomorphic to a product of finitely many ni-by-ni matrix rings over division rings Di, for some integers ni, both of which are uniquely determined up to permutation of the index i. In particular, any simple left or right Artinian ring is isomorphic to an n-by-n matrix ring over a division ring D, where both n and D are uniquely determined."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Brauer group",
   "citaten": [
    {
     "hoofdstuk": "Associative rings and algebras",
     "nr": 11,
     "bronregel": "Wikipedia, Brauer group"
    }
   ],
   "wikipedia": "Brauer group",
   "via": "exact",
   "oud": {
    "id": 4503345,
    "titel": "Brauer group",
    "adres1": "387952021@23",
    "pad2": "+-0++-+0+--+++--+--00+-0",
    "lead": "In mathematics, the Brauer group of a field K is an abelian group whose elements are Morita equivalence classes of central simple algebras over K, with addition given by the tensor product of algebras. It was defined by the algebraist Richard Brauer. The Brauer group arose out of attempts to classify division algebras over a field. It can also be defined in terms of Galois cohomology. More generally, the Brauer group of a scheme is defined in terms of Azumaya algebras, or equivalently using projective bundles."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Albert–Brauer–Hasse–Noether theorem",
   "citaten": [
    {
     "hoofdstuk": "Associative rings and algebras",
     "nr": 15,
     "bronregel": "Wikipedia, Albert–Brauer–Hasse–Noether theorem"
    }
   ],
   "wikipedia": "Albert–Brauer–Hasse–Noether theorem",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Köthe conjecture",
   "citaten": [
    {
     "hoofdstuk": "Associative rings and algebras",
     "nr": 17,
     "bronregel": "Wikipedia, Köthe conjecture"
    }
   ],
   "wikipedia": "Köthe conjecture",
   "via": "exact",
   "oud": {
    "id": 4889690,
    "titel": "Köthe conjecture",
    "adres1": "847288786600@35",
    "pad2": "+-++0+++++0++-+--0+0-+-+",
    "lead": "In mathematics, the Köthe conjecture is a problem in ring theory, open as of 2022. It is formulated in various ways. Suppose that R is a ring. One way to state the conjecture is that if R has no nil ideal, other than {0}, then it has no nil one-sided ideal, other than {0}. This question was posed in 1930 by Gottfried Köthe (1905–1989). The Köthe conjecture has been shown to be true for various classes of rings, such as polynomial identity rings and right Noetherian rings, but a general solution remains elusive."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Jacobson radical",
   "citaten": [
    {
     "hoofdstuk": "Associative rings and algebras",
     "nr": 22,
     "bronregel": "Wikipedia, Jacobson radical"
    }
   ],
   "wikipedia": "Jacobson radical",
   "via": "exact",
   "oud": {
    "id": 4383455,
    "titel": "Jacobson radical",
    "adres1": "48383245@23",
    "pad2": "+-0++0--++-+++-----+0+-+",
    "lead": "In mathematics, more specifically ring theory, the Jacobson radical of a ring is the ideal consisting of those elements in that annihilate all simple right -modules. It happens that substituting \"left\" in place of \"right\" in the definition yields the same ideal, and so the notion is left-right symmetric. The Jacobson radical of a ring is frequently denoted by or ; the former notation will be preferred in this article, because it avoids confusion with other radicals of a ring. The Jacobson radical is named after Nathan Jacobson, who was the first to study it for arbitrary rings in."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Amitsur–Levitzki theorem",
   "citaten": [
    {
     "hoofdstuk": "Associative rings and algebras",
     "nr": 25,
     "bronregel": "Wikipedia, Amitsur–Levitzki theorem"
    }
   ],
   "wikipedia": "Amitsur–Levitzki theorem",
   "via": "exact",
   "oud": {
    "id": 6093534,
    "titel": "Amitsur–Levitzki theorem",
    "adres1": "121626686135668826458@47",
    "pad2": "+-++0++--++++0+-0+-+-+-0",
    "lead": "In algebra, the Amitsur–Levitzki theorem states that the algebra of n × n matrices over a commutative ring satisfies a certain identity of degree 2n. It was proved by Amitsur and Levitsky. In particular matrix rings are polynomial identity rings such that the smallest identity they satisfy has degree exactly 2n."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Morita equivalence",
   "citaten": [
    {
     "hoofdstuk": "Associative rings and algebras",
     "nr": 29,
     "bronregel": "Wikipedia, Morita equivalence"
    }
   ],
   "wikipedia": "Morita equivalence",
   "via": "exact",
   "oud": {
    "id": 4909585,
    "titel": "Morita equivalence",
    "adres1": "435447091@25",
    "pad2": "+-+++0+0--++--00-++0-0-+",
    "lead": "In abstract algebra, Morita equivalence is a relationship defined between rings that preserves many ring-theoretic properties. More precisely two rings like R, S are Morita equivalent (denoted by ) if their categories of modules are additively equivalent (denoted by ). It is named after Japanese mathematician Kiiti Morita who defined equivalence and a similar notion of duality in 1958."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Goldie's theorem",
   "citaten": [
    {
     "hoofdstuk": "Associative rings and algebras",
     "nr": 31,
     "bronregel": "Wikipedia, Goldie’s theorem"
    }
   ],
   "wikipedia": "Goldie's theorem",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Golod–Shafarevich theorem",
   "citaten": [
    {
     "hoofdstuk": "Associative rings and algebras",
     "nr": 35,
     "bronregel": "Wikipedia, Golod–Shafarevich theorem"
    }
   ],
   "wikipedia": "Golod–Shafarevich theorem",
   "via": "exact",
   "oud": {
    "id": 5275446,
    "titel": "Golod–Shafarevich theorem",
    "adres1": "3492101089@25",
    "pad2": "+-++0++0-+-++++--++--+-+",
    "lead": "In mathematics, the Golod–Shafarevich theorem was proved in 1964 by Evgeny Golod and Igor Shafarevich. It is a result in non-commutative homological algebra which solves the class field tower problem, by showing that class field towers can be infinite."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kaplansky's conjectures",
   "citaten": [
    {
     "hoofdstuk": "Associative rings and algebras",
     "nr": 41,
     "bronregel": "Wikipedia, Kaplansky’s conjectures"
    }
   ],
   "wikipedia": "Kaplansky's conjectures",
   "via": "exact",
   "oud": {
    "id": 4973069,
    "titel": "Kaplansky's conjectures",
    "adres1": "1501586938155780658@43",
    "pad2": "+-++++--+-+++-+---+0-+-+",
    "lead": "The mathematician Irving Kaplansky is notable for proposing numerous conjectures in several branches of mathematics, including a list of ten conjectures on Hopf algebras. They are usually known as Kaplansky's conjectures."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Degen's eight-square identity",
   "citaten": [
    {
     "hoofdstuk": "Non-associative algebras",
     "nr": 2,
     "bronregel": "Wikipedia, Degen’s eight-square identity"
    }
   ],
   "wikipedia": "Degen's eight-square identity",
   "via": "exact",
   "oud": {
    "id": 5046329,
    "titel": "Degen's eight-square identity",
    "adres1": "25516288248787@35",
    "pad2": "+-++0++0-+-+-+-+-0----0+",
    "lead": "In mathematics, Degen's eight-square identity establishes that the product of two numbers, each of which is a sum of eight squares, is itself the sum of eight squares.Namely: First discovered by Carl Ferdinand Degen around 1818, the identity was independently rediscovered by John Thomas Graves (1843) and Arthur Cayley (1845). The latter two derived it while working on an extension of quaternions called octonions. In algebraic terms the identity means that the norm of product of two octonions equals the product of their norms: . Similar statements are true for quaternions (Euler's four-square identity), complex numbers (the Brahmagupta–Fibonacci two-square identity) and real numbers. In 1898 "
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Octonion",
   "citaten": [
    {
     "hoofdstuk": "Non-associative algebras",
     "nr": 5,
     "bronregel": "Wikipedia, Octonion"
    }
   ],
   "wikipedia": "Octonion",
   "via": "exact",
   "oud": {
    "id": 4381066,
    "titel": "Octonion",
    "adres1": "104618080225@28",
    "pad2": "+-0++--+-00+-+---+-0-0++",
    "lead": "In mathematics, the octonions are a normed division algebra over the real numbers, a kind of hypercomplex number system. The octonions are usually represented by the capital letter O, using boldface O or blackboard bold . Octonions have eight dimensions; twice the number of dimensions of the quaternions, of which they are an extension. They are noncommutative and nonassociative, but satisfy a weaker form of associativity; namely, they are alternative. They are also power associative."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Lie algebra",
   "citaten": [
    {
     "hoofdstuk": "Non-associative algebras",
     "nr": 9,
     "bronregel": "Wikipedia, Lie algebra"
    }
   ],
   "wikipedia": "Lie algebra",
   "via": "exact",
   "oud": {
    "id": 4366942,
    "titel": "Lie algebra",
    "adres1": "3922627528@27",
    "pad2": "+-++0++-+-+++0+-++-0----",
    "lead": "In mathematics, a Lie algebra (pronounced /liː/ LEE) is a vector space together with an operation called the Lie bracket, an alternating bilinear map , that satisfies the Jacobi identity. The Lie bracket of two vectors and is denoted . The vector space together with this operation is a non-associative algebra, meaning that the Lie bracket is not necessarily associative. An elementary example is the space of three dimensional vectors with the bracket operation defined by the cross product This is skew-symmetric since , and instead of associativity it satisfies the Jacobi identity:"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Wilhelm Killing",
   "citaten": [
    {
     "hoofdstuk": "Non-associative algebras",
     "nr": 14,
     "bronregel": "Wikipedia, Wilhelm Killing"
    },
    {
     "hoofdstuk": "Lie groups",
     "nr": 4,
     "bronregel": "Wikipedia, Wilhelm Killing"
    }
   ],
   "wikipedia": "Wilhelm Killing",
   "via": "exact",
   "oud": {
    "id": 4696700,
    "titel": "Wilhelm Killing",
    "adres1": "121626686136071850724@47",
    "pad2": "+0++-+++0+-0--0+--0+++-0",
    "lead": "Wilhelm Karl Joseph Killing (10 May 1847 – 11 February 1923) was a German mathematician who made important contributions to the theories of Lie algebras, Lie groups, and non-Euclidean geometry."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hurwitz's theorem (composition algebras)",
   "citaten": [
    {
     "hoofdstuk": "Non-associative algebras",
     "nr": 15,
     "bronregel": "Wikipedia, Hurwitz’s theorem (composition algebras)"
    }
   ],
   "wikipedia": "Hurwitz's theorem (composition algebras)",
   "via": "exact",
   "oud": {
    "id": 5919910,
    "titel": "Hurwitz's theorem (composition algebras)",
    "adres1": "8578797037750@34",
    "pad2": "+-++0++-++-++-0-0+-0-+-+",
    "lead": "In mathematics, Hurwitz's theorem is a theorem of Adolf Hurwitz (1859–1919), published posthumously in 1923, solving the Hurwitz problem for finite-dimensional unital real non-associative algebras endowed with a positive-definite quadratic form. The theorem states that if the quadratic form defines a homomorphism into the positive real numbers on the non-zero part of the algebra, then the algebra must be isomorphic to the real numbers, the complex numbers, the quaternions, or the octonions. Such algebras, sometimes called Hurwitz algebras, are examples of composition algebras."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Spinor",
   "citaten": [
    {
     "hoofdstuk": "Non-associative algebras",
     "nr": 16,
     "bronregel": "Wikipedia, Spinor"
    }
   ],
   "wikipedia": "Spinor",
   "via": "exact",
   "oud": {
    "id": 4372165,
    "titel": "Spinor",
    "adres1": "11767897171@28",
    "pad2": "+-+++0++0-++-+++--0--+-+",
    "lead": "In geometry and physics, spinors /spɪnər/ are elements of a complex vector space that can be associated with Euclidean space. Like geometric vectors and more general tensors, spinors transform linearly when the Euclidean space is subjected to a slight (infinitesimal) rotation. Unlike vectors and tensors, a spinor transforms to its negative when the space is continuously rotated through a complete turn from 0° to 360° (see picture). This property characterizes spinors: spinors can be viewed as the \"square roots\" of vectors (although this is inaccurate and may be misleading; they are better viewed as \"square roots\" of sections of vector bundles – in the case of the exterior algebra bundle of t"
   },
   "reden_oud": null,
   "nieuw": [
    "rotor_vier",
    "gamma_toestand"
   ]
  },
  {
   "sleutel": "Weyl's theorem on complete reducibility",
   "citaten": [
    {
     "hoofdstuk": "Non-associative algebras",
     "nr": 17,
     "bronregel": "Wikipedia, Weyl’s theorem on complete reducibility"
    }
   ],
   "wikipedia": "Weyl's theorem on complete reducibility",
   "via": "exact",
   "oud": {
    "id": 6417259,
    "titel": "Weyl's theorem on complete reducibility",
    "adres1": "3323262623536858622536@52",
    "pad2": "+-++0++-++00+-+-0-++-+-+",
    "lead": "In algebra, Weyl's theorem on complete reducibility is a fundamental result in the theory of Lie algebra representations (specifically in the representation theory of semisimple Lie algebras). Let be a semisimple Lie algebra over a field of characteristic zero. The theorem states that every finite-dimensional module over is semisimple as a module (i.e., a direct sum of simple modules.)"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Unitarian trick",
   "citaten": [
    {
     "hoofdstuk": "Non-associative algebras",
     "nr": 19,
     "bronregel": "Wikipedia, Unitarian trick"
    }
   ],
   "wikipedia": "Unitarian trick",
   "via": "exact",
   "oud": {
    "id": 4701454,
    "titel": "Unitarian trick",
    "adres1": "2058915195151633@37",
    "pad2": "+-+++-+---+---+0--0--+++",
    "lead": "In mathematics, the unitarian trick is a device in the representation theory of Lie groups, introduced by Adolf Hurwitz for the special linear group and by Hermann Weyl for general semisimple groups. It applies to show that the representation theory of some group G is in a qualitative way controlled by that of some other compact group K. An important example is that in which G is the complex general linear group, and K the unitary group acting on vectors of the same size. From the fact that the representations of K are completely reducible, the same is concluded for those of G, at least in finite dimensions."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Jordan algebra",
   "citaten": [
    {
     "hoofdstuk": "Non-associative algebras",
     "nr": 23,
     "bronregel": "Wikipedia, Jordan algebra"
    }
   ],
   "wikipedia": "Jordan algebra",
   "via": "exact",
   "oud": {
    "id": 4605167,
    "titel": "Jordan algebra",
    "adres1": "2824300699660@31",
    "pad2": "+-+++00-++-+++---+-----0",
    "lead": "In abstract algebra, a Jordan algebra is a nonassociative algebra over a field whose multiplication satisfies the following axioms: 1. * (commutative law) 2. * (Jordan identity). The product of two elements x and y in a Jordan algebra is also denoted x ∘ y, particularly to avoid confusion with the product of a related associative algebra."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Burnside problem",
   "citaten": [
    {
     "hoofdstuk": "Non-associative algebras",
     "nr": 30,
     "bronregel": "Wikipedia, Burnside problem"
    }
   ],
   "wikipedia": "Burnside problem",
   "via": "exact",
   "oud": {
    "id": 4436353,
    "titel": "Burnside problem",
    "adres1": "11627400079@26",
    "pad2": "+-0+0+0-+++++----+0--+-+",
    "lead": "The Burnside problem asks whether a finitely generated group in which every element has finite order must necessarily be a finite group. It was posed by William Burnside in 1902, making it one of the oldest questions in group theory and was influential in the development of combinatorial group theory. It is known to have a negative answer in general, as Evgeny Golod and Igor Shafarevich provided a counter-example in 1964. The problem has many refinements and variants (see and below) that differ in the additional conditions imposed on the orders of the group elements, some of which are still open questions."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Restricted Lie algebra",
   "citaten": [
    {
     "hoofdstuk": "Non-associative algebras",
     "nr": 35,
     "bronregel": "Wikipedia, Restricted Lie algebra"
    }
   ],
   "wikipedia": "Restricted Lie algebra",
   "via": "exact",
   "oud": {
    "id": 5769001,
    "titel": "Restricted Lie algebra",
    "adres1": "317732829769@31",
    "pad2": "+-++0++0++-++-+-++-----+",
    "lead": "In mathematics, a restricted Lie algebra is a Lie algebra together with an additional \"p operation.\""
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Bézout's theorem",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 3,
     "bronregel": "Wikipedia, Bézout’s theorem"
    }
   ],
   "wikipedia": "Bézout's theorem",
   "via": "exact",
   "oud": {
    "id": 4435090,
    "titel": "Bézout's theorem",
    "adres1": "3922233625@27",
    "pad2": "+-++0++-0++++0+---0--0--",
    "lead": "Bézout's theorem is a statement in algebraic geometry concerning the number of common zeros of n polynomials in n indeterminates. In its original form the theorem states that in general the number of common zeros equals the product of the degrees of the polynomials. It is named after Étienne Bézout. In the case of two variables and in the case of affine hypersurfaces, if multiplicities and points at infinity are not counted, this theorem provides only an upper bound of the number of points, which is almost always reached. This bound is often referred to as the Bézout bound."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Riemann–Roch theorem",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 8,
     "bronregel": "Wikipedia, Riemann–Roch theorem"
    }
   ],
   "wikipedia": "Riemann–Roch theorem",
   "via": "exact",
   "oud": {
    "id": 4465051,
    "titel": "Riemann–Roch theorem",
    "adres1": "25733765064223@35",
    "pad2": "+-++0++0+++++-0--0-0-+-+",
    "lead": "The Riemann–Roch theorem is an important theorem in mathematics, specifically in complex analysis and algebraic geometry, for the computation of the dimension of the space of meromorphic functions with prescribed zeros and allowed poles. It relates the complex analysis of a connected compact Riemann surface with the surface's purely topological genus g, in a way that can be carried over into purely algebraic settings."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "AF+BG theorem",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 11,
     "bronregel": "Wikipedia, AF+BG theorem"
    }
   ],
   "wikipedia": "AF+BG theorem",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Minimal model program",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 18,
     "bronregel": "Wikipedia, Minimal model program"
    }
   ],
   "wikipedia": "Minimal model program",
   "via": "exact",
   "oud": {
    "id": 5548841,
    "titel": "Minimal model program",
    "adres1": "4558659291545246209@46",
    "pad2": "+-+++0-0+-+-0+0+0-++---+",
    "lead": "In algebraic geometry, the minimal model program is part of the birational classification of algebraic varieties. Its goal is to construct a birational model of any complex projective variety which is as simple as possible. The subject has its origins in the classical birational geometry of surfaces studied by the Italian school, and is currently an active research area within algebraic geometry."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Enriques–Kodaira classification",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 22,
     "bronregel": "Wikipedia, Enriques–Kodaira classification"
    }
   ],
   "wikipedia": "Enriques–Kodaira classification",
   "via": "exact",
   "oud": {
    "id": 4882096,
    "titel": "Enriques–Kodaira classification",
    "adres1": "403429339@20",
    "pad2": "+-++++--+-+++----0-+-+-+",
    "lead": "In mathematics, the Enriques–Kodaira classification is a classification of compact complex surfaces into ten classes. For each of these classes, the surfaces in the class can be parametrized by a moduli space. For most of the classes the moduli spaces are well understood, but for the class of surfaces of general type the moduli spaces seem too complicated to describe explicitly, though some components are known."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Resolution of singularities",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 23,
     "bronregel": "Wikipedia, Resolution of singularities"
    }
   ],
   "wikipedia": "Resolution of singularities",
   "via": "exact",
   "oud": {
    "id": 5324029,
    "titel": "Resolution of singularities",
    "adres1": "3282569673945376156561@50",
    "pad2": "+-+++0-++++++-+---0+-+-+",
    "lead": "In algebraic geometry, the problem of resolution of singularities asks whether every algebraic variety V has a resolution, a non-singular variety W with a proper birational map W→V. For varieties over fields of characteristic 0 this was proved in Hironaka (1964), while for varieties over fields of characteristic p it is an open problem in dimensions at least 4."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "History of algebraic geometry",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 27,
     "bronregel": "Wikipedia, History of algebraic geometry"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 52,
     "bronregel": "Wikipedia, History of algebraic geometry"
    }
   ],
   "wikipedia": "Algebraic geometry",
   "via": "doorverwijzing",
   "oud": {
    "id": 4359853,
    "titel": "Algebraic geometry",
    "adres1": "5315230@19",
    "pad2": "+-++++--+-+++---0+---0--",
    "lead": "Algebraic geometry is a branch of mathematics, classically studying zeros of multivariate polynomials. Modern algebraic geometry is based on the use of abstract algebraic techniques, mainly from commutative algebra, for solving geometrical problems about these sets of zeros. In the 20th century, algebraic geometry split into several subareas."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Foundations of Algebraic Geometry",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 29,
     "bronregel": "Wikipedia, Foundations of Algebraic Geometry"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 55,
     "bronregel": "Wikipedia, Foundations of Algebraic Geometry"
    }
   ],
   "wikipedia": "Foundations of Algebraic Geometry",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "GAGA",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 35,
     "bronregel": "Wikipedia, GAGA"
    }
   ],
   "wikipedia": "Algebraic geometry and analytic geometry",
   "via": "doorverwijzing",
   "oud": {
    "id": 4553848,
    "titel": "Algebraic geometry and analytic geometry",
    "adres1": "694811657278558@38",
    "pad2": "+-++++--+-+++---00---+--",
    "lead": "In mathematics, algebraic geometry and analytic geometry are two closely related subjects. While algebraic geometry studies algebraic varieties, analytic geometry deals with complex manifolds and the more general analytic spaces defined locally by the vanishing of analytic functions of several complex variables. The deep relation between these subjects has numerous applications in which algebraic techniques are applied to analytic spaces and analytic techniques to algebraic varieties."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hirzebruch–Riemann–Roch theorem",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 39,
     "bronregel": "Wikipedia, Hirzebruch–Riemann–Roch theorem"
    }
   ],
   "wikipedia": "Hirzebruch–Riemann–Roch theorem",
   "via": "exact",
   "oud": {
    "id": 4867672,
    "titel": "Hirzebruch–Riemann–Roch theorem",
    "adres1": "1307351431@26",
    "pad2": "+-++0++-++0++----0-+-+-0",
    "lead": "In mathematics, the Hirzebruch–Riemann–Roch theorem, named after Friedrich Hirzebruch, Bernhard Riemann, and Gustav Roch, is Hirzebruch's 1954 result generalizing the classical Riemann–Roch theorem on Riemann surfaces to all complex algebraic varieties of higher dimensions. The result paved the way for the Grothendieck–Hirzebruch–Riemann–Roch theorem proved about three years later."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Grothendieck–Riemann–Roch theorem",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 40,
     "bronregel": "Wikipedia, Grothendieck–Riemann–Roch theorem"
    }
   ],
   "wikipedia": "Grothendieck–Riemann–Roch theorem",
   "via": "exact",
   "oud": {
    "id": 4696802,
    "titel": "Grothendieck–Riemann–Roch theorem",
    "adres1": "25516718720299@35",
    "pad2": "+-++0++0++0++-+--+---+-+",
    "lead": "In mathematics, specifically in algebraic geometry, the Grothendieck–Riemann–Roch theorem is a far-reaching result on coherent cohomology. It is a generalisation of the Hirzebruch–Riemann–Roch theorem, about complex manifolds, which is itself a generalisation of the classical Riemann–Roch theorem for line bundles on compact Riemann surfaces."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Moduli of algebraic curves",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 52,
     "bronregel": "Wikipedia, Moduli of algebraic curves"
    }
   ],
   "wikipedia": "Moduli of algebraic curves",
   "via": "exact",
   "oud": {
    "id": 4879943,
    "titel": "Moduli of algebraic curves",
    "adres1": "121576884310821827134@47",
    "pad2": "+-++0++0++++0-0--+0--0-0",
    "lead": "In algebraic geometry, a moduli space of (algebraic) curves is a geometric space (typically a scheme or an algebraic stack) whose points represent isomorphism classes of algebraic curves. It is thus a special case of a moduli space. Depending on the restrictions applied to the classes of algebraic curves considered, the corresponding moduli problem and the moduli space is different. One also distinguishes between fine and coarse moduli spaces for the same moduli problem."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Frankel conjecture",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 57,
     "bronregel": "Wikipedia, Frankel conjecture"
    }
   ],
   "wikipedia": "Frankel conjecture",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Cone of curves",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 59,
     "bronregel": "Wikipedia, Cone of curves"
    }
   ],
   "wikipedia": "Cone of curves",
   "via": "exact",
   "oud": {
    "id": 5546809,
    "titel": "Cone of curves",
    "adres1": "807552817521350729282380@57",
    "pad2": "+-0+++--+0++0+---+-+++++",
    "lead": "In mathematics, the cone of curves (sometimes the Kleiman-Mori cone) of an algebraic variety is a combinatorial invariant of importance to the birational geometry of ."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Caucher Birkar",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 70,
     "bronregel": "Wikipedia, Caucher Birkar"
    }
   ],
   "wikipedia": "Caucher Birkar",
   "via": "exact",
   "oud": {
    "id": 6313333,
    "titel": "Caucher Birkar",
    "adres1": "4559049911263525507@44",
    "pad2": "+0++-0+-++0++0+0-+--++--",
    "lead": "Caucher Birkar FRS (Kurdish: کۆچەر بیرکار, romanized: Koçer Bîrkar, lit. 'migrant mathematician'; born Fereydoun Derakhshani (Persian: فریدون درخشانی); July 1978) is an Iranian Kurdish mathematician and a professor at Tsinghua University and University of Cambridge."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Faltings's theorem",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 73,
     "bronregel": "Wikipedia, Faltings’s theorem"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 119,
     "bronregel": "Wikipedia, Faltings’s theorem"
    }
   ],
   "wikipedia": "Faltings' theorem",
   "via": "doorverwijzing",
   "oud": {
    "id": 4443409,
    "titel": "Faltings' theorem",
    "adres1": "6179279751300187@38",
    "pad2": "+-++0++-++0++-+--++--+-0",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Cubic fourfold",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 75,
     "bronregel": "Wikipedia, Cubic fourfold"
    }
   ],
   "wikipedia": "Cubic fourfold",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Hodge conjecture",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 80,
     "bronregel": "Wikipedia, Hodge conjecture"
    }
   ],
   "wikipedia": "Hodge conjecture",
   "via": "exact",
   "oud": {
    "id": 4464383,
    "titel": "Hodge conjecture",
    "adres1": "55590710672453419@40",
    "pad2": "+-++0+++++0+0----++--+-+",
    "lead": "In mathematics, the Hodge conjecture is a major unsolved problem in algebraic geometry and complex geometry that relates the algebraic topology of a non-singular complex algebraic variety to its subvarieties."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Mathematics Subject Classification",
   "citaten": [
    {
     "hoofdstuk": "Algebraic geometry",
     "nr": 84,
     "bronregel": "Wikipedia, Mathematics Subject Classification"
    },
    {
     "hoofdstuk": "Operations research",
     "nr": 42,
     "bronregel": "Wikipedia, Mathematics Subject Classification"
    }
   ],
   "wikipedia": "Mathematics Subject Classification",
   "via": "exact",
   "oud": {
    "id": 4879757,
    "titel": "Mathematics Subject Classification",
    "adres1": "4783726@39",
    "pad2": "+-0+0--0++-+0-++-++0+-+0",
    "lead": "The Mathematics Subject Classification (MSC) is an alphanumerical classification scheme collaboratively produced by staff of, and based on the coverage of, the two major mathematical reviewing databases, Mathematical Reviews and Zentralblatt MATH. The MSC is used by many mathematics journals, which ask authors of research papers and expository articles to list subject codes from the Mathematics Subject Classification in their papers. The current version is MSC2020."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Category theory",
   "citaten": [
    {
     "hoofdstuk": "Category theory and homological algebra",
     "nr": 1,
     "bronregel": "Wikipedia, Category theory"
    }
   ],
   "wikipedia": "Category theory",
   "via": "exact",
   "oud": {
    "id": 4361555,
    "titel": "Category theory",
    "adres1": "3874743649@25",
    "pad2": "+-+++0+-+-+++-+-+0-++++0",
    "lead": "Category theory is a general theory of mathematical structures and their relations that was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Nowadays, category theory is used in almost all areas of mathematics, and in some areas of computer science. In particular, many constructions of new mathematical objects from previous ones, that appear similarly in several contexts are conveniently expressed and unified in terms of categories. Examples include quotient spaces, direct products, completion, and duality."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Jean-Louis Verdier",
   "citaten": [
    {
     "hoofdstuk": "Category theory and homological algebra",
     "nr": 14,
     "bronregel": "Wikipedia, Jean-Louis Verdier"
    }
   ],
   "wikipedia": "Jean-Louis Verdier",
   "via": "exact",
   "oud": {
    "id": 5290858,
    "titel": "Jean-Louis Verdier",
    "adres1": "617673410654968@36",
    "pad2": "+0++--++---++-++++--+---",
    "lead": "Jean-Louis Verdier (French: [vɛʁdje]; 2 February 1935 – 25 August 1989) was a French mathematician who worked, under the guidance of his doctoral advisor Alexander Grothendieck, on derived categories and Verdier duality. He was a close collaborator of Grothendieck, notably contributing to SGA 4 his theory of and anticipating the later development of by Michael Artin and Barry Mazur, following a suggestion he attributed to Pierre Cartier. 's related theory of was later taken up by Eric Friedlander in his definition of the . Verdier later worked on the theory of integrable systems."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Derived category",
   "citaten": [
    {
     "hoofdstuk": "Category theory and homological algebra",
     "nr": 15,
     "bronregel": "Wikipedia, Derived category"
    }
   ],
   "wikipedia": "Derived category",
   "via": "exact",
   "oud": {
    "id": 4613559,
    "titel": "Derived category",
    "adres1": "8505477783226@34",
    "pad2": "+-0+-++0+-+++0+-+-0++++0",
    "lead": "In mathematics, the derived category D(A) of an abelian category A is a construction of homological algebra introduced to refine and in a certain sense to simplify the theory of derived functors defined on A. The construction proceeds on the basis that the objects of D(A) should be chain complexes in A, with two such chain complexes considered isomorphic when there is a chain map that induces an isomorphism on the level of homology of the chain complexes. Derived functors can then be defined for chain complexes, refining the concept of hypercohomology. The definitions lead to a significant simplification of formulas otherwise described (not completely faithfully) by complicated spectral sequ"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Mitchell's embedding theorem",
   "citaten": [
    {
     "hoofdstuk": "Category theory and homological algebra",
     "nr": 19,
     "bronregel": "Wikipedia, Mitchell’s embedding theorem"
    }
   ],
   "wikipedia": "Mitchell's embedding theorem",
   "via": "exact",
   "oud": {
    "id": 4516513,
    "titel": "Mitchell's embedding theorem",
    "adres1": "55804439735582581@42",
    "pad2": "+-++0++-+++0+----+++-+--",
    "lead": "Mitchell's embedding theorem, also known as the Freyd–Mitchell theorem or the full embedding theorem, is a result about abelian categories; it essentially states that these categories, while rather abstractly defined, are in fact concrete categories of modules. This allows one to use element-wise diagram chasing proofs in these categories. The theorem is named after and Peter Freyd."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "André Joyal",
   "citaten": [
    {
     "hoofdstuk": "Category theory and homological algebra",
     "nr": 40,
     "bronregel": "Wikipedia, André Joyal"
    }
   ],
   "wikipedia": "André Joyal",
   "via": "exact",
   "oud": {
    "id": 5290403,
    "titel": "André Joyal",
    "adres1": "1501586906690354851@43",
    "pad2": "--++0++----+0--0++--+-+0",
    "lead": "André Joyal (French: [ʒwajal]; born 1943) is a professor of mathematics at the Université du Québec à Montréal who works on category theory. He was a member of the School of Mathematics at the Institute for Advanced Study in 2013, where he was invited to join the Special Year on Univalent Foundations of Mathematics."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Quillen–Suslin theorem",
   "citaten": [
    {
     "hoofdstuk": "K-theory",
     "nr": 1,
     "bronregel": "Wikipedia, Quillen–Suslin theorem"
    }
   ],
   "wikipedia": "Quillen–Suslin theorem",
   "via": "exact",
   "oud": {
    "id": 4535280,
    "titel": "Quillen–Suslin theorem",
    "adres1": "597295@19",
    "pad2": "+-++0++-+++++-+-++++-+-+",
    "lead": "The Quillen–Suslin theorem, also known as Serre's problem or Serre's conjecture, is a theorem in commutative algebra concerning the relationship between free modules and projective modules over polynomial rings. In the geometric setting it is a statement about the triviality of vector bundles on affine space. The theorem states that every finitely generated projective module over a polynomial ring is free."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Algebraic K-theory (Grothendieck's K₀)",
   "citaten": [
    {
     "hoofdstuk": "K-theory",
     "nr": 4,
     "bronregel": "Wikipedia, Algebraic K-theory (Grothendieck’s K₀)"
    }
   ],
   "wikipedia": null,
   "via": null,
   "oud": null,
   "reden_oud": "geen Wikipedia-artikel met deze titel",
   "nieuw": []
  },
  {
   "sleutel": "Bott periodicity theorem",
   "citaten": [
    {
     "hoofdstuk": "K-theory",
     "nr": 7,
     "bronregel": "Wikipedia, Bott periodicity theorem"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 167,
     "bronregel": "Wikipedia, Bott periodicity theorem"
    }
   ],
   "wikipedia": "Bott periodicity theorem",
   "via": "exact",
   "oud": {
    "id": 4580877,
    "titel": "Bott periodicity theorem",
    "adres1": "945063656335@32",
    "pad2": "+-+++00+++-+0+++--+--++0",
    "lead": "In mathematics, the Bott periodicity theorem describes a periodicity in the homotopy groups of classical groups, discovered by Raoul Bott , which proved to be of foundational significance for much further research, in particular in K-theory of stable complex vector bundles, as well as the stable homotopy groups of spheres. Bott periodicity can be formulated in numerous ways, with the periodicity in question always appearing as a period-2 phenomenon, with respect to dimension, for the theory associated to the unitary group. See for example topological K-theory."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Topological K-theory",
   "citaten": [
    {
     "hoofdstuk": "K-theory",
     "nr": 10,
     "bronregel": "Wikipedia, Topological K-theory"
    }
   ],
   "wikipedia": "Topological K-theory",
   "via": "exact",
   "oud": {
    "id": 4870092,
    "titel": "Topological K-theory",
    "adres1": "1519553097181748467@45",
    "pad2": "+-++++--+-+++----+++-++-",
    "lead": "In mathematics, topological K-theory is a branch of algebraic topology. It was founded to study vector bundles on topological spaces, by means of ideas now recognised as (general) K-theory that were introduced by Alexander Grothendieck. The early work on topological K-theory is due to Michael Atiyah and Friedrich Hirzebruch."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Atiyah–Singer index theorem",
   "citaten": [
    {
     "hoofdstuk": "K-theory",
     "nr": 18,
     "bronregel": "Wikipedia, Atiyah–Singer index theorem"
    },
    {
     "hoofdstuk": "Global analysis",
     "nr": 9,
     "bronregel": "Wikipedia, Atiyah–Singer index theorem"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 124,
     "bronregel": "Wikipedia, Atiyah–Singer index theorem"
    }
   ],
   "wikipedia": "Atiyah–Singer index theorem",
   "via": "exact",
   "oud": {
    "id": 4484113,
    "titel": "Atiyah–Singer index theorem",
    "adres1": "500316396052080772@42",
    "pad2": "+-++0++--+0++++--+---+-0",
    "lead": "In differential geometry, the Atiyah–Singer index theorem, proved by Michael Atiyah and Isadore Singer (1963), states that for an elliptic differential operator on a compact manifold, the analytical index (related to the dimension of the space of solutions) is equal to the topological index (defined in terms of some topological data). It includes many other theorems, such as the Chern–Gauss–Bonnet theorem and Riemann–Roch theorem, as special cases, and has applications to theoretical physics."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Congruence subgroup problem",
   "citaten": [
    {
     "hoofdstuk": "K-theory",
     "nr": 21,
     "bronregel": "Wikipedia, Congruence subgroup problem"
    }
   ],
   "wikipedia": "Congruence subgroup",
   "via": "doorverwijzing",
   "oud": {
    "id": 4498331,
    "titel": "Congruence subgroup",
    "adres1": "77201295258304@36",
    "pad2": "+-++0++00++++---++-+-+-+",
    "lead": "In mathematics, a congruence subgroup of a matrix group with integer entries is a subgroup defined by congruence conditions on the entries. A very simple example would be invertible 2 × 2 integer matrices of determinant 1, in which the off-diagonal entries are even. More generally, the notion of congruence subgroup can be defined for arithmetic subgroups of algebraic groups; that is, those for which we have a notion of 'integral structure' and can define reduction maps modulo an integer."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Norm residue isomorphism theorem",
   "citaten": [
    {
     "hoofdstuk": "K-theory",
     "nr": 40,
     "bronregel": "Wikipedia, Norm residue isomorphism theorem"
    }
   ],
   "wikipedia": "Norm residue isomorphism theorem",
   "via": "exact",
   "oud": {
    "id": 5991245,
    "titel": "Norm residue isomorphism theorem",
    "adres1": "40542254448280895053@46",
    "pad2": "+-++0++--+0++-0-0-++-+-+",
    "lead": "In mathematics, the norm residue isomorphism theorem is a long-sought result relating Milnor K-theory and Galois cohomology. The result has a relatively elementary formulation and at the same time represents the key juncture in the proofs of many seemingly unrelated theorems from abstract algebra, theory of quadratic forms, algebraic K-theory and the theory of motives. The theorem asserts that a certain statement holds true for any prime and any natural number . John Milnor speculated that this theorem might be true for and all , and this question became known as Milnor's conjecture. The general case was conjectured by Spencer Bloch and Kazuya Kato and became known as the Bloch–Kato conjectu"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Lie group",
   "citaten": [
    {
     "hoofdstuk": "Lie groups",
     "nr": 2,
     "bronregel": "Wikipedia, Lie group"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 35,
     "bronregel": "Wikipedia, Lie group"
    }
   ],
   "wikipedia": "Lie group",
   "via": "exact",
   "oud": {
    "id": 4366943,
    "titel": "Lie group",
    "adres1": "48427498@23",
    "pad2": "+-+++0+-+++++++-++-+-+--",
    "lead": "In mathematics, a Lie group (pronounced /liː/ LEE) is a group that is also a differentiable manifold. A manifold is a space that locally resembles Euclidean space, whereas groups define the abstract concept of a binary operation along with the additional properties it must have to be a group, for instance multiplication and the taking of inverses (division), or equivalently, the concept of addition and the taking of inverses (subtraction). Combining these two ideas, one obtains a continuous group where multiplying points and their inverses are continuous. If the multiplication and taking of inverses are smooth (differentiable) as well, one obtains a Lie group."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Élie Cartan",
   "citaten": [
    {
     "hoofdstuk": "Lie groups",
     "nr": 7,
     "bronregel": "Wikipedia, Élie Cartan"
    }
   ],
   "wikipedia": "Élie Cartan",
   "via": "exact",
   "oud": {
    "id": 4499175,
    "titel": "Élie Cartan",
    "adres1": "13514076519727666276@45",
    "pad2": "+-+++-0+--0++-0-0+0-+--0",
    "lead": "Élie Joseph Cartan ForMemRS (French: [kaʁtɑ̃]; 9 April 1869 – 6 May 1951) was an influential French mathematician who did fundamental work in the theory of Lie groups, differential systems (coordinate-free geometric formulation of PDEs), and differential geometry. He also made significant contributions to general relativity and indirectly to quantum mechanics. He is widely regarded as one of the greatest mathematicians of the twentieth century. His son Henri Cartan was an influential mathematician working in algebraic topology."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Haar measure",
   "citaten": [
    {
     "hoofdstuk": "Lie groups",
     "nr": 9,
     "bronregel": "Wikipedia, Haar measure"
    },
    {
     "hoofdstuk": "Abstract harmonic analysis",
     "nr": 1,
     "bronregel": "Wikipedia, Haar measure"
    }
   ],
   "wikipedia": "Haar measure",
   "via": "exact",
   "oud": {
    "id": 4377091,
    "titel": "Haar measure",
    "adres1": "18759914780023936@41",
    "pad2": "+-00--0-++++-++0-++-+0-+",
    "lead": "In mathematical analysis, the Haar measure assigns an \"invariant volume\" to subsets of locally compact topological groups, consequently defining an integral for functions on those groups. This measure was introduced by Alfréd Haar in 1933, though its special case for Lie groups had been introduced by Adolf Hurwitz in 1897 under the name \"invariant integral\". Haar measures are used in many parts of analysis, number theory, group theory, representation theory, statistics, probability theory, and ergodic theory."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Peter–Weyl theorem",
   "citaten": [
    {
     "hoofdstuk": "Lie groups",
     "nr": 12,
     "bronregel": "Wikipedia, Peter–Weyl theorem"
    },
    {
     "hoofdstuk": "Abstract harmonic analysis",
     "nr": 7,
     "bronregel": "Wikipedia, Peter–Weyl theorem"
    }
   ],
   "wikipedia": "Peter–Weyl theorem",
   "via": "exact",
   "oud": {
    "id": 4476008,
    "titel": "Peter–Weyl theorem",
    "adres1": "35303691268@29",
    "pad2": "+-++0++-++-++00-00+--+++",
    "lead": "In mathematics, the Peter–Weyl theorem is a basic result in the theory of harmonic analysis, applying to topological groups that are compact, but are not necessarily abelian. It was initially proved by Hermann Weyl, with his student Fritz Peter, in the setting of a compact topological group G. The theorem is a collection of results generalizing the significant facts about the decomposition of the regular representation of any finite group, as discovered by Ferdinand Georg Frobenius and Issai Schur."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hilbert's fifth problem",
   "citaten": [
    {
     "hoofdstuk": "Lie groups",
     "nr": 26,
     "bronregel": "Wikipedia, Hilbert’s fifth problem"
    },
    {
     "hoofdstuk": "Abstract harmonic analysis",
     "nr": 4,
     "bronregel": "Wikipedia, Hilbert’s fifth problem"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 152,
     "bronregel": "Wikipedia, Hilbert’s fifth problem"
    }
   ],
   "wikipedia": "Hilbert's fifth problem",
   "via": "exact",
   "oud": {
    "id": 4436818,
    "titel": "Hilbert's fifth problem",
    "adres1": "8476377721669@32",
    "pad2": "+-++++--+-0++-+--0++-+--",
    "lead": "Hilbert's fifth problem is the fifth mathematical problem from the problem list publicized in 1900 by mathematician David Hilbert, and concerns the characterization of Lie groups. The theory of Lie groups describes continuous symmetry in mathematics; its importance there and in theoretical physics (for example quark theory) grew steadily in the twentieth century. In rough terms, Lie group theory is the common ground of group theory and the theory of topological manifolds. The question Hilbert asked was an acute one of making this precise: is there any difference if a restriction to smooth manifolds is imposed?"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Pontryagin duality",
   "citaten": [
    {
     "hoofdstuk": "Lie groups",
     "nr": 30,
     "bronregel": "Wikipedia, Pontryagin duality"
    },
    {
     "hoofdstuk": "Abstract harmonic analysis",
     "nr": 13,
     "bronregel": "Wikipedia, Pontryagin duality"
    }
   ],
   "wikipedia": "Pontryagin duality",
   "via": "exact",
   "oud": {
    "id": 4494535,
    "titel": "Pontryagin duality",
    "adres1": "953198489143@32",
    "pad2": "+-++++--+-+++++---+--+++",
    "lead": "In mathematics, Pontryagin duality is a duality between locally compact abelian groups that allows generalizing Fourier transform to all such groups, which include the circle group (the multiplicative group of complex numbers of modulus one), the finite abelian groups (with the discrete topology), and the additive group of the integers (also with the discrete topology), the real numbers, and every finite dimensional vector space over the reals or a p-adic field."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Arithmetic group",
   "citaten": [
    {
     "hoofdstuk": "Lie groups",
     "nr": 37,
     "bronregel": "Wikipedia, Arithmetic group"
    }
   ],
   "wikipedia": "Arithmetic group",
   "via": "exact",
   "oud": {
    "id": 4553913,
    "titel": "Arithmetic group",
    "adres1": "3922625890@27",
    "pad2": "+-++++--+--+-00+-+----++",
    "lead": "In mathematics, an arithmetic group is a group obtained as the integer points of an algebraic group, for example They arise naturally in the study of arithmetic properties of quadratic forms and other classical topics in number theory. They also give rise to very interesting examples of Riemannian manifolds and hence are objects of interest in differential geometry and topology. Finally, these two topics join in the theory of automorphic forms which is fundamental in modern number theory."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kazhdan's property (T)",
   "citaten": [
    {
     "hoofdstuk": "Lie groups",
     "nr": 41,
     "bronregel": "Wikipedia, Kazhdan’s property (T)"
    },
    {
     "hoofdstuk": "Abstract harmonic analysis",
     "nr": 34,
     "bronregel": "Wikipedia, Kazhdan’s property (T)"
    }
   ],
   "wikipedia": "Kazhdan's property (T)",
   "via": "exact",
   "oud": {
    "id": 4673349,
    "titel": "Kazhdan's property (T)",
    "adres1": "55613483620272388@40",
    "pad2": "+-0++-++0+++++0+0---0+--",
    "lead": "In mathematics, a locally compact topological group G has property (T) if the trivial representation is an isolated point in its unitary dual equipped with the Fell topology. Informally, this means that if G acts unitarily on a Hilbert space and has \"almost invariant vectors\", then it has a nonzero invariant vector. The formal definition, introduced by David Kazhdan, gives this a precise, quantitative meaning."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Mostow rigidity theorem",
   "citaten": [
    {
     "hoofdstuk": "Lie groups",
     "nr": 43,
     "bronregel": "Wikipedia, Mostow rigidity theorem"
    }
   ],
   "wikipedia": "Mostow rigidity theorem",
   "via": "exact",
   "oud": {
    "id": 4855784,
    "titel": "Mostow rigidity theorem",
    "adres1": "35303647771@29",
    "pad2": "+-++0++-++0-+00--0++-+-+",
    "lead": "In mathematics, Mostow's rigidity theorem, or strong rigidity theorem, or Mostow–Prasad rigidity theorem, essentially states that the geometry of a complete, finite-volume hyperbolic manifold of dimension greater than two is determined by the fundamental group and hence unique. The theorem was proven for closed manifolds by Mostow and extended to finite volume manifolds by in 3 dimensions, and by Prasad in all dimensions at least 3. gave an alternate proof using the Gromov norm. gave the simplest available proof."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Oppenheim conjecture",
   "citaten": [
    {
     "hoofdstuk": "Lie groups",
     "nr": 51,
     "bronregel": "Wikipedia, Oppenheim conjecture"
    }
   ],
   "wikipedia": "Oppenheim conjecture",
   "via": "exact",
   "oud": {
    "id": 5048030,
    "titel": "Oppenheim conjecture",
    "adres1": "16677182130155902@39",
    "pad2": "+-++0+++-++++-----+00+-+",
    "lead": "In Diophantine approximation, the Oppenheim conjecture concerns representations of numbers by real quadratic forms in several variables. It was formulated in 1929 by Alexander Oppenheim and later the conjectured property was further strengthened by Harold Davenport and Oppenheim. Initial research on this problem took the number n of variables to be large, and applied a version of the Hardy-Littlewood circle method. The definitive work of Margulis, settling the conjecture in the affirmative, used methods arising from ergodic theory and the study of discrete subgroups of semisimple Lie groups."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Ratner's theorems",
   "citaten": [
    {
     "hoofdstuk": "Lie groups",
     "nr": 53,
     "bronregel": "Wikipedia, Ratner’s theorems"
    }
   ],
   "wikipedia": "Ratner's theorems",
   "via": "exact",
   "oud": {
    "id": 5576528,
    "titel": "Ratner's theorems",
    "adres1": "13675977874635742846@47",
    "pad2": "+-++0++-++-+++-----+0+-+",
    "lead": "In mathematics, Ratner's theorems are a group of major theorems in ergodic theory concerning unipotent flows on homogeneous spaces proved by Marina Ratner around 1990. The theorems grew out of Ratner's earlier work on . The study of the dynamics of unipotent flows played a decisive role in the proof of the Oppenheim conjecture by Grigory Margulis. Ratner's theorems have guided key advances in the understanding of the dynamics of unipotent flows. Their later generalizations provide ways to both sharpen the results and extend the theory to the setting of arbitrary semisimple algebraic groups over a local field."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Euler's formula",
   "citaten": [
    {
     "hoofdstuk": "Complex analysis",
     "nr": 3,
     "bronregel": "Wikipedia, Euler’s formula"
    }
   ],
   "wikipedia": "Euler's formula",
   "via": "exact",
   "oud": {
    "id": 4363182,
    "titel": "Euler's formula",
    "adres1": "317700810559@31",
    "pad2": "+-+++0++0--+-+0+-+0--+0+",
    "lead": "Euler's formula, named after Leonhard Euler, is a mathematical formula in complex analysis that establishes the fundamental relationship between the trigonometric functions and the complex exponential function. Euler's formula states that for any real number x: Euler's formula is ubiquitous in mathematics, physics, and engineering. The physicist Richard Feynman called the equation \"our jewel\" and \"the most remarkable formula in mathematics\". When x = π, Euler's formula may be rewritten as eiπ + 1 = 0, which is known as Euler's identity."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Riemann mapping theorem",
   "citaten": [
    {
     "hoofdstuk": "Complex analysis",
     "nr": 16,
     "bronregel": "Wikipedia, Riemann mapping theorem"
    },
    {
     "hoofdstuk": "Potential theory",
     "nr": 11,
     "bronregel": "Wikipedia, Riemann mapping theorem"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 138,
     "bronregel": "Wikipedia, Riemann mapping theorem"
    }
   ],
   "wikipedia": "Riemann mapping theorem",
   "via": "exact",
   "oud": {
    "id": 4370751,
    "titel": "Riemann mapping theorem",
    "adres1": "6253304926689154@40",
    "pad2": "+-++0++-+0++-----+-+-+--",
    "lead": "In complex analysis, the Riemann mapping theorem states that if U is a non-empty simply connected open subset of the complex number plane C which is not all of C, then there exists a biholomorphic mapping f (i.e. a bijective holomorphic mapping whose inverse is also holomorphic) from U onto the open unit disk This mapping is known as a Riemann mapping. As a corollary of the theorem, any two simply connected open subsets of the Riemann sphere which both lack at least two points of the sphere can be conformally mapped into each other."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Dirichlet's principle",
   "citaten": [
    {
     "hoofdstuk": "Complex analysis",
     "nr": 17,
     "bronregel": "Wikipedia, Dirichlet’s principle"
    },
    {
     "hoofdstuk": "Potential theory",
     "nr": 12,
     "bronregel": "Wikipedia, Dirichlet’s principle"
    },
    {
     "hoofdstuk": "Calculus of variations and optimisation",
     "nr": 12,
     "bronregel": "Wikipedia, Dirichlet’s principle"
    }
   ],
   "wikipedia": "Dirichlet's principle",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Picard theorem",
   "citaten": [
    {
     "hoofdstuk": "Complex analysis",
     "nr": 20,
     "bronregel": "Wikipedia, Picard theorem"
    }
   ],
   "wikipedia": "Picard theorem",
   "via": "exact",
   "oud": {
    "id": 4562366,
    "titel": "Picard theorem",
    "adres1": "8577921747310@34",
    "pad2": "+-++0++-+++++-+--00-++++",
    "lead": "In complex analysis, Picard's great theorem and Picard's little theorem are related theorems about the range of an analytic function. They are named after Émile Picard."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Uniformization theorem",
   "citaten": [
    {
     "hoofdstuk": "Complex analysis",
     "nr": 26,
     "bronregel": "Wikipedia, Uniformization theorem"
    }
   ],
   "wikipedia": "Uniformization theorem",
   "via": "exact",
   "oud": {
    "id": 4474613,
    "titel": "Uniformization theorem",
    "adres1": "941819747032@30",
    "pad2": "+-++0++-+---000000++-+-+",
    "lead": "In mathematics, the uniformization theorem says that every simply connected Riemann surface is conformally equivalent to one of three Riemann surfaces: the open unit disk, the complex plane, or the Riemann sphere. The theorem is a generalization of the Riemann mapping theorem from simply connected open subsets of the plane to arbitrary simply connected Riemann surfaces."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "De Branges's theorem",
   "citaten": [
    {
     "hoofdstuk": "Complex analysis",
     "nr": 32,
     "bronregel": "Wikipedia, De Branges’s theorem"
    },
    {
     "hoofdstuk": "Special functions",
     "nr": 39,
     "bronregel": "Wikipedia, De Branges’s theorem"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 146,
     "bronregel": "Wikipedia, De Branges’s theorem"
    }
   ],
   "wikipedia": "De Branges's theorem",
   "via": "exact",
   "oud": {
    "id": 4466382,
    "titel": "De Branges's theorem",
    "adres1": "166772132017360318@41",
    "pad2": "+-++0++-+++++-+--00--+-+",
    "lead": "In complex analysis, de Branges's theorem, or the Bieberbach conjecture, is a theorem that gives a necessary condition on a holomorphic function in order for it to map the open unit disk of the complex plane injectively to the complex plane. It was posed by Ludwig Bieberbach and finally proven by Louis de Branges. Such functions are called schlicht. The theorem then states that The Koebe function (see below) is a function in which for all , and it is schlicht, so we cannot find a stricter limit on the absolute value of the th coefficient."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Schramm–Loewner evolution",
   "citaten": [
    {
     "hoofdstuk": "Complex analysis",
     "nr": 36,
     "bronregel": "Wikipedia, Schramm–Loewner evolution"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 131,
     "bronregel": "Wikipedia, Schramm–Loewner evolution"
    }
   ],
   "wikipedia": "Schramm–Loewner evolution",
   "via": "exact",
   "oud": {
    "id": 5162003,
    "titel": "Schramm–Loewner evolution",
    "adres1": "88665910478390321220763@53",
    "pad2": "+-+++0--+0-+00+--+++-+-+",
    "lead": "In probability theory, the Schramm–Loewner evolution with parameter κ, also known as stochastic Loewner evolution (SLEκ), is a family of random planar curves that have been proven to be the scaling limit of a variety of two-dimensional lattice models in statistical mechanics. Given a parameter κ and a domain in the complex plane U, it gives a family of random curves in U, with κ controlling how much the curve turns. There are two main variants of SLE, chordal SLE which gives a family of random curves from two fixed boundary points, and radial SLE, which gives a family of random curves from a fixed boundary point to a fixed interior point. These curves are defined to satisfy conformal invaria"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "George Green",
   "citaten": [
    {
     "hoofdstuk": "Potential theory",
     "nr": 8,
     "bronregel": "Wikipedia, George Green"
    }
   ],
   "wikipedia": null,
   "via": null,
   "oud": null,
   "reden_oud": "doorverwijspagina (George Green)",
   "nieuw": []
  },
  {
   "sleutel": "Schwarz alternating method",
   "citaten": [
    {
     "hoofdstuk": "Potential theory",
     "nr": 14,
     "bronregel": "Wikipedia, Schwarz alternating method"
    }
   ],
   "wikipedia": "Schwarz alternating method",
   "via": "exact",
   "oud": {
    "id": 5587899,
    "titel": "Schwarz alternating method",
    "adres1": "1094640175222220495512@49",
    "pad2": "+-+++++--+0+++0+-+-+-0-+",
    "lead": "In mathematics, the Schwarz alternating method or alternating process is an iterative method introduced in 1869–1870 by Hermann Schwarz in the theory of conformal mapping. Given two overlapping regions in the complex plane in each of which the Dirichlet problem could be solved, Schwarz described an iterative method for solving the Dirichlet problem in their union, provided their intersection was suitably well behaved. This was one of several constructive techniques of conformal mapping developed by Schwarz as a contribution to the problem of uniformization, posed by Riemann in the 1850s and first resolved rigorously by Koebe and Poincaré in 1907. It furnished a scheme for uniformizing the un"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Lebesgue spine",
   "citaten": [
    {
     "hoofdstuk": "Potential theory",
     "nr": 20,
     "bronregel": "Wikipedia, Lebesgue spine"
    }
   ],
   "wikipedia": "Lebesgue spine",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Perron method",
   "citaten": [
    {
     "hoofdstuk": "Potential theory",
     "nr": 22,
     "bronregel": "Wikipedia, Perron method"
    }
   ],
   "wikipedia": "Perron method",
   "via": "exact",
   "oud": {
    "id": 5968656,
    "titel": "Perron method",
    "adres1": "22911791232745@33",
    "pad2": "+-0+++-++00+-++0-0+0+0++",
    "lead": "In the mathematical study of harmonic functions, the Perron method, also known as the method of subharmonic functions, is a technique introduced by Oskar Perron for the solution of the Dirichlet problem for Laplace's equation. The Perron method works by finding the largest subharmonic function with boundary values below the desired values; the \"Perron solution\" coincides with the actual solution of the Dirichlet problem if the problem is soluble. where is the set of all subharmonic functions such that on the boundary of the domain. diverges."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Capacity of a set",
   "citaten": [
    {
     "hoofdstuk": "Potential theory",
     "nr": 28,
     "bronregel": "Wikipedia, Capacity of a set"
    }
   ],
   "wikipedia": "Capacity of a set",
   "via": "exact",
   "oud": {
    "id": 5515798,
    "titel": "Capacity of a set",
    "adres1": "6253304953792636@40",
    "pad2": "+-+++0-0++-++00-0+-0--++",
    "lead": "In mathematics, the capacity of a set in Euclidean space is a measure of the \"size\" of that set. Unlike, say, Lebesgue measure, which measures a set's volume or physical extent, capacity is a mathematical analogue of a set's ability to hold electrical charge. More precisely, it is the capacitance of the set: the total charge a set can hold while maintaining a given potential energy. The potential energy is computed with respect to an idealized ground at infinity for the harmonic or Newtonian capacity, and with respect to a surface for the condenser capacity."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Nikolai Makarov",
   "citaten": [
    {
     "hoofdstuk": "Potential theory",
     "nr": 32,
     "bronregel": "Wikipedia, Nikolai Makarov"
    }
   ],
   "wikipedia": null,
   "via": null,
   "oud": null,
   "reden_oud": "doorverwijspagina (Nikolay Makarov)",
   "nieuw": []
  },
  {
   "sleutel": "Several complex variables",
   "citaten": [
    {
     "hoofdstuk": "Several complex variables",
     "nr": 2,
     "bronregel": "Wikipedia, Several complex variables"
    }
   ],
   "wikipedia": "Function of several complex variables",
   "via": "doorverwijzing",
   "oud": {
    "id": 4493182,
    "titel": "Function of several complex variables",
    "adres1": "364880290034528071048@48",
    "pad2": "+-+++0+++--+-+0+-+++-+++",
    "lead": "The theory of functions of several complex variables is the branch of mathematics dealing with complex-valued functions. The name of the field dealing with the properties of function of several complex variables is called several complex variables (and analytic space), that has become a common name for that whole field of study and Mathematics Subject Classification has, as a top-level heading. A function is n-tuples of complex numbers, classically studied on ."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kiyoshi Oka",
   "citaten": [
    {
     "hoofdstuk": "Several complex variables",
     "nr": 13,
     "bronregel": "Wikipedia, Kiyoshi Oka"
    }
   ],
   "wikipedia": "Kiyoshi Oka",
   "via": "exact",
   "oud": {
    "id": 4498118,
    "titel": "Kiyoshi Oka",
    "adres1": "364729963771707923089@48",
    "pad2": "--+--+-++-+-++-++0-+-0+0",
    "lead": "Kiyoshi Oka (岡 潔, Oka Kiyoshi, April 19, 1901 – March 1, 1978) was a Japanese mathematician who did fundamental work in the theory of several complex variables."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Cartan's theorems A and B",
   "citaten": [
    {
     "hoofdstuk": "Several complex variables",
     "nr": 19,
     "bronregel": "Wikipedia, Cartan’s theorems A and B"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 122,
     "bronregel": "Wikipedia, Cartan’s theorems A and B"
    }
   ],
   "wikipedia": "Cartan's theorems A and B",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Charles Fefferman",
   "citaten": [
    {
     "hoofdstuk": "Several complex variables",
     "nr": 29,
     "bronregel": "Wikipedia, Charles Fefferman"
    }
   ],
   "wikipedia": "Charles Fefferman",
   "via": "exact",
   "oud": {
    "id": 4527789,
    "titel": "Charles Fefferman",
    "adres1": "56284566418282285@40",
    "pad2": "+---+-+-+--+-+-++++0++--",
    "lead": "Charles Louis Fefferman (born April 18, 1949) is an American mathematician at Princeton University, where he is currently the Herbert E. Jones, Jr. '43 University Professor of Mathematics. He was awarded the Fields Medal in 1978 for his contributions to mathematical analysis."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hypergeometric function",
   "citaten": [
    {
     "hoofdstuk": "Special functions",
     "nr": 2,
     "bronregel": "Wikipedia, Hypergeometric function"
    }
   ],
   "wikipedia": "Hypergeometric function",
   "via": "exact",
   "oud": {
    "id": 4769163,
    "titel": "Hypergeometric function",
    "adres1": "25422193081171@33",
    "pad2": "+-+++0++++-+-+---++--+-0",
    "lead": "In mathematics, the Gaussian or ordinary hypergeometric function 2F1(a,b;c;z) is a special function represented by the hypergeometric series, that includes many other special functions as specific or limiting cases. It is a solution of a second-order linear ordinary differential equation (ODE). Every second-order linear ODE with three regular singular points can be transformed into this equation."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Gamma function",
   "citaten": [
    {
     "hoofdstuk": "Special functions",
     "nr": 6,
     "bronregel": "Wikipedia, Gamma function"
    }
   ],
   "wikipedia": "Gamma function",
   "via": "exact",
   "oud": {
    "id": 4364418,
    "titel": "Gamma function",
    "adres1": "48028978@23",
    "pad2": "+-+++0++++-+-+++--+--+-+",
    "lead": "In mathematics, the gamma function (represented by Γ, the capital letter gamma from the Greek alphabet) is one commonly used extension of the factorial function to complex numbers. The gamma function is defined for all complex numbers except the non-positive integers. For every positive integer n, Derived by Daniel Bernoulli, for complex numbers with a positive real part, the gamma function is defined via a convergent improper integral:"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Bessel function",
   "citaten": [
    {
     "hoofdstuk": "Special functions",
     "nr": 7,
     "bronregel": "Wikipedia, Bessel function"
    }
   ],
   "wikipedia": "Bessel function",
   "via": "exact",
   "oud": {
    "id": 4361036,
    "titel": "Bessel function",
    "adres1": "3922232230@27",
    "pad2": "+-+++-++--++-+++-++--+--",
    "lead": "Bessel functions, first defined by the mathematician Daniel Bernoulli and then generalized by Friedrich Bessel, are canonical solutions y(x) of Bessel's differential equation for an arbitrary complex number , the order of the Bessel function. Although and produce the same differential equation, it is conventional to define different Bessel functions for these two values in such a way that the Bessel functions are mostly smooth functions of ."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Elliptic function",
   "citaten": [
    {
     "hoofdstuk": "Special functions",
     "nr": 12,
     "bronregel": "Wikipedia, Elliptic function"
    }
   ],
   "wikipedia": "Elliptic function",
   "via": "exact",
   "oud": {
    "id": 4387915,
    "titel": "Elliptic function",
    "adres1": "35300089981@29",
    "pad2": "+-+++0++++-+-++--++--+--",
    "lead": "In the mathematical field of complex analysis, elliptic functions are a special kind of meromorphic functions, that satisfy two periodicity conditions. They are named elliptic functions because they come from elliptic integrals. Originally those integrals occurred at the calculation of the arc length of an ellipse. Important elliptic functions are Jacobi elliptic functions and the Weierstrass -function. Further development of this theory led to hyperelliptic functions and modular forms."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Abel elliptic functions",
   "citaten": [
    {
     "hoofdstuk": "Special functions",
     "nr": 13,
     "bronregel": "Wikipedia, Abel elliptic functions"
    }
   ],
   "wikipedia": "Abel elliptic functions",
   "via": "exact",
   "oud": {
    "id": 6847578,
    "titel": "Abel elliptic functions",
    "adres1": "502239960850334329@44",
    "pad2": "+-++0++00+-+0++--+0-----",
    "lead": "In mathematics Abel elliptic functions are a special kind of elliptic functions, that were established by the Norwegian mathematician Niels Henrik Abel. He published his paper \"Recherches sur les Fonctions elliptiques\" in Crelle's Journal in 1827. It was the first work on elliptic functions that was actually published. Abel's work on elliptic functions also influenced Jacobi's studies of elliptic functions, whose 1829 published book \"Fundamenta nova theoriae functionum ellipticarum\" became the standard work on elliptic functions."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Legendre polynomials",
   "citaten": [
    {
     "hoofdstuk": "Special functions",
     "nr": 15,
     "bronregel": "Wikipedia, Legendre polynomials"
    }
   ],
   "wikipedia": "Legendre polynomials",
   "via": "exact",
   "oud": {
    "id": 4398735,
    "titel": "Legendre polynomials",
    "adres1": "953102431657@32",
    "pad2": "+-++++0-++-+0-++-+-0-+-+",
    "lead": "In physical science and mathematics, Legendre polynomials (named after Adrien-Marie Legendre, who discovered them in 1782) are a system of complete and orthogonal polynomials, with a vast number of mathematical properties, and numerous applications. They can be defined in many ways, and the various definitions highlight different aspects as well as suggest generalizations and connections to different mathematical structures and physical and numerical applications."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Jacobi elliptic functions",
   "citaten": [
    {
     "hoofdstuk": "Special functions",
     "nr": 24,
     "bronregel": "Wikipedia, Jacobi elliptic functions"
    }
   ],
   "wikipedia": "Jacobi elliptic functions",
   "via": "exact",
   "oud": {
    "id": 4515429,
    "titel": "Jacobi elliptic functions",
    "adres1": "2859307290568@33",
    "pad2": "+-++++0-++-+0++0-+---+-0",
    "lead": "In mathematics, the Jacobi elliptic functions are a set of basic elliptic functions. They are found in the description of the motion of a pendulum (see also pendulum (mathematics)), as well as in the design of electronic elliptic filters. While trigonometric functions are defined with reference to a circle, the Jacobi elliptic functions are a generalization which refer to other conic sections, the ellipse in particular. The relation to trigonometric functions is contained in the notation, for example, by the matching notation for . The Jacobi elliptic functions are used more often in practical problems than the Weierstrass elliptic functions as they do not require notions of complex analysis"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Schwarz's list",
   "citaten": [
    {
     "hoofdstuk": "Special functions",
     "nr": 28,
     "bronregel": "Wikipedia, Schwarz’s list"
    }
   ],
   "wikipedia": "Schwarz's list",
   "via": "exact",
   "oud": {
    "id": 5985730,
    "titel": "Schwarz's list",
    "adres1": "6179279751236260@38",
    "pad2": "+-00+-+-++-++-++0--+++-0",
    "lead": "In the mathematical theory of special functions, Schwarz's list or the Schwartz table is the list of 15 cases found by Hermann Schwarz when hypergeometric functions can be expressed algebraically. More precisely, it is a listing of parameters determining the cases in which the hypergeometric equation has a finite monodromy group, or equivalently has two independent solutions that are algebraic functions. It lists 15 cases, divided up by the isomorphism class of the monodromy group (excluding the case of a cyclic group), and was first derived by Schwarz by methods of complex analytic geometry. Correspondingly the statement is not directly in terms of the parameters specifying the hypergeometr"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Bohr–Mollerup theorem",
   "citaten": [
    {
     "hoofdstuk": "Special functions",
     "nr": 29,
     "bronregel": "Wikipedia, Bohr–Mollerup theorem"
    }
   ],
   "wikipedia": "Bohr–Mollerup theorem",
   "via": "exact",
   "oud": {
    "id": 4580785,
    "titel": "Bohr–Mollerup theorem",
    "adres1": "2859307249267@33",
    "pad2": "+-++0++-+0-+-0+--0+0-+-0",
    "lead": "In mathematical analysis, the Bohr–Mollerup theorem is a theorem proved by the Danish mathematicians Harald Bohr and Johannes Mollerup. The theorem characterizes the gamma function, defined for x > 0 by as the only positive function f , with domain on the interval x > 0, that simultaneously has the following three properties: * f (1) = 1, and * f (x + 1) = x f (x) for x > 0 and * f is logarithmically convex. A treatment of this theorem is in Artin's book The Gamma Function, which has been reprinted by the AMS in a collection of Artin's writings."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Rogers–Ramanujan identities",
   "citaten": [
    {
     "hoofdstuk": "Special functions",
     "nr": 30,
     "bronregel": "Wikipedia, Rogers–Ramanujan identities"
    }
   ],
   "wikipedia": "Rogers–Ramanujan identities",
   "via": "exact",
   "oud": {
    "id": 4804332,
    "titel": "Rogers–Ramanujan identities",
    "adres1": "6202470354304645@40",
    "pad2": "+-++++--+--+++00-+---+0+",
    "lead": "In mathematics, the Rogers–Ramanujan identities are two identities related to basic hypergeometric series and integer partitions. The identities were first discovered and proved by Leonard James Rogers, and were subsequently rediscovered (without a proof) by Srinivasa Ramanujan some time before 1913. Ramanujan had no proof, but rediscovered Rogers's paper in 1917, and they then published a joint new proof. Issai Schur independently rediscovered and proved the identities."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Painlevé transcendents",
   "citaten": [
    {
     "hoofdstuk": "Special functions",
     "nr": 34,
     "bronregel": "Wikipedia, Painlevé transcendents"
    }
   ],
   "wikipedia": "Painlevé transcendents",
   "via": "exact",
   "oud": {
    "id": 4766638,
    "titel": "Painlevé transcendents",
    "adres1": "1500949212569048080@43",
    "pad2": "+-+++0+++-0+--+---+---0+",
    "lead": "In mathematics, Painlevé transcendents are solutions to certain nonlinear second-order ordinary differential equations in the complex plane with the Painlevé property (the only movable singularities are poles), but which are not generally solvable in terms of elementary functions. They were discovered byÉmile Picard,Paul Painlevé ,Richard Fuchs, andBertrand Gambier."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Selberg integral",
   "citaten": [
    {
     "hoofdstuk": "Special functions",
     "nr": 37,
     "bronregel": "Wikipedia, Selberg integral"
    }
   ],
   "wikipedia": "Selberg integral",
   "via": "exact",
   "oud": {
    "id": 5669555,
    "titel": "Selberg integral",
    "adres1": "2059759917097651@37",
    "pad2": "+-+++0++++0+-++--+-+-+--",
    "lead": "In mathematics, the Selberg integral is a generalization of Euler beta function to n dimensions introduced by Atle Selberg."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Askey–Wilson polynomials",
   "citaten": [
    {
     "hoofdstuk": "Special functions",
     "nr": 42,
     "bronregel": "Wikipedia, Askey–Wilson polynomials"
    }
   ],
   "wikipedia": "Askey–Wilson polynomials",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Fibonacci sequence",
   "citaten": [
    {
     "hoofdstuk": "Difference and functional equations",
     "nr": 2,
     "bronregel": "Wikipedia, Fibonacci sequence"
    }
   ],
   "wikipedia": "Fibonacci sequence",
   "via": "exact",
   "oud": {
    "id": 4363809,
    "titel": "Fibonacci sequence",
    "adres1": "104604129901@28",
    "pad2": "+-+++0++0-0+-+++-+---++-",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": [
    "laden"
   ]
  },
  {
   "sleutel": "Cauchy's functional equation",
   "citaten": [
    {
     "hoofdstuk": "Difference and functional equations",
     "nr": 6,
     "bronregel": "Wikipedia, Cauchy’s functional equation"
    }
   ],
   "wikipedia": "Cauchy's functional equation",
   "via": "exact",
   "oud": {
    "id": 5065800,
    "titel": "Cauchy's functional equation",
    "adres1": "4558659291556445116@46",
    "pad2": "+-++++0-+0-+-0+--++--+--",
    "lead": "Cauchy's functional equation is the functional equation: A function that solves this equation is called an additive function. Over the rational numbers, it can be shown using elementary algebra that there is a single family of solutions, namely for any rational constant Over the real numbers, the family of linear maps now with an arbitrary real constant, is likewise a family of solutions; however there can exist other solutions not of this form that are extremely complicated. However, any of a number of regularity conditions, some of them quite weak, will preclude the existence of these pathological solutions. For example, an additive function is linear if:"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Skolem–Mahler–Lech theorem",
   "citaten": [
    {
     "hoofdstuk": "Difference and functional equations",
     "nr": 8,
     "bronregel": "Wikipedia, Skolem–Mahler–Lech theorem"
    }
   ],
   "wikipedia": "Skolem–Mahler–Lech theorem",
   "via": "exact",
   "oud": {
    "id": 6090104,
    "titel": "Skolem–Mahler–Lech theorem",
    "adres1": "166840553284967332@41",
    "pad2": "+-++0++-++-++-+-0+++-+--",
    "lead": "In additive and algebraic number theory, the Skolem–Mahler–Lech theorem states that if a sequence of numbers satisfies a linear difference equation, then with finitely many exceptions the positions at which the sequence is zero form a regularly repeating pattern. This result is named after Thoralf Skolem (who proved the theorem for sequences of rational numbers), Kurt Mahler (who proved it for sequences of algebraic numbers), and (who proved it for sequences whose elements belong to any field of characteristic 0). Its known proofs use p-adic analysis and are non-constructive."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hyers–Ulam–Rassias stability",
   "citaten": [
    {
     "hoofdstuk": "Difference and functional equations",
     "nr": 12,
     "bronregel": "Wikipedia, Hyers–Ulam–Rassias stability"
    }
   ],
   "wikipedia": "Hyers–Ulam–Rassias stability",
   "via": "exact",
   "oud": {
    "id": 6101679,
    "titel": "Hyers–Ulam–Rassias stability",
    "adres1": "2636056839124@50",
    "pad2": "+-++++++-+-++---0+-+-+-+",
    "lead": "The stability problem of functional equations originated from a question of Stanisław Ulam, posed in 1940, concerning the stability of group homomorphisms. In the next year, Donald H. Hyers gave a partial affirmative answer to the question of Ulam in the context of Banach spaces in the case of additive mappings, that was the first significant breakthrough and a step toward more solutions in this area. Since then, a large number of papers have been published in connection with various generalizations of Ulam's problem and Hyers's theorem. In 1978, Themistocles M. Rassias succeeded in extending Hyers's theorem for mappings between Banach spaces by considering an unbounded Cauchy difference sub"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Sharkovskii's theorem",
   "citaten": [
    {
     "hoofdstuk": "Difference and functional equations",
     "nr": 20,
     "bronregel": "Wikipedia, Sharkovskii’s theorem"
    }
   ],
   "wikipedia": "Sharkovskii's theorem",
   "via": "exact",
   "oud": {
    "id": 4393323,
    "titel": "Sharkovskii's theorem",
    "adres1": "56279744340064768@42",
    "pad2": "+-++0++--+0+++0---000+-+",
    "lead": "In mathematics, Sharkovskii's theorem, named after Oleksandr Mykolaiovych Sharkovskii, who published it in 1964, is a result about discrete dynamical systems. One of the implications of the theorem is that if a discrete dynamical system on the real line has a periodic point of period 3, then it must have periodic points of every other period."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Feigenbaum constants",
   "citaten": [
    {
     "hoofdstuk": "Difference and functional equations",
     "nr": 25,
     "bronregel": "Wikipedia, Feigenbaum constants"
    }
   ],
   "wikipedia": "Feigenbaum constants",
   "via": "exact",
   "oud": {
    "id": 4390645,
    "titel": "Feigenbaum constants",
    "adres1": "8476378254730@32",
    "pad2": "+-++0++0++-+-+0+-+0--+--",
    "lead": "In mathematics, specifically bifurcation theory, the Feigenbaum constants are two mathematical constants which both express ratios in a bifurcation diagram for a non-linear map. They are named after the physicist Mitchell J. Feigenbaum."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "The Quadrature of the Parabola",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 1,
     "bronregel": "Wikipedia, The Quadrature of the Parabola"
    }
   ],
   "wikipedia": "Quadrature of the Parabola",
   "via": "doorverwijzing",
   "oud": {
    "id": 5449797,
    "titel": "Quadrature of the Parabola",
    "adres1": "25418706703723@33",
    "pad2": "+-+++0++++0+-0+---+-0-++",
    "lead": "Quadrature of the Parabola (Greek: Τετραγωνισμὸς παραβολῆς) is a treatise on geometry, written by Archimedes in the 3rd century BC and addressed to his Alexandrian acquaintance Dositheus. It contains 24 propositions regarding parabolas, culminating in two proofs showing that the area of a parabolic segment (the region enclosed by a parabola and a line) is that of a certain inscribed triangle."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Harmonic series",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 3,
     "bronregel": "Wikipedia, Harmonic series"
    }
   ],
   "wikipedia": null,
   "via": null,
   "oud": null,
   "reden_oud": "doorverwijspagina (Harmonic series)",
   "nieuw": []
  },
  {
   "sleutel": "Madhava series",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 7,
     "bronregel": "Wikipedia, Madhava series"
    }
   ],
   "wikipedia": "Madhava series",
   "via": "exact",
   "oud": {
    "id": 5958078,
    "titel": "Madhava series",
    "adres1": "31424108599@27",
    "pad2": "+-----00--+0+-+0-+---+++",
    "lead": "In mathematics, a Madhava series or Leibniz series is any one of the series in a collection of infinite series expressions all of which are believed to have been discovered by an Indian Mathematician and Astronomer Madhava of Sangamagrama (c. 1350 – c. 1425), the founder of the Kerala school of astronomy and mathematics and later by Gottfried Wilhelm Leibniz, among others. These expressions are the Maclaurin series expansions of the trigonometric sine, cosine and arctangent functions, and the special case of the power series expansion of the arctangent function yielding a formula for computing π. The power series expansions of sine and cosine functions are respectively called Madhava's sine "
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Basel problem",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 10,
     "bronregel": "Wikipedia, Basel problem"
    }
   ],
   "wikipedia": "Basel problem",
   "via": "exact",
   "oud": {
    "id": 4525048,
    "titel": "Basel problem",
    "adres1": "2084435018609131@39",
    "pad2": "+-+++++--+-+++00--+0+0--",
    "lead": "The Basel problem is a problem in mathematical analysis with relevance to number theory, concerning an infinite sum of inverse squares. It was first posed by Pietro Mengoli in 1650 and solved by Leonhard Euler in 1734, and read on 5 December 1735 in The Saint Petersburg Academy of Sciences. Since the problem had withstood the attacks of the leading mathematicians of the day, Euler's solution brought him immediate fame when he was twenty-eight. Euler generalised the problem considerably, and his ideas were taken up years later by Bernhard Riemann in his seminal 1859 paper \"On the Number of Primes Less Than a Given Magnitude\", in which he defined his zeta function and proved its basic properti"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Abel's theorem",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 16,
     "bronregel": "Wikipedia, Abel’s theorem"
    }
   ],
   "wikipedia": "Abel's theorem",
   "via": "exact",
   "oud": {
    "id": 4462403,
    "titel": "Abel's theorem",
    "adres1": "953102411992@32",
    "pad2": "+-++0++--+0++00--0----0-",
    "lead": "In mathematics, Abel's theorem for power series relates a limit of a power series to the sum of its coefficients. It is named after Norwegian mathematician Niels Henrik Abel."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Riemann series theorem",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 18,
     "bronregel": "Wikipedia, Riemann series theorem"
    }
   ],
   "wikipedia": "Riemann series theorem",
   "via": "exact",
   "oud": {
    "id": 4747611,
    "titel": "Riemann series theorem",
    "adres1": "2084435018609311@39",
    "pad2": "+-++0++00+-+--+--+-+-+++",
    "lead": "In mathematics, the Riemann series theorem (also called the Riemann rearrangement theorem), named after 19th-century German mathematician Bernhard Riemann, says that if an infinite series of real numbers is conditionally convergent, then its terms can be arranged in a permutation so that the new series converges to an arbitrary real number, or diverges. This implies that a series of real numbers is absolutely convergent if and only if it is unconditionally convergent."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Cesàro summation",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 21,
     "bronregel": "Wikipedia, Cesàro summation"
    }
   ],
   "wikipedia": "Cesàro summation",
   "via": "exact",
   "oud": {
    "id": 4567297,
    "titel": "Cesàro summation",
    "adres1": "8577921747862@34",
    "pad2": "+-+++0++---+--+--+-0--++",
    "lead": "In mathematical analysis, Cesàro summation (also known as the Cesàro mean) assigns values to some infinite sums that are not necessarily convergent in the usual sense. The Cesàro sum is defined as the limit, as n tends to infinity, of the sequence of arithmetic means of the first n partial sums of the series. This special case of a matrix summability method is named for the Italian analyst Ernesto Cesàro (1859–1906)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Abelian and Tauberian theorems",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 23,
     "bronregel": "Wikipedia, Abelian and Tauberian theorems"
    }
   ],
   "wikipedia": "Abelian and Tauberian theorems",
   "via": "exact",
   "oud": {
    "id": 4505580,
    "titel": "Abelian and Tauberian theorems",
    "adres1": "3486785158@30",
    "pad2": "+-++0++-0++++-+--+---+-0",
    "lead": "In mathematics, Abelian and Tauberian theorems are theorems giving conditions for two methods of summing divergent series to give the same result, named after Niels Henrik Abel and Alfred Tauber. The original examples are Abel's theorem showing that if a series converges to some limit then its Abel sum is the same limit, and Tauber's theorem showing that if the Abel sum of a series exists and the coefficients are sufficiently small (o(1/n)) then the series converges to the Abel sum. More general Abelian and Tauberian theorems give similar results for more general summation methods."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Borel summation",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 26,
     "bronregel": "Wikipedia, Borel summation"
    }
   ],
   "wikipedia": "Borel summation",
   "via": "exact",
   "oud": {
    "id": 4808376,
    "titel": "Borel summation",
    "adres1": "694811661532363@38",
    "pad2": "+-++0++0+-++-0+0-+0---++",
    "lead": "In mathematics, Borel summation is a summation method for divergent series, introduced by Émile Borel. It is particularly useful for summing divergent asymptotic series, and in some sense gives the best possible sum for such series. There are several variations of this method that are also called Borel summation, and a generalization of it called Mittag-Leffler summation."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Lévy–Steinitz theorem",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 28,
     "bronregel": "Wikipedia, Lévy–Steinitz theorem"
    }
   ],
   "wikipedia": "Lévy–Steinitz theorem",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Silverman–Toeplitz theorem",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 29,
     "bronregel": "Wikipedia, Silverman–Toeplitz theorem"
    }
   ],
   "wikipedia": "Silverman–Toeplitz theorem",
   "via": "exact",
   "oud": {
    "id": 4737610,
    "titel": "Silverman–Toeplitz theorem",
    "adres1": "6202470354307012@40",
    "pad2": "+-++0++0+++++++0-+-+-+-+",
    "lead": "In mathematics, the Silverman–Toeplitz theorem, first proved by Otto Toeplitz, is a result in summability theory characterizing matrix summability methods that are regular. A regular matrix summability method is a matrix transformation of a convergent sequence which preserves the limit. An infinite matrix with complex-valued entries defines a regular summability method if and only if it satisfies all of the following properties: An example is Cesaro summation, a matrix summability method with"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Littlewood's Tauberian theorem",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 33,
     "bronregel": "Wikipedia, Littlewood’s Tauberian theorem"
    }
   ],
   "wikipedia": "Littlewood's Tauberian theorem",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Hardy–Littlewood Tauberian theorem",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 37,
     "bronregel": "Wikipedia, Hardy–Littlewood Tauberian theorem"
    }
   ],
   "wikipedia": "Hardy–Littlewood Tauberian theorem",
   "via": "exact",
   "oud": {
    "id": 5827321,
    "titel": "Hardy–Littlewood Tauberian theorem",
    "adres1": "506517699060642115@44",
    "pad2": "+-++0++0+++++0+--0+--+-+",
    "lead": "In mathematical analysis, the Hardy–Littlewood Tauberian theorem is a Tauberian theorem relating the asymptotics of the partial sums of a series with the asymptotics of its Abel summation. In this form, the theorem asserts that if, as y ↓ 0, the non-negative sequence an is such that there is an asymptotic equivalence then there is also an asymptotic equivalence as n → ∞. The integral formulation of the theorem relates in an analogous manner the asymptotics of the cumulative distribution function of a function with the asymptotics of its Laplace transform."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Wiener's Tauberian theorem",
   "citaten": [
    {
     "hoofdstuk": "Series and summability",
     "nr": 38,
     "bronregel": "Wikipedia, Wiener’s Tauberian theorem"
    },
    {
     "hoofdstuk": "Abstract harmonic analysis",
     "nr": 17,
     "bronregel": "Wikipedia, Wiener’s Tauberian theorem"
    }
   ],
   "wikipedia": "Wiener's Tauberian theorem",
   "via": "exact",
   "oud": {
    "id": 4979486,
    "titel": "Wiener's Tauberian theorem",
    "adres1": "3323262623544610693111@52",
    "pad2": "+-++0++-+++++++---0--+-0",
    "lead": "In mathematical analysis, Wiener's tauberian theorem is any of several related results proved by Norbert Wiener in 1932. They provide a necessary and sufficient condition under which any function in L1 or L2 can be approximated by linear combinations of translations of a given function. Informally, if the Fourier transform of a function f vanishes on a certain set Z, the Fourier transform of any linear combination of translations of f also vanishes on Z. Therefore, the linear combinations of translations of f can not approximate a function whose Fourier transform does not vanish on Z."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Equioscillation theorem",
   "citaten": [
    {
     "hoofdstuk": "Approximation theory",
     "nr": 3,
     "bronregel": "Wikipedia, Equioscillation theorem"
    }
   ],
   "wikipedia": "Equioscillation theorem",
   "via": "exact",
   "oud": {
    "id": 6171651,
    "titel": "Equioscillation theorem",
    "adres1": "9969787870633832269663@53",
    "pad2": "+-++00+--+-+--+----0-+++",
    "lead": "In mathematics, the equioscillation theorem concerns the approximation of continuous functions using polynomials when the merit function is the maximum difference (uniform norm). Its discovery is attributed to Chebyshev."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Stone–Weierstrass theorem",
   "citaten": [
    {
     "hoofdstuk": "Approximation theory",
     "nr": 5,
     "bronregel": "Wikipedia, Stone–Weierstrass theorem"
    }
   ],
   "wikipedia": "Stone–Weierstrass theorem",
   "via": "exact",
   "oud": {
    "id": 4371965,
    "titel": "Stone–Weierstrass theorem",
    "adres1": "953102410516@32",
    "pad2": "+-++0++00+0+00+--0++-+-+",
    "lead": "In mathematical analysis, the Weierstrass approximation theorem states that every continuous function defined on a closed interval [a, b] can be uniformly approximated as closely as desired by a polynomial function. Because polynomials are among the simplest functions, and because computers can directly evaluate polynomials, this theorem has both practical and theoretical relevance, especially in polynomial interpolation. The original version of this result was established by Karl Weierstrass in using the Weierstrass transform."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Weierstrass transform",
   "citaten": [
    {
     "hoofdstuk": "Approximation theory",
     "nr": 6,
     "bronregel": "Wikipedia, Weierstrass transform"
    }
   ],
   "wikipedia": "Weierstrass transform",
   "via": "exact",
   "oud": {
    "id": 5629573,
    "titel": "Weierstrass transform",
    "adres1": "506517698964987676@44",
    "pad2": "+-++0++0++++-++0-+++-+-+",
    "lead": "In mathematics, the Weierstrass transform of a function f : R → R, named after Karl Weierstrass, is a \"smoothed\" version of f(x) obtained by averaging the values of f, weighted with a Gaussian centered at x. Specifically, it is the function F defined by the convolution of f with the Gaussian function The factor 1/√(4π) is chosen so that the Gaussian will have a total integral of 1, with the consequence that constant functions are not changed by the Weierstrass transform."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Jackson's inequality",
   "citaten": [
    {
     "hoofdstuk": "Approximation theory",
     "nr": 7,
     "bronregel": "Wikipedia, Jackson’s inequality"
    }
   ],
   "wikipedia": "Jackson's inequality",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Bernstein polynomial",
   "citaten": [
    {
     "hoofdstuk": "Approximation theory",
     "nr": 13,
     "bronregel": "Wikipedia, Bernstein polynomial"
    }
   ],
   "wikipedia": "Bernstein polynomial",
   "via": "exact",
   "oud": {
    "id": 4488246,
    "titel": "Bernstein polynomial",
    "adres1": "694811672868304@38",
    "pad2": "+-++++0-++-++++0-----+-+",
    "lead": "In the mathematical field of numerical analysis, a Bernstein polynomial is a polynomial that is a linear combination of Bernstein basis polynomials. The idea is named after Sergei Natanovich Bernstein. A numerically stable way to evaluate polynomials in Bernstein form is de Casteljau's algorithm. Polynomials in Bernstein form were first used by Bernstein in a constructive proof for the Weierstrass approximation theorem. With the advent of computer graphics, Bernstein polynomials, restricted to the interval [0, 1], became important in the form of Bézier curves."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Müntz–Szász theorem",
   "citaten": [
    {
     "hoofdstuk": "Approximation theory",
     "nr": 17,
     "bronregel": "Wikipedia, Müntz–Szász theorem"
    }
   ],
   "wikipedia": "Müntz–Szász theorem",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Mergelyan's theorem",
   "citaten": [
    {
     "hoofdstuk": "Approximation theory",
     "nr": 21,
     "bronregel": "Wikipedia, Mergelyan’s theorem"
    }
   ],
   "wikipedia": "Mergelyan's theorem",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Kolmogorov–Arnold representation theorem",
   "citaten": [
    {
     "hoofdstuk": "Approximation theory",
     "nr": 23,
     "bronregel": "Wikipedia, Kolmogorov–Arnold representation theorem"
    }
   ],
   "wikipedia": "Kolmogorov–Arnold representation theorem",
   "via": "exact",
   "oud": {
    "id": 6698067,
    "titel": "Kolmogorov–Arnold representation theorem",
    "adres1": "6200563815077482@40",
    "pad2": "+-++0++-++-++++--000-+-+",
    "lead": "In real analysis and approximation theory, the Kolmogorov-Arnold representation theorem (or superposition theorem) states that every multivariate continuous function can be represented as a superposition of the two-argument addition and continuous functions of one variable. It solved a more constrained, yet more general form of Hilbert's thirteenth problem. . There are proofs with specific constructions. In a sense, they showed that the only true multivariate function is the sum, since every other function can be written using univariate functions and summing."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Bernstein's constant",
   "citaten": [
    {
     "hoofdstuk": "Approximation theory",
     "nr": 30,
     "bronregel": "Wikipedia, Bernstein’s constant"
    }
   ],
   "wikipedia": "Bernstein's constant",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Universal approximation theorem",
   "citaten": [
    {
     "hoofdstuk": "Approximation theory",
     "nr": 34,
     "bronregel": "Wikipedia, Universal approximation theorem"
    }
   ],
   "wikipedia": "Universal approximation theorem",
   "via": "exact",
   "oud": {
    "id": 5667870,
    "titel": "Universal approximation theorem",
    "adres1": "29555303492796773739751@52",
    "pad2": "+-++++--+--++-000-0+-+-0",
    "lead": "In the mathematical theory of artificial neural networks, universal approximation theorems are results that establish the density of an algorithmically generated class of functions within a given function space of interest. Typically, these results concern the approximation capabilities of the feedforward architecture on the space of continuous functions between two Euclidean spaces, and the approximation is with respect to the compact convergence topology."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Gelfand–Raikov theorem",
   "citaten": [
    {
     "hoofdstuk": "Abstract harmonic analysis",
     "nr": 20,
     "bronregel": "Wikipedia, Gelfand–Raikov theorem"
    }
   ],
   "wikipedia": "Gelfand–Raikov theorem",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Tate's thesis",
   "citaten": [
    {
     "hoofdstuk": "Abstract harmonic analysis",
     "nr": 22,
     "bronregel": "Wikipedia, Tate’s thesis"
    }
   ],
   "wikipedia": "Tate's thesis",
   "via": "exact",
   "oud": {
    "id": 4894848,
    "titel": "Tate's thesis",
    "adres1": "2541865894696@31",
    "pad2": "+----+-+0+--+-0-0-++-+++",
    "lead": "In number theory, Tate's thesis is the 1950 PhD thesis of John Tate completed under the supervision of Emil Artin at Princeton University. In it, Tate used a translation invariant integration on the locally compact group of ideles to lift the zeta function twisted by a Hecke character, i.e. a Hecke L-function, of a number field to a zeta integral and study its properties. Using harmonic analysis, more precisely the Poisson summation formula, he proved the functional equation and meromorphic continuation of the zeta integral and the Hecke L-function. He also located the poles of the twisted zeta function. His work can be viewed as an elegant and powerful reformulation of a work of Erich Hecke"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Discrete series representation",
   "citaten": [
    {
     "hoofdstuk": "Abstract harmonic analysis",
     "nr": 31,
     "bronregel": "Wikipedia, Discrete series representation"
    }
   ],
   "wikipedia": "Discrete series representation",
   "via": "exact",
   "oud": {
    "id": 5191798,
    "titel": "Discrete series representation",
    "adres1": "50031545098999960@45",
    "pad2": "+-++++0-++0+-+++-+-+--+0",
    "lead": "In mathematics, a discrete series representation is an irreducible unitary representation of a locally compact topological group G that is a subrepresentation of the left regular representation of G on L²(G). In the Plancherel measure, such representations have positive measure. The name comes from the fact that they are exactly the representations that occur discretely in the decomposition of the regular representation."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Laplace transform",
   "citaten": [
    {
     "hoofdstuk": "Integral transforms",
     "nr": 1,
     "bronregel": "Wikipedia, Laplace transform"
    }
   ],
   "wikipedia": "Laplace transform",
   "via": "exact",
   "oud": {
    "id": 4367262,
    "titel": "Laplace transform",
    "adres1": "2859307295680@33",
    "pad2": "+-+++0+++-++-+++-++-0-00",
    "lead": "In mathematics, the Laplace transform, named after its discoverer Pierre-Simon Laplace (/ləˈplɑːs/), is an integral transform that converts a function of a real variable (usually , in the time domain) to a function of a complex variable (in the complex frequency domain, also known as s-domain, or s-plane). The transform has many applications in science and engineering because it is a tool for solving differential equations. In particular, it transforms ordinary differential equations into algebraic equations and convolution into multiplication.For suitable functions f, the Laplace transform is the integral"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Mellin transform",
   "citaten": [
    {
     "hoofdstuk": "Integral transforms",
     "nr": 5,
     "bronregel": "Wikipedia, Mellin transform"
    }
   ],
   "wikipedia": "Mellin transform",
   "via": "exact",
   "oud": {
    "id": 4499493,
    "titel": "Mellin transform",
    "adres1": "2067490118115460@39",
    "pad2": "+-+++++--+++-+0--+0+-+-0",
    "lead": "In mathematics, the Mellin transform is an integral transform that may be regarded as the multiplicative version of the two-sided Laplace transform. This integral transform is closely connected to the theory of Dirichlet series, and isoften used in number theory, mathematical statistics, and the theory of asymptotic expansions; it is closely related to the Laplace transform and the Fourier transform, and the theory of the gamma function and allied special functions. The Mellin transform of a function f is The inverse transform is"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Operational calculus",
   "citaten": [
    {
     "hoofdstuk": "Integral transforms",
     "nr": 8,
     "bronregel": "Wikipedia, Operational calculus"
    }
   ],
   "wikipedia": "Operational calculus",
   "via": "exact",
   "oud": {
    "id": 5280830,
    "titel": "Operational calculus",
    "adres1": "228862198662193@35",
    "pad2": "+-+++00-+--0000-0-0++--+",
    "lead": "Operational calculus, also known as operational analysis, is a technique by which problems in analysis, in particular differential equations, are transformed into algebraic problems, usually the problem of solving a polynomial equation."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Radon transform",
   "citaten": [
    {
     "hoofdstuk": "Integral transforms",
     "nr": 14,
     "bronregel": "Wikipedia, Radon transform"
    }
   ],
   "wikipedia": "Radon transform",
   "via": "exact",
   "oud": {
    "id": 4527916,
    "titel": "Radon transform",
    "adres1": "8508189781378@34",
    "pad2": "+-0++-0++-++-+-+--0--+-+",
    "lead": "In mathematics, the Radon transform is the integral transform which takes a function f defined on the plane to a function Rf defined on the (two-dimensional) space of lines in the plane, whose value at a particular line is equal to the line integral of the function over that line. The transform was introduced in 1917 by Johann Radon, who also provided a formula for the inverse transform. Radon further included formulas for the transform in three dimensions, in which the integral is taken over planes (integrating over lines is known as the X-ray transform). It was later generalized to higher-dimensional Euclidean spaces, and more broadly in the context of integral geometry. The complex analog"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Titchmarsh convolution theorem",
   "citaten": [
    {
     "hoofdstuk": "Integral transforms",
     "nr": 15,
     "bronregel": "Wikipedia, Titchmarsh convolution theorem"
    }
   ],
   "wikipedia": "Titchmarsh convolution theorem",
   "via": "exact",
   "oud": {
    "id": 5242556,
    "titel": "Titchmarsh convolution theorem",
    "adres1": "55590711576631219@40",
    "pad2": "+-++0++-++++-----++-0+-+",
    "lead": "The Titchmarsh convolution theorem describes the properties of the support of the convolution of two functions. It was proven by Edward Charles Titchmarsh in 1926."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Bernstein's theorem on monotone functions",
   "citaten": [
    {
     "hoofdstuk": "Integral transforms",
     "nr": 17,
     "bronregel": "Wikipedia, Bernstein’s theorem on monotone functions"
    }
   ],
   "wikipedia": "Bernstein's theorem on monotone functions",
   "via": "exact",
   "oud": {
    "id": 4929947,
    "titel": "Bernstein's theorem on monotone functions",
    "adres1": "166840553184485068@41",
    "pad2": "+-++0++-++0++00---00-0--",
    "lead": "In real analysis, a branch of mathematics, Bernstein's theorem states that every real-valued function on the half-line [0, ∞) that is totally monotone is a mixture of exponential functions. In one important special case the mixture is a weighted average, or expected value. Total monotonicity (sometimes also complete monotonicity) of a function f means that f is continuous on [0, ∞), infinitely differentiable on (0, ∞), and satisfies for all nonnegative integers n and for all t > 0. Another convention puts the opposite inequality in the above definition."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Compact operator",
   "citaten": [
    {
     "hoofdstuk": "Integral equations",
     "nr": 12,
     "bronregel": "Wikipedia, Compact operator"
    }
   ],
   "wikipedia": "Compact operator",
   "via": "exact",
   "oud": {
    "id": 4542582,
    "titel": "Compact operator",
    "adres1": "123083800871737058029@49",
    "pad2": "+-+++0+-+-++-+-0++-0+--+",
    "lead": "In functional analysis, a branch of mathematics, a compact operator is a linear operator , where are normed vector spaces, with the property that maps bounded subsets of to relatively compact subsets of (subsets with compact closure in ). Such an operator is necessarily a bounded operator, and so continuous. Some authors require that are Banach, but the definition can be extended to more general spaces."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Tracy–Widom distribution",
   "citaten": [
    {
     "hoofdstuk": "Integral equations",
     "nr": 24,
     "bronregel": "Wikipedia, Tracy–Widom distribution"
    }
   ],
   "wikipedia": "Tracy–Widom distribution",
   "via": "exact",
   "oud": {
    "id": 5784783,
    "titel": "Tracy–Widom distribution",
    "adres1": "64637448738746544170075719@59",
    "pad2": "+-+++0-0+++++++--+++-+++",
    "lead": "The Tracy–Widom distribution is a probability distribution from random matrix theory introduced by Craig Tracy and Harold Widom . It is the distribution of the normalized largest eigenvalue of a random Hermitian matrix. The distribution is defined as a Fredholm determinant. The distribution F1 is of particular interest in multivariate statistics. For a discussion of the universality of Fβ, β = 1, 2, and 4, see . For an application of F1 to inferring population structure from genetic data see .In 2017 it was proved that the distribution F is not infinitely divisible."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Spectral theorem",
   "citaten": [
    {
     "hoofdstuk": "Operator theory",
     "nr": 1,
     "bronregel": "Wikipedia, Spectral theorem"
    }
   ],
   "wikipedia": "Spectral theorem",
   "via": "exact",
   "oud": {
    "id": 4416656,
    "titel": "Spectral theorem",
    "adres1": "2084434975558189@39",
    "pad2": "+-++0++-++++-++--00--+-+",
    "lead": "In mathematics, particularly linear algebra and functional analysis, a spectral theorem is a result about when a linear operator or matrix can be diagonalized (that is, represented as a diagonal matrix in some basis). This is extremely useful because computations involving a diagonalizable matrix can often be reduced to much simpler computations involving the corresponding diagonal matrix. The concept of diagonalization is relatively straightforward for operators on finite-dimensional vector spaces but requires some modification for operators on infinite-dimensional spaces. In general, the spectral theorem identifies a class of linear operators that can be modeled by multiplication operators"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Fredholm theory",
   "citaten": [
    {
     "hoofdstuk": "Operator theory",
     "nr": 5,
     "bronregel": "Wikipedia, Fredholm theory"
    }
   ],
   "wikipedia": "Fredholm theory",
   "via": "exact",
   "oud": {
    "id": 5000025,
    "titel": "Fredholm theory",
    "adres1": "25524472460041@35",
    "pad2": "+-+++0++++0+-++0-0+--+-+",
    "lead": "In mathematics, Fredholm theory is a theory of integral equations. In the narrowest sense, Fredholm theory concerns itself with the solution of the Fredholm integral equation. In a broader sense, the abstract structure of Fredholm's theory is given in terms of the spectral theory of Fredholm operators and Fredholm kernels on Hilbert space. The theory is named in honour of Erik Ivar Fredholm."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Spectral radius",
   "citaten": [
    {
     "hoofdstuk": "Operator theory",
     "nr": 13,
     "bronregel": "Wikipedia, Spectral radius"
    }
   ],
   "wikipedia": "Spectral radius",
   "via": "exact",
   "oud": {
    "id": 4499146,
    "titel": "Spectral radius",
    "adres1": "18759914746580179@41",
    "pad2": "+-0++0-0++++-++--0---+-0",
    "lead": "In mathematics, the spectral radius of a square matrix is the maximum of the absolute values of its eigenvalues. More generally, the spectral radius of a bounded linear operator is the supremum of the absolute values of the elements of its spectrum. The spectral radius is often denoted by ρ(·)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Invariant subspace problem",
   "citaten": [
    {
     "hoofdstuk": "Operator theory",
     "nr": 14,
     "bronregel": "Wikipedia, Invariant subspace problem"
    }
   ],
   "wikipedia": "Invariant subspace problem",
   "via": "exact",
   "oud": {
    "id": 4564990,
    "titel": "Invariant subspace problem",
    "adres1": "231603886114066@37",
    "pad2": "+-++++--+-++++--0--+-+-+",
    "lead": "In the field of mathematics known as functional analysis, the invariant subspace problem is a partially unresolved problem asking whether every bounded operator on a complex Banach space sends some non-trivial closed subspace to itself. Many variants of the problem have been solved, by restricting the class of bounded operators considered or by specifying a particular class of Banach spaces. The problem is still open for separable Hilbert spaces (in other words, each example, found so far, of an operator with no non-trivial invariant subspaces is an operator that acts on a Banach space that is not isomorphic to a separable Hilbert space)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Zenodorus (mathematician)",
   "citaten": [
    {
     "hoofdstuk": "Calculus of variations and optimisation",
     "nr": 2,
     "bronregel": "Wikipedia, Zenodorus (mathematician)"
    }
   ],
   "wikipedia": "Zenodorus (mathematician)",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Brachistochrone curve",
   "citaten": [
    {
     "hoofdstuk": "Calculus of variations and optimisation",
     "nr": 4,
     "bronregel": "Wikipedia, Brachistochrone curve"
    }
   ],
   "wikipedia": "Brachistochrone curve",
   "via": "exact",
   "oud": {
    "id": 4443262,
    "titel": "Brachistochrone curve",
    "adres1": "228768360397570@35",
    "pad2": "+--+++-0-0++0------0++-+",
    "lead": "In physics and mathematics, a brachistochrone curve (from Ancient Greek βράχιστος χρόνος (brákhistos khrónos) 'shortest time'), or curve of fastest descent, is the one lying on the plane between a point A and a lower point B, where B is not directly below A, on which a bead slides frictionlessly under the influence of a uniform gravitational field to a given end point in the shortest time. The problem was posed by Johann Bernoulli in 1696."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Euler–Lagrange equation",
   "citaten": [
    {
     "hoofdstuk": "Calculus of variations and optimisation",
     "nr": 8,
     "bronregel": "Wikipedia, Euler–Lagrange equation"
    }
   ],
   "wikipedia": "Euler–Lagrange equation",
   "via": "exact",
   "oud": {
    "id": 4476172,
    "titel": "Euler–Lagrange equation",
    "adres1": "6202470354344659@40",
    "pad2": "+-++++++-+-+--00-++0---+",
    "lead": "In the calculus of variations and classical mechanics, the Euler–Lagrange equations are a system of second-order ordinary differential equations whose solutions are stationary points of the given action functional. The equations were discovered in the 1750s by Swiss mathematician Leonhard Euler and Italian mathematician Joseph-Louis Lagrange."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Isoperimetric inequality",
   "citaten": [
    {
     "hoofdstuk": "Calculus of variations and optimisation",
     "nr": 10,
     "bronregel": "Wikipedia, Isoperimetric inequality"
    }
   ],
   "wikipedia": "Isoperimetric inequality",
   "via": "exact",
   "oud": {
    "id": 4484445,
    "titel": "Isoperimetric inequality",
    "adres1": "166772134729894168@41",
    "pad2": "+-++0++--++++---0--+0+--",
    "lead": "In mathematics, the isoperimetric inequality is a geometric inequality involving the perimeter of a set and its volume. In -dimensional space the inequality lower bounds the surface area or perimeter of a set by its volume , , where is a unit sphere. The equality holds only when is a sphere in . and that equality holds if and only if the curve is a circle."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hilbert's nineteenth problem",
   "citaten": [
    {
     "hoofdstuk": "Calculus of variations and optimisation",
     "nr": 15,
     "bronregel": "Wikipedia, Hilbert’s nineteenth problem"
    }
   ],
   "wikipedia": "Hilbert's nineteenth problem",
   "via": "exact",
   "oud": {
    "id": 4805671,
    "titel": "Hilbert's nineteenth problem",
    "adres1": "228862198647451@35",
    "pad2": "+-++++--+--+--+--00+-+-0",
    "lead": "Hilbert's nineteenth problem is one of the 23 Hilbert problems, set out in a list compiled in 1900 by David Hilbert. It asks whether the solutions of regular problems in the calculus of variations are always analytic. Informally, and perhaps less directly, since Hilbert's concept of a \"regular variational problem\" identifies precisely a variational problem whose Euler–Lagrange equation is an elliptic partial differential equation with analytic coefficients, Hilbert's nineteenth problem, despite its seemingly technical statement, simply asks whether, in this class of partial differential equations, any solution function inherits the relatively simple and well understood structure from the sol"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Plateau's problem",
   "citaten": [
    {
     "hoofdstuk": "Calculus of variations and optimisation",
     "nr": 21,
     "bronregel": "Wikipedia, Plateau’s problem"
    }
   ],
   "wikipedia": "Plateau's problem",
   "via": "exact",
   "oud": {
    "id": 4487780,
    "titel": "Plateau's problem",
    "adres1": "18537838382160361@39",
    "pad2": "+0-00---+++++-----+-+-+-",
    "lead": "In mathematics, Plateau's problem is to show the existence of a minimal surface with a given boundary, a problem raised by Joseph-Louis Lagrange in 1760. However, it is named after Joseph Plateau who experimented with soap films. The problem is considered part of the calculus of variations. The existence and regularity problems are part of geometric measure theory."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Pontryagin's maximum principle",
   "citaten": [
    {
     "hoofdstuk": "Calculus of variations and optimisation",
     "nr": 23,
     "bronregel": "Wikipedia, Pontryagin’s maximum principle"
    },
    {
     "hoofdstuk": "Control theory",
     "nr": 29,
     "bronregel": "Wikipedia, Pontryagin’s maximum principle"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 162,
     "bronregel": "Wikipedia, Pontryagin’s maximum principle"
    }
   ],
   "wikipedia": "Pontryagin's maximum principle",
   "via": "exact",
   "oud": {
    "id": 4586033,
    "titel": "Pontryagin's maximum principle",
    "adres1": "364730652932465304280@48",
    "pad2": "+-++++++-+-++00---+000++",
    "lead": "Pontryagin's maximum principle is used in optimal control theory to find the best possible control for taking a dynamical system from one state to another, especially in the presence of constraints for the state or input controls. It states that it is necessary for any optimal control along with the optimal state trajectory to solve the so-called Hamiltonian system, which is a two-point boundary value problem, plus a maximum condition of the control Hamiltonian. These necessary conditions become sufficient under certain convexity conditions on the objective and constraint functions."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Platonic solid",
   "citaten": [
    {
     "hoofdstuk": "Convex and discrete geometry",
     "nr": 1,
     "bronregel": "Wikipedia, Platonic solid"
    }
   ],
   "wikipedia": "Platonic solid",
   "via": "exact",
   "oud": {
    "id": 4369673,
    "titel": "Platonic solid",
    "adres1": "228768360397579@35",
    "pad2": "+-0++--+-+-+--+-+-+--0+0",
    "lead": "In geometry, a Platonic solid is a convex, regular polyhedron in three-dimensional Euclidean space. Being a regular polyhedron means that the faces are congruent (identical in shape and size) regular polygons (all angles congruent and all edges congruent), and the same number of faces meet at each vertex. There are only five such polyhedra: Geometers have studied the Platonic solids for thousands of years. They are named for the ancient Greek philosopher Plato who hypothesized in one of his dialogues, the Timaeus, that the classical elements were made of these regular solids."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kepler conjecture",
   "citaten": [
    {
     "hoofdstuk": "Convex and discrete geometry",
     "nr": 3,
     "bronregel": "Wikipedia, Kepler conjecture"
    }
   ],
   "wikipedia": "Kepler conjecture",
   "via": "exact",
   "oud": {
    "id": 4494987,
    "titel": "Kepler conjecture",
    "adres1": "500521342123747369@42",
    "pad2": "+-++++--+-0++0+---+00+++",
    "lead": "The Kepler conjecture, named after the 17th-century mathematician and astronomer Johannes Kepler, is a mathematical theorem about sphere packing in three-dimensional Euclidean space. It states that no arrangement of equally sized spheres filling space has a greater average density than that of the cubic close packing (face-centered cubic) and hexagonal close packing arrangements. The density of these arrangements is around 74.05%."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Circle packing",
   "citaten": [
    {
     "hoofdstuk": "Convex and discrete geometry",
     "nr": 7,
     "bronregel": "Wikipedia, Circle packing"
    }
   ],
   "wikipedia": "Circle packing",
   "via": "exact",
   "oud": {
    "id": 5608027,
    "titel": "Circle packing",
    "adres1": "3283920525663088416217@50",
    "pad2": "+-0+++0-++++++0-++-+++++",
    "lead": "In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs and so that no circle can be enlarged without creating an overlap. The associated packing density, η, of an arrangement is the proportion of the surface covered by the circles. Generalisations can be made to higher dimensions – this is called sphere packing, which usually deals only with identical spheres."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Brunn–Minkowski theorem",
   "citaten": [
    {
     "hoofdstuk": "Convex and discrete geometry",
     "nr": 13,
     "bronregel": "Wikipedia, Brunn–Minkowski theorem"
    }
   ],
   "wikipedia": "Brunn–Minkowski theorem",
   "via": "exact",
   "oud": {
    "id": 5207515,
    "titel": "Brunn–Minkowski theorem",
    "adres1": "1506736726958858896@45",
    "pad2": "+-++0++-+0+++0+0--0--+-0",
    "lead": "In mathematics, the Brunn–Minkowski theorem (or Brunn–Minkowski inequality) is an inequality relating the volumes (or more generally Lebesgue measures) of compact subsets of Euclidean space. The original version of the Brunn–Minkowski theorem (Hermann Brunn 1887; Hermann Minkowski 1896) applied to convex sets; the generalization to compact nonconvex sets stated here is due to Lazar Lyusternik (1935)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Helly's theorem",
   "citaten": [
    {
     "hoofdstuk": "Convex and discrete geometry",
     "nr": 16,
     "bronregel": "Wikipedia, Helly’s theorem"
    }
   ],
   "wikipedia": "Helly's theorem",
   "via": "exact",
   "oud": {
    "id": 4679588,
    "titel": "Helly's theorem",
    "adres1": "18759912423260275@41",
    "pad2": "+-++0++-0+-+-++--+++-+-0",
    "lead": "Helly's theorem is a basic result in discrete geometry on the intersection of convex sets. It was discovered by Eduard Helly in 1913, but not published by him until 1923, by which time alternative proofs by and had already appeared. Helly's theorem gave rise to the notion of a Helly family."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Borsuk's conjecture",
   "citaten": [
    {
     "hoofdstuk": "Convex and discrete geometry",
     "nr": 33,
     "bronregel": "Wikipedia, Borsuk’s conjecture"
    }
   ],
   "wikipedia": "Borsuk's conjecture",
   "via": "exact",
   "oud": {
    "id": 5221143,
    "titel": "Borsuk's conjecture",
    "adres1": "88667205044717920549060@53",
    "pad2": "+-++0++++++++-+0--0--+-+",
    "lead": "The Borsuk problem in geometry, for historical reasons incorrectly called Borsuk's conjecture, is a question in discrete geometry. It is named after Karol Borsuk."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Morse theory",
   "citaten": [
    {
     "hoofdstuk": "Global analysis",
     "nr": 1,
     "bronregel": "Wikipedia, Morse theory"
    }
   ],
   "wikipedia": "Morse theory",
   "via": "exact",
   "oud": {
    "id": 4490288,
    "titel": "Morse theory",
    "adres1": "369251402616067861198@50",
    "pad2": "+-+++-+-0+-0-++--++----+",
    "lead": "In mathematics, specifically in differential topology, Morse theory enables one to analyze the topology of a manifold by studying differentiable functions on that manifold. According to the basic insights of Marston Morse, a typical differentiable function on a manifold will reflect the topology quite directly. Morse theory allows one to find CW structures and handle decompositions on manifolds and to obtain substantial information about their homology. The analogue of Morse theory for complex manifolds is Picard–Lefschetz theory."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hodge theory",
   "citaten": [
    {
     "hoofdstuk": "Global analysis",
     "nr": 3,
     "bronregel": "Wikipedia, Hodge theory"
    }
   ],
   "wikipedia": "Hodge theory",
   "via": "exact",
   "oud": {
    "id": 4527465,
    "titel": "Hodge theory",
    "adres1": "3922231438@27",
    "pad2": "+-++++--+-0+-----++--+-+",
    "lead": "In mathematics, Hodge theory, named after W. V. D. Hodge, is a method for studying the cohomology groups of a smooth manifold M using partial differential equations. The key observation is that, given a Riemannian metric on M, every cohomology class has a canonical representative, a differential form that vanishes under the Laplacian operator of the metric. Such forms are called harmonic."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Atiyah–Bott fixed-point theorem",
   "citaten": [
    {
     "hoofdstuk": "Global analysis",
     "nr": 14,
     "bronregel": "Wikipedia, Atiyah–Bott fixed-point theorem"
    }
   ],
   "wikipedia": "Atiyah–Bott fixed-point theorem",
   "via": "exact",
   "oud": {
    "id": 4940705,
    "titel": "Atiyah–Bott fixed-point theorem",
    "adres1": "76256118890065@34",
    "pad2": "+-++0++-++0++-+0-0+--0--",
    "lead": "In mathematics, the Atiyah–Bott fixed-point theorem, proven by Michael Atiyah and Raoul Bott in the 1960s, is a general form of the Lefschetz fixed-point theorem for smooth manifolds M, which uses an elliptic complex on M. This is a system of elliptic differential operators on vector bundles, generalizing the de Rham complex constructed from smooth differential forms which appears in the original Lefschetz fixed-point theorem."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Floer homology",
   "citaten": [
    {
     "hoofdstuk": "Global analysis",
     "nr": 20,
     "bronregel": "Wikipedia, Floer homology"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 170,
     "bronregel": "Wikipedia, Floer homology"
    }
   ],
   "wikipedia": "Floer homology",
   "via": "exact",
   "oud": {
    "id": 4845412,
    "titel": "Floer homology",
    "adres1": "104646638557@28",
    "pad2": "+-+++0--+0++-0+--+++-+--",
    "lead": "In mathematics, Floer homology is a tool for studying symplectic geometry and low-dimensional topology. Floer homology is a novel invariant that arises as an infinite-dimensional analogue of finite-dimensional Morse homology. Andreas Floer introduced the first version of Floer homology, now called Lagrangian Floer homology, in his proof of the Arnold conjecture in symplectic geometry. Floer also developed a closely related theory for Lagrangian submanifolds of a symplectic manifold. A third construction, also due to Floer, associates homology groups to closed three-dimensional manifolds using the Yang–Mills functional. These constructions and their descendants play a fundamental role in curr"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Arnold conjecture",
   "citaten": [
    {
     "hoofdstuk": "Global analysis",
     "nr": 24,
     "bronregel": "Wikipedia, Arnold conjecture"
    }
   ],
   "wikipedia": "Arnold conjecture",
   "via": "exact",
   "oud": {
    "id": 7548526,
    "titel": "Arnold conjecture",
    "adres1": "4558659291545245399@46",
    "pad2": "+-++0+++++-++-+---+--+-+",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kuranishi structure (Topology 38 (1999), 933–1048)",
   "citaten": [
    {
     "hoofdstuk": "Global analysis",
     "nr": 28,
     "bronregel": "Wikipedia, Kuranishi structure (Topology 38 (1999), 933–1048)"
    }
   ],
   "wikipedia": null,
   "via": null,
   "oud": null,
   "reden_oud": "geen Wikipedia-artikel met deze titel",
   "nieuw": []
  },
  {
   "sleutel": "Seiberg–Witten invariants",
   "citaten": [
    {
     "hoofdstuk": "Global analysis",
     "nr": 32,
     "bronregel": "Wikipedia, Seiberg–Witten invariants"
    }
   ],
   "wikipedia": "Seiberg–Witten invariants",
   "via": "exact",
   "oud": {
    "id": 5516869,
    "titel": "Seiberg–Witten invariants",
    "adres1": "3323262623536858745512@52",
    "pad2": "+-++0++0++-++0+0-+-+-+-+",
    "lead": "In mathematics, and especially gauge theory, Seiberg–Witten invariants are invariants of compact smooth oriented 4-manifolds introduced by Edward Witten, using the Seiberg–Witten theory studied by Nathan Seiberg and Witten during their investigations of Seiberg–Witten gauge theory. For detailed descriptions of Seiberg–Witten invariants see,,,, . For the relation to symplectic manifolds and Gromov–Witten invariants see. For the early history see."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Thom conjecture",
   "citaten": [
    {
     "hoofdstuk": "Global analysis",
     "nr": 34,
     "bronregel": "Wikipedia, Thom conjecture"
    }
   ],
   "wikipedia": "Thom conjecture",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Euclidean algorithm",
   "citaten": [
    {
     "hoofdstuk": "Computer science",
     "nr": 1,
     "bronregel": "Wikipedia, Euclidean algorithm"
    }
   ],
   "wikipedia": "Euclidean algorithm",
   "via": "exact",
   "oud": {
    "id": 4363549,
    "titel": "Euclidean algorithm",
    "adres1": "430527079@23",
    "pad2": "+-++00+-0+0+0----+-----+",
    "lead": "In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC).It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules,and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Regular expression",
   "citaten": [
    {
     "hoofdstuk": "Computer science",
     "nr": 10,
     "bronregel": "Wikipedia, Regular expression"
    }
   ],
   "wikipedia": "Regular expression",
   "via": "exact",
   "oud": {
    "id": 4370531,
    "titel": "Regular expression",
    "adres1": "435788209@23",
    "pad2": "+-0+++00+-0+0++-0-0-++0+",
    "lead": "A regular expression (shortened as regex or regexp; sometimes referred to as rational expression) is a sequence of characters that specifies a search pattern in text. Usually such patterns are used by string-searching algorithms for \"find\" or \"find and replace\" operations on strings, or for input validation. Regular expression techniques are developed in theoretical computer science and formal language theory."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Powerset construction",
   "citaten": [
    {
     "hoofdstuk": "Computer science",
     "nr": 12,
     "bronregel": "Wikipedia, Powerset construction"
    }
   ],
   "wikipedia": "Powerset construction",
   "via": "exact",
   "oud": {
    "id": 4643290,
    "titel": "Powerset construction",
    "adres1": "76256118890884@34",
    "pad2": "+-+++0--+---+0++0-+00-++",
    "lead": "In the theory of computation and automata theory, the powerset construction or subset construction is a standard method for converting a nondeterministic finite automaton (NFA) into a deterministic finite automaton (DFA) which recognizes the same formal language. It is important in theory because it establishes that NFAs, despite their additional flexibility, are unable to recognize any language that cannot be recognized by some DFA. It is also important in practice for converting easier-to-construct NFAs into more efficiently executable DFAs. However, if the NFA has n states, the resulting DFA may have up to 2n states, an exponentially larger number, which sometimes makes the construction i"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Dijkstra's algorithm",
   "citaten": [
    {
     "hoofdstuk": "Computer science",
     "nr": 16,
     "bronregel": "Wikipedia, Dijkstra’s algorithm"
    }
   ],
   "wikipedia": "Dijkstra's algorithm",
   "via": "exact",
   "oud": {
    "id": 4379016,
    "titel": "Dijkstra's algorithm",
    "adres1": "313939913410@29",
    "pad2": "+-00--+0++++++-0--0++0-+",
    "lead": "Dijkstra's algorithm (/ˈdaɪkstrəz/ DYKE-strəz) is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants. Dijkstra's original algorithm found the shortest path between two given nodes, but a more common variant fixes a single node as the \"source\" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Time hierarchy theorem",
   "citaten": [
    {
     "hoofdstuk": "Computer science",
     "nr": 18,
     "bronregel": "Wikipedia, Time hierarchy theorem"
    }
   ],
   "wikipedia": "Time hierarchy theorem",
   "via": "exact",
   "oud": {
    "id": 4447457,
    "titel": "Time hierarchy theorem",
    "adres1": "686305070426350@36",
    "pad2": "+-++0++-++-++-+----+++++",
    "lead": "In computational complexity theory, the time hierarchy theorems are important statements about time-bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example, there are problems that can be solved with n2 time but not n time. . . The analogous theorems for space are the space hierarchy theorems. A similar theorem is not known for time-bounded probabilistic complexity classes, unless the class also has one bit of advice."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Cook–Levin theorem",
   "citaten": [
    {
     "hoofdstuk": "Computer science",
     "nr": 22,
     "bronregel": "Wikipedia, Cook–Levin theorem"
    }
   ],
   "wikipedia": "Cook–Levin theorem",
   "via": "exact",
   "oud": {
    "id": 4560315,
    "titel": "Cook–Levin theorem",
    "adres1": "4558659291545225806@46",
    "pad2": "+-++0++-++0++++--+++0+-+",
    "lead": "In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete. That is, it is in NP, and any problem in NP can be reduced in polynomial time by a deterministic Turing machine to the Boolean satisfiability problem. The theorem is named after Stephen Cook and Leonid Levin."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "PCP theorem",
   "citaten": [
    {
     "hoofdstuk": "Computer science",
     "nr": 24,
     "bronregel": "Wikipedia, PCP theorem"
    }
   ],
   "wikipedia": "PCP theorem",
   "via": "exact",
   "oud": {
    "id": 4879068,
    "titel": "PCP theorem",
    "adres1": "166840553285104303@41",
    "pad2": "+-++0++-++-++-+-0-++++++",
    "lead": "In computational complexity theory, the PCP theorem (also known as the PCP characterization theorem) states that every decision problem in the NP complexity class has probabilistically checkable proofs (proofs that can be checked by a randomized algorithm) of constant query complexity and logarithmic randomness complexity (uses a logarithmic number of random bits)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "RSA cryptosystem",
   "citaten": [
    {
     "hoofdstuk": "Computer science",
     "nr": 30,
     "bronregel": "Wikipedia, RSA cryptosystem"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 19,
     "bronregel": "Wikipedia, RSA cryptosystem"
    }
   ],
   "wikipedia": "RSA cryptosystem",
   "via": "exact",
   "oud": {
    "id": 4370399,
    "titel": "RSA cryptosystem",
    "adres1": "104646645091@28",
    "pad2": "+-+++0+0++-++++0----++-+",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Probably approximately correct learning",
   "citaten": [
    {
     "hoofdstuk": "Computer science",
     "nr": 33,
     "bronregel": "Wikipedia, Probably approximately correct learning"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 80,
     "bronregel": "Wikipedia, Probably approximately correct learning"
    }
   ],
   "wikipedia": "Probably approximately correct learning",
   "via": "exact",
   "oud": {
    "id": 4497650,
    "titel": "Probably approximately correct learning",
    "adres1": "229647901623382@37",
    "pad2": "+-0+++-+++-+-+0+-00++-++",
    "lead": "In computational learning theory, probably approximately correct (PAC) learning is a framework for mathematical analysis of machine learning. It was proposed in 1984 by Leslie Valiant. In this framework, the learner receives samples and must select a generalization function (called the hypothesis) from a certain class of possible functions. The goal is that, with high probability (the \"probably\" part), the selected function will have low generalization error (the \"approximately correct\" part). The learner must be able to learn the concept given any arbitrary approximation ratio, probability of success, or distribution of the samples."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "AKS primality test",
   "citaten": [
    {
     "hoofdstuk": "Computer science",
     "nr": 38,
     "bronregel": "Wikipedia, AKS primality test"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 22,
     "bronregel": "Wikipedia, AKS primality test"
    }
   ],
   "wikipedia": "AKS primality test",
   "via": "exact",
   "oud": {
    "id": 4503764,
    "titel": "AKS primality test",
    "adres1": "10476493534@28",
    "pad2": "+-++0+++-+-+++0+--+0+0-+",
    "lead": "The AKS primality test (also known as Agrawal–Kayal–Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian Institute of Technology Kanpur, on August 6, 2002, in an article titled \"PRIMES is in P\". The algorithm was the first that can provably determine whether any given number is prime or composite in polynomial time, without relying on mathematical conjectures such as the generalized Riemann hypothesis. The proof is also notable for not relying on the field of analysis. In 2006 the authors received both the Gödel Prize and Fulkerson Prize for th"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Graph isomorphism problem",
   "citaten": [
    {
     "hoofdstuk": "Computer science",
     "nr": 57,
     "bronregel": "Wikipedia, Graph isomorphism problem"
    }
   ],
   "wikipedia": "Graph isomorphism problem",
   "via": "exact",
   "oud": {
    "id": 4754814,
    "titel": "Graph isomorphism problem",
    "adres1": "3283920525666665073754@50",
    "pad2": "+-++0++-+0+++-----0+-+-0",
    "lead": "Unsolved problem in computer science: Can the graph isomorphism problem be solved in polynomial time? (more unsolved problems in computer science) The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic. This problem is a special case of the subgraph isomorphism problem, which asks whether a given graph G contains a subgraph that is isomorphic to another given graph H; this problem is known to be NP-complete. It is also known to be a special case of the non-abelian hidden subgroup problem over the symmetric group."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "D'Alembert's principle",
   "citaten": [
    {
     "hoofdstuk": "Mechanics",
     "nr": 6,
     "bronregel": "Wikipedia, D’Alembert’s principle"
    }
   ],
   "wikipedia": "D'Alembert's principle",
   "via": "exact",
   "oud": {
    "id": 4527131,
    "titel": "D'Alembert's principle",
    "adres1": "2836052493922@33",
    "pad2": "+-+++00-0+-+0-+-0++-+-0+",
    "lead": "D'Alembert's principle is another way of formulating Newton's second law of motion.The principle has been defined as \"the negative of the product of mass times acceleration. If this force is added to the impressed force there is equilibrium, which means that the principle of virtual work is satisfied.\" It constitutes an extension of the principle of virtual work from static to dynamical systems."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hamilton–Jacobi equation",
   "citaten": [
    {
     "hoofdstuk": "Mechanics",
     "nr": 11,
     "bronregel": "Wikipedia, Hamilton–Jacobi equation"
    },
    {
     "hoofdstuk": "Optics and electromagnetism",
     "nr": 14,
     "bronregel": "Wikipedia, Hamilton–Jacobi equation"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 179,
     "bronregel": "Wikipedia, Hamilton–Jacobi equation"
    }
   ],
   "wikipedia": "Hamilton–Jacobi equation",
   "via": "exact",
   "oud": {
    "id": 4598038,
    "titel": "Hamilton–Jacobi equation",
    "adres1": "689163372705637@38",
    "pad2": "+-++++++-+-+-+---++--+-+",
    "lead": "In physics, the Hamilton–Jacobi equation, named after William Rowan Hamilton and Carl Gustav Jacob Jacobi, is an alternative formulation of classical mechanics, equivalent to other formulations such as Newton's laws of motion, Lagrangian mechanics and Hamiltonian mechanics. The Hamilton–Jacobi equation is particularly useful in identifying conserved quantities for mechanical systems, which may be possible even when the mechanical problem itself cannot be solved completely."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Painlevé conjecture",
   "citaten": [
    {
     "hoofdstuk": "Mechanics",
     "nr": 18,
     "bronregel": "Wikipedia, Painlevé conjecture"
    }
   ],
   "wikipedia": "Painlevé conjecture",
   "via": "exact",
   "oud": {
    "id": 6590581,
    "titel": "Painlevé conjecture",
    "adres1": "3889146484@25",
    "pad2": "+-++++--+-+++-+--0+-00-+",
    "lead": "In physics, the Painlevé conjecture is a theorem about singularities among the solutions to the n-body problem: there are noncollision singularities for n ≥ 4. The theorem was proven for n ≥ 5 in 1988 by Jeff Xia and for n=4 in 2014 by Jinxin Xue."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Sitnikov problem",
   "citaten": [
    {
     "hoofdstuk": "Mechanics",
     "nr": 24,
     "bronregel": "Wikipedia, Sitnikov problem"
    }
   ],
   "wikipedia": "Sitnikov problem",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Noether's theorem",
   "citaten": [
    {
     "hoofdstuk": "Mechanics",
     "nr": 32,
     "bronregel": "Wikipedia, Noether’s theorem"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 128,
     "bronregel": "Wikipedia, Noether’s theorem"
    }
   ],
   "wikipedia": "Noether's theorem",
   "via": "exact",
   "oud": {
    "id": 4435432,
    "titel": "Noether's theorem",
    "adres1": "231603885583102@37",
    "pad2": "+-++0++-0+-++-+--0++-+-+",
    "lead": "Noether's theorem or Noether's first theorem states that every differentiable symmetry of the action of a physical system with conservative forces has a corresponding conservation law. The theorem was proven by mathematician Emmy Noether in 1915 and published in 1918. The action of a physical system is the integral over time of a Lagrangian function, from which the system's behavior can be determined by the principle of least action. This theorem only applies to continuous and smooth symmetries over physical space."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Moment map",
   "citaten": [
    {
     "hoofdstuk": "Mechanics",
     "nr": 35,
     "bronregel": "Wikipedia, Moment map"
    }
   ],
   "wikipedia": "Momentum map",
   "via": "doorverwijzing",
   "oud": {
    "id": 4946547,
    "titel": "Momentum map",
    "adres1": "29909363611901880647719@54",
    "pad2": "+-00--0-+-+0-+---+++0---",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Geometric mechanics",
   "citaten": [
    {
     "hoofdstuk": "Mechanics",
     "nr": 37,
     "bronregel": "Wikipedia, Geometric mechanics"
    }
   ],
   "wikipedia": "Geometric mechanics",
   "via": "exact",
   "oud": {
    "id": 6502216,
    "titel": "Geometric mechanics",
    "adres1": "21545802568946508302928142@58",
    "pad2": "+-00--+-+0-+-0---+0-----",
    "lead": "Geometric mechanics is a branch of mathematics applying particular geometric methods to many areas of mechanics, from mechanics of particles and rigid bodies to fluid mechanics to control theory. Geometric mechanics applies principally to systems for which the configuration space is a Lie group, or a group of diffeomorphisms, or more generally where some aspect of the configuration space has this group structure. For example, the configuration space of a rigid body such as a satellite is the group of Euclidean motions (translations and rotations in space), while the configuration space for a liquid crystal is the group of diffeomorphisms coupled with an internal state (gauge symmetry or orde"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Non-squeezing theorem",
   "citaten": [
    {
     "hoofdstuk": "Mechanics",
     "nr": 38,
     "bronregel": "Wikipedia, Non-squeezing theorem"
    }
   ],
   "wikipedia": "Non-squeezing theorem",
   "via": "exact",
   "oud": {
    "id": 5865121,
    "titel": "Non-squeezing theorem",
    "adres1": "265997731435171250773861@54",
    "pad2": "+-++0++--+0+++0---++-0-0",
    "lead": "The non-squeezing theorem, also called Gromov's non-squeezing theorem, is one of the most important theorems in symplectic geometry. It was first proven in 1985 by Mikhail Gromov. The theorem states that one cannot embed a ball into a cylinder via a symplectic map unless the radius of the ball is less than or equal to the radius of the cylinder. The theorem is important because formerly very little was known about the geometry behind symplectic maps."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Buckling",
   "citaten": [
    {
     "hoofdstuk": "Elasticity and solids",
     "nr": 8,
     "bronregel": "Wikipedia, Buckling"
    }
   ],
   "wikipedia": "Buckling",
   "via": "exact",
   "oud": {
    "id": 4584647,
    "titel": "Buckling",
    "adres1": "4502847637707142591@44",
    "pad2": "+-----00+++--+-0---00+-+",
    "lead": "In structural engineering, buckling is the sudden change in shape (deformation) of a structural component under load, such as the bowing of a column under compression or the wrinkling of a plate under shear. If a structure is subjected to a gradually increasing load, when the load reaches a critical level, a member may suddenly change shape and the structure and component is said to have buckled. Euler's critical load and Johnson's parabolic formula are used to determine the buckling stress in slender columns."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Saint-Venant's principle",
   "citaten": [
    {
     "hoofdstuk": "Elasticity and solids",
     "nr": 17,
     "bronregel": "Wikipedia, Saint-Venant’s principle"
    }
   ],
   "wikipedia": "Saint-Venant's principle",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Max Born",
   "citaten": [
    {
     "hoofdstuk": "Elasticity and solids",
     "nr": 20,
     "bronregel": "Wikipedia, Max Born"
    }
   ],
   "wikipedia": "Max Born",
   "via": "exact",
   "oud": {
    "id": 4385223,
    "titel": "Max Born",
    "adres1": "8577891573094@32",
    "pad2": "+---+-+0-+-+-+-+-------+",
    "lead": "Max Born FRS, FRSE (German pronunciation: [ˈmaks ˈbɔɐ̯n]; 11 December 1882 – 5 January 1970) was a German physicist and mathematician who was instrumental in the development of quantum mechanics. He also made contributions to solid-state physics and optics and supervised the work of a number of notable physicists in the 1920s and 1930s. Born won the 1954 Nobel Prize in Physics for his \"fundamental research in quantum mechanics, especially in the statistical interpretation of the wave function\"."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Quasiconvexity (calculus of variations)",
   "citaten": [
    {
     "hoofdstuk": "Elasticity and solids",
     "nr": 27,
     "bronregel": "Wikipedia, Quasiconvexity (calculus of variations)"
    }
   ],
   "wikipedia": "Quasiconvexity (calculus of variations)",
   "via": "exact",
   "oud": {
    "id": 7511611,
    "titel": "Quasiconvexity (calculus of variations)",
    "adres1": "121626763344841228696@47",
    "pad2": "+-++++0-+0++----0+000+-0",
    "lead": "In the calculus of variations, a subfield of mathematics, quasiconvexity is a generalisation of the notion of convexity. It is used to characterise the integrand of a functional and related to the existence of minimisers. Under some natural conditions, quasiconvexity of the integrand is a necessary and sufficient condition for a functional"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Homogenization (mathematics)",
   "citaten": [
    {
     "hoofdstuk": "Elasticity and solids",
     "nr": 32,
     "bronregel": "Wikipedia, Homogenization (mathematics)"
    }
   ],
   "wikipedia": "Asymptotic homogenization",
   "via": "doorverwijzing",
   "oud": {
    "id": 5866096,
    "titel": "Asymptotic homogenization",
    "adres1": "18538110044879311@39",
    "pad2": "+-++++0-+00+-0---+++-0-0",
    "lead": "In mathematics and physics, homogenization is a method of studying partial differential equations with rapidly oscillating coefficients, such as where is a very small parameter and is a 1-periodic coefficient:, . Frequently, inhomogeneous materials (such as composite materials) possess microstructure and therefore they are subjected to loads or forcings which vary on a length scale which is far bigger than the characteristic length scale of the microstructure. In this situation, one can often replace the equation above with an equation of the form from 1-periodic functions satisfying:"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "On Floating Bodies",
   "citaten": [
    {
     "hoofdstuk": "Fluid mechanics",
     "nr": 1,
     "bronregel": "Wikipedia, On Floating Bodies"
    }
   ],
   "wikipedia": "On Floating Bodies",
   "via": "exact",
   "oud": {
    "id": 6312010,
    "titel": "On Floating Bodies",
    "adres1": "13558548721829105116@45",
    "pad2": "+0+-+0+++0+00++--0+0-++-",
    "lead": "On Floating Bodies (Greek: Περὶ τῶν ἐπιπλεόντων σωμάτων) is a Greek-language work consisting of two books written by Archimedes of Syracuse (287 – c. 212 BC), one of the most important mathematicians, physicists, and engineers of antiquity. On Floating Bodies, which is thought to have been written around 250 BC, survives only partly in Greek, the rest in medieval Latin translation from the Greek. It is the first known work on hydrostatics, of which Archimedes is recognized as the founder."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "D'Alembert's paradox",
   "citaten": [
    {
     "hoofdstuk": "Fluid mechanics",
     "nr": 4,
     "bronregel": "Wikipedia, D’Alembert’s paradox"
    }
   ],
   "wikipedia": "D'Alembert's paradox",
   "via": "exact",
   "oud": {
    "id": 4519155,
    "titel": "D'Alembert's paradox",
    "adres1": "35001774514@27",
    "pad2": "+-+++0-00+-++-+--++-+-0+",
    "lead": "In fluid dynamics, d'Alembert's paradox (or the hydrodynamic paradox) is a contradiction reached in 1752 by French mathematician Jean le Rond d'Alembert. D'Alembert proved that – for incompressible and inviscid potential flow – the drag force is zero on a body moving with constant velocity relative to the fluid. Zero drag is in direct contradiction to the observation of substantial drag on bodies moving relative to fluids, such as air and water; especially at high velocities corresponding with high Reynolds numbers. It is a particular example of the reversibility paradox."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Stokes' law",
   "citaten": [
    {
     "hoofdstuk": "Fluid mechanics",
     "nr": 8,
     "bronregel": "Wikipedia, Stokes’ law"
    }
   ],
   "wikipedia": "Stokes's law",
   "via": "doorverwijzing",
   "oud": {
    "id": 4453731,
    "titel": "Stokes's law",
    "adres1": "2859308489863@33",
    "pad2": "+-0+++--++-+--0+-+++-+++",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Helmholtz's theorems",
   "citaten": [
    {
     "hoofdstuk": "Fluid mechanics",
     "nr": 10,
     "bronregel": "Wikipedia, Helmholtz’s theorems"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 86,
     "bronregel": "Wikipedia, Helmholtz’s theorems"
    }
   ],
   "wikipedia": "Helmholtz's theorems",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Kelvin's circulation theorem",
   "citaten": [
    {
     "hoofdstuk": "Fluid mechanics",
     "nr": 13,
     "bronregel": "Wikipedia, Kelvin’s circulation theorem"
    }
   ],
   "wikipedia": "Kelvin's circulation theorem",
   "via": "exact",
   "oud": {
    "id": 5184926,
    "titel": "Kelvin's circulation theorem",
    "adres1": "5336290@21",
    "pad2": "+-+++0--++-+--0--+--0+++",
    "lead": "In fluid mechanics, Kelvin's circulation theorem (named after William Thomson, 1st Baron Kelvin who published it in 1869) states: In a barotropic, ideal fluid with conservative body forces, the circulation around a closed curve (which encloses the same fluid elements) moving with the fluid remains constant with time. Stated mathematically: This theorem does not hold in cases with viscous stresses, nonconservative body forces (for example the Coriolis force) or non-barotropic pressure-density relations."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Reynolds number",
   "citaten": [
    {
     "hoofdstuk": "Fluid mechanics",
     "nr": 17,
     "bronregel": "Wikipedia, Reynolds number"
    }
   ],
   "wikipedia": "Reynolds number",
   "via": "exact",
   "oud": {
    "id": 5866680,
    "titel": "Reynolds number",
    "adres1": "2824311507058@31",
    "pad2": "+-0+++--++-+-+---+-+++0+",
    "lead": "The Reynolds number (Re) helps predict flow patterns in different fluid flow situations by measuring the ratio between inertial and viscous forces. At low Reynolds numbers, flows tend to be dominated by laminar (sheet-like) flow, while at high Reynolds numbers flows tend to be turbulent. The turbulence results from differences in the fluid's speed and direction, which may sometimes intersect or even move counter to the overall direction of the flow (eddy currents). These eddy currents begin to churn the flow, using up energy in the process, which for liquids increases the chances of cavitation. Reynolds numbers are an important dimensionless quantity in fluid mechanics."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Turbulence",
   "citaten": [
    {
     "hoofdstuk": "Fluid mechanics",
     "nr": 24,
     "bronregel": "Wikipedia, Turbulence"
    }
   ],
   "wikipedia": "Turbulence",
   "via": "exact",
   "oud": {
    "id": 4437434,
    "titel": "Turbulence",
    "adres1": "1501586903160390142@43",
    "pad2": "++++++00+-++-++-----0+-+",
    "lead": "In fluid dynamics, turbulence or turbulent flow is fluid motion characterized by chaotic changes in pressure and flow velocity. It is in contrast to a laminar flow, which occurs when a fluid flows in parallel layers, with no disruption between those layers. The turbulence intensity affects many fields, for examples fish ecology, air pollution, precipitation, and climate change."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Fermat's principle",
   "citaten": [
    {
     "hoofdstuk": "Optics and electromagnetism",
     "nr": 1,
     "bronregel": "Wikipedia, Fermat’s principle"
    }
   ],
   "wikipedia": "Fermat's principle",
   "via": "exact",
   "oud": {
    "id": 4375429,
    "titel": "Fermat's principle",
    "adres1": "1771714@20",
    "pad2": "+-+++-++00-+--++-0+--+-0",
    "lead": "Fermat's principle, also known as the principle of least time, is the link between ray optics and wave optics. In its original \"strong\" form, Fermat's principle states that the path taken by a ray between two given points is the path that can be traveled in the least time. In order to be true in all cases, this statement must be weakened by replacing the \"least\" time with a time that is \"stationary\" with respect to variations of the path — so that a deviation in the path causes, at most, a second-order change in the traversal time. To put it loosely, a ray path is surrounded by close paths that can be traversed in very close times. It that this technical definition corresponds to more intuit"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Ibn Sahl",
   "citaten": [
    {
     "hoofdstuk": "Optics and electromagnetism",
     "nr": 4,
     "bronregel": "Wikipedia, Ibn Sahl"
    }
   ],
   "wikipedia": "Ibn Sahl",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Snell's law",
   "citaten": [
    {
     "hoofdstuk": "Optics and electromagnetism",
     "nr": 6,
     "bronregel": "Wikipedia, Snell’s law"
    }
   ],
   "wikipedia": "Snell's law",
   "via": "exact",
   "oud": {
    "id": 4377870,
    "titel": "Snell's law",
    "adres1": "686305081192798@36",
    "pad2": "+-0+++--++0+-00-0+0+-+0+",
    "lead": "Snell's law (also known as Snell–Descartes law and ibn-Sahl law and the law of refraction) is a formula used to describe the relationship between the angles of incidence and refraction, when referring to light or other waves passing through a boundary between two different isotropic media, such as water, glass, or air. This law was named after the Dutch astronomer and mathematician Willebrord Snellius (also called Snell). The law follows from Fermat's principle of least time, which in turn follows from the propagation of light as waves."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Huygens–Fresnel principle",
   "citaten": [
    {
     "hoofdstuk": "Optics and electromagnetism",
     "nr": 10,
     "bronregel": "Wikipedia, Huygens–Fresnel principle"
    }
   ],
   "wikipedia": "Huygens–Fresnel principle",
   "via": "exact",
   "oud": {
    "id": 4365335,
    "titel": "Huygens–Fresnel principle",
    "adres1": "144042382@22",
    "pad2": "+-+++-0-+0++-----++0-+00",
    "lead": "The Huygens–Fresnel principle (named after Dutch physicist Christiaan Huygens and French physicist Augustin-Jean Fresnel) states that every point on a wavefront is itself the source of spherical wavelets, and the secondary wavelets emanating from different points mutually interfere. The sum of these spherical wavelets forms a new wavefront. As such, the Huygens-Fresnel principle is a method of analysis applied to problems of luminous wave propagation both in the far-field limit and in near-field diffraction as well as reflection."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "History of Maxwell's equations",
   "citaten": [
    {
     "hoofdstuk": "Optics and electromagnetism",
     "nr": 15,
     "bronregel": "Wikipedia, History of Maxwell’s equations"
    }
   ],
   "wikipedia": "History of Maxwell's equations",
   "via": "exact",
   "oud": {
    "id": 6416267,
    "titel": "History of Maxwell's equations",
    "adres1": "2058915243578149@37",
    "pad2": "+-0--+-0++-0--++-++--+-+",
    "lead": "In the beginning of the 19th century, many experimental and theoretical works had been accomplished in the understanding of electromagnetics. In the 1780s, Coulomb's law of electrostatics had been established. In 1825, Ampère published his Ampère's law. Michael Faraday discovered the electromagnetic induction through his experiments and conceptually, he emphasized the lines of forces in this electromagnetic induction. In 1834, Lenz solved the problem of the direction of the induction, and Neumann wrote down the equation to calculate the induced force by change of magnetic flux. However, these experimental results and rules were not well organized and sometimes confusing to scientists. A comp"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Mie scattering",
   "citaten": [
    {
     "hoofdstuk": "Optics and electromagnetism",
     "nr": 24,
     "bronregel": "Wikipedia, Mie scattering"
    }
   ],
   "wikipedia": "Mie scattering",
   "via": "exact",
   "oud": {
    "id": 4455486,
    "titel": "Mie scattering",
    "adres1": "166772134729847737@41",
    "pad2": "+---------++-+--++++---0",
    "lead": "The Mie solution to Maxwell's equations (also known as the Lorenz–Mie solution, the Lorenz–Mie–Debye solution or Mie scattering) describes the scattering of an electromagnetic plane wave by a homogeneous sphere. The solution takes the form of an infinite series of spherical multipole partial waves. It is named after Gustav Mie."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Transformation optics",
   "citaten": [
    {
     "hoofdstuk": "Optics and electromagnetism",
     "nr": 36,
     "bronregel": "Wikipedia, Transformation optics"
    }
   ],
   "wikipedia": "Transformation optics",
   "via": "exact",
   "oud": {
    "id": 6002608,
    "titel": "Transformation optics",
    "adres1": "228865559317759@35",
    "pad2": "+-0--+--+--0-+--++0+++-+",
    "lead": "Transformation optics is a branch of optics which applies metamaterials to produce spatial variations, derived from coordinate transformations, which can direct chosen bandwidths of electromagnetic radiation. This can allow for the construction of new composite artificial devices, which probably could not exist without metamaterials and coordinate transformation. Computing power that became available in the late 1990s enables prescribed quantitative values for the permittivity and permeability, the constitutive parameters, which produce localized spatial variations. The aggregate value of all the constitutive parameters produces an effective value, which yields the intended or desired result"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Second law of thermodynamics",
   "citaten": [
    {
     "hoofdstuk": "Thermodynamics",
     "nr": 10,
     "bronregel": "Wikipedia, Second law of thermodynamics"
    }
   ],
   "wikipedia": "Second law of thermodynamics",
   "via": "exact",
   "oud": {
    "id": 4425313,
    "titel": "Second law of thermodynamics",
    "adres1": "25429134764251@33",
    "pad2": "+-0--+--+0-+--++-+-0-0-+",
    "lead": "The second law of thermodynamics is a physical law based on universal experience concerning heat and energy interconversions. One simple statement of the law is that heat always moves from hotter objects to colder objects (or \"downhill\"), unless energy is supplied to reverse the direction of heat flow. Another definition is: \"Not all heat energy can be converted into work in a cyclic process.\" The second law of thermodynamics allows the definition of the concept of thermodynamic temperature, relying also on the zeroth law of thermodynamics."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Stefan problem",
   "citaten": [
    {
     "hoofdstuk": "Thermodynamics",
     "nr": 11,
     "bronregel": "Wikipedia, Stefan problem"
    }
   ],
   "wikipedia": "Stefan problem",
   "via": "exact",
   "oud": {
    "id": 4563148,
    "titel": "Stefan problem",
    "adres1": "313944697180@29",
    "pad2": "+-+++0-++--+++0---++-+-0",
    "lead": "In mathematics and its applications, particularly to phase transitions in matter, a Stefan problem is a particular kind of boundary value problem for a system of partial differential equations (PDE), in which the boundary between the phases can move with time. The classical Stefan problem aims to describe the evolution of the boundary between two phases of a material undergoing a phase change, for example the melting of a solid, such as ice to water. This is accomplished by solving heat equations in both regions, subject to given boundary and initial conditions. At the interface between the phases (in the classical problem) the temperature is set to the phase change temperature. To close the"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Adiabatic accessibility",
   "citaten": [
    {
     "hoofdstuk": "Thermodynamics",
     "nr": 13,
     "bronregel": "Wikipedia, Adiabatic accessibility"
    }
   ],
   "wikipedia": "Adiabatic accessibility",
   "via": "exact",
   "oud": {
    "id": 6033141,
    "titel": "Adiabatic accessibility",
    "adres1": "25516720486018@35",
    "pad2": "+-0+++--+-+++---000-+0-0",
    "lead": "Adiabatic accessibility denotes a certain relation between two equilibrium states of a thermodynamic system (or of different such systems). The concept was coined by Constantin Carathéodory in 1909 (\"adiabatische Erreichbarkeit\") and taken up 90 years later by Elliott Lieb and J. Yngvason in their axiomatic approach to the foundations of thermodynamics. It was also used by R. Giles in his 1964 monograph."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Constantin Carathéodory",
   "citaten": [
    {
     "hoofdstuk": "Thermodynamics",
     "nr": 15,
     "bronregel": "Wikipedia, Constantin Carathéodory"
    }
   ],
   "wikipedia": "Constantin Carathéodory",
   "via": "exact",
   "oud": {
    "id": 4520475,
    "titel": "Constantin Carathéodory",
    "adres1": "945047774071@30",
    "pad2": "+-0--++0---+--+-++---+++",
    "lead": "Constantin Carathéodory (Greek: Κωνσταντίνος Καραθεοδωρή, romanized: Konstantinos Karatheodori; 13 September 1873 – 2 February 1950) was a Greek mathematician who spent most of his professional career in Germany. He made significant contributions to real and complex analysis, the calculus of variations, and measure theory. He also created an axiomatic formulation of thermodynamics. Carathéodory is considered one of the greatest mathematicians of his era and the most renowned Greek mathematician since antiquity."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Planck's law",
   "citaten": [
    {
     "hoofdstuk": "Quantum theory",
     "nr": 2,
     "bronregel": "Wikipedia, Planck’s law"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 184,
     "bronregel": "Wikipedia, Planck’s law"
    }
   ],
   "wikipedia": "Planck's law",
   "via": "exact",
   "oud": {
    "id": 4449418,
    "titel": "Planck's law",
    "adres1": "8476378259122@32",
    "pad2": "+-0++-++++-+--++--+---+0",
    "lead": "In physics, Planck's law describes the spectral density of electromagnetic radiation emitted by a black body in thermal equilibrium at a given temperature T, when there is no net flow of matter or energy between the body and its environment."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Matrix mechanics",
   "citaten": [
    {
     "hoofdstuk": "Quantum theory",
     "nr": 5,
     "bronregel": "Wikipedia, Matrix mechanics"
    }
   ],
   "wikipedia": "Matrix mechanics",
   "via": "exact",
   "oud": {
    "id": 4501461,
    "titel": "Matrix mechanics",
    "adres1": "168839236503809803@43",
    "pad2": "+-0+++--+--+-+---0-+0-0+",
    "lead": "Matrix mechanics is a formulation of quantum mechanics created by Werner Heisenberg, Max Born, and Pascual Jordan in 1925. It was the first conceptually autonomous and logically consistent formulation of quantum mechanics. Its account of quantum jumps supplanted the Bohr model's electron orbits. It did so by interpreting the physical properties of particles as matrices that evolve in time. It is equivalent to the Schrödinger wave formulation of quantum mechanics, as manifest in Dirac's bra–ket notation."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Uncertainty principle",
   "citaten": [
    {
     "hoofdstuk": "Quantum theory",
     "nr": 11,
     "bronregel": "Wikipedia, Uncertainty principle"
    }
   ],
   "wikipedia": "Uncertainty principle",
   "via": "exact",
   "oud": {
    "id": 4373301,
    "titel": "Uncertainty principle",
    "adres1": "2058915243578374@37",
    "pad2": "+-000++0-+-+++-+--++0+0+",
    "lead": "In quantum mechanics, the uncertainty principle (also known as Heisenberg's uncertainty principle) is any of a variety of mathematical inequalities asserting a fundamental limit to the accuracy with which the values for certain pairs of physical quantities of a particle, such as position, x, and momentum, p, can be predicted from initial conditions. where ħ is the reduced Planck constant, h/(2π)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Stone–von Neumann theorem",
   "citaten": [
    {
     "hoofdstuk": "Quantum theory",
     "nr": 14,
     "bronregel": "Wikipedia, Stone–von Neumann theorem"
    }
   ],
   "wikipedia": "Stone–von Neumann theorem",
   "via": "exact",
   "oud": {
    "id": 4574438,
    "titel": "Stone–von Neumann theorem",
    "adres1": "953199670294@32",
    "pad2": "+-++0++-++-+00-0--++-+-+",
    "lead": "In mathematics and in theoretical physics, the Stone–von Neumann theorem refers to any one of a number of different formulations of the uniqueness of the canonical commutation relations between position and momentum operators. It is named after Marshall Stone and John von Neumann."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Tosio Kato",
   "citaten": [
    {
     "hoofdstuk": "Quantum theory",
     "nr": 21,
     "bronregel": "Wikipedia, Tosio Kato"
    }
   ],
   "wikipedia": "Tosio Kato",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Gleason's theorem",
   "citaten": [
    {
     "hoofdstuk": "Quantum theory",
     "nr": 24,
     "bronregel": "Wikipedia, Gleason’s theorem"
    }
   ],
   "wikipedia": "Gleason's theorem",
   "via": "exact",
   "oud": {
    "id": 5167811,
    "titel": "Gleason's theorem",
    "adres1": "500528979471929410@42",
    "pad2": "+-++0++-0+-0000--+-+-+-+",
    "lead": "In mathematical physics, Gleason's theorem shows that the rule one uses to calculate probabilities in quantum physics, the Born rule, can be derived from the usual mathematical representation of measurements in quantum physics together with the assumption of non-contextuality. Andrew M. Gleason first proved the theorem in 1957, answering a question posed by George W. Mackey, an accomplishment that was historically significant for the role it played in showing that wide classes of hidden-variable theories are inconsistent with quantum physics. Multiple variations have been proven in the years since. Gleason's theorem is of particular importance for the field of quantum logic and its attempt t"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "CHSH inequality",
   "citaten": [
    {
     "hoofdstuk": "Quantum theory",
     "nr": 26,
     "bronregel": "Wikipedia, CHSH inequality"
    }
   ],
   "wikipedia": "CHSH inequality",
   "via": "exact",
   "oud": {
    "id": 4442332,
    "titel": "CHSH inequality",
    "adres1": "945354420640@32",
    "pad2": "+-+++++--+-+++--++-++0-+",
    "lead": "In physics, the CHSH inequality can be used in the proof of Bell's theorem, which states that certain consequences of entanglement in quantum mechanics can not be reproduced by local hidden-variable theories. Experimental verification of the inequality being violated is seen as confirmation that nature cannot be described by such theories. CHSH stands for John Clauser, Michael Horne, Abner Shimony, and , who described it in a much-cited paper published in 1969. They derived the CHSH inequality, which, as with John Stewart Bell's original inequality, is a constraint on the statistical occurrence of \"coincidences\" in a Bell test which is necessarily true if there exist underlying local hidden "
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Stability of matter",
   "citaten": [
    {
     "hoofdstuk": "Quantum theory",
     "nr": 27,
     "bronregel": "Wikipedia, Stability of matter"
    }
   ],
   "wikipedia": "Stability of matter",
   "via": "exact",
   "oud": {
    "id": 7509263,
    "titel": "Stability of matter",
    "adres1": "88667207111160695796787@53",
    "pad2": "+-00-+-+++-+--00+-+----+",
    "lead": "Stability of matter refers to the problem of showing rigorously that a large number of charged quantum particles can coexist and form macroscopic objects, like ordinary matter. The first proof was provided by Freeman Dyson and Andrew Lenard in 1967–1968, but a shorter and more conceptual proof was found later by Elliott Lieb and Walter Thirring in 1975."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Yang–Mills existence and mass gap",
   "citaten": [
    {
     "hoofdstuk": "Quantum theory",
     "nr": 38,
     "bronregel": "Wikipedia, Yang–Mills existence and mass gap"
    }
   ],
   "wikipedia": "Yang–Mills existence and mass gap",
   "via": "exact",
   "oud": {
    "id": 4813039,
    "titel": "Yang–Mills existence and mass gap",
    "adres1": "88667205044619859587181@53",
    "pad2": "+-++++++-+0+0+---++----0",
    "lead": "The Yang–Mills existence and mass gap problem is an unsolved problem in mathematical physics and mathematics, and one of the seven Millennium Prize Problems defined by the Clay Mathematics Institute, which has offered a prize of US$1,000,000 for its solution. The problem is phrased as follows: Yang–Mills Existence and Mass Gap. Prove that for any compact simple gauge group G, a non-trivial quantum Yang–Mills theory exists on and has a mass gap Δ > 0. Existence includes establishing axiomatic properties at least as strong as those cited in , and . Therefore, the winner must prove that:"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kinetic theory of gases",
   "citaten": [
    {
     "hoofdstuk": "Statistical mechanics",
     "nr": 1,
     "bronregel": "Wikipedia, Kinetic theory of gases"
    }
   ],
   "wikipedia": "Kinetic theory of gases",
   "via": "exact",
   "oud": {
    "id": 4386037,
    "titel": "Kinetic theory of gases",
    "adres1": "6176745730735183@38",
    "pad2": "+-0--+0++--+-0+0--+--+-+",
    "lead": "The kinetic theory of gases is a simple, historically significant classical model of the thermodynamic behavior of gases, with which many principal concepts of thermodynamics were established. The model describes a gas as a large number of identical submicroscopic particles (atoms or molecules), all of which are in constant, rapid, random motion. Their size is assumed to be much smaller than the average distance between the particles. The particles undergo random elastic collisions between themselves and with the enclosing walls of the container. The basic version of the model describes the ideal gas, and considers no other interactions between the particles."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "H-theorem",
   "citaten": [
    {
     "hoofdstuk": "Statistical mechanics",
     "nr": 8,
     "bronregel": "Wikipedia, H-theorem"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 94,
     "bronregel": "Wikipedia, H-theorem"
    }
   ],
   "wikipedia": "H-theorem",
   "via": "exact",
   "oud": {
    "id": 4509067,
    "titel": "H-theorem",
    "adres1": "8476378254748@32",
    "pad2": "+-++0++-++-+-+----+00+-+",
    "lead": "In classical statistical mechanics, the H-theorem, introduced by Ludwig Boltzmann in 1872, describes the tendency to decrease in the quantity H (defined below) in a nearly-ideal gas of molecules. As this quantity H was meant to represent the entropy of thermodynamics, the H-theorem was an early demonstration of the power of statistical mechanics as it claimed to derive the second law of thermodynamics—a statement about fundamentally irreversible processes—from reversible microscopic mechanics. It is thought to prove the second law of thermodynamics, albeit under the assumption of low-entropy initial conditions."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Brownian motion",
   "citaten": [
    {
     "hoofdstuk": "Statistical mechanics",
     "nr": 13,
     "bronregel": "Wikipedia, Brownian motion"
    }
   ],
   "wikipedia": "Brownian motion",
   "via": "exact",
   "oud": {
    "id": 4360892,
    "titel": "Brownian motion",
    "adres1": "143548210@22",
    "pad2": "+-0+++--+00+-+0--00--+00",
    "lead": "Brownian motion, or pedesis (from Ancient Greek: πήδησις /pɛ̌ːdɛːsis/ \"leaping\"), is the random motion of particles suspended in a medium (a liquid or a gas). This pattern of motion typically consists of random fluctuations in a particle's position inside a fluid sub-domain, followed by a relocation to another sub-domain. Each relocation is followed by more fluctuations within the new closed volume. This pattern describes a fluid at thermal equilibrium, defined by a given temperature. Within such a fluid, there exists no preferential direction of flow (as in transport phenomena). More specifically, the fluid's overall linear and angular momenta remain null over time. The kinetic energies of "
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Ising model",
   "citaten": [
    {
     "hoofdstuk": "Statistical mechanics",
     "nr": 18,
     "bronregel": "Wikipedia, Ising model"
    }
   ],
   "wikipedia": "Ising model",
   "via": "exact",
   "oud": {
    "id": 4475520,
    "titel": "Ising model",
    "adres1": "228799741452085@35",
    "pad2": "+-0+++-+0+0+-+-++-0+-+-+",
    "lead": "The Ising model (German pronunciation: [ˈiːzɪŋ]) (or Lenz-Ising model or Ising-Lenz model), named after the physicists Ernst Ising and Wilhelm Lenz, is a mathematical model of ferromagnetism in statistical mechanics. The model consists of discrete variables that represent magnetic dipole moments of atomic \"spins\" that can be in one of two states (+1 or −1). The spins are arranged in a graph, usually a lattice (where the local structure repeats periodically in all directions), allowing each spin to interact with its neighbors. Neighboring spins that agree have a lower energy than those that disagree; the system tends to the lowest energy but heat disturbs this tendency, thus creating the poss"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Onsager reciprocal relations",
   "citaten": [
    {
     "hoofdstuk": "Statistical mechanics",
     "nr": 21,
     "bronregel": "Wikipedia, Onsager reciprocal relations"
    }
   ],
   "wikipedia": "Onsager reciprocal relations",
   "via": "exact",
   "oud": {
    "id": 4519388,
    "titel": "Onsager reciprocal relations",
    "adres1": "315116943706@31",
    "pad2": "+-+++-0-0++++0---+-+0+-+",
    "lead": "In thermodynamics, the Onsager reciprocal relations express the equality of certain ratios between flows and forces in thermodynamic systems out of equilibrium, but where a notion of local equilibrium exists."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Square lattice Ising model",
   "citaten": [
    {
     "hoofdstuk": "Statistical mechanics",
     "nr": 25,
     "bronregel": "Wikipedia, Square lattice Ising model"
    }
   ],
   "wikipedia": "Square lattice Ising model",
   "via": "exact",
   "oud": {
    "id": 5052231,
    "titel": "Square lattice Ising model",
    "adres1": "6200493343870924@40",
    "pad2": "+-++++++-+0+++-++0-+---+",
    "lead": "In statistical mechanics, the two-dimensional square lattice Ising model is a simple lattice model of interacting magnetic spins. The model is notable for having nontrivial interactions, yet having an analytical solution. The model was solved by Lars Onsager for the special case that the external magnetic field H = 0. An analytical solution for the general case for has yet to be found."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Lee–Yang theorem",
   "citaten": [
    {
     "hoofdstuk": "Statistical mechanics",
     "nr": 26,
     "bronregel": "Wikipedia, Lee–Yang theorem"
    }
   ],
   "wikipedia": "Lee–Yang theorem",
   "via": "exact",
   "oud": {
    "id": 5709751,
    "titel": "Lee–Yang theorem",
    "adres1": "35260049908@29",
    "pad2": "+-++0++-+++++00-0+0+-0-+",
    "lead": "In statistical mechanics, the Lee–Yang theorem states that if partition functions of certain models in statistical field theory with ferromagnetic interactions are considered as functions of an external field, then all zeros are purely imaginary (or on the unit circle after a change of variable). The first version was proved for the Ising model by T. D. Lee and C. N. Yang. Their result was later extended to more general models by several people. Asano in 1970 extended the Lee–Yang theorem to the Heisenberg model and provided a simpler proof using Asano contractions. extended the Lee–Yang theorem to certain continuous probability distributions by approximating them by a superposition of Ising"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Mermin–Wagner theorem",
   "citaten": [
    {
     "hoofdstuk": "Statistical mechanics",
     "nr": 29,
     "bronregel": "Wikipedia, Mermin–Wagner theorem"
    }
   ],
   "wikipedia": "Mermin–Wagner theorem",
   "via": "exact",
   "oud": {
    "id": 4986259,
    "titel": "Mermin–Wagner theorem",
    "adres1": "29555303492796773754898@52",
    "pad2": "+-++0++-++0+++0---++-+-+",
    "lead": "In quantum field theory and statistical mechanics, the Mermin–Wagner theorem (also known as Mermin–Wagner–Hohenberg theorem, Mermin–Wagner–Berezinskii theorem, or Coleman theorem) states that continuous symmetries cannot be spontaneously broken at finite temperature in systems with sufficiently short-range interactions in dimensions d ≤ 2. Intuitively, this means that long-range fluctuations can be created with little energy cost and since they increase the entropy they are favored."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Relativity priority dispute",
   "citaten": [
    {
     "hoofdstuk": "Relativity",
     "nr": 1,
     "bronregel": "Wikipedia, Relativity priority dispute"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 181,
     "bronregel": "Wikipedia, Relativity priority dispute"
    }
   ],
   "wikipedia": "Relativity priority dispute",
   "via": "exact",
   "oud": {
    "id": 4972826,
    "titel": "Relativity priority dispute",
    "adres1": "13514076519727667005@45",
    "pad2": "+-0--+-00+-++-0-+--+++-+",
    "lead": "Albert Einstein presented the theories of special relativity and general relativity in publications that either contained no formal references to previous literature, or referred only to a small number of his predecessors for fundamental results on which he based his theories, most notably to the work of Henri Poincaré and Hendrik Lorentz for special relativity, and to the work of David Hilbert, Carl F. Gauss, Bernhard Riemann, and Ernst Mach for general relativity. Subsequently, claims have been put forward about both theories, asserting that they were formulated, either wholly or in part, by others before Einstein. At issue is the extent to which Einstein and various other individuals shou"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "History of general relativity",
   "citaten": [
    {
     "hoofdstuk": "Relativity",
     "nr": 5,
     "bronregel": "Wikipedia, History of general relativity"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 37,
     "bronregel": "Wikipedia, History of general relativity"
    }
   ],
   "wikipedia": "History of general relativity",
   "via": "exact",
   "oud": {
    "id": 4756634,
    "titel": "History of general relativity",
    "adres1": "229650085807993@35",
    "pad2": "+-0--+0-++-0--+0-00--+-+",
    "lead": "General relativity is a theory of gravitation that was developed by Albert Einstein between 1907 and 1915, with contributions by many others after 1915. According to general relativity, the observed gravitational attraction between masses results from the warping of space and time by those masses."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Minkowski space",
   "citaten": [
    {
     "hoofdstuk": "Relativity",
     "nr": 7,
     "bronregel": "Wikipedia, Minkowski space"
    }
   ],
   "wikipedia": "Minkowski spacetime",
   "via": "doorverwijzing",
   "oud": {
    "id": 4460543,
    "titel": "Minkowski spacetime",
    "adres1": "2084435018565553@39",
    "pad2": "+-+++0+++0++-000-0++-+--",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "General relativity priority dispute",
   "citaten": [
    {
     "hoofdstuk": "Relativity",
     "nr": 11,
     "bronregel": "Wikipedia, General relativity priority dispute"
    }
   ],
   "wikipedia": "General relativity priority dispute",
   "via": "exact",
   "oud": {
    "id": 7311213,
    "titel": "General relativity priority dispute",
    "adres1": "228862110952306@35",
    "pad2": "+-00+-00++-++-0-0----+-+",
    "lead": "Albert Einstein presented the theories of special relativity and general relativity in publications that either contained no formal references to previous literature, or referred only to a small number of his predecessors for fundamental results on which he based his theories, most notably to the work of Henri Poincaré and Hendrik Lorentz for special relativity, and to the work of David Hilbert, Carl F. Gauss, Bernhard Riemann, and Ernst Mach for general relativity. Subsequently, claims have been put forward about both theories, asserting that they were formulated, either wholly or in part, by others before Einstein. At issue is the extent to which Einstein and various other individuals shou"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Birkhoff's theorem (relativity)",
   "citaten": [
    {
     "hoofdstuk": "Relativity",
     "nr": 13,
     "bronregel": "Wikipedia, Birkhoff’s theorem (relativity)"
    }
   ],
   "wikipedia": "Birkhoff's theorem (relativity)",
   "via": "exact",
   "oud": {
    "id": 4717611,
    "titel": "Birkhoff's theorem (relativity)",
    "adres1": "166840447374037225@41",
    "pad2": "+-++0++-++0++-0--00--+-+",
    "lead": "In general relativity, Birkhoff's theorem states that any spherically symmetric solution of the vacuum field equations must be static and asymptotically flat. This means that the exterior solution (i.e. the spacetime outside of a spherical, nonrotating, gravitating body) must be given by the Schwarzschild metric. The converse of the theorem is true and is called Israel's theorem. The converse is not true in Newtonian gravity."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Georges Lemaître",
   "citaten": [
    {
     "hoofdstuk": "Relativity",
     "nr": 18,
     "bronregel": "Wikipedia, Georges Lemaître"
    }
   ],
   "wikipedia": "Georges Lemaître",
   "via": "exact",
   "oud": {
    "id": 4458842,
    "titel": "Georges Lemaître",
    "adres1": "4504692079098845182@44",
    "pad2": "+-0--++-00-+--+0-+0---+0",
    "lead": "Georges Henri Joseph Édouard Lemaître (/ləˈmɛtrə/ lə-MET-rə; French: [ʒɔʁʒ ləmɛːtʁ]; 17 July 1894 – 20 June 1966) was a Belgian Catholic priest, theoretical physicist, mathematician, astronomer, and professor of physics at the Catholic University of Louvain. He was the first to theorize that the recession of nearby galaxies can be explained by an expanding universe, which was observationally confirmed soon afterwards by Edwin Hubble. He first derived \"Hubble's law\", now called the Hubble–Lemaître law by the IAU, and published the first estimation of the Hubble constant in 1927, two years before Hubble's article. Lemaître also proposed the \"Big Bang theory\" of the origin of the universe, call"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Yvonne Choquet-Bruhat",
   "citaten": [
    {
     "hoofdstuk": "Relativity",
     "nr": 20,
     "bronregel": "Wikipedia, Yvonne Choquet-Bruhat"
    }
   ],
   "wikipedia": "Yvonne Choquet-Bruhat",
   "via": "exact",
   "oud": {
    "id": 5797407,
    "titel": "Yvonne Choquet-Bruhat",
    "adres1": "1507191748696038232@43",
    "pad2": "+0++--++0--++-0-+++-+-++",
    "lead": "Yvonne Choquet-Bruhat (French: [ivɔn ʃɔkɛ bʁy.a]; born 29 December 1923) is a French mathematician and physicist. She has made seminal contributions to the study of Einstein's general theory of relativity, by showing that the Einstein equations can be put into the form of an initial value problem which is well-posed. In 2015, her breakthrough paper was listed by the journal Classical and Quantum Gravity as one of thirteen 'milestone' results in the study of general relativity, across the hundred years in which it had been studied."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Penrose–Hawking singularity theorems",
   "citaten": [
    {
     "hoofdstuk": "Relativity",
     "nr": 26,
     "bronregel": "Wikipedia, Penrose–Hawking singularity theorems"
    }
   ],
   "wikipedia": "Penrose–Hawking singularity theorems",
   "via": "exact",
   "oud": {
    "id": 4475984,
    "titel": "Penrose–Hawking singularity theorems",
    "adres1": "34867909648@27",
    "pad2": "+-++++--+-++0-+---+--+0+",
    "lead": "The Penrose–Hawking singularity theorems (after Roger Penrose and Stephen Hawking) are a set of results in general relativity that attempt to answer the question of when gravitation produces singularities. The Penrose singularity theorem is a theorem in semi-Riemannian geometry and its general relativistic interpretation predicts a gravitational singularity in black hole formation. The Hawking singularity theorem is based on the Penrose theorem and it is interpreted as a gravitational singularity in the Big Bang situation. Penrose was awarded the Nobel Prize in Physics in 2020 \"for the discovery that black hole formation is a robust prediction of the general theory of relativity\", which he s"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "No-hair theorem",
   "citaten": [
    {
     "hoofdstuk": "Relativity",
     "nr": 31,
     "bronregel": "Wikipedia, No-hair theorem"
    }
   ],
   "wikipedia": "No-hair theorem",
   "via": "exact",
   "oud": {
    "id": 4445980,
    "titel": "No-hair theorem",
    "adres1": "55614331042806691@40",
    "pad2": "+-++0++--+0++++---+0++-+",
    "lead": "The no-hair theorem states that all stationary black hole solutions of the Einstein–Maxwell equations of gravitation and electromagnetism in general relativity can be completely characterized by only three independent externally observable classical parameters: mass, electric charge, and angular momentum. Other characteristics (such as geometry and magnetic moment) are uniquely determined by these three parameters, and all other information (for which \"hair\" is a metaphor) about the matter that formed a black hole or is falling into it \"disappears\" behind the black-hole event horizon and is therefore permanently inaccessible to external observers after the black hole \"settles down\" (by emitt"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hawking radiation",
   "citaten": [
    {
     "hoofdstuk": "Relativity",
     "nr": 36,
     "bronregel": "Wikipedia, Hawking radiation"
    },
    {
     "hoofdstuk": "Astronomy",
     "nr": 50,
     "bronregel": "Wikipedia, Hawking radiation"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 198,
     "bronregel": "Wikipedia, Hawking radiation"
    }
   ],
   "wikipedia": "Hawking radiation",
   "via": "exact",
   "oud": {
    "id": 4443956,
    "titel": "Hawking radiation",
    "adres1": "4504760709476190625@44",
    "pad2": "+-0++-++++++-+---0+--+-+",
    "lead": "Hawking radiation is theoretical black body radiation that is theorized to be released outside a black hole's event horizon because of relativistic quantum effects. It is named after the physicist Stephen Hawking, who developed a theoretical argument for its existence in 1974. Hawking radiation is a purely kinematic effect that is generic to Lorentzian geometries containing event horizons or local apparent horizons."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Positive energy theorem",
   "citaten": [
    {
     "hoofdstuk": "Relativity",
     "nr": 37,
     "bronregel": "Wikipedia, Positive energy theorem"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 40,
     "bronregel": "Wikipedia, Positive energy theorem"
    }
   ],
   "wikipedia": "Positive energy theorem",
   "via": "exact",
   "oud": {
    "id": 4837729,
    "titel": "Positive energy theorem",
    "adres1": "2084434971975892@39",
    "pad2": "+-+++-++++-+++----+--+++",
    "lead": "The positive energy theorem (also known as the positive mass theorem) refers to a collection of foundational results in general relativity and differential geometry. Its standard form, broadly speaking, asserts that the gravitational energy of an isolated system is nonnegative, and can only be zero when the system has no gravitating objects. Although these statements are often thought of as being primarily physical in nature, they can be formalized as mathematical theorems which can be proven using techniques of differential geometry, partial differential equations, and geometric measure theory."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Demetrios Christodoulou",
   "citaten": [
    {
     "hoofdstuk": "Relativity",
     "nr": 42,
     "bronregel": "Wikipedia, Demetrios Christodoulou"
    }
   ],
   "wikipedia": "Demetrios Christodoulou",
   "via": "exact",
   "oud": {
    "id": 4814788,
    "titel": "Demetrios Christodoulou",
    "adres1": "689160612400579@36",
    "pad2": "--+++0-----++-0-+-0++++-",
    "lead": "Demetrios Christodoulou (Greek: Δημήτριος Χριστοδούλου; born 19 October 1951) is a Greek mathematician and physicist, who first became well known for his proof, together with Sergiu Klainerman, of the nonlinear stability of the Minkowski spacetime of special relativity in the framework of general relativity. Christodoulou is a 1993 MacArthur Fellow."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kepler's laws of planetary motion",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 2,
     "bronregel": "Wikipedia, Kepler’s laws of planetary motion"
    }
   ],
   "wikipedia": "Kepler's laws of planetary motion",
   "via": "exact",
   "oud": {
    "id": 4366759,
    "titel": "Kepler's laws of planetary motion",
    "adres1": "76256120132533@34",
    "pad2": "+-0+0+--+0-+--+---++0++0",
    "lead": "In astronomy, Kepler's laws of planetary motion, published by Johannes Kepler between 1609 and 1619, describe the orbits of planets around the Sun. The laws modified the heliocentric theory of Nicolaus Copernicus, replacing its circular orbits and epicycles with elliptical trajectories, and explaining how planetary velocities vary. The three laws state that: Isaac Newton showed in 1687 that relationships like Kepler's would apply in the Solar System as a consequence of his own laws of motion and law of universal gravitation."
   },
   "reden_oud": null,
   "nieuw": [
    "lus_helling"
   ]
  },
  {
   "sleutel": "Rudolphine Tables",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 3,
     "bronregel": "Wikipedia, Rudolphine Tables"
    }
   ],
   "wikipedia": "Rudolphine Tables",
   "via": "exact",
   "oud": {
    "id": 4908880,
    "titel": "Rudolphine Tables",
    "adres1": "1306282222@24",
    "pad2": "+--++-0-+0-+0-++-+-+++++",
    "lead": "The Rudolphine Tables (Latin: Tabulae Rudolphinae) consist of a star catalogue and planetary tables published by Johannes Kepler in 1627, using observational data collected by Tycho Brahe (1546–1601). The tables are named in memory of Rudolf II, Holy Roman Emperor, in whose employ Brahe and Kepler had begun work on the tables. The main purpose of the Rudolphine tables was to allow the computation of the positions of the then known planets of the Solar System, and they were considerably more precise than earlier such tables."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "De motu corporum in gyrum",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 6,
     "bronregel": "Wikipedia, De motu corporum in gyrum"
    }
   ],
   "wikipedia": "De motu corporum in gyrum",
   "via": "exact",
   "oud": {
    "id": 4790622,
    "titel": "De motu corporum in gyrum",
    "adres1": "97644902635@47",
    "pad2": "+0+0----0-----+----0-+++",
    "lead": "De motu corporum in gyrum (from Latin: \"On the motion of bodies in an orbit\"; abbreviated De Motu) is the presumed title of a manuscript by Isaac Newton sent to Edmond Halley in November 1684. The manuscript was prompted by a visit from Halley earlier that year when he had questioned Newton about problems then occupying the minds of Halley and his scientific circle in London, including Sir Christopher Wren and Robert Hooke."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Pierre-Simon Laplace",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 13,
     "bronregel": "Wikipedia, Pierre-Simon Laplace"
    },
    {
     "hoofdstuk": "Geophysics",
     "nr": 10,
     "bronregel": "Wikipedia, Pierre-Simon Laplace"
    }
   ],
   "wikipedia": "Pierre-Simon Laplace",
   "via": "exact",
   "oud": {
    "id": 4489444,
    "titel": "Pierre-Simon Laplace",
    "adres1": "76573320598324@34",
    "pad2": "+-0--+0-+0-+--++-++-+-+-",
    "lead": "Pierre-Simon, marquis de Laplace (/ləˈplɑːs/; French: [pjɛʁ simɔ̃ laplas]; 23 March 1749 – 5 March 1827) was a French scholar and polymath whose work was important to the development of engineering, mathematics, statistics, physics, astronomy, and philosophy. He summarized and extended the work of his predecessors in his five-volume Mécanique céleste (Celestial Mechanics) (1799–1825). This work translated the geometric study of classical mechanics to one based on calculus, opening up a broader range of problems. In statistics, the Bayesian interpretation of probability was developed mainly by Laplace."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Nebular hypothesis",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 16,
     "bronregel": "Wikipedia, Nebular hypothesis"
    }
   ],
   "wikipedia": "Nebular hypothesis",
   "via": "exact",
   "oud": {
    "id": 4455557,
    "titel": "Nebular hypothesis",
    "adres1": "6199715762197561@38",
    "pad2": "+0+0--0-0+-+--+---0+-++0",
    "lead": "The nebular hypothesis is the most widely accepted model in the field of cosmogony to explain the formation and evolution of the Solar System (as well as other planetary systems). It suggests the Solar System is formed from gas and dust orbiting the Sun. The theory was developed by Immanuel Kant and published in his Universal Natural History and Theory of the Heavens (1755) and then modified in 1796 by Pierre Laplace. Originally applied to the Solar System, the process of planetary system formation is now thought to be at work throughout the universe. The widely accepted modern variant of the nebular theory is the solar nebular disk model (SNDM) or solar nebular model. It offered explanation"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Gauss's method",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 17,
     "bronregel": "Wikipedia, Gauss’s method"
    }
   ],
   "wikipedia": "Gauss's method",
   "via": "exact",
   "oud": {
    "id": 6587556,
    "titel": "Gauss's method",
    "adres1": "229721122980379@37",
    "pad2": "+-++++++-+0+-00+-000----",
    "lead": "In orbital mechanics (subfield of celestial mechanics), Gauss's method is used for preliminary orbit determination from at least three observations (more observations increases the accuracy of the determined orbit) of the orbiting body of interest at three different times. The required information are the times of observations, the position vectors of the observation points (in Equatorial Coordinate System), the direction cosine vector of the orbiting body from the observation points (from Topocentric Equatorial Coordinate System) and general physical data."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Ceres (dwarf planet)",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 19,
     "bronregel": "Wikipedia, Ceres (dwarf planet)"
    }
   ],
   "wikipedia": "Ceres (dwarf planet)",
   "via": "exact",
   "oud": {
    "id": 5087677,
    "titel": "Ceres (dwarf planet)",
    "adres1": "13514076520128314542@45",
    "pad2": "++00+----0-+--+---0---++",
    "lead": "Ceres (/ˈsɪəriːz/; minor-planet designation: 1 Ceres) is a dwarf planet in the asteroid belt between the orbits of Mars and Jupiter. It was the first asteroid discovered, on 1 January 1801, by Giuseppe Piazzi at Palermo Astronomical Observatory in Sicily and announced as a new planet. Ceres was later classified as an asteroid and then a dwarf planet – the only one always inside Neptune's orbit."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Discovery of Neptune",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 21,
     "bronregel": "Wikipedia, Discovery of Neptune"
    }
   ],
   "wikipedia": "Discovery of Neptune",
   "via": "exact",
   "oud": {
    "id": 5461531,
    "titel": "Discovery of Neptune",
    "adres1": "55821947226027283@40",
    "pad2": "++---+00++-+--+0--++-0++",
    "lead": "The planet Neptune was mathematically predicted before it was directly observed. With a prediction by Urbain Le Verrier, telescopic observations confirming the existence of a major planet were made on the night of September 23–24, 1846, at the Berlin Observatory, by astronomer Johann Gottfried Galle (assisted by Heinrich Louis d'Arrest), working from Le Verrier's calculations. It was a sensational moment of 19th-century science, and dramatic confirmation of Newtonian gravitational theory. In François Arago's apt phrase, Le Verrier had discovered a planet \"with the point of his pen\"."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Lane–Emden equation",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 24,
     "bronregel": "Wikipedia, Lane–Emden equation"
    }
   ],
   "wikipedia": "Lane–Emden equation",
   "via": "exact",
   "oud": {
    "id": 4488644,
    "titel": "Lane–Emden equation",
    "adres1": "167466699567470368@43",
    "pad2": "+-0++0-0++0+-0---+++----",
    "lead": "In astrophysics, the Lane–Emden equation is a dimensionless form of Poisson's equation for the gravitational potential of a Newtonian self-gravitating, spherically symmetric, polytropic fluid. It is named after astrophysicists Jonathan Homer Lane and Robert Emden. The equation reads where is a dimensionless radius and is related to the density, and thus the pressure, by for central density . The index is the polytropic index that appears in the polytropic equation of state,"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Jeans instability",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 28,
     "bronregel": "Wikipedia, Jeans instability"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 176,
     "bronregel": "Wikipedia, Jeans instability"
    }
   ],
   "wikipedia": "Jeans instability",
   "via": "exact",
   "oud": {
    "id": 5029817,
    "titel": "Jeans instability",
    "adres1": "166772134726305283@41",
    "pad2": "+----000++++-++---0++--+",
    "lead": "In stellar physics, the Jeans instability causes the collapse of interstellar gas clouds and subsequent star formation, named after James Jeans. It occurs when the internal gas pressure is not strong enough to prevent gravitational collapse of a region filled with matter. For stability, the cloud must be in hydrostatic equilibrium, which in case of a spherical cloud translates to: , The Jeans instability likely determines when star formation occurs in molecular clouds."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Schwarzschild metric",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 30,
     "bronregel": "Wikipedia, Schwarzschild metric"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 189,
     "bronregel": "Wikipedia, Schwarzschild metric"
    }
   ],
   "wikipedia": "Schwarzschild metric",
   "via": "exact",
   "oud": {
    "id": 4470352,
    "titel": "Schwarzschild metric",
    "adres1": "25422193494676@33",
    "pad2": "+-0++0--++0++-0------+-+",
    "lead": "In Einstein's theory of general relativity, the Schwarzschild metric (also known as the Schwarzschild solution) is an exact solution to the Einstein field equations that describes the gravitational field outside a spherical mass, on the assumption that the electric charge of the mass, angular momentum of the mass, and universal cosmological constant are all zero. The solution is a useful approximation for describing slowly rotating astronomical objects such as many stars and planets, including Earth and the Sun. It was found by Karl Schwarzschild in 1916, and around the same time independently by , who published his more complete and modern-looking discussion four months after Schwarzschild."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Buchdahl's theorem",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 33,
     "bronregel": "Wikipedia, Buchdahl’s theorem"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 192,
     "bronregel": "Wikipedia, Buchdahl’s theorem"
    }
   ],
   "wikipedia": "Buchdahl's theorem",
   "via": "exact",
   "oud": {
    "id": 7269655,
    "titel": "Buchdahl's theorem",
    "adres1": "1501564979550415564@43",
    "pad2": "+-++0++-++-++-+---0--+-+",
    "lead": "In general relativity, Buchdahl's theorem, named after Hans Adolf Buchdahl, makes more precise the notion that there is a maximal sustainable density for ordinary gravitating matter. It gives an inequality between the mass and radius that must be satisfied for static, spherically symmetric matter configurations under certain conditions. In particular, for areal radius , the mass must satisfy"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Interior Schwarzschild metric",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 34,
     "bronregel": "Wikipedia, Interior Schwarzschild metric"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 193,
     "bronregel": "Wikipedia, Interior Schwarzschild metric"
    }
   ],
   "wikipedia": "Interior Schwarzschild metric",
   "via": "exact",
   "oud": {
    "id": 6795442,
    "titel": "Interior Schwarzschild metric",
    "adres1": "231603890536747@37",
    "pad2": "+-0+++--++0+0---0----+-+",
    "lead": "In Einstein's theory of general relativity, the interior Schwarzschild metric (also interior Schwarzschild solution or Schwarzschild fluid solution) is an exact solution for the gravitational field in the interior of a non-rotating spherical body which consists of an incompressible fluid (implying that density is constant throughout the body) and has zero pressure at the surface. This is a static solution, meaning that it does not change over time. It was discovered by Karl Schwarzschild in 1916, who earlier had found the exterior Schwarzschild metric."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Mass–luminosity relation",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 35,
     "bronregel": "Wikipedia, Mass–luminosity relation"
    }
   ],
   "wikipedia": "Mass–luminosity relation",
   "via": "exact",
   "oud": {
    "id": 5876754,
    "titel": "Mass–luminosity relation",
    "adres1": "686399213610118@36",
    "pad2": "+-0++0-0+-0+--+--+-+--+0",
    "lead": "In astrophysics, the mass–luminosity relation is an equation giving the relationship between a star's mass and its luminosity, first noted by Jakob Karl Ernst Halm. The relationship is represented by the equation: where L⊙ and M⊙ are the luminosity and mass of the Sun and 1 < a < 6. The value a = 3.5 is commonly used for main-sequence stars. This equation and the usual value of a = 3.5 only applies to main-sequence stars with masses 2M⊙ < M < 55M⊙ and does not apply to red giants or white dwarfs. As a star approaches the Eddington luminosity then a = 1."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Chandrasekhar limit",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 38,
     "bronregel": "Wikipedia, Chandrasekhar limit"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 185,
     "bronregel": "Wikipedia, Chandrasekhar limit"
    }
   ],
   "wikipedia": "Chandrasekhar limit",
   "via": "exact",
   "oud": {
    "id": 4361953,
    "titel": "Chandrasekhar limit",
    "adres1": "8476373055979@32",
    "pad2": "+-0++0-++++++000-+-0-+-+",
    "lead": "The Chandrasekhar limit (/tʃʌndrəˈseɪkər/) is the maximum mass of a stable white dwarf star. The currently accepted value of the Chandrasekhar limit is about 1.4 M☉ (2.765×1030 kg). White dwarfs resist gravitational collapse primarily through electron degeneracy pressure, compared to main sequence stars, which resist collapse through thermal pressure. The Chandrasekhar limit is the mass above which electron degeneracy pressure in the star's core is insufficient to balance the star's own gravitational self-attraction. Consequently, a white dwarf with a mass greater than the limit is subject to further gravitational collapse, evolving into a different type of stellar remnant, such as a neutron"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Tolman–Oppenheimer–Volkoff equation",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 43,
     "bronregel": "Wikipedia, Tolman–Oppenheimer–Volkoff equation"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 194,
     "bronregel": "Wikipedia, Tolman–Oppenheimer–Volkoff equation"
    }
   ],
   "wikipedia": "Tolman–Oppenheimer–Volkoff equation",
   "via": "exact",
   "oud": {
    "id": 5290281,
    "titel": "Tolman–Oppenheimer–Volkoff equation",
    "adres1": "8508189786409@34",
    "pad2": "+-00--+0+--+-+-000+0-+-0",
    "lead": "In astrophysics, the Tolman–Oppenheimer–Volkoff (TOV) equation constrains the structure of a spherically symmetric body of isotropic material which is in static gravitational equilibrium, as modelled by general relativity. The equation is Here, is a radial coordinate, and and are the density and pressure, respectively, of the material at radius . The quantity , the total mass within , is discussed below. where is determined by the constraint"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Stability of the Solar System",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 45,
     "bronregel": "Wikipedia, Stability of the Solar System"
    }
   ],
   "wikipedia": "Stability of the Solar System",
   "via": "exact",
   "oud": {
    "id": 5662310,
    "titel": "Stability of the Solar System",
    "adres1": "76288518237310@34",
    "pad2": "+-00--0++0-+--+-0-0+-0++",
    "lead": "The stability of the Solar System is a subject of much inquiry in astronomy. Though the planets have been stable when historically observed, and will be in the short term, their weak gravitational effects on one another can add up in unpredictable ways. For this reason (among others), the Solar System is chaotic in the technical sense of mathematical chaos theory, and even the most precise long-term models for the orbital motion of the Solar System are not valid over more than a few tens of millions of years."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kolmogorov–Arnold–Moser theorem",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 46,
     "bronregel": "Wikipedia, Kolmogorov–Arnold–Moser theorem"
    }
   ],
   "wikipedia": "Kolmogorov–Arnold–Moser theorem",
   "via": "exact",
   "oud": {
    "id": 4366529,
    "titel": "Kolmogorov–Arnold–Moser theorem",
    "adres1": "8472902104027@32",
    "pad2": "+-++0++-++-++++--000-+-+",
    "lead": "The Kolmogorov–Arnold–Moser (KAM) theorem is a result in dynamical systems about the persistence of quasiperiodic motions under small perturbations. The theorem partly resolves the that arises in the perturbation theory of classical mechanics."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kerr metric",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 49,
     "bronregel": "Wikipedia, Kerr metric"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 197,
     "bronregel": "Wikipedia, Kerr metric"
    }
   ],
   "wikipedia": "Kerr metric",
   "via": "exact",
   "oud": {
    "id": 4517179,
    "titel": "Kerr metric",
    "adres1": "8476378254505@32",
    "pad2": "+-0+++-0++0+++--++--++-+",
    "lead": "The Kerr metric or Kerr geometry describes the geometry of empty spacetime around a rotating uncharged axially symmetric black hole with a quasispherical event horizon. The Kerr metric is an exact solution of the Einstein field equations of general relativity; these equations are highly non-linear, which makes exact solutions very difficult to find."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Effective one-body formalism",
   "citaten": [
    {
     "hoofdstuk": "Astronomy",
     "nr": 55,
     "bronregel": "Wikipedia, Effective one-body formalism"
    }
   ],
   "wikipedia": "Effective one-body formalism",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Eratosthenes",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 2,
     "bronregel": "Wikipedia, Eratosthenes"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 44,
     "bronregel": "Wikipedia, Eratosthenes"
    }
   ],
   "wikipedia": "Eratosthenes",
   "via": "exact",
   "oud": {
    "id": 4379137,
    "titel": "Eratosthenes",
    "adres1": "34998777541@27",
    "pad2": "+-0+-+0--+-+--00--+---+-",
    "lead": "Eratosthenes of Cyrene (/ɛrəˈtɒsθəniːz/; Greek: Ἐρατοσθένης [eratostʰénɛːs]; c. 276 BC – c. 195/194 BC) was a Greek polymath: a mathematician, geographer, poet, astronomer, and music theorist. He was a man of learning, becoming the chief librarian at the Library of Alexandria. His work is comparable to what is now known as the study of geography, and he introduced some of the terminology still used today."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Clairaut's theorem (gravity)",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 3,
     "bronregel": "Wikipedia, Clairaut’s theorem (gravity)"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 201,
     "bronregel": "Wikipedia, Clairaut’s theorem (gravity)"
    }
   ],
   "wikipedia": "Clairaut's theorem (gravity)",
   "via": "exact",
   "oud": {
    "id": 4695955,
    "titel": "Clairaut's theorem (gravity)",
    "adres1": "55821915499164418@40",
    "pad2": "+-+++0--++-+--+---+--+++",
    "lead": "Clairaut's theorem characterizes the surface gravity on a viscous rotating ellipsoid in hydrostatic equilibrium under the action of its gravitational field and centrifugal force. It was published in 1743 by Alexis Claude Clairaut in a treatise which synthesized physical and geodetic evidence that the Earth is an oblate rotational ellipsoid. It was initially used to relate the gravity at any point on the Earth's surface to the position of that point, allowing the ellipticity of the Earth to be calculated from measurements of gravity at different latitudes. Today it has been largely supplanted by the Somigliana equation."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Theory of tides",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 6,
     "bronregel": "Wikipedia, Theory of tides"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 204,
     "bronregel": "Wikipedia, Theory of tides"
    }
   ],
   "wikipedia": "Theory of tides",
   "via": "exact",
   "oud": {
    "id": 5351541,
    "titel": "Theory of tides",
    "adres1": "941561112394@30",
    "pad2": "+-0--+0+0+-0--+-0++0-0++",
    "lead": "The theory of tides is the application of continuum mechanics to interpret and predict the tidal deformations of planetary and satellite bodies and their atmospheres and oceans (especially Earth's oceans) under the gravitational loading of another astronomical body or bodies (especially the Moon and Sun)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Pierre Louis Maupertuis",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 9,
     "bronregel": "Wikipedia, Pierre Louis Maupertuis"
    }
   ],
   "wikipedia": "Pierre Louis Maupertuis",
   "via": "exact",
   "oud": {
    "id": 4450912,
    "titel": "Pierre Louis Maupertuis",
    "adres1": "941819216050@30",
    "pad2": "+-0--++--+-+--++-++-+-+-",
    "lead": "Pierre Louis Moreau de Maupertuis (/ˌmoʊpərˈtwiː/; French: [mopɛʁtɥi]; 1698 – 27 July 1759) was a French mathematician, philosopher and man of letters. He became the Director of the Académie des Sciences, and the first President of the Prussian Academy of Science, at the invitation of Frederick the Great."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Carl Friedrich Gauss",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 12,
     "bronregel": "Wikipedia, Carl Friedrich Gauss"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 143,
     "bronregel": "Wikipedia, Carl Friedrich Gauss"
    }
   ],
   "wikipedia": "Carl Friedrich Gauss",
   "via": "exact",
   "oud": {
    "id": 4361666,
    "titel": "Carl Friedrich Gauss",
    "adres1": "15965101@20",
    "pad2": "+-00-0+-++-+---+-+---+--",
    "lead": "Johann Carl Friedrich Gauss (/ɡaʊs/; German: Gauß [kaʁl ˈfʁiːdʁɪç ˈɡaʊs]; Latin: Carolus Fridericus Gauss; 30 April 1777 – 23 February 1855) was a German mathematician and physicist who made significant contributions to many fields in mathematics and science. Sometimes referred to as the Princeps mathematicorum (Latin for '\"the foremost of mathematicians\"') and \"the greatest mathematician since antiquity\", Gauss had an exceptional influence in many fields of mathematics and science, and he is ranked among history's most influential mathematicians."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Age of Earth",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 17,
     "bronregel": "Wikipedia, Age of Earth"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 97,
     "bronregel": "Wikipedia, Age of Earth"
    }
   ],
   "wikipedia": "Age of Earth",
   "via": "exact",
   "oud": {
    "id": 4380297,
    "titel": "Age of Earth",
    "adres1": "8476373056708@32",
    "pad2": "+--00--0-+-+-0+-+-0---+0",
    "lead": "The age of Earth is estimated to be 4.54 ± 0.05 billion years (4.54 × 109 years ± 1%). This age may represent the age of Earth's accretion, or core formation, or of the material from which Earth formed. This dating is based on evidence from radiometric age-dating of meteorite material and is consistent with the radiometric ages of the oldest-known terrestrial and lunar samples."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Tide-predicting machine",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 19,
     "bronregel": "Wikipedia, Tide-predicting machine"
    }
   ],
   "wikipedia": "Tide-predicting machine",
   "via": "exact",
   "oud": {
    "id": 5892253,
    "titel": "Tide-predicting machine",
    "adres1": "144079813@37",
    "pad2": "+--0+-+0+00+-+++-0+++-++",
    "lead": "A tide-predicting machine was a special-purpose mechanical analog computer of the late 19th and early 20th centuries, constructed and set up to predict the ebb and flow of sea tides and the irregular variations in their heights – which change in mixtures of rhythms, that never (in the aggregate) repeat themselves exactly. Its purpose was to shorten the laborious and error-prone computations of tide-prediction. Such machines usually provided predictions valid from hour to hour and day to day for a year or more ahead."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Ekman spiral",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 20,
     "bronregel": "Wikipedia, Ekman spiral"
    }
   ],
   "wikipedia": "Ekman transport",
   "via": "doorverwijzing",
   "oud": {
    "id": 5090623,
    "titel": "Ekman transport",
    "adres1": "945350636401@32",
    "pad2": "+---------0+-+---+++0+-0",
    "lead": "Ekman transport is part of Ekman motion theory, first investigated in 1902 by Vagn Walfrid Ekman. Winds are the main source of energy for ocean circulation, and Ekman Transport is a component of wind-driven ocean current. Ekman transport occurs when ocean surface waters are influenced by the friction force acting on them via the wind. As the wind blows it casts a friction force on the ocean surface that drags the upper 10-100m of the water column with it. However, due to the influence of the Coriolis effect, the ocean water moves at a 90° angle from the direction of the surface wind. The direction of transport is dependent on the hemisphere: in the northern hemisphere, transport occurs at 90"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Gustav Herglotz",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 23,
     "bronregel": "Wikipedia, Gustav Herglotz"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 157,
     "bronregel": "Wikipedia, Gustav Herglotz"
    }
   ],
   "wikipedia": "Gustav Herglotz",
   "via": "exact",
   "oud": {
    "id": 5285551,
    "titel": "Gustav Herglotz",
    "adres1": "166840448670768754@41",
    "pad2": "++----++-0-+--00+-0+-+--",
    "lead": "Gustav Herglotz (2 February 1881 – 22 March 1953) was a German Bohemian physicist best known for his works on the theory of relativity and seismology."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Love number",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 24,
     "bronregel": "Wikipedia, Love number"
    }
   ],
   "wikipedia": "Love number",
   "via": "exact",
   "oud": {
    "id": 5918638,
    "titel": "Love number",
    "adres1": "29555303492796806035018@52",
    "pad2": "+--+0-++-+++-++--+----++",
    "lead": "The Love numbers (h, k, and l) are dimensionless parameters that measure the rigidity of a planetary body and the susceptibility of its shape to change in response to a tidal potential. In 1909, Augustus Edward Hough Love introduced the values h and k which characterize the overall elastic response of the Earth to the tides ― Earth tides or body tides. Later, in 1912, Toshi Shida added a third Love number, l, which was needed to obtain a complete overall description of the solid Earth's response to the tides."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Antidynamo theorem",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 28,
     "bronregel": "Wikipedia, Antidynamo theorem"
    }
   ],
   "wikipedia": "Antidynamo theorem",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Arthur Thomas Doodson",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 29,
     "bronregel": "Wikipedia, Arthur Thomas Doodson"
    }
   ],
   "wikipedia": "Arthur Thomas Doodson",
   "via": "exact",
   "oud": {
    "id": 5505312,
    "titel": "Arthur Thomas Doodson",
    "adres1": "366230910230488355644@48",
    "pad2": "----000-0+-----+0+0--+++",
    "lead": "Arthur Thomas Doodson (31 March 1890 – 10 January 1968) was a British oceanographer."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Backus–Gilbert method",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 38,
     "bronregel": "Wikipedia, Backus–Gilbert method"
    }
   ],
   "wikipedia": "Backus–Gilbert method",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Dynamo theory",
   "citaten": [
    {
     "hoofdstuk": "Geophysics",
     "nr": 40,
     "bronregel": "Wikipedia, Dynamo theory"
    }
   ],
   "wikipedia": "Dynamo theory",
   "via": "exact",
   "oud": {
    "id": 4467236,
    "titel": "Dynamo theory",
    "adres1": "34868043280@27",
    "pad2": "+----0-++--0-+++-++--00+",
    "lead": "In physics, the dynamo theory proposes a mechanism by which a celestial body such as Earth or a star generates a magnetic field. The dynamo theory describes the process through which a rotating, convecting, and electrically conducting fluid can maintain a magnetic field over astronomical time scales. A dynamo is thought to be the source of the Earth's magnetic field and the magnetic fields of Mercury and the Jovian planets."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Transportation theory (mathematics)",
   "citaten": [
    {
     "hoofdstuk": "Operations research",
     "nr": 1,
     "bronregel": "Wikipedia, Transportation theory (mathematics)"
    }
   ],
   "wikipedia": "Transportation theory (mathematics)",
   "via": "exact",
   "oud": {
    "id": 5158507,
    "titel": "Transportation theory (mathematics)",
    "adres1": "6202470350624104@40",
    "pad2": "+-++++0-+-0++-0--+0+-0--",
    "lead": "In mathematics and economics, transportation theory or transport theory is a name given to the study of optimal transportation and allocation of resources. The problem was formalized by the French mathematician Gaspard Monge in 1781. In the 1920s A.N. Tolstoi was one of the first to study the transportation problem mathematically. In 1930, in the collection Transportation Planning Volume I for the National Commissariat of Transportation of the Soviet Union, he published a paper \"Methods of Finding the Minimal Kilometrage in Cargo-transportation in space\"."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Fourier–Motzkin elimination",
   "citaten": [
    {
     "hoofdstuk": "Operations research",
     "nr": 6,
     "bronregel": "Wikipedia, Fourier–Motzkin elimination"
    }
   ],
   "wikipedia": "Fourier–Motzkin elimination",
   "via": "exact",
   "oud": {
    "id": 5292308,
    "titel": "Fourier–Motzkin elimination",
    "adres1": "6200563083276664@40",
    "pad2": "+-++++++-+0+-++--++-+--+",
    "lead": "Fourier–Motzkin elimination, also known as the FME method, is a mathematical algorithm for eliminating variables from a system of linear inequalities. It can output real solutions. The algorithm is named after Joseph Fourier who proposed the method in 1826 and Theodore Motzkin who re-discovered it in 1936."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Farkas' lemma",
   "citaten": [
    {
     "hoofdstuk": "Operations research",
     "nr": 7,
     "bronregel": "Wikipedia, Farkas’ lemma"
    }
   ],
   "wikipedia": "Farkas' lemma",
   "via": "exact",
   "oud": {
    "id": 4823222,
    "titel": "Farkas' lemma",
    "adres1": "694811657279314@38",
    "pad2": "+-++0++-+00++++--++--+--",
    "lead": "Farkas' lemma is a solvability theorem for a finite system of linear inequalities in mathematics. It was originally proven by the Hungarian mathematician Gyula Farkas.Farkas' lemma is the key result underpinning the linear programming duality and has played a central role in the development of mathematical optimization (alternatively, mathematical programming). It is used amongst other things in the proof of the Karush–Kuhn–Tucker theorem in nonlinear programming.Remarkably, in the area of the foundations of quantum theory, the lemma also underlies the complete set of Bell inequalities in the form of necessary and sufficient conditions for the existence of a local hidden-variable theory, giv"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Karush–Kuhn–Tucker conditions",
   "citaten": [
    {
     "hoofdstuk": "Operations research",
     "nr": 14,
     "bronregel": "Wikipedia, Karush–Kuhn–Tucker conditions"
    }
   ],
   "wikipedia": "Karush–Kuhn–Tucker conditions",
   "via": "exact",
   "oud": {
    "id": 4813464,
    "titel": "Karush–Kuhn–Tucker conditions",
    "adres1": "1519553097181919062@45",
    "pad2": "+-+++++--+-+++--+--+++-0",
    "lead": "In mathematical optimization, the Karush–Kuhn–Tucker (KKT) conditions, also known as the Kuhn–Tucker conditions, are first derivative tests (sometimes called first-order necessary conditions) for a solution in nonlinear programming to be optimal, provided that some are satisfied. The KKT conditions were originally named after Harold W. Kuhn and Albert W. Tucker, who first published the conditions in 1951. Later scholars discovered that the necessary conditions for this problem had been stated by William Karush in his master's thesis in 1939."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Linear programming",
   "citaten": [
    {
     "hoofdstuk": "Operations research",
     "nr": 18,
     "bronregel": "Wikipedia, Linear programming"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 210,
     "bronregel": "Wikipedia, Linear programming"
    }
   ],
   "wikipedia": "Linear programming",
   "via": "exact",
   "oud": {
    "id": 4378171,
    "titel": "Linear programming",
    "adres1": "8476377846319@32",
    "pad2": "+-0+++0-+-+++00-+--++-++",
    "lead": "Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization). Linear programs are problems that can be expressed in canonical form as"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Klee–Minty cube",
   "citaten": [
    {
     "hoofdstuk": "Operations research",
     "nr": 23,
     "bronregel": "Wikipedia, Klee–Minty cube"
    }
   ],
   "wikipedia": "Klee–Minty cube",
   "via": "exact",
   "oud": {
    "id": 6127742,
    "titel": "Klee–Minty cube",
    "adres1": "7178979876918526276901263@57",
    "pad2": "+-+++0-+0+++0++-0+-++-++",
    "lead": "The Klee–Minty cube or Klee–Minty polytope (named after Victor Klee and George J. Minty) is a unit hypercube of variable dimension whose corners have been perturbed. Klee and Minty demonstrated that George Dantzig's simplex algorithm has poor worst-case performance when initialized at one corner of their \"squashed cube\". On the three-dimensional version, the simplex algorithm and the criss-cross algorithm visit all 8 corners in the worst case."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Christofides algorithm",
   "citaten": [
    {
     "hoofdstuk": "Operations research",
     "nr": 27,
     "bronregel": "Wikipedia, Christofides algorithm"
    }
   ],
   "wikipedia": "Christofides algorithm",
   "via": "exact",
   "oud": {
    "id": 4935957,
    "titel": "Christofides algorithm",
    "adres1": "686305070017957@36",
    "pad2": "+-+++00-+0-+-0+--0-+++-+",
    "lead": "The Christofides algorithm or Christofides–Serdyukov algorithm is an algorithm for finding approximate solutions to the travelling salesman problem, on instances where the distances form a metric space (they are symmetric and obey the triangle inequality).It is an approximation algorithm that guarantees that its solutions will be within a factor of 3/2 of the optimal solution length, and is named after Nicos Christofides and , who discovered it independently in 1976."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Ellipsoid method",
   "citaten": [
    {
     "hoofdstuk": "Operations research",
     "nr": 28,
     "bronregel": "Wikipedia, Ellipsoid method"
    }
   ],
   "wikipedia": "Ellipsoid method",
   "via": "exact",
   "oud": {
    "id": 4998125,
    "titel": "Ellipsoid method",
    "adres1": "6253304915507041@40",
    "pad2": "+-0+++--0+-+-+--++-+---0",
    "lead": "In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions. When specialized to solving feasible linear optimization problems with rational data, the ellipsoid method is an algorithm which finds an optimal solution in a number of steps that is polynomial in the input size. The ellipsoid method generates a sequence of ellipsoids whose volume uniformly decreases at every step, thus enclosing a minimizer of a convex function."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hirsch conjecture",
   "citaten": [
    {
     "hoofdstuk": "Operations research",
     "nr": 36,
     "bronregel": "Wikipedia, Hirsch conjecture"
    }
   ],
   "wikipedia": "Hirsch conjecture",
   "via": "exact",
   "oud": {
    "id": 5343960,
    "titel": "Hirsch conjecture",
    "adres1": "315017682319@31",
    "pad2": "+-++0++++++++----00+-+-+",
    "lead": "In mathematical programming and polyhedral combinatorics, the Hirsch conjecture is the statement that the edge-vertex graph of an n-facet polytope in d-dimensional Euclidean space has diameter no more than n − d. That is, any two vertices of the polytope must be connected to each other by a path of length at most n − d. The conjecture was first put forth in a letter by to George B. Dantzig in 1957 and was motivated by the analysis of the simplex method in linear programming, as the diameter of a polytope provides a lower bound on the number of steps needed by the simplex method. The conjecture is now known to be false in general."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Nash equilibrium",
   "citaten": [
    {
     "hoofdstuk": "Game theory and economics",
     "nr": 7,
     "bronregel": "Wikipedia, Nash equilibrium"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 77,
     "bronregel": "Wikipedia, Nash equilibrium"
    }
   ],
   "wikipedia": "Nash equilibrium",
   "via": "exact",
   "oud": {
    "id": 4378831,
    "titel": "Nash equilibrium",
    "adres1": "2058915210090868@37",
    "pad2": "+-+++0--0+-+++--0--0+--+",
    "lead": "In game theory, the Nash equilibrium, named after the mathematician John Nash, is the most common way to define the solution of a non-cooperative game involving two or more players. In a Nash equilibrium, each player is assumed to know the equilibrium strategies of the other players, and no one has anything to gain by changing only one's own strategy. The principle of Nash equilibrium dates back to the time of Cournot, who in 1838 applied it to competing firms choosing outputs. Nash showed that there is a Nash equilibrium for every finite game: see further the article on strategy."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Zermelo's theorem (game theory)",
   "citaten": [
    {
     "hoofdstuk": "Game theory and economics",
     "nr": 11,
     "bronregel": "Wikipedia, Zermelo’s theorem (game theory)"
    }
   ],
   "wikipedia": "Zermelo's theorem (game theory)",
   "via": "exact",
   "oud": {
    "id": 5914541,
    "titel": "Zermelo's theorem (game theory)",
    "adres1": "364729963803089461669@48",
    "pad2": "+-++0++-0+-++0+----+-0-0",
    "lead": "In game theory, Zermelo's theorem is a theorem about finite two-person games of perfect information in which the players move alternately and in which chance does not affect the decision making process. It says that if the game cannot end in a draw, then one of the two players must have a winning strategy (i.e. can force a win). An alternate statement is that for a game meeting all of these conditions except the condition that a draw is now possible, then either the first-player can force a win, or the second-player can force a win, or both players can at least force a draw.The theorem is named after Ernst Zermelo, a German mathematician and logician, who proved the theorem for the example g"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Minimax theorem",
   "citaten": [
    {
     "hoofdstuk": "Game theory and economics",
     "nr": 16,
     "bronregel": "Wikipedia, Minimax theorem"
    }
   ],
   "wikipedia": "Minimax theorem",
   "via": "exact",
   "oud": {
    "id": 4557028,
    "titel": "Minimax theorem",
    "adres1": "364730652932465348020@48",
    "pad2": "+-++0++--+0+00----++0--+",
    "lead": "In the mathematical area of game theory, a minimax theorem is a theorem providing conditions that guarantee that the max–min inequality is also an equality. The first theorem in this sense is von Neumann's minimax theorem from 1928, which was considered the starting point of game theory. Since then, several generalizations and alternative versions of von Neumann's original theorem have appeared in the literature."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Lone divider",
   "citaten": [
    {
     "hoofdstuk": "Game theory and economics",
     "nr": 19,
     "bronregel": "Wikipedia, Lone divider"
    }
   ],
   "wikipedia": "Lone divider",
   "via": "exact",
   "oud": {
    "id": 7110613,
    "titel": "Lone divider",
    "adres1": "43226137@26",
    "pad2": "+-----++--+0++-0+--+-0-+",
    "lead": "The lone divider procedure is a procedure for proportional cake-cutting. It involves a heterogenous and divisible resource, such as a birthday cake, and n partners with different preferences over different parts of the cake. It allows the n people to divide the cake among them such that each person receives a piece with a value of at least 1/n of the total value according to his own subjective valuation."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Shapley value",
   "citaten": [
    {
     "hoofdstuk": "Game theory and economics",
     "nr": 26,
     "bronregel": "Wikipedia, Shapley value"
    }
   ],
   "wikipedia": "Shapley value",
   "via": "exact",
   "oud": {
    "id": 4451729,
    "titel": "Shapley value",
    "adres1": "25733765125306@35",
    "pad2": "+-0+++-00+++-+0+0++0--+0",
    "lead": "The Shapley value is a solution concept in cooperative game theory. It was named in honor of Lloyd Shapley, who introduced it in 1951 and won the Nobel Memorial Prize in Economic Sciences for it in 2012. To each cooperative game it assigns a unique distribution (among the players) of a total surplus generated by the coalition of all players. The Shapley value is characterized by a collection of desirable properties. Hart (1989) provides a survey of the subject."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Arrow–Debreu model",
   "citaten": [
    {
     "hoofdstuk": "Game theory and economics",
     "nr": 28,
     "bronregel": "Wikipedia, Arrow–Debreu model"
    }
   ],
   "wikipedia": "Arrow–Debreu model",
   "via": "exact",
   "oud": {
    "id": 4656008,
    "titel": "Arrow–Debreu model",
    "adres1": "506517699060641881@44",
    "pad2": "+-+++0-0++0+++--0+--+-0+",
    "lead": "In mathematical economics, the Arrow–Debreu model suggests that under certain economic assumptions (convex preferences, perfect competition, and demand independence) there must be a set of prices such that aggregate supplies will equal aggregate demands for every commodity in the economy."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Envy-free cake-cutting",
   "citaten": [
    {
     "hoofdstuk": "Game theory and economics",
     "nr": 31,
     "bronregel": "Wikipedia, Envy-free cake-cutting"
    }
   ],
   "wikipedia": "Envy-free cake-cutting",
   "via": "exact",
   "oud": {
    "id": 4778427,
    "titel": "Envy-free cake-cutting",
    "adres1": "11665668772@28",
    "pad2": "+-0+++++-+++++0-00+-+-0+",
    "lead": "An envy-free cake-cutting is a kind of fair cake-cutting. It is a division of a heterogeneous resource (\"cake\") that satisfies the envy-free criterion, namely, that every partner feels that their allocated share is at least as good as any other share, according to their own subjective valuation. Unsolved problem in computer science: What is the runtime complexity of envy-free cake-cutting? (more unsolved problems in computer science) Two major variants of the problem have been studied:"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Gibbard–Satterthwaite theorem",
   "citaten": [
    {
     "hoofdstuk": "Game theory and economics",
     "nr": 35,
     "bronregel": "Wikipedia, Gibbard–Satterthwaite theorem"
    }
   ],
   "wikipedia": "Gibbard–Satterthwaite theorem",
   "via": "exact",
   "oud": {
    "id": 4474603,
    "titel": "Gibbard–Satterthwaite theorem",
    "adres1": "8570951905708@34",
    "pad2": "+-++0++-+++0+-+--+---+-0",
    "lead": "In social choice theory, the Gibbard–Satterthwaite theorem is a result published independently by philosopher Allan Gibbard in 1973 and economist Mark Satterthwaite in 1975. It deals with deterministic ordinal electoral systems that choose a single winner. It states that for every voting rule, one of the following three things must hold:"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Brams–Taylor procedure",
   "citaten": [
    {
     "hoofdstuk": "Game theory and economics",
     "nr": 40,
     "bronregel": "Wikipedia, Brams–Taylor procedure"
    }
   ],
   "wikipedia": "Brams–Taylor procedure",
   "via": "exact",
   "oud": {
    "id": 6009069,
    "titel": "Brams–Taylor procedure",
    "adres1": "25516293227137@35",
    "pad2": "+-0+++0-++0+++---0--++++",
    "lead": "The Brams–Taylor procedure (BTP) is a procedure for envy-free cake-cutting. It explicated the first finite procedure to produce an envy-free division of a cake among any positive integer number of players."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Envy-free item allocation",
   "citaten": [
    {
     "hoofdstuk": "Game theory and economics",
     "nr": 47,
     "bronregel": "Wikipedia, Envy-free item allocation"
    }
   ],
   "wikipedia": "Envy-free item allocation",
   "via": "exact",
   "oud": {
    "id": 6850499,
    "titel": "Envy-free item allocation",
    "adres1": "88667205044619854936881@53",
    "pad2": "+-+++-+--00+++-0+00++-0+",
    "lead": "Envy-free (EF) item allocation is a fair item allocation problem, in which the fairness criterion is envy-freeness - each agent should receive a bundle that they believe to be at least as good as the bundle of any other agent. Since the items are indivisible, an EF assignment may not exist. The simplest case is when there is a single item and at least two agents: if the item is assigned to one agent, the other will envy."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Logistic function",
   "citaten": [
    {
     "hoofdstuk": "Mathematical biology",
     "nr": 7,
     "bronregel": "Wikipedia, Logistic function"
    }
   ],
   "wikipedia": "Logistic function",
   "via": "exact",
   "oud": {
    "id": 4392373,
    "titel": "Logistic function",
    "adres1": "18530237192205286@39",
    "pad2": "+-+++0+0+0-+-+++-+0+0---",
    "lead": "A logistic function or logistic curve is a common S-shaped curve (sigmoid curve) with equation where , the value of the sigmoid's midpoint;, the supremum of the values of the function;, the logistic growth rate or steepness of the curve. For values of in the domain of real numbers from to , the S-curve shown on the right is obtained, with the graph of approaching as approaches and approaching zero as approaches . The standard logistic function, where , is sometimes simply called the sigmoid. It is also sometimes called the expit, being the inverse of the logit."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Lotka–Volterra equations",
   "citaten": [
    {
     "hoofdstuk": "Mathematical biology",
     "nr": 15,
     "bronregel": "Wikipedia, Lotka–Volterra equations"
    }
   ],
   "wikipedia": "Lotka–Volterra equations",
   "via": "exact",
   "oud": {
    "id": 4518535,
    "titel": "Lotka–Volterra equations",
    "adres1": "166842989240043430@41",
    "pad2": "+-00--+++0-+0-+0-+++-+--",
    "lead": "The Lotka–Volterra equations, also known as the predator–prey equations, are a pair of first-order nonlinear differential equations, frequently used to describe the dynamics of biological systems in which two species interact, one as a predator and the other as prey. The populations change through time according to the pair of equations: where The Lotka–Volterra system of equations is an example of a Kolmogorov model, which is a more general framework that can model the dynamics of ecological systems with predator–prey interactions, competition, disease, and mutualism."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kermack–McKendrick theory",
   "citaten": [
    {
     "hoofdstuk": "Mathematical biology",
     "nr": 24,
     "bronregel": "Wikipedia, Kermack–McKendrick theory"
    }
   ],
   "wikipedia": "Kermack–McKendrick theory",
   "via": "exact",
   "oud": {
    "id": 6313897,
    "titel": "Kermack–McKendrick theory",
    "adres1": "2836052454007@33",
    "pad2": "+-+++0--++--++---+0+++-+",
    "lead": "Kermack–McKendrick theory is a hypothesis that predicts the number and distribution of cases of an infectious disease as it is transmitted through a population over time. Building on the research of Ronald Ross and Hilda Hudson, A. G. McKendrick and W. O. Kermack published their theory in a set of three articles from 1927, 1932, and 1933. While Kermack–McKendrick theory was indeed the source of SIR models and their relatives, Kermack and McKendrick were thinking of a more subtle and empirically useful problem than the simple compartmental models discussed here. The text is somewhat difficult to read, compared to modern papers, but the important feature is it was a model where the age-of-infe"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Fisher's equation",
   "citaten": [
    {
     "hoofdstuk": "Mathematical biology",
     "nr": 27,
     "bronregel": "Wikipedia, Fisher’s equation"
    }
   ],
   "wikipedia": "KPP–Fisher equation",
   "via": "doorverwijzing",
   "oud": {
    "id": 4737281,
    "titel": "KPP–Fisher equation",
    "adres1": "25524472437946@35",
    "pad2": "+-0+++-++0-+0+++--++++--",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Leslie matrix",
   "citaten": [
    {
     "hoofdstuk": "Mathematical biology",
     "nr": 29,
     "bronregel": "Wikipedia, Leslie matrix"
    }
   ],
   "wikipedia": "Leslie matrix",
   "via": "exact",
   "oud": {
    "id": 4698058,
    "titel": "Leslie matrix",
    "adres1": "35001774514@29",
    "pad2": "+----0+-0-+0+++--++++-0+",
    "lead": "The Leslie matrix is a discrete, age-structured model of population growth that is very popular in population ecology named after . The Leslie matrix (also called the Leslie model) is one of the most well-known ways to describe the growth of populations (and their projected age distribution), in which a population is closed to migration, growing in an unlimited environment, and where only one sex, usually the female, is considered. To build a matrix, the following information must be known from the population: where is the maximum age attainable in the population. This can be written as: or:"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "FitzHugh–Nagumo model",
   "citaten": [
    {
     "hoofdstuk": "Mathematical biology",
     "nr": 38,
     "bronregel": "Wikipedia, FitzHugh–Nagumo model"
    }
   ],
   "wikipedia": "FitzHugh–Nagumo model",
   "via": "exact",
   "oud": {
    "id": 5288006,
    "titel": "FitzHugh–Nagumo model",
    "adres1": "8505429417694@34",
    "pad2": "+-0+++--+0++-+-0-+++++-+",
    "lead": "The FitzHugh–Nagumo model (FHN), named after (1922–2007) who suggested the system in 1961 and J. Nagumo et al. who created the equivalent circuit the following year, describes a prototype of an excitable system (e.g., a neuron). The FHN Model is an example of a relaxation oscillator because, if the external stimulus exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables and relax back to their rest values. The equations for this dynamical system read"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Neutral theory of molecular evolution",
   "citaten": [
    {
     "hoofdstuk": "Mathematical biology",
     "nr": 39,
     "bronregel": "Wikipedia, Neutral theory of molecular evolution"
    }
   ],
   "wikipedia": "Neutral theory of molecular evolution",
   "via": "exact",
   "oud": {
    "id": 4444784,
    "titel": "Neutral theory of molecular evolution",
    "adres1": "18538110347602150@39",
    "pad2": "+-+++0+-+--+-0+-+-++-+-+",
    "lead": "The neutral theory of molecular evolution holds that most evolutionary changes occur at the molecular level, and most of the variation within and between species are due to random genetic drift of mutant alleles that are selectively neutral. The theory applies only for evolution at the molecular level, and is compatible with phenotypic evolution being shaped by natural selection as postulated by Charles Darwin. The neutral theory allows for the possibility that most mutations are deleterious, but holds that because these are rapidly removed by natural selection, they do not make significant contributions to variation within and between species at the molecular level. A neutral mutation is on"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Logistic map",
   "citaten": [
    {
     "hoofdstuk": "Mathematical biology",
     "nr": 45,
     "bronregel": "Wikipedia, Logistic map"
    }
   ],
   "wikipedia": "Logistic map",
   "via": "exact",
   "oud": {
    "id": 4367045,
    "titel": "Logistic map",
    "adres1": "2859307231609@33",
    "pad2": "+-+++0+-+-++-000-+-++---",
    "lead": "The logistic map is a polynomial mapping (equivalently, recurrence relation) of degree 2, often referred to as an archetypal example of how complex, chaotic behaviour can arise from very simple non-linear dynamical equations. The map was popularized in a 1976 paper by the biologist Robert May, in part as a discrete-time demographic model analogous to the logistic equation written down by Pierre François Verhulst.Mathematically, the logistic map is written"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Computational phylogenetics",
   "citaten": [
    {
     "hoofdstuk": "Mathematical biology",
     "nr": 48,
     "bronregel": "Wikipedia, Computational phylogenetics"
    }
   ],
   "wikipedia": "Computational phylogenetics",
   "via": "exact",
   "oud": {
    "id": 4969985,
    "titel": "Computational phylogenetics",
    "adres1": "4504761568531435222@44",
    "pad2": "+-0+++-++0-++++0--++++++",
    "lead": "Computational phylogenetics is the application of computational algorithms, methods, and programs to phylogenetic analyses. The goal is to assemble a phylogenetic tree representing a hypothesis about the evolutionary ancestry of a set of genes, species, or other taxa. For example, these techniques have been used to explore the family tree of hominid species and the relationships between specific genes shared by many types of organisms."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Coalescent theory",
   "citaten": [
    {
     "hoofdstuk": "Mathematical biology",
     "nr": 49,
     "bronregel": "Wikipedia, Coalescent theory"
    }
   ],
   "wikipedia": "Coalescent theory",
   "via": "exact",
   "oud": {
    "id": 4922201,
    "titel": "Coalescent theory",
    "adres1": "104619476071@28",
    "pad2": "+-00--+-+0-+--+-++0+-+++",
    "lead": "Coalescent theory is a model of how alleles sampled from a population may have originated from a common ancestor. In the simplest case, coalescent theory assumes no recombination, no natural selection, and no gene flow or population structure, meaning that each variant is equally likely to have been passed from one generation to the next. The model looks backward in time, merging alleles into a single ancestral copy according to a random process in coalescence events. Under this model, the expected time between successive coalescence events increases almost exponentially back in time (with wide variance). Variance in the model comes from both the random passing of alleles from one generation"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "A Mathematical Theory of Natural and Artificial Selection",
   "citaten": [
    {
     "hoofdstuk": "Mathematical biology",
     "nr": 52,
     "bronregel": "Wikipedia, A Mathematical Theory of Natural and Artificial Selection"
    }
   ],
   "wikipedia": "A Mathematical Theory of Natural and Artificial Selection",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Ctesibius",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 3,
     "bronregel": "Wikipedia, Ctesibius"
    }
   ],
   "wikipedia": "Ctesibius",
   "via": "exact",
   "oud": {
    "id": 4520985,
    "titel": "Ctesibius",
    "adres1": "11666193643@26",
    "pad2": "+0+++-+0---++-+-0--++000",
    "lead": "Ctesibius or Ktesibios or Tesibius (Greek: Κτησίβιος; fl. 285–222 BC) was a Greek inventor and mathematician in Alexandria, Ptolemaic Egypt. He wrote the first treatises on the science of compressed air and its uses in pumps (and even in a kind of cannon). This, in combination with his work On pneumatics on the elasticity of air, earned him the title of \"father of pneumatics.\" None of his written work has survived, including his Memorabilia, a compilation of his research that was cited by Athenaeus. Ctesibius' most commonly known invention today is a pipe organ (hydraulis), a predecessor of the modern church organ."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Centrifugal governor",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 4,
     "bronregel": "Wikipedia, Centrifugal governor"
    }
   ],
   "wikipedia": "Centrifugal governor",
   "via": "exact",
   "oud": {
    "id": 4392244,
    "titel": "Centrifugal governor",
    "adres1": "4502839058910172729@44",
    "pad2": "-+-0--0-++-0---+--0+++-+",
    "lead": "A centrifugal governor is a specific type of governor with a feedback system that controls the speed of an engine by regulating the flow of fuel or working fluid, so as to maintain a near-constant speed. It uses the principle of proportional control. A simple governor does not maintain an exact speed but a speed range, since under increasing load the governor opens the throttle as the speed (RPM) decreases."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Negative-feedback amplifier",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 13,
     "bronregel": "Wikipedia, Negative-feedback amplifier"
    }
   ],
   "wikipedia": "Negative-feedback amplifier",
   "via": "exact",
   "oud": {
    "id": 4446661,
    "titel": "Negative-feedback amplifier",
    "adres1": "1291586077@24",
    "pad2": "+-0+++00+-++0+----+0+--+",
    "lead": "A negative-feedback amplifier (or feedback amplifier) is an electronic amplifier that subtracts a fraction of its output from its input, so that negative feedback opposes the original signal. The applied negative feedback can improve its performance (gain stability, linearity, frequency response, step response) and reduces sensitivity to parameter variations due to manufacturing or environment. Because of these advantages, many amplifiers and control systems use negative feedback. An idealized negative-feedback amplifier as shown in the diagram is a system of three elements (see Figure 1):"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Nyquist stability criterion",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 17,
     "bronregel": "Wikipedia, Nyquist stability criterion"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 133,
     "bronregel": "Wikipedia, Nyquist stability criterion"
    }
   ],
   "wikipedia": "Nyquist stability criterion",
   "via": "exact",
   "oud": {
    "id": 4719825,
    "titel": "Nyquist stability criterion",
    "adres1": "6253304925449368@40",
    "pad2": "+-0+++--++++-+-+0-++++-0",
    "lead": "In control theory and stability theory, the Nyquist stability criterion or Strecker–Nyquist stability criterion, independently discovered by the German electrical engineer at Siemens in 1930 and the Swedish-American electrical engineer Harry Nyquist at Bell Telephone Laboratories in 1932, is a graphical technique for determining the stability of a dynamical system. Because it only looks at the Nyquist plot of the open loop systems, it can be applied without explicitly computing the poles and zeros of either the closed-loop or open-loop system (although the number of each type of right-half-plane singularities must be known). As a result, it can be applied to systems defined by non-rational f"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hendrik Wade Bode",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 19,
     "bronregel": "Wikipedia, Hendrik Wade Bode"
    }
   ],
   "wikipedia": "Hendrik Wade Bode",
   "via": "exact",
   "oud": {
    "id": 4970700,
    "titel": "Hendrik Wade Bode",
    "adres1": "1098749015861350368664@49",
    "pad2": "+---+--++--+-+-+-+0--00-",
    "lead": "Hendrik Wade Bode (/ˈboʊdi/ boh-dee; Dutch: [ˈbodə]; December 24, 1905 – June 21, 1982) was an American engineer, researcher, inventor, author and scientist, of Dutch ancestry. As a pioneer of modern control theory and electronic telecommunications he revolutionized both the content and methodology of his chosen fields of research. His synergy with Claude Shannon, the father of information theory, laid the foundations for the technological convergence of the information age."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Wiener filter",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 23,
     "bronregel": "Wikipedia, Wiener filter"
    }
   ],
   "wikipedia": "Wiener filter",
   "via": "exact",
   "oud": {
    "id": 4651907,
    "titel": "Wiener filter",
    "adres1": "689163372291538@38",
    "pad2": "+-0+++-0++++-+++00++-+--",
    "lead": "In signal processing, the Wiener filter is a filter used to produce an estimate of a desired or target random process by linear time-invariant (LTI) filtering of an observed noisy process, assuming known stationary signal and noise spectra, and additive noise. The Wiener filter minimizes the mean square error between the estimated random process and the desired process."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Bellman equation",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 26,
     "bronregel": "Wikipedia, Bellman equation"
    }
   ],
   "wikipedia": "Bellman equation",
   "via": "exact",
   "oud": {
    "id": 4655497,
    "titel": "Bellman equation",
    "adres1": "2059759915899238@37",
    "pad2": "+-+++0+++0-+++-0--0--0--",
    "lead": "A Bellman equation, named after Richard E. Bellman, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming. It writes the \"value\" of a decision problem at a certain point in time in terms of the payoff from some initial choices and the \"value\" of the remaining decision problem that results from those initial choices. This breaks a dynamic optimization problem into a sequence of simpler subproblems, as Bellman's “principle of optimality\" prescribes. The equation applies to algebraic structures with a total ordering; for algebraic structures with a partial ordering, the generic Bellman's equation can be used."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Control theory",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 27,
     "bronregel": "Wikipedia, Control theory"
    }
   ],
   "wikipedia": "Control theory",
   "via": "exact",
   "oud": {
    "id": 4362060,
    "titel": "Control theory",
    "adres1": "228767924549638@35",
    "pad2": "+----0-++---++0-+-0+++++",
    "lead": "Control theory is a field of mathematics that deals with the control of dynamical systems in engineered processes and machines. The objective is to develop a model or algorithm governing the application of system inputs to drive the system to a desired state, while minimizing any delay, overshoot, or steady-state error and ensuring a level of control stability; often with the aim to achieve a degree of optimality."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Peter Swerling",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 36,
     "bronregel": "Wikipedia, Peter Swerling"
    }
   ],
   "wikipedia": "Peter Swerling",
   "via": "exact",
   "oud": {
    "id": 4815551,
    "titel": "Peter Swerling",
    "adres1": "2066571920751958@37",
    "pad2": "----+-+-++-+-++++--+-+--",
    "lead": "Peter Swerling (4 March 1929 – 25 August 2000) was one of the most influential radar theoreticians in the second half of the 20th century. He is best known for the class of statistically \"fluctuating target\" scattering models he developed at the RAND Corporation in the early 1950s to characterize the performance of pulsed radar systems, referred to as Swerling Targets I, II, III, and IV in the literature of radar. Swerling also contributed to the optimal estimation of orbits of satellites and trajectories of missiles, anticipating the development of the Kalman filter. He also founded two companies, one of which continues his engineering work today."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kalman filter",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 38,
     "bronregel": "Wikipedia, Kalman filter"
    }
   ],
   "wikipedia": "Kalman filter",
   "via": "exact",
   "oud": {
    "id": 4446482,
    "titel": "Kalman filter",
    "adres1": "2058915243533014@37",
    "pad2": "+-0+++-0+-++0+-+--+++0--",
    "lead": "For statistics and control theory, Kalman filtering, also known as linear quadratic estimation (LQE), is an algorithm that uses a series of measurements observed over time, including statistical noise and other inaccuracies, and produces estimates of unknown variables that tend to be more accurate than those based on a single measurement alone, by estimating a joint probability distribution over the variables for each timeframe. The filter is named after Rudolf E. Kálmán, who was one of the primary developers of its theory."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Walter Murray Wonham",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 44,
     "bronregel": "Wikipedia, Walter Murray Wonham"
    }
   ],
   "wikipedia": "W. M. Wonham",
   "via": "doorverwijzing",
   "oud": {
    "id": 7211914,
    "titel": "W. M. Wonham",
    "adres1": "366230910218825824417@48",
    "pad2": "+---+++-++---0-+-++0--+-",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "H-infinity methods in control theory",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 48,
     "bronregel": "Wikipedia, H-infinity methods in control theory"
    }
   ],
   "wikipedia": "H-infinity methods in control theory",
   "via": "exact",
   "oud": {
    "id": 4481263,
    "titel": "H-infinity methods in control theory",
    "adres1": "2824688121589@31",
    "pad2": "+-++++++-+-+-+0--0++0+--",
    "lead": "H∞ (i.e. \"H-infinity\") methods are used in control theory to synthesize controllers to achieve stabilization with guaranteed performance. To use H∞ methods, a control designer expresses the control problem as a mathematical optimization problem and then finds the controller that solves this optimization. H∞ techniques have the advantage over classical control techniques in that H∞ techniques are readily applicable to problems involving multivariate systems with cross-coupling between channels; disadvantages of H∞ techniques include the level of mathematical understanding needed to apply them successfully and the need for a reasonably good model of the system to be controlled. It is important"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Linear–quadratic–Gaussian control",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 51,
     "bronregel": "Wikipedia, Linear–quadratic–Gaussian control"
    }
   ],
   "wikipedia": "Linear–quadratic–Gaussian control",
   "via": "exact",
   "oud": {
    "id": 5071217,
    "titel": "Linear–quadratic–Gaussian control",
    "adres1": "689160756023056@38",
    "pad2": "+--0+-+++--+-+-++0-+00-+",
    "lead": "In control theory, the linear–quadratic–Gaussian (LQG) control problem is one of the most fundamental optimal control problems, and it can also be operated repeatedly for model predictive control. It concerns linear systems driven by additive white Gaussian noise. The problem is to determine an output feedback law that is optimal in the sense of minimizing the expected value of a quadratic cost criterion. Output measurements are assumed to be corrupted by Gaussian noise and the initial state, likewise, is assumed to be a Gaussian random vector."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kharitonov's theorem",
   "citaten": [
    {
     "hoofdstuk": "Control theory",
     "nr": 52,
     "bronregel": "Wikipedia, Kharitonov’s theorem"
    }
   ],
   "wikipedia": "Kharitonov's theorem",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Frequency analysis",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 1,
     "bronregel": "Wikipedia, Frequency analysis"
    }
   ],
   "wikipedia": "Frequency analysis",
   "via": "exact",
   "oud": {
    "id": 4438515,
    "titel": "Frequency analysis",
    "adres1": "4802905@28",
    "pad2": "+-0+++-+++0+-+++-++-+++-",
    "lead": "In cryptanalysis, frequency analysis (also known as counting letters) is the study of the frequency of letters or groups of letters in a ciphertext. The method is used as an aid to breaking classical ciphers. In some ciphers, such properties of the natural language plaintext are preserved in the ciphertext, and these patterns have the potential to be exploited in a ciphertext-only attack."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Shannon–Hartley theorem",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 6,
     "bronregel": "Wikipedia, Shannon–Hartley theorem"
    }
   ],
   "wikipedia": "Shannon–Hartley theorem",
   "via": "exact",
   "oud": {
    "id": 4388302,
    "titel": "Shannon–Hartley theorem",
    "adres1": "432127882@25",
    "pad2": "+-++0++-+++++++-0++--+-+",
    "lead": "In information theory, the Shannon–Hartley theorem tells the maximum rate at which information can be transmitted over a communications channel of a specified bandwidth in the presence of noise. It is an application of the noisy-channel coding theorem to the archetypal case of a continuous-time analog communications channel subject to Gaussian noise. The theorem establishes Shannon's channel capacity for such a communication link, a bound on the maximum amount of error-free information per time unit that can be transmitted with a specified bandwidth in the presence of the noise interference, assuming that the signal power is bounded, and that the Gaussian noise process is characterized by a "
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "A Symbolic Analysis of Relay and Switching Circuits",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 8,
     "bronregel": "Wikipedia, A Symbolic Analysis of Relay and Switching Circuits"
    },
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 99,
     "bronregel": "Wikipedia, A Symbolic Analysis of Relay and Switching Circuits"
    }
   ],
   "wikipedia": "A Symbolic Analysis of Relay and Switching Circuits",
   "via": "exact",
   "oud": {
    "id": 4804317,
    "titel": "A Symbolic Analysis of Relay and Switching Circuits",
    "adres1": "76573401547672@34",
    "pad2": "+-+++-0-+---+0+-++-+++-+",
    "lead": "\"A Symbolic Analysis of Relay and Switching Circuits\" is the title of a master's thesis written by computer science pioneer Claude E. Shannon while attending the Massachusetts Institute of Technology (MIT) in 1937. In his thesis, Shannon, a dual degree graduate of the University of Michigan, proved that Boolean algebra could be used to simplify the arrangement of the relays that were the building blocks of the electromechanical automatic telephone exchanges of the day. Shannon went on to prove that it should also be possible to use arrangements of relays to solve Boolean algebra problems."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Communication Theory of Secrecy Systems",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 12,
     "bronregel": "Wikipedia, Communication Theory of Secrecy Systems"
    }
   ],
   "wikipedia": "Communication Theory of Secrecy Systems",
   "via": "exact",
   "oud": {
    "id": 4516159,
    "titel": "Communication Theory of Secrecy Systems",
    "adres1": "8476372944712@32",
    "pad2": "+-0--+0-0+--+++-+--0+0-+",
    "lead": "\"Communication Theory of Secrecy Systems\" is a paper published in 1949 by Claude Shannon discussing cryptography from the viewpoint of information theory. It is one of the foundational treatments (arguably the foundational treatment) of modern cryptography. It is also a proof that all theoretically unbreakable ciphers must have the same requirements as the one-time pad."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Unicity distance",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 16,
     "bronregel": "Wikipedia, Unicity distance"
    }
   ],
   "wikipedia": "Unicity distance",
   "via": "exact",
   "oud": {
    "id": 4388400,
    "titel": "Unicity distance",
    "adres1": "14371048@22",
    "pad2": "+-0+++---+++-0--+--0-+--",
    "lead": "In cryptography, unicity distance is the length of an original ciphertext needed to break the cipher by reducing the number of possible spurious keys to zero in a brute force attack. That is, after trying every possible key, there should be just one decipherment that makes sense, i.e. expected amount of ciphertext needed to determine the key completely, assuming the underlying message has redundancy. Claude Shannon defined the unicity distance in his 1949 paper \"Communication Theory of Secrecy Systems\"."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Shannon–Fano coding",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 18,
     "bronregel": "Wikipedia, Shannon–Fano coding"
    }
   ],
   "wikipedia": "Shannon–Fano coding",
   "via": "exact",
   "oud": {
    "id": 7962865,
    "titel": "Shannon–Fano coding",
    "adres1": "9759@9",
    "pad2": "+-+++000+-++-+++-++0+++0",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Kraft–McMillan inequality",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 19,
     "bronregel": "Wikipedia, Kraft–McMillan inequality"
    }
   ],
   "wikipedia": "Kraft–McMillan inequality",
   "via": "exact",
   "oud": {
    "id": 4688804,
    "titel": "Kraft–McMillan inequality",
    "adres1": "4558659283418968684@46",
    "pad2": "+-+++++0-+-+++-00+0+++-+",
    "lead": "In coding theory, the Kraft–McMillan inequality gives a necessary and sufficient condition for the existence of a prefix code (in Leon G. Kraft's version) or a uniquely decodable code (in Brockway McMillan's version) for a given set of codeword lengths. Its applications to prefix codes and trees often find use in computer science and information theory."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Huffman coding",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 24,
     "bronregel": "Wikipedia, Huffman coding"
    }
   ],
   "wikipedia": "Huffman coding",
   "via": "exact",
   "oud": {
    "id": 4365117,
    "titel": "Huffman coding",
    "adres1": "16004467@22",
    "pad2": "+-0+++++++++-+-+-+-++0-+",
    "lead": "In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding or using such a code proceeds by means of Huffman coding, an algorithm developed by David A. Huffman while he was a Sc.D. student at MIT, and published in the 1952 paper \"A Method for the Construction of Minimum-Redundancy Codes\"."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Shannon capacity of a graph",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 29,
     "bronregel": "Wikipedia, Shannon capacity of a graph"
    }
   ],
   "wikipedia": "Shannon capacity of a graph",
   "via": "exact",
   "oud": {
    "id": 6439714,
    "titel": "Shannon capacity of a graph",
    "adres1": "6253304915528884@40",
    "pad2": "+-++++0-+++++00--+-+-0-+",
    "lead": "In graph theory, the Shannon capacity of a graph is a graph invariant defined from the number of independent sets of strong graph products. It is named after American mathematician Claude Shannon. It measures the Shannon capacity of a communications channel defined from the graph, and is upper bounded by the Lovász number, which can be computed in polynomial time. However, the computational complexity of the Shannon capacity itself remains unknown."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "BCH code",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 31,
     "bronregel": "Wikipedia, BCH code"
    }
   ],
   "wikipedia": "BCH code",
   "via": "exact",
   "oud": {
    "id": 4377125,
    "titel": "BCH code",
    "adres1": "231603885760249@37",
    "pad2": "+--+++-+0+++0+0+0---+-0+",
    "lead": "In coding theory, the Bose–Chaudhuri–Hocquenghem codes (BCH codes) form a class of cyclic error-correcting codes that are constructed using polynomials over a finite field (also called Galois field). BCH codes were invented in 1959 by French mathematician Alexis Hocquenghem, and independently in 1960 by Raj Chandra Bose and D.K. Ray-Chaudhuri. The name Bose–Chaudhuri–Hocquenghem (and the acronym BCH) arises from the initials of the inventors' surnames (mistakenly, in the case of Ray-Chaudhuri)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Reed–Solomon error correction",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 32,
     "bronregel": "Wikipedia, Reed–Solomon error correction"
    }
   ],
   "wikipedia": "Reed–Solomon error correction",
   "via": "exact",
   "oud": {
    "id": 4378944,
    "titel": "Reed–Solomon error correction",
    "adres1": "2084434971842242@39",
    "pad2": "+-+++0-+++-++++00+-++--+",
    "lead": "Reed–Solomon codes are a group of error-correcting codes that were introduced by Irving S. Reed and Gustave Solomon in 1960.They have many applications, the most prominent of which include consumer technologies such as MiniDiscs, CDs, DVDs, Blu-ray discs, QR codes, data transmission technologies such as DSL and WiMAX, broadcast systems such as satellite communications, DVB and ATSC, and storage systems such as RAID 6."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Low-density parity-check code",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 33,
     "bronregel": "Wikipedia, Low-density parity-check code"
    }
   ],
   "wikipedia": "Low-density parity-check code",
   "via": "exact",
   "oud": {
    "id": 4530634,
    "titel": "Low-density parity-check code",
    "adres1": "1501564057747518484@43",
    "pad2": "+-++00+-+++++++++-+0+-++",
    "lead": "In information theory, a low-density parity-check (LDPC) code is a linear error correcting code, a method of transmitting a message over a noisy transmission channel. An LDPC code is constructed using a sparse Tanner graph (subclass of the bipartite graph). LDPC codes are capacity-approaching codes, which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical maximum (the Shannon limit) for a symmetric memoryless channel. The noise threshold defines an upper bound for the channel noise, up to which the probability of lost information can be made as small as desired. Using iterative belief propagation techniques, LDPC codes can be decod"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Turbo code",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 36,
     "bronregel": "Wikipedia, Turbo code"
    }
   ],
   "wikipedia": "Turbo code",
   "via": "exact",
   "oud": {
    "id": 4526694,
    "titel": "Turbo code",
    "adres1": "2824688119474@31",
    "pad2": "+--+++--+00+-+-+----+-0+",
    "lead": "In information theory, turbo codes (originally in French Turbocodes) are a class of high-performance forward error correction (FEC) codes developed around 1990–91, but first published in 1993. They were the first practical codes to closely approach the maximum channel capacity or Shannon limit, a theoretical maximum for the code rate at which reliable communication is still possible given a specific noise level. Turbo codes are used in 3G/4G mobile communications (e.g., in UMTS and LTE) and in (deep space) satellite communications as well as other applications where designers seek to achieve reliable information transfer over bandwidth- or latency-constrained communication links in the prese"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Polar code (coding theory)",
   "citaten": [
    {
     "hoofdstuk": "Information theory",
     "nr": 40,
     "bronregel": "Wikipedia, Polar code (coding theory)"
    }
   ],
   "wikipedia": "Polar code (coding theory)",
   "via": "exact",
   "oud": {
    "id": 6374179,
    "titel": "Polar code (coding theory)",
    "adres1": "121626686135668821346@47",
    "pad2": "+-+++0+-++0+-++++-+0++++",
    "lead": "In information theory, a polar code is a linear block error-correcting code. The code construction is based on a multiple recursive concatenation of a short kernel code which transforms the physical channel into virtual outer channels. When the number of recursions becomes large, the virtual channels tend to either have high reliability or low reliability (in other words, they polarize or become sparse), and the data bits are allocated to the most reliable channels. It is the first code with an explicit construction to provably achieve the channel capacity for symmetric binary-input, discrete, memoryless channels (B-DMC) with polynomial dependence on the gap to capacity. Notably, polar codes"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "New Math",
   "citaten": [
    {
     "hoofdstuk": "Mathematics education",
     "nr": 9,
     "bronregel": "Wikipedia, New Math"
    }
   ],
   "wikipedia": "New Math",
   "via": "exact",
   "oud": {
    "id": 4503569,
    "titel": "New Math",
    "adres1": "229719859759765@35",
    "pad2": "+-++++--0+0+-++--+00--+0",
    "lead": "New Mathematics or New Math was a dramatic but temporary change in the way mathematics was taught in American grade schools, and to a lesser extent in European countries and elsewhere, during the 1950s–1970s. Curriculum topics and teaching practices were changed in the U.S. shortly after the Sputnik crisis. The goal was to boost students' science education and mathematical skill to meet the technological threat of Soviet engineers, reputedly highly skilled mathematicians."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "TIMSS",
   "citaten": [
    {
     "hoofdstuk": "Mathematics education",
     "nr": 15,
     "bronregel": "Wikipedia, TIMSS"
    }
   ],
   "wikipedia": "Trends in International Mathematics and Science Study",
   "via": "doorverwijzing",
   "oud": {
    "id": 5061861,
    "titel": "Trends in International Mathematics and Science Study",
    "adres1": "109569772906645073581@48",
    "pad2": "+-00--0+-0-0-+++++++---+",
    "lead": "The IEA's Trends in International Mathematics and Science Study (TIMSS) is a series of international assessments of the mathematics and science knowledge of students around the world. The participating students come from a diverse set of educational systems (countries or regional jurisdictions of countries) in terms of economic development, geographical location, and population size. In each of the participating educational systems, a minimum of 4,000 to 5,000 students is evaluated. Contextual data about the conditions in which participating students learn mathematics and science are collected from the students and their teachers, their principals, and their parents via questionnaires."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Hans Freudenthal",
   "citaten": [
    {
     "hoofdstuk": "Mathematics education",
     "nr": 16,
     "bronregel": "Wikipedia, Hans Freudenthal"
    }
   ],
   "wikipedia": "Hans Freudenthal",
   "via": "exact",
   "oud": {
    "id": 4549783,
    "titel": "Hans Freudenthal",
    "adres1": "76542322171591@34",
    "pad2": "+0++-+-00--+0--+0-++-+-0",
    "lead": "Hans Freudenthal (17 September 1905 – 13 October 1990) was a Jewish-German-born Dutch mathematician. He made substantial contributions to algebraic topology and also took an interest in literature, philosophy, history and mathematics education."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "PISA",
   "citaten": [
    {
     "hoofdstuk": "Mathematics education",
     "nr": 24,
     "bronregel": "Wikipedia, PISA"
    }
   ],
   "wikipedia": null,
   "via": null,
   "oud": null,
   "reden_oud": "doorverwijspagina (Pisa (disambiguation))",
   "nieuw": []
  },
  {
   "sleutel": "Analytic–synthetic distinction",
   "citaten": [
    {
     "hoofdstuk": "General",
     "nr": 7,
     "bronregel": "Wikipedia, analytic–synthetic distinction"
    }
   ],
   "wikipedia": "Analytic–synthetic distinction",
   "via": "exact",
   "oud": {
    "id": 5143689,
    "titel": "Analytic–synthetic distinction",
    "adres1": "944933453830@30",
    "pad2": "+-+++-0-++-0+-+-+-++0+-+",
    "lead": "The analytic–synthetic distinction is a semantic distinction, used primarily in philosophy to distinguish between propositions (in particular, statements that are affirmative subject–predicate judgments) that are of two types: analytic propositions and synthetic propositions. Analytic propositions are true or not true solely by virtue of their meaning, whereas synthetic propositions' truth, if any, derives from how their meaning relates to the world."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Critique of Pure Reason",
   "citaten": [
    {
     "hoofdstuk": "General",
     "nr": 9,
     "bronregel": "Wikipedia, Critique of Pure Reason"
    }
   ],
   "wikipedia": "Critique of Pure Reason",
   "via": "exact",
   "oud": {
    "id": 4490064,
    "titel": "Critique of Pure Reason",
    "adres1": "1162327087@24",
    "pad2": "+-+++-0--00-+-+---+-++0+",
    "lead": "The Critique of Pure Reason (German: Kritik der reinen Vernunft; 1781; second edition 1787) is a book by the German philosopher Immanuel Kant, in which the author seeks to determine the limits and scope of metaphysics. Also referred to as Kant's \"First Critique\", it was followed by his Critique of Practical Reason (1788) and Critique of Judgment (1790). In the preface to the first edition, Kant explains that by a \"critique of pure reason\" he means a critique \"of the faculty of reason in general, in respect of all knowledge after which it may strive independently of all experience\" and that he aims to reach a decision about \"the possibility or impossibility of metaphysics.\" The term \"critique"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Paul Benacerraf",
   "citaten": [
    {
     "hoofdstuk": "General",
     "nr": 21,
     "bronregel": "Wikipedia, Paul Benacerraf"
    }
   ],
   "wikipedia": "Paul Benacerraf",
   "via": "exact",
   "oud": {
    "id": 4682980,
    "titel": "Paul Benacerraf",
    "adres1": "6253840756189765@38",
    "pad2": "+---+--0+--++-+0----0-+-",
    "lead": "Paul Joseph Salomon Benacerraf (/bɪˈnæsərəf/; born 26 March 1931) is a French-born American philosopher working in the field of the philosophy of mathematics who taught at Princeton University his entire career, from 1960 until his retirement in 2007. He was appointed Stuart Professor of Philosophy in 1974, and retired as the James S. McDonnell Distinguished University Professor of Philosophy."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Frege's theorem",
   "citaten": [
    {
     "hoofdstuk": "General",
     "nr": 24,
     "bronregel": "Wikipedia, Frege’s theorem"
    }
   ],
   "wikipedia": "Frege's theorem",
   "via": "exact",
   "oud": {
    "id": 5028818,
    "titel": "Frege's theorem",
    "adres1": "313811186608@29",
    "pad2": "+-++0++-0+-+0-+---+--+--",
    "lead": "In metalogic and metamathematics, Frege's theorem is a metatheorem that states that the Peano axioms of arithmetic can be derived in second-order logic from Hume's principle. It was first proven, informally, by Gottlob Frege in his 1884 Die Grundlagen der Arithmetik (The Foundations of Arithmetic) and proven more formally in his 1893 Grundgesetze der Arithmetik I (Basic Laws of Arithmetic I). The theorem was re-discovered by Crispin Wright in the early 1980s and has since been the focus of significant work. It is at the core of the philosophy of mathematics known as neo-logicism (at least of the Scottish School variety)."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Homotopy type theory",
   "citaten": [
    {
     "hoofdstuk": "General",
     "nr": 28,
     "bronregel": "Wikipedia, homotopy type theory"
    }
   ],
   "wikipedia": "Homotopy type theory",
   "via": "exact",
   "oud": {
    "id": 6225836,
    "titel": "Homotopy type theory",
    "adres1": "55613515146480523@40",
    "pad2": "+-++0++-+-+-0----0++-+0-",
    "lead": "In mathematical logic and computer science, homotopy type theory (HoTT /hɒt/) refers to various lines of development of intuitionistic type theory, based on the interpretation of types as objects to which the intuition of (abstract) homotopy theory applies."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Magic square",
   "citaten": [
    {
     "hoofdstuk": "General",
     "nr": 33,
     "bronregel": "Wikipedia, magic square"
    }
   ],
   "wikipedia": "Magic square",
   "via": "exact",
   "oud": {
    "id": 4381364,
    "titel": "Magic square",
    "adres1": "1164055078@25",
    "pad2": "+-0++++00-+--0+-------+0",
    "lead": "In recreational mathematics, a square array of numbers, usually positive integers, is called a magic square if the sums of the numbers in each row, each column, and both main diagonals are the same. The order of the magic square is the number of integers along one side (n), and the constant sum is called the magic constant. If the array includes just the positive integers , the magic square is said to be normal. Some authors take magic square to mean normal magic square."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Conway's Game of Life",
   "citaten": [
    {
     "hoofdstuk": "General",
     "nr": 38,
     "bronregel": "Wikipedia, Conway’s Game of Life"
    }
   ],
   "wikipedia": "Conway's Game of Life",
   "via": "exact",
   "oud": {
    "id": 4375351,
    "titel": "Conway's Game of Life",
    "adres1": "56284545497044690@40",
    "pad2": "+-0+0000+++-00+--+-++-++",
    "lead": "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves. It is Turing complete and can simulate a universal constructor or any other Turing machine."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Dimensional analysis",
   "citaten": [
    {
     "hoofdstuk": "General",
     "nr": 55,
     "bronregel": "Wikipedia, dimensional analysis"
    }
   ],
   "wikipedia": "Dimensional analysis",
   "via": "exact",
   "oud": {
    "id": 4362592,
    "titel": "Dimensional analysis",
    "adres1": "1291600738@24",
    "pad2": "+-0++-0-+--+-+-+0+---00+",
    "lead": "In engineering and science, dimensional analysis is the analysis of the relationships between different physical quantities by identifying their base quantities (such as length, mass, time, and electric current) and units of measure (such as miles vs. kilometres, or pounds vs. kilograms) and tracking these dimensions as calculations or comparisons are performed. The conversion of units from one dimensional unit to another is often easier within the metric or the SI than in others, due to the regular 10-base in all units."
   },
   "reden_oud": null,
   "nieuw": [
    "ladder_dim",
    "m81_brug"
   ]
  },
  {
   "sleutel": "Buckingham π theorem",
   "citaten": [
    {
     "hoofdstuk": "General",
     "nr": 58,
     "bronregel": "Wikipedia, Buckingham π theorem"
    }
   ],
   "wikipedia": "Buckingham pi theorem",
   "via": "doorverwijzing",
   "oud": {
    "id": 4381052,
    "titel": "Buckingham pi theorem",
    "adres1": "2859307235902@33",
    "pad2": "+-++0++-+++++-00--+-0+++",
    "lead": null
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "The Unreasonable Effectiveness of Mathematics in the Natural Sciences",
   "citaten": [
    {
     "hoofdstuk": "General",
     "nr": 64,
     "bronregel": "Wikipedia, The Unreasonable Effectiveness of Mathematics in the Natural Sciences"
    }
   ],
   "wikipedia": "The Unreasonable Effectiveness of Mathematics in the Natural Sciences",
   "via": "exact",
   "oud": {
    "id": 4443066,
    "titel": "The Unreasonable Effectiveness of Mathematics in the Natural Sciences",
    "adres1": "4504692079099009450@44",
    "pad2": "+-+++00+0+-+--++-+++--0-",
    "lead": "\"The Unreasonable Effectiveness of Mathematics in the Natural Sciences\" is a 1960 article by the physicist Eugene Wigner. In the paper, Wigner observes that a physical theory's mathematical structure often points the way to further advances in that theory and even to empirical predictions."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Akaike information criterion",
   "citaten": [
    {
     "hoofdstuk": "General",
     "nr": 67,
     "bronregel": "Wikipedia, Akaike information criterion"
    }
   ],
   "wikipedia": "Akaike information criterion",
   "via": "exact",
   "oud": {
    "id": 4564754,
    "titel": "Akaike information criterion",
    "adres1": "76287400735042@34",
    "pad2": "+-0+++-+0+-+++-+---+++0-",
    "lead": "The Akaike information criterion (AIC) is an estimator of prediction error and thereby relative quality of statistical models for a given set of data. Given a collection of models for the data, AIC estimates the quality of each model, relative to each of the other models. Thus, AIC provides a means for model selection. In estimating the amount of information lost by a model, AIC deals with the trade-off between the goodness of fit of the model and the simplicity of the model. In other words, AIC deals with both the risk of overfitting and the risk of underfitting."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "All models are wrong",
   "citaten": [
    {
     "hoofdstuk": "General",
     "nr": 71,
     "bronregel": "Wikipedia, all models are wrong"
    }
   ],
   "wikipedia": "All models are wrong",
   "via": "exact",
   "oud": {
    "id": 6621701,
    "titel": "All models are wrong",
    "adres1": "21545802568898989548959863@58",
    "pad2": "+-00+0+++000+++---++0--+",
    "lead": "All models are wrong is a common aphorism in statistics; it is often expanded as \"All models are wrong, but some are useful\". The aphorism acknowledges that statistical models always fall short of the complexities of reality but can still be useful nonetheless. The aphorism originally referred just to statistical models, but it is now sometimes used for scientific models in general. The aphorism is generally attributed to the statistician George Box. The underlying concept, though, predates Box's writings."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Bayesian information criterion",
   "citaten": [
    {
     "hoofdstuk": "General",
     "nr": 74,
     "bronregel": "Wikipedia, Bayesian information criterion"
    }
   ],
   "wikipedia": "Bayesian information criterion",
   "via": "exact",
   "oud": {
    "id": 4822455,
    "titel": "Bayesian information criterion",
    "adres1": "9847727629176564409159@51",
    "pad2": "+-+++++--+0+++-+0--++++0",
    "lead": "In statistics, the Bayesian information criterion (BIC) or Schwarz information criterion (also SIC, SBC, SBIC) is a criterion for model selection among a finite set of models; models with lower BIC are generally preferred. It is based, in part, on the likelihood function and it is closely related to the Akaike information criterion (AIC). The BIC was developed by Gideon E. Schwarz and published in a 1978 paper, where he gave a Bayesian argument for adopting it."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Eudemus of Rhodes",
   "citaten": [
    {
     "hoofdstuk": "History of mathematics",
     "nr": 4,
     "bronregel": "Wikipedia, Eudemus of Rhodes"
    }
   ],
   "wikipedia": "Eudemus of Rhodes",
   "via": "exact",
   "oud": {
    "id": 4923318,
    "titel": "Eudemus of Rhodes",
    "adres1": "97630147693@47",
    "pad2": "+-0---+--0-+--+-0----+0+",
    "lead": "Eudemus of Rhodes (Greek: Εὔδημος) was an ancient Greek philosopher, considered the first historian of science, who lived from c. 370 BCE until c. 300 BCE. He was one of Aristotle's most important pupils, editing his teacher's work and making it more easily accessible. Eudemus' nephew, Pasicles, was also credited with editing Aristotle's works."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Gustaf Eneström",
   "citaten": [
    {
     "hoofdstuk": "History of mathematics",
     "nr": 11,
     "bronregel": "Wikipedia, Gustaf Eneström"
    }
   ],
   "wikipedia": "Gustaf Eneström",
   "via": "exact",
   "oud": null,
   "reden_oud": "geen enwiki-bewoner met deze titel (artikel nieuwer dan de lading of hernoemd)",
   "nieuw": []
  },
  {
   "sleutel": "Archimedes Palimpsest",
   "citaten": [
    {
     "hoofdstuk": "History of mathematics",
     "nr": 13,
     "bronregel": "Wikipedia, Archimedes Palimpsest"
    }
   ],
   "wikipedia": "Archimedes Palimpsest",
   "via": "exact",
   "oud": {
    "id": 4441708,
    "titel": "Archimedes Palimpsest",
    "adres1": "168853636878613669@41",
    "pad2": "+-0---+--0-+--+0----+-+-",
    "lead": "The Archimedes Palimpsest is a parchment codex palimpsest, originally a Byzantine Greek copy of a compilation of Archimedes and other authors. It contains two works of Archimedes that were thought to have been lost (the Ostomachion and the Method of Mechanical Theorems) and the only surviving original Greek edition of his work On Floating Bodies. The first version of the compilation is believed to have been produced by Isidorus of Miletus, the architect of the geometrically complex Hagia Sophia cathedral in Constantinople, sometime around AD 530. The copy found in the palimpsest was created from this original, also in Constantinople, during the Macedonian Renaissance (c. AD 950), a time when"
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "ZbMATH Open",
   "citaten": [
    {
     "hoofdstuk": "History of mathematics",
     "nr": 17,
     "bronregel": "Wikipedia, zbMATH Open"
    }
   ],
   "wikipedia": "ZbMATH Open",
   "via": "exact",
   "oud": {
    "id": 4720538,
    "titel": "ZbMATH Open",
    "adres1": "56276909443993591@40",
    "pad2": "+-++++--+-0+++---0------",
    "lead": "zbMATH Open, formerly Zentralblatt MATH, is a major reviewing service providing reviews and abstracts for articles in pure and applied mathematics, produced by the Berlin office of FIZ Karlsruhe – Leibniz Institute for Information Infrastructure GmbH. Editors are the European Mathematical Society, FIZ Karlsruhe, and the Heidelberg Academy of Sciences. zbMATH is distributed by Springer Science+Business Media. It uses the Mathematics Subject Classification codes for organising reviews by topic."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Sabetai Unguru",
   "citaten": [
    {
     "hoofdstuk": "History of mathematics",
     "nr": 21,
     "bronregel": "Wikipedia, Sabetai Unguru"
    }
   ],
   "wikipedia": "Sabetai Unguru",
   "via": "exact",
   "oud": {
    "id": 7122879,
    "titel": "Sabetai Unguru",
    "adres1": "265888143589586657153284@54",
    "pad2": "0-+-++-+--+-+-0+-------+",
    "lead": "Sabetai Unguru (Hebrew: שבתאי אונגורו, Shabtai Unguru; born 1 January 1931) is an Israeli historian of mathematics and science."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "MacTutor History of Mathematics Archive",
   "citaten": [
    {
     "hoofdstuk": "History of mathematics",
     "nr": 25,
     "bronregel": "Wikipedia, MacTutor History of Mathematics Archive"
    }
   ],
   "wikipedia": "MacTutor History of Mathematics Archive",
   "via": "exact",
   "oud": {
    "id": 4655049,
    "titel": "MacTutor History of Mathematics Archive",
    "adres1": "123094301284462531807@47",
    "pad2": "+-++++--0+-+--++-++---+0",
    "lead": "The MacTutor History of Mathematics archive is a website maintained by John J. O'Connor and Edmund F. Robertson and hosted by the University of St Andrews in Scotland. It contains detailed biographies on many historical and contemporary mathematicians, as well as information on famous curves and various topics in the history of mathematics. In 2015, O'Connor and Robertson won the Hirst Prize of the London Mathematical Society for their work. The citation for the Hirst Prize calls the archive \"the most widely used and influential web-based resource in history of mathematics\"."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Jens Høyrup",
   "citaten": [
    {
     "hoofdstuk": "History of mathematics",
     "nr": 28,
     "bronregel": "Wikipedia, Jens Høyrup"
    }
   ],
   "wikipedia": "Jens Høyrup",
   "via": "exact",
   "oud": {
    "id": 7132720,
    "titel": "Jens Høyrup",
    "adres1": "3283920594391453457176@50",
    "pad2": "+0++-+-+-0-+-+-0++-+++--",
    "lead": "Jens Egede Høyrup, born 1943 in Copenhagen, is a Danish historian of mathematics, specializing in pre-modern and early modern mathematics, ancient Mesopotamian mathematics in particular. He is especially known for his interpretation of what has often been referred to as Old Babylonian \"algebra\" as consisting of concrete, geometric manipulations."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Algebraic K-theory",
   "citaten": [
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 120,
     "bronregel": "Wikipedia, Algebraic K-theory"
    }
   ],
   "wikipedia": "Algebraic K-theory",
   "via": "exact",
   "oud": {
    "id": 4546865,
    "titel": "Algebraic K-theory",
    "adres1": "25422193095031@33",
    "pad2": "+-++0++0+++++-0--++--+--",
    "lead": "Algebraic K-theory is a subject area in mathematics with connections to geometry, topology, ring theory, and number theory. Geometric, algebraic, and arithmetic objects are assigned objects called K-groups. These are groups in the sense of abstract algebra. They contain detailed information about the original object but are notoriously difficult to compute; for example, an important outstanding problem is to compute the K-groups of the integers."
   },
   "reden_oud": null,
   "nieuw": []
  },
  {
   "sleutel": "Wiener's tauberian theorem",
   "citaten": [
    {
     "hoofdstuk": "Where the chains meet",
     "nr": 148,
     "bronregel": "Wikipedia, Wiener’s tauberian theorem"
    }
   ],
   "wikipedia": "Wiener's Tauberian theorem",
   "via": "doorverwijzing",
   "oud": {
    "id": 4979486,
    "titel": "Wiener's Tauberian theorem",
    "adres1": "3323262623544610693111@52",
    "pad2": "+-++0++-+++++++---0--+-0",
    "lead": "In mathematical analysis, Wiener's tauberian theorem is any of several related results proved by Norbert Wiener in 1932. They provide a necessary and sufficient condition under which any function in L1 or L2 can be approximated by linear combinations of translations of a given function. Informally, if the Fourier transform of a function f vanishes on a certain set Z, the Fourier transform of any linear combination of translations of f also vanishes on Z. Therefore, the linear combinations of translations of f can not approximate a function whose Fourier transform does not vanish on Z."
   },
   "reden_oud": null,
   "nieuw": []
  }
 ]
}