# Social Processes and Proofs of Theorems and Programs

> An annotated edition of this paper on Fermat's Library, where scientists and readers explain its ideas, equations and history in the margins. Annotated edition: https://fermatslibrary.com/p/606fb661

- **Authors:** Richard De Millo et al.
- **Original:** https://s3-us-west-1.amazonaws.com/fermatslibrary/uploads%2F1653325514889-mwlvl9q7xn-d005aea17f3858c52ca5c7c4de4aaf01%2Fsocial_processes.pdf
- **Annotations:** 11 comments in 11 threads
- **Annotated edition:** https://fermatslibrary.com/p/606fb661

## Annotations

### Annotation 1 (the paper)

**Annotation** by João Batalha (2022-05-23):

> This paper was rather controversial at time of publishing - to the point of affecting the funding of research about program verification. It sparked a debate that has lasted decades. To this day, no side has clearly won the debate. Formal verification techniques are widely used in hardware design, yet formal verification of large software systems is still a rarity.

### Annotation 2 (the paper)

**Annotation** by João Batalha (2022-05-23):

> Alan Perlis was an American mathematician and computer scientist. He was one of the co-creators of ALGOL 60 and would go on to become the first winner, in 1966, of the A.M. Turing Award. Richard DeMillo and Richard Lipton are longtime scientific collaborators.

### Annotation 3 (the paper)

**Annotation** by João Batalha (2022-05-23):

> In the context of software engineering, formal verification is the use of tools that automatically analyze the space of possible behaviors of a program rather than computing results for particular values. Typically this doesn't mean running all possible simulations for all possible values, but instead leveraging mathematical techniques to explore the full space of possible simulations.

### Annotation 4 (the paper)

**Annotation** by João Batalha (2022-05-23):

> In fact, in Principia Mathematica, it takes over 360 pages to prove definitively that $1 + 1 = 2$.

### Annotation 5 (the paper)

**Annotation** by João Batalha (2022-05-23):

> Homotopy groups are used in algebraic topology to classify topological spaces. Two things are homotopic to each other if you can drag one of them onto the other without "cutting" anything.
>
> ![](https://i.imgur.com/MKBTbro.png)
> *The two highlighted loops on the surface of a donut, colored in red and blue, are not homotopic.*

### Annotation 6 (the paper)

**Annotation** by João Batalha (2022-05-23):

> The Four-Color 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. Kempe's "proof" was a proof by induction, and it was shown incorrect by British mathematician Percy Heawood in 1890. You can learn more about [Kempe's proof in this video](https://www.youtube.com/watch?v=adZZv4eEPs8).
>
> A valid proof for the Four-Color Theorem would only be found in 1976 by Kenneth Appel and Wolfgang Haken. Their proof was a computer assisted proof which was infeasible for a human to check by hand.
>
> ![](https://i.imgur.com/SRMRoAf.png)
> *A map of the world in which the continents are coloured using four colours.*

### Annotation 7 (the paper)

**Annotation** by João Batalha (2022-05-23):

> Here is the body of the Time magazine article article on the topic:
>
> >  A sure way for any mathematician to achieve immortal fame would be to prove or disprove the Riemann hypothesis. This baffling theory, which deals with prime numbers, is usually stated in Riemann's symbolism as follows: "All the nontrivial zeros of the zeta function of s, a complex variable, lie on the line where sigma is ½-(sigma being the real part of s)." The theory was propounded in 1859 by Georg Friedrich Bernhard Riemann (who revolutionized geometry and laid the foundations for Einstein's theory of relativity). No layman has ever been able to understand it and no mathematician has ever proved it.
>
> >  One day last month electrifying news arrived at the University of Chicago office of Dr. Adrian A. Albert, editor of the Transactions of the American Mathematical Society. A wire from the society's secretary, University of Pennsylvania Professor John R. Kline, asked Editor Albert to stop the presses: a paper disproving the Riemann hypothesis was on the way. Its author: Professor Hans Adolf Rademacher, a refugee German mathematician now at Penn.
>
> > On the heels of the telegram came a letter from Professor Rademacher himself, reporting that his calculations had been checked and confirmed by famed Mathematician Carl Siegel of Princeton's Institute for Advanced Study. Editor Albert got ready to publish the historic paper in the May issue. U.S. mathematicians, hearing the wildfire rumor, held their breath. Alas for drama, last week the issue went to press without the Rademacher article. At the last moment the professor wired meekly that it was all a mistake; on rechecking. Mathematician Siegel had discovered a flaw (undisclosed) in the Rademacher reasoning. U.S. mathematicians felt much like the morning after a phony armistice celebration. Sighed Editor Albert: ''The whole thing certainly raised a lot of false hopes."
>
> [Time Magazine, Monday April 30, 1945](http://content.time.com/time/subscriber/article/0,33009,797441,00.html)

### Annotation 8 (the paper)

**Annotation** by João Batalha (2022-05-23):

> Euclid's fifth postulate (aka parallel postulate) is the fifth postulate in Euclid's Elements. Unlike the first four postulates, which are quite simple to state, the fifth postulate is worded in a somewhat convoluted way:
> > If a line segment intersects two straight lines forming two interior angles on the same side that are less than two right angles, then the two lines, if extended indefinitely, meet on that side on which the angles sum to less than two right angles.
> ![](https://i.imgur.com/zuhUqB7.png)
>
> Many mathematicians over the centuries tried to prove the parallel postulate from the other four but were unable to do so. In the process, mathematicians began considering the consequences of assuming that the parallel postulate was not true. They found that doing so would give rise to alternative geometries. These alternative geometries are now collectively known as non-euclidian geometries.

### Annotation 9 (the paper)

**Annotation** by João Batalha (2022-05-23):

> There are now over 240 published proofs for the law of quadratic reciprocity.

### Annotation 10 (the paper)

**Annotation** by João Batalha (2022-05-23):

> Euler formula, is a topological invariance relating the number of faces, vertices, and edges of any polyhedron. It is written $V - E + F =  2$, where F is the number of faces, V the number of vertices, and E the number of edges. A cube, for example, has 6 faces, 8 vertices, and 12 edges and satisfies this formula.

### Annotation 11 (the paper)

**Annotation** by João Batalha (2022-05-23):

> Euclid is an imperative programming language (descendant from Pascal) for writing verifiable programs. Butler Lampson led the design of Euclid at Xerox PARC in the mid-1970s.
> ![](https://i.imgur.com/cDE6pSF.png)
> *Example of a program written in Euclid"

---

Source: [Fermat's Library](https://fermatslibrary.com/) — https://fermatslibrary.com/p/606fb661. More annotated papers: https://fermatslibrary.com/llms.txt
