SearcharxivSearch

arXiv · 1809.03869

Intransitive Machines

Abstract

The intransitive cycle of superiority is characterized by such binary relations between A, B, and C that A is superior to B, B is superior to C, and C is superior to A (i.e., A>B>C>A - in contrast with transitive relations A>B>C). The first part of the article presents a brief review of studies of intransitive cycles in various disciplines (mathematics, biology, sociology, logical games, decision theory, etc.), and their reflections in educational materials. The second part of the article introduces the issue of intransitivity in elementary physics. We present principles of building mechanical intransitive devices in correspondence with the structure of the Condorcet paradox, and describe five intransitive devices: intransitive gears; levers; pulleys, wheels, and axles; wedges; inclined planes. Each of the mechanisms are constructed as compositions of simple machines and show paradoxical intransitivity of relations such as "to rotate faster than", "to lift", "to be stronger than" in some geometrical constructions. The article is an invitation to develop teaching materials and problems advancing the understanding of transitivity and intransitivity in various areas, including physics education.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander Poddiakov. 2018-09-08. Intransitive Machines. https://arxiv.org/abs/1809.03869

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO