Abstract
In his later years, Jack Schwartz devoted much energy to the implementation of a proofchecker based on set theory and to the preparation of a large script file to be fed into it. His goal was to attain a verified proof of the Cauchy integral theorem of complex analysis.
This contribution to the memorial volume for Jack reflects that effort: it briefly reports the chronicle of his proofchecking project and highlights some features of the system as implemented; in an annex, it presents a proof scenario leading from bare set theory to two basic theorems about clawfree graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
 1.
… geological history shows us that life is only a short episode between two eternities of death, and that, even inside that episode, conscious thinking has only lasted and will last only one moment. Thought is but a flash in the middle of a long night.
But this flash is all we have.
An epigraph (in French) drawn from here appears at the beginning of the 2nd part of Dunford–Schwartz’s Linear Operators.
 2.
Within these definitions: Svm means ‘singlevalued map’, i.e. a function represented as a set of pairs; and \(F\mbox {\boldmath $\upharpoonright $}x\) designates the value resulting from application of a singlevalued map F to an element x of the domain of F.
 3.
This is the beginning of A user’s manual for the Ref verifier, see http://setl.dyndns.org/EtnaNova/login/Ref_user_manual.html.
 4.
Such output symbols, whose meanings are specified inside the theory, carry the Θ subscript.
 5.
This is part of the passage
Wir haben oft ein Zeichen nötig, mit dem wir einen sehr zusammengesetzten Sinn verbinden. Dieses Zeichen dient uns sozusagen als Gefäß, in dem wir diesen Sinn mit uns führen können, immer in dem Bewußtsein, daß wir dieses Gefäß öffnen können, wenn wir seines Inhalts bedürfen.
by Gottlob Frege as worded by Jack at the beginning of [1]:
We often need to associate some highly compound meaning with a symbol. Such a symbol serves us as a kind of container carrying this meaning, always with the understanding that it can be opened if we need its content.
 6.
Taken from: Henri Poincaré, “Science and method”, London: Routledge, 1996, p. 118.
 7.
The references that follows aim at covering in full, in chronological order, Jack’s publications that refer to computational logic and to proofverification. I have received substantial help in this reconstruction from Domenico Cantone and from Alfredo Ferro. The few bibliographic items not coauthored by Jack, placed at the end, have to do with the Ref system.
References
The references that follows aim at covering in full, in chronological order, Jack’s publications that refer to computational logic and to proofverification. I have received substantial help in this reconstruction from Domenico Cantone and from Alfredo Ferro. The few bibliographic items not coauthored by Jack, placed at the end, have to do with the Ref system.
Ferro, A., Omodeo, E.G., Schwartz, J.T.: Decision procedures for some fragments of set theory. In: Bibel, W., Kowalski, R. (eds.) Proc. of the 5th Conference on Automated Deduction. LNCS, vol. 87, pp. 88–96, Les Arcs, France. Springer, Berlin (1980).
Ferro, A., Omodeo, E.G., Schwartz, J.T.: Decision procedures for elementary sublanguages of set theory. I: Multilevel syllogistic and some extensions. Commun. Pure Appl. Math. XXXIII, 599–608 (1980)
Omodeo, E.G., Schwartz, J.T.: A ‘Theory’ mechanism for a proofverifier based on firstorder set theory. In: Kakas, A., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond—Essays in Honour of Bob Kowalski, Part II, vol. 2408, pp. 214–230. Springer, Berlin (2002)
Omodeo, E.G., Cantone, D., Policriti, A., Schwartz, J.T.: A computerized Referee. In: Schaerf, M., Stock, O. (eds.) Reasoning, Action and Interaction in AI Theories and Systems—Essays Dedicated to Luigia Carlucci Aiello. Lecture Notes in Artificial Intelligence, vol. 4155, pp. 117–139. Springer, Berlin (2006)
D’Agostino, G., Omodeo, E.G., Schwartz, J.T., Tomescu, A.I.: Selfapplied proof verification. (Extended abstract). In: CordónFranco, A., FernándezMargarit, A., Félix LaraMartin, F. (eds.) JAF, 26èmes Journées sur les Arithmétiques Faibles, Sevilla, 11–13 June 2007, pp. 113–117. Fénix Editora, Sevilla (2007). See http://www.cs.us.es/glm/jaf26
Schwartz, J.T., Cantone, D., Omodeo, E.G.: Computational Logic and Set Theory. Applying Formalized Logic to Analysis. Springer, Berlin (2011). Foreword by Martin Davis
Schwartz, J.T., Dewar, R.K.B., Dubinsky, E., Schonberg, E.: Programming with Sets: An Introduction to SETL. Texts and Monographs in Computer Science. Springer, Berlin (1986)
Landau, E.: Foundations of Analysis. The Arithmetic of Whole, Rational, Irrational and Complex Numbers, 3rd edn. Chelsea Publishing, New York (1966)
Omodeo, E.G., Tomescu, A.I.: Using ÆtnaNova to formally prove that the DavisPutnam satisfiability test is correct. Matematiche 63, 85–105 (2008). A preliminary version was presented at, CILC07 (Messina)
Cantone, D., Chiaruttini, C., Nicolosi Asmundo, M., Omodeo, E.G.: Cumulative hierarchies and computability over universes of sets. Matematiche 63, 31–84 (2008)
Matthews, M.M., Sumner, D.P.: Hamiltonian results in K _{1,3}free graphs. J. Graph Theory 8, 139–146 (1984)
Milanič, M., Tomescu, A.I.: Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. Discrete Appl. Math. (2012). doi:1016/j.dam.2011.11.027
Schwartz, J.T., Cantone, D., Omodeo, E.G.: Computational Logic and Set Theory. Springer, Berlin (2011). Foreword by Martin Davis
Sumner, D.P.: Graphs with 1factors. Proc. Am. Math. Soc. 42, 8–12 (1974)
Las Vergnas, M.: A note on matchings in graphs. Cah. Cent. Étud. Rech. Opér. 17, 257–260 (1975)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Appendix: ClawFree Graphs as Sets
Appendix: ClawFree Graphs as Sets
This scenario contains the formal proofs, checked by J. T. Schwartz’s proofverifier Ref, of two classical results on connected clawfree graphs; namely, that any such graph:

owns a perfect matching if its number of vertices is even,

has a Hamiltonian cycle in its square if it owns three or more vertices.
The original proofs (cf. [14, 15] and [11]) referred to undirected graphs, the ones to be presented refer to a special class of digraphs whose vertices are hereditarily finite sets and whose edges reflect the membership relation. Ours is a legitimate change of perspective in the light of [12], as we will briefly explain at the end.
To make our formal development selfcontained, we proceed from the bare settheoretic foundation built into Ref (cf. [13]). The lemmas exploited without proof in what follows are indeed very few, and their full proofs are available in [13].
1.1 A.1 Basic Laws on the UnionSet Global Operation
\(\hphantom{i}\begin{array}{lllcl}{ \!\!\!\textsc {Def}\ {\mathsf{unionset}}{:}\ {\mbox {[Members of members of a set]}}}&{}&{ \mbox {\boldmath $\bigcup $}\mathsf{X}}&{ \mathop {=}\nolimits _{\mathrm {Def}}}&{\left \{\mathsf{u} :\:\mathsf{v} \in \mathsf{X} ,\mathsf{u} \in \mathsf{v}\right \}}\end{array}\)
The proof of the following claim, that the union set of a set s is the settheoretic ‘least upper bound’ of all its elements, can be found in [13, p. 387].
Ref has the builtin ability to reduce \(\{\mathsf{f}(v):\:v \in \emptyset \}\) to ∅ and \(\{\mathsf{f}(v):\:v \in \{\mathsf{x}_{0}\}\}\) to {f(x _{0})}; hence we are left with only the doubleton to consider. Let c belong to one of \(\{\mathsf{f}(v):\:v \in \{\mathsf{x}_{0},\mathsf{x}_{1}\}\}\) and {f(x _{0}),f(x _{1})} but not to the other. After excluding, through variablesubstitution, the case \(\mathsf{c} \notin \{\mathsf{f}(v):\:v \in \{\mathsf{x}_{0},\mathsf{x}_{1}\}\}\), we easily exclude both possibilities c=f(x _{0}) and c=f(x _{1}), through variablesubstitution and equality propagation.
Under the assumption that \(\mathsf{z}_{0} \mbox {\bf $\:$=$\:$}\left \{\mathsf{x}_{0} ,\mathsf{y}_{0}\right \} \mbox {$\;${\footnotesize $\&$}$\;$}\mbox {\boldmath $\bigcup $}\mathsf{z}_{0} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{x}_{0} \mbox {$\;${\footnotesize $\cup $}$\;$}\mathsf{y}_{0} \) can hold, two citations of Theorem 2 readily yield \(\mathsf{x}_{0} \mbox {\boldmath $\:\subseteq \:$}\mbox {\boldmath $\bigcup $}\mathsf{z}_{0} \) and \(\mathsf{y}_{0} \mbox {\boldmath $\:\subseteq \:$}\mbox {\boldmath $\bigcup $}\mathsf{z}_{0} \).
A third citation of the same Theorem 2 enables us to derive from \(\mbox {\boldmath $\bigcup $}\mathsf{z}_{0} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{x}_{0} \mbox {$\;${\footnotesize $\cup $}$\;$}\mathsf{y}_{0} \) that some element of \(\mathsf{z}_{0} \mbox {\bf $\:$=$\:$}\left \{\mathsf{x}_{0} ,\mathsf{y}_{0}\right \} \) is not included in \(\mathsf{x}_{0} \mbox {$\;${\footnotesize $\cup $}$\;$}\mathsf{y}_{0} \), which is manifestly absurd.
Arguing by contradiction, let x _{0},y _{0} be a counterexample, so that in either one of \(\mbox {\boldmath $\bigcup $}(\mathsf{x}_{0} \mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\mathsf{y}_{0}\right \})\) and \(\mathsf{y}_{0} \mbox {$\;${\footnotesize $\cup $}$\;$}\mbox {\boldmath $\bigcup $}\mathsf{x}_{0} \) there is an a not belonging to the other set. Taking the definition of \(\mbox {\boldmath $\bigcup $}\) into account, by monotonicity we must exclude the possibility that \(\mathsf{a} \in \mbox {\boldmath $\bigcup $}\mathsf{x}_{0} \mbox {\boldmath $\setminus $}\mbox {\boldmath $\bigcup $}(\mathsf{x}_{0} \mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\mathsf{y}_{0}\right \})\); through variablesubstitution, we must also discard the possibility that \(\mathsf{a} \in \mbox {\boldmath $\bigcup $}(\mathsf{x}_{0} \mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\mathsf{y}_{0}\right \})\mbox {\boldmath $\setminus $}\mbox {\boldmath $\bigcup $}\mathsf{x}_{0} \mbox {\boldmath $\setminus $}\mathsf{y}_{0} \).
The only possibility left, namely that \(\mathsf{a} \in \mathsf{y}_{0} \mbox {\boldmath $\setminus $}\mbox {\boldmath $\bigcup $}(\mathsf{x}_{0} \mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\mathsf{y}_{0}\right \})\), is also manifestly absurd. This contradiction leads us to the desired conclusion.
1.2 A.2 Transitive Sets
Any strict subset of a transitive set t, owns a subset in t which does not belong to it.
The ‘(⋆)’ context restriction in the following three steps serves to hide the semantics of arb: which, to the limited extent necessary here, has been captured by the preceding Peddicord’s lemma.
Assuming that s is transitive, that t equals s deprived of some sources and that t is not transitive, there must be an element y of t which is not a subset of t, so that a z∈y exists which does not belong to t. Due to the transitivity of s, y is included in s and hence z belongs to s; hence, under the assumption that \(\mathsf{s} \mbox {\boldmath $\setminus $}\mathsf{t} \) and \(\mbox {\boldmath $\bigcup $}\mathsf{s} \) are disjoint, z does not belong to \(\mbox {\boldmath $\bigcup $}\mathsf{s} \).
However, this is untenable.
1.3 A.3 Basic Laws on the Finitude Property
To begin developing an acceptable treatment of finiteness without much preparatory work, we adopt here the definition (reminiscent of Tarski’s 1924 paper “Sur les ensembles finis”): a set F is finite if every nonnull family of subsets of F owns an inclusionminimal element. This notion is readily specified in terms of the powerset operator, as follows:
The lemma on the monotonicity of finitude and the \({\textsc {Theory}\;}\) of finite induction displayed below are proved in full—together with various other laws on finiteness which we will not need here—in [13, pp. 405–407].
1.4 A.4 Some Combinatorics of the UnionSet Operation
Preparatory to a technique to which we will resort for extending perfect matchings, we introduce the following trivial combinatorial lemma:
For, supposing the contrary, \(\mbox {\boldmath $\bigcup $}(\mathsf{m}\mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\mathsf{x}\mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\mathsf{y}\right \}\right \})\) would differ from each of \(\mathsf{s}\mbox {\boldmath $\setminus $}\left \{\mathsf{s}\right \}\), \(\mathsf{s}\mbox {\boldmath $\setminus $}\left \{\mathsf{c}\right \}\), and \(\mathsf{s}\mbox {\boldmath $\setminus $}\left \{\mathsf{v}\right \}\), the first of which equals s. Thanks to Theorem 2e, we can rewrite \(\mbox {\boldmath $\bigcup $}(\mathsf{m}\mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\mathsf{x}\mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\mathsf{y}\right \}\right \})\) as \(\mathsf{x}\mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\mathsf{y}\right \}\mbox {$\;${\footnotesize $\cup $}$\;$}\mbox {\boldmath $\bigcup $}\mathsf{m}\); but then the decision algorithm for a fragment of set theory known as ‘multilevel syllogistic with singleton’ yields an immediate contradiction.
Arguing by contradiction, suppose that there are counterexamples to the claim. Then, by exploiting finite induction, we can pick a minimal counterexample, f _{0}.
Momentarily supposing that \(\mathsf{f}_{0} \mbox {\bf $\:$=$\:$}\left \{\mathsf{a}\right \} \), one gets \(\mbox {\boldmath $\bigcup $}\mathsf{f}_{0} \mbox {\boldmath $\:\not \subseteq \:$}\mathsf{a} \), because \(\mbox {\boldmath $\bigcup $}\mathsf{f}_{0} \mbox {\boldmath $\:\subseteq \:$}\mathsf{a} \) would imply \(\mathsf{f}_{0} \mbox {\boldmath $\setminus $}\mbox {\boldmath $\bigcup $}\mathsf{f}_{0} \mbox {\boldmath $\:\supseteq \:$}\left \{\mathsf{a}\right \} \mbox {\boldmath $\setminus $}\mathsf{a} \) and hence would imply the emptiness of \(\left \{\mathsf{a}\right \} \mbox {\boldmath $\setminus $}\mathsf{a} \), whence the manifest absurdity a∈a follows. But, on the other hand, \(\mbox {\boldmath $\bigcup $}\left \{\mathsf{a}\right \} \mbox {\boldmath $\:\subseteq \:$}\mathsf{a} \) trivially holds; therefore we must exclude that f _{0} is a singleton \(\left \{\mathsf{a}\right \} \).
Due to our minimality assumption, the strict nonnull subset of f _{0} cannot be a counterexample to the claim; therefore it has sources and hence .
Since does not intersect f _{0}, the inequality just found conflicts with the equality which one gets from Theorem 2e through equality propagation.
1.5 A.5 ClawFree, Transitive Sets and Their Pivots
A claw is defined to be a pair Y,F such that (1) F has at least three elements, (2) no element of F belongs to any other element of F, (3) either Y belongs to all elements of F or there is a W in Y such that Y belongs to all elements of \(\mathsf{F} \mbox {\boldmath $\setminus $}\left \{\mathsf{W}\right \} \).
To really interest us, a clawfree set must be transitive: we omit this requirement in the definition given here below, but we will make it explicit in the major theorems pertaining to clawfreeness (Fig. 6).
By way of first approximation, we want to select from each finite transitive set s not included in \(\left \{\emptyset \right \} \) a ‘pivotal pair’ consisting of an element x of maximum rank in s and an element y of maximum rank in x. To avoid introducing the recursive notion of rank of a set, we slightly generalize the idea: for any set s (not necessarily finite or transitive) we define the frontier of s to consist of those elements x of s which own elements y belonging to s such that the length of no membership chain issuing from y, ending in s, and contained in s ever exceeds 2. Any element y which is thus related to an element x of the frontier of s will be called a pivot of s.
Our next claim is that if we choose a pivot element y of a transitive set s from an element of the frontier of s, then removal of all predecessors of y from s leads to a transitive set t such that y is a source of t.
Arguing by contradiction, let s,x,y,t be a counterexample to the claim. Taking the definition of t into account to exploit monotonicity, we readily get \(\mathsf{t} \mbox {\boldmath $\:\subseteq \:$}\mathsf{s} \) and x∈t.
Now taking the definition of front into account, we can simplify our initial assumption to the following:
Since s is transitive, if t were not transitive then by Theorem 4c \(\mathsf{s} \mbox {\boldmath $\setminus $}\mathsf{t} \) would have an element z not being a source of s. But then y would belong to \(\mathsf{z} \in \mbox {\boldmath $\bigcup $}\mathsf{s} \), which conflicts with y being a pivot.
Now knowing that Trans(t), we must consider the other possibility, namely that \(\mathsf{y} \notin \mathsf{t} \mbox {\boldmath $\setminus $}\mbox {\boldmath $\bigcup $}\mathsf{t} \). However, after expanding t and \(\mbox {\boldmath $\bigcup $}\mathsf{t} \) according to their definitions, …
… we see that neither one of the possibilities \(\mathsf{y} \in \mbox {\boldmath $\bigcup $}\mathsf{t} \), y∉t is tenable.
Pivotal elements, in a transitive clawfree set such as the one treated in this Theory, own at most two predecessors.
Suppose that y,x constitute a counterexample, so that y has, in addition to x, at least two predecessors z and w in s _{0}.
The transitivity of s _{0}, since y∈x and x∈s _{0}, implies that y∈s _{0}; therefore, in view of the clawfreeness of s _{0}, y and \(\mathsf{e} \mbox {\bf $\:$=$\:$}\left \{\mathsf{x} ,\mathsf{z} ,\mathsf{w}\right \} \) do not form a claw.
It readily follows from the definition of claw that \(\left \{\mathsf{x} ,\mathsf{z} ,\mathsf{w}\right \} \) and \(\mbox {\boldmath $\bigcup $}\left \{\mathsf{x} ,\mathsf{z} ,\mathsf{w}\right \} \) intersect; therefore, we can pick an element a common to the two.
But then y∈a, \(\mathsf{a} \mbox {\boldmath $\:\subseteq \:$}\mbox {\boldmath $\bigcup $}\mbox {\boldmath $\bigcup $}\left \{\mathsf{x} ,\mathsf{z} ,\mathsf{w}\right \}\), and \(\mbox {\boldmath $\bigcup $}\mbox {\boldmath $\bigcup $}\left \{\mathsf{x} ,\mathsf{z} ,\mathsf{w}\right \} \mbox {\boldmath $\:\subseteq \:$}\mbox {\boldmath $\bigcup $}\mbox {\boldmath $\bigcup $}\mathsf{s}_{0} \) must hold, implying that \(\mathsf{y} \in \mbox {\boldmath $\bigcup $}\mbox {\boldmath $\bigcup $}\mathsf{s}_{0} \); but we have started with the assumption that \(\mathsf{y} \notin \mbox {\boldmath $\bigcup $}\mbox {\boldmath $\bigcup $}\mathsf{s}_{0} \). This contradiction proves the claim.
Via Skolemization, we give a name to the third item in a pivotal tripleton:
The removal of the predecessors of a pivot from a clawfree, transitive nontrivial set such as the one treated by this theory does not disrupt transitivity.
1.6 A.6 Hanks, Cycles, and Hamiltonian Cycles
The following notion approximately models the concept of a graph where every vertex has at least two incident edges. However, we neither require that (1) edges be doubletons, nor that (2) the set H of edges and the one of vertices—which is understood to be \(\mbox {\boldmath $\bigcup $}\mathsf{H} \)—be disjoint.
For, assuming that h _{0} is a hank, nonnull, and a subset of a doubleton \(\left \{\mathsf{x}_{0} ,\mathsf{u}_{0}\right \} \), we will reach a contradiction arguing as follows. If a is one of the (at most two) elements of h _{0}, since \(\emptyset \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{a}\mbox {$\;${\footnotesize $\&$}$\;$}\mathsf{a} \mbox {\boldmath $\:\subseteq \:$}\mbox {\boldmath $\bigcup $}(\mathsf{h}_{0} \mbox {\boldmath $\setminus $}\left \{\mathsf{a}\right \})\) ensues from the definition of hank, \(\mbox {\boldmath $\bigcup $}(\mathsf{h}_{0} \mbox {\boldmath $\setminus $}\left \{\mathsf{a}\right \})\) must be nonnull; hence \(\mathsf{h}_{0} \mbox {\bf $\:$=$\:$}\left \{\mathsf{a} ,\mathsf{b}\right \} \), where \(\mathsf{b} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{a} \). But then \(\mbox {\boldmath $\bigcup $}(\mathsf{h}_{0} \mbox {\boldmath $\setminus $}\left \{\mathsf{a}\right \})\mbox {\bf $\:$=$\:$}\mbox {\boldmath $\bigcup $}\left \{\mathsf{b}\right \} \) and \(\mbox {\boldmath $\bigcup $}(\mathsf{h}_{0} \mbox {\boldmath $\setminus $}\left \{\mathsf{b}\right \})\mbox {\bf $\:$=$\:$}\mbox {\boldmath $\bigcup $}\left \{\mathsf{a}\right \} \), i.e., \(\mbox {\boldmath $\bigcup $}(\mathsf{h}_{0} \mbox {\boldmath $\setminus $}\left \{\mathsf{a}\right \})\mbox {\bf $\:$=$\:$}\mathsf{b} \) and \(\mbox {\boldmath $\bigcup $}(\mathsf{h}_{0} \mbox {\boldmath $\setminus $}\left \{\mathsf{b}\right \})\mbox {\bf $\:$=$\:$}\mathsf{a} \); therefore \(\mathsf{a} \mbox {\boldmath $\:\subseteq \:$}\mathsf{b} \) and \(\mathsf{b} \mbox {\boldmath $\:\subseteq \:$}\mathsf{a} \) ensue from the definition of hank, leading us to the identity \(\mathsf{a} \mbox {\bf $\:$=$\:$}\mathsf{b} \), which contradicts an earlier inequality.
The following is the basic case of a general theorem scheme where the length of the chain can be any number >2.
The following is the basic case of a general theorem scheme where the length of the path can be any number >1: Replacing an edge by a path with the same endpoints does not disrupt a hank.
Suppose that the premisses are met by h _{0},w _{0},y _{0},x _{1}, and h _{1}. In order to prove Hank(h _{1}), we assume it to be false, so that the definition of hank implies the existence of an e _{1}∈h _{1} and a z _{1}∈e _{1} such that \(\mathsf{z}_{1} \notin \mbox {\boldmath $\bigcup $}(\mathsf{h}_{1} \mbox {\boldmath $\setminus $}\left \{\mathsf{e}_{1}\right \})\).
Since x _{1} belongs to the distinct edges \(\left \{\mathsf{w}_{0} ,\mathsf{x}_{1}\right \} ,\left \{\mathsf{x}_{1} ,\mathsf{y}_{0}\right \} \) of h _{1}, clearly \(\mathsf{z}_{1} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{x}_{1} \).
Moreover, e _{1} cannot be one of the edges of \(\mathsf{h}_{1} \mbox {\boldmath $\setminus $}\mathsf{h}_{0} \).
We know, at this point, that \(\mathsf{e}_{1} \in \mathsf{h}_{0} \mbox {\boldmath $\setminus $}\left \{\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \}\right \} \). Since h _{0} is a hank, z _{1} has in h _{0} at least one incident edge different from e _{1}; since the latter is no longer available in \(\mathsf{h}_{1} \mbox {\boldmath $\setminus $}\left \{\mathsf{e}_{1}\right \} \), it must be \(\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \), and either \(\mathsf{z}_{1} \mbox {\bf $\:$=$\:$}\mathsf{w}_{0} \) or \(\mathsf{z}_{1} \mbox {\bf $\:$=$\:$}\mathsf{y}_{0} \) hence holds. Both cases lead to a contradiction, though; in fact \(\left \{\mathsf{w}_{0} ,\mathsf{x}_{1}\right \} ,\left \{\mathsf{x}_{1} ,\mathsf{y}_{0}\right \} \) differ from e _{1} and these edges of h _{1} are, respectively, incident to w _{0} and to y _{0}.
The replacement of an edge by a 2path with the same endpoints does not disrupt a cycle.
Supposing that h _{0},w _{0},y _{0},x _{1},h _{1} constitute a counterexample to the claim, observe that Hank(h _{1}) must hold; hence we can consider a strictly smaller hank d _{1} than h _{1}. It readily turns out that either \(\left \{\mathsf{w}_{0} ,\mathsf{x}_{1}\right \} \in \mathsf{d}_{1} \) or \(\left \{\mathsf{x}_{1} ,\mathsf{y}_{0}\right \} \in \mathsf{d}_{1} \); for otherwise h _{0} would strictly include d _{1}, since \(\mathsf{d}_{1} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{h}_{0} \) follows from \(\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \in \mathsf{h}_{0} \mbox {\boldmath $\setminus $}\mathsf{h}_{1} \).
Should one of \(\left \{\mathsf{w}_{0} ,\mathsf{x}_{1}\right \} ,\left \{\mathsf{x}_{1} ,\mathsf{y}_{0}\right \} \), but not the other, belong to d _{1}, we would easily get a contradiction: the two cases are treated symmetrically. At this point we have derived that both \(\left \{\mathsf{w}_{0} ,\mathsf{x}_{1}\right \} \) and \(\left \{\mathsf{x}_{1} ,\mathsf{y}_{0}\right \} \) belong to d _{1}.
We will show that the set d _{0} obtained by replacing \(\left \{\mathsf{w}_{0} ,\mathsf{x}_{1}\right \} \) and \(\left \{\mathsf{x}_{1} ,\mathsf{y}_{0}\right \} \) by \(\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \) in d _{1} is nonnull and is a cycle strictly included in h _{0}. Obviously \(\left \{\mathsf{w}_{0} ,\mathsf{x}_{1}\right \} \mathbf {\mbox {\bf $\:\not $=$\:$}}\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \mbox {$\;${\footnotesize $\&$}$\;$}\left \{\mathsf{x}_{1} ,\mathsf{y}_{0}\right \} \mathbf {\mbox {\bf $\:\not $=$\:$}}\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \), because x _{1}, y _{0}, and w _{0} are distinct.
Despite us having assumed at the beginning that h _{0} contains no proper cycle, so that in particular Hank(d _{0}) cannot hold, due to an edge e _{0} of d _{0} and to an endpoint x _{0} of e _{0} which is not properly covered in d _{0}, …
… we now aim at showing that this offending edge e _{0} of d _{0} will also offend d _{1}, which contradicts a fact noted at the beginning. Here we shortly digress to prove that \(\mathsf{e}_{0} \mbox {\bf $\:$=$\:$}\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \) must hold, else e _{0} would offend d _{1}.
Indeed, assuming \(\mathsf{e}_{0} \mathbf {\mbox {\bf $\:\not $=$\:$}}\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \), e _{0} would also belong to d _{1}, and each one of its endpoints must have edges distinct from e _{0} incident to it in d _{1}. However, it will turn out that this cannot be the case for the endpoint x _{0}, which hence is not properly covered in d _{1}.
To see this, let \(\mathsf{q}_{2} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{e}_{0} \) be the edge that covers x _{0} in d _{1}.
If this edge q _{2} were one of the two which have been removed, the edge \(\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \) would satisfactorily cover x _{0} in d _{0}.
q _{2} must hence belong to d _{0}; but again, this implies that q _{2} would satisfactorily cover x _{0} in d _{0}. Therefore, \(\mathsf{e}_{0} \mbox {\bf $\:$=$\:$}\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \) must hold.
The only remaining possibility, \(\mathsf{e}_{0} \mbox {\bf $\:$=$\:$}\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \), is also untenable. Indeed, d _{1} has two edges incident to w _{0}, one of which is \(\left \{\mathsf{w}_{0} ,\mathsf{x}_{1}\right \} \); likewise, d _{1} has two edges incident to y _{0}, one of which is \(\left \{\mathsf{x}_{1} ,\mathsf{y}_{0}\right \} \). For either one of the endpoints w _{0},y _{0} of e _{0}, the second incident edge belongs to d _{1} and differs from \(\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \), so it must belong to d _{0} as well; since d _{0} also owns the edge \(\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \) incident to either endpoint, it is not true that e _{0} is an offending edge for d _{0}, a fact that contradicts one of the assumptions made.
In our specialized context, where edges are 2sets whose elements satisfy a peculiar membership constraint, we do not simply require that a Hamiltonian cycle H touches every vertex, but also that every source has an incident membership edge in H.
Suppose that s _{0},t _{0},x _{1},y _{0},h _{0},w _{0},k _{0} make a counterexample to the claim. One reason why
is violated might be
; if this is the case, we can choose an x′ witnessing this fact.
To see that \(\mathsf {x}' \in \mathsf{t}_{0} \mbox {\boldmath $\setminus $}\mbox {\boldmath $\bigcup $}\mathsf{t}_{0} \) follows from the constraint \(\mathsf {x}' \in \mathsf{s}_{0} \mbox {\boldmath $\setminus $}\mbox {\boldmath $\bigcup $}\mathsf{s}_{0} \), we assume the contrary and argue as follows: (1) Unless x′ belongs to t _{0}, we must have \(\mathsf {x}' \mbox {\bf $\:$=$\:$}\mathsf{x}_{1} \), which however has an incident membership edge, namely \(\left \{\mathsf{x}_{1} ,\mathsf{y}_{0}\right \} \), in \(\mathsf{h}_{0} \mbox {\boldmath $\setminus $}\left \{\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \}\right \} \mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\left \{\mathsf{w}_{0} ,\mathsf{x}_{1}\right \} ,\left \{\mathsf{x}_{1} ,\mathsf{y}_{0}\right \}\right \} \). (2) Thus, since x′∈t _{0}, we have \(\mathsf {x}' \in \mathsf{t}_{0} \mbox {$\;${\footnotesize $\cap $}$\;$}\mbox {\boldmath $\bigcup $}\mathsf{t}_{0} \) and hence \(\mathsf {x}' \in \mathsf{s}_{0} \mbox {$\;${\footnotesize $\cap $}$\;$}\mbox {\boldmath $\bigcup $}\mathsf{s}_{0} \), contradicting the constraint on x′.
Knowing that \(\mathsf {x}' \in \mathsf{t}_{0} \mbox {\boldmath $\setminus $}\mbox {\boldmath $\bigcup $}\mathsf{t}_{0} \), we can find a y _{1}∈x′ such that \(\left \{\mathsf {x}' ,\mathsf{y}_{1}\right \} \in \mathsf{h}_{0} \). Since this membership edge is no longer available after the modification of h _{0}, it must be \(\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \); therefore, \(\mathsf {x}' \mbox {\bf $\:$=$\:$}\mathsf{w}_{0} \), for otherwise \(\mathsf {x}' \mbox {\bf $\:$=$\:$}\mathsf{y}_{0} \) would (in view of the fact y _{0}∈x _{1}) contradict the assumption \(\mathsf {x}' \in \mathsf{s}_{0} \mbox {\boldmath $\setminus $}\mbox {\boldmath $\bigcup $}\mathsf{s}_{0} \).
If x′∈y _{0}, the assumption \(\mathsf {x}' \in \mathsf{s}_{0} \mbox {\boldmath $\setminus $}\mbox {\boldmath $\bigcup $}\mathsf{s}_{0} \) would be contradicted similarly: but then, by the initial assumption, we must have \(\left \{\mathsf {x}' ,\mathsf{k}_{0}\right \} \in \mathsf{h}_{0} \mbox {$\;${\footnotesize $\&$}$\;$}\mathsf{k}_{0} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{y}_{0} \mbox {$\;${\footnotesize $\&$}$\;$}\mathsf{k}_{0} \in \mathsf {x}' \), conflicting with Stat2, because \(\left \{\mathsf {x}' ,\mathsf{k}_{0}\right \} \mbox {\bf $\:$=$\:$}\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \) would imply \(\mathsf{k}_{0} \mbox {\bf $\:$=$\:$}\mathsf{y}_{0} \).
At this point the reason why
is false must be that
is false; however, we will derive a contradiction also in this case.
In fact, after observing that \(\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \mbox {\boldmath $\:\subseteq \:$}\mbox {\boldmath $\bigcup $}\mathsf{h}_{0} \) must hold, we will be able to discard one by one each potential reason why \(\mathsf{Hamiltonian}\big (\mathsf{h}_{0} \mbox {\boldmath $\setminus $}\left \{\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \}\right \} \mbox {$\;${\footnotesize $\cup $}$\;$} \left \{\left \{\mathsf{w}_{0} ,\mathsf{x}_{1}\right \} ,\left \{\mathsf{x}_{1} ,\mathsf{y}_{0}\right \}\right \},\mathsf{s}_{0},\mathsf{sqEdges}(\mathsf{s}_{0})\big )\) should be false.
We prove first that \(\mbox {\boldmath $\bigcup $}\mathsf{h}_{1} \mbox {\boldmath $\:\subseteq \:$}\mathsf{s}_{0} \).
The remaining case is \(\mathsf{s}_{0} \mbox {\boldmath $\:\not \subseteq \:$}\mbox {\boldmath $\bigcup $}\mathsf{h}_{1} \), which entails that we can find an \(\mathsf{a} \in \mathsf{t}_{0} \mbox {\boldmath $\setminus $}\mbox {\boldmath $\bigcup $}\mathsf{h}_{1} \).
Since a∈t _{0} and \(\mathsf{t}_{0} \mbox {\bf $\:$=$\:$}\mbox {\boldmath $\bigcup $}\mathsf{h}_{0} \), we can find an e′∈h _{0} such that a∈e′.
Since \(\mathsf{h}_{1} \mbox {\bf $\:$=$\:$}\mathsf{h}_{0} \mbox {\boldmath $\setminus $}\left \{\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \}\right \} \mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\left \{\mathsf{w}_{0} ,\mathsf{x}_{1}\right \} ,\left \{\mathsf{x}_{1} ,\mathsf{y}_{0}\right \}\right \} \), we conclude that \(\mathsf {e}' \mbox {\bf $\:$=$\:$}\left \{\mathsf{w}_{0} ,\mathsf{y}_{0}\right \} \) must hold. Hence, either \(\mathsf{a} \mbox {\bf $\:$=$\:$}\mathsf{w}_{0} \) or \(\mathsf{a} \mbox {\bf $\:$=$\:$}\mathsf{y}_{0} \) must hold, both of which yield a contradiction.
Notice that since h _{0} is a Hamiltonian path in t _{0}, its unionset must equal t _{0}; since x _{0} does not belong to t _{0}, but it belongs to \(\left \{\mathsf{x}_{0} ,\mathsf{y}_{0}\right \} \), it follows that \(\left \{\mathsf{x}_{0} ,\mathsf{y}_{0}\right \} \) cannot belong to h _{0}.
Arguing by contradiction, assume that \(\left \{\left \{\mathsf{x}_{0} ,\mathsf{y}_{0}\right \} ,\left \{\mathsf{y}_{0} ,\mathsf{z}_{0}\right \} ,\left \{\mathsf{z}_{0} ,\mathsf{x}_{0}\right \}\right \} \) is not a ‘square Hamiltonian’ cycle for \(\mathsf{s} \mbox {\bf $\:$=$\:$}\left \{\mathsf{x}_{0} ,\mathsf{y}_{0} ,\mathsf{z}_{0}\right \} \), where x _{0}∈y _{0} and y _{0}∈z _{0} holds. We will first exclude the possibility that \(\left \{\left \{\mathsf{x}_{0} ,\mathsf{y}_{0}\right \} ,\left \{\mathsf{y}_{0} ,\mathsf{z}_{0}\right \} ,\left \{\mathsf{z}_{0} ,\mathsf{x}_{0}\right \}\right \} \) is not a Hamiltonian cycle in the ‘square edges’ of s; after discarding this, we will also exclude that this cycle may fail to satisfy the restraining condition that it has a genuine membership edge incident into each source of s.
We conclude by checking that \(\left \{\left \{\mathsf{x}_{0} ,\mathsf{y}_{0}\right \} ,\left \{\mathsf{y}_{0} ,\mathsf{z}_{0}\right \} ,\left \{\mathsf{z}_{0} ,\mathsf{x}_{0}\right \}\right \} \) owns a genuine membership edge incident into each source of s; as a matter of fact, z _{0} is the only source of s and \(\left \{\mathsf{y}_{0} ,\mathsf{z}_{0}\right \} \) is a membership edge.
Any nontrivial transitive set whose square is devoid of Hamiltonian cycles must strictly comprise certain sets.
Indeed, any set satisfying the premises of our present claim must, due to its transitivity and nontriviality, include either one of the Hamiltonian cycles endowed with the vertices \(\emptyset ,\left \{\emptyset \right \} ,\left \{\left \{\emptyset \right \}\right \} \) and \(\emptyset ,\left \{\emptyset \right \} ,\left \{\emptyset ,\left \{\emptyset \right \}\right \} \), respectively; but it must also own additional elements, else the last premise would be falsified. Moreover, it cannot have exactly the elements \(\emptyset ,\left \{\emptyset \right \} ,\left \{\left \{\emptyset \right \}\right \} ,\left \{\emptyset ,\left \{\emptyset \right \}\right \} \), as these form a Hamiltonian cycle.
The cases \(\mathsf{t} \mbox {\bf $\:$=$\:$}\left \{\emptyset ,\left \{\emptyset \right \} ,\left \{\left \{\emptyset \right \}\right \}\right \} \) and \(\mathsf{t} \mbox {\bf $\:$=$\:$}\left \{\emptyset ,\left \{\emptyset \right \} ,\left \{\emptyset ,\left \{\emptyset \right \}\right \}\right \} \) must be excluded, because we have the respective Hamiltonian cycles
Having thus established that \(\mathsf{t} \mbox {\bf $\:$=$\:$}\left \{\emptyset ,\left \{\emptyset \right \} ,\left \{\left \{\emptyset \right \}\right \} ,\left \{\emptyset ,\left \{\emptyset \right \}\right \}\right \} \), we can now exploit Theorem hamiltonian_{2} to enrich the Hamiltonian cycle for \(\left \{\emptyset ,\left \{\emptyset \right \} ,\left \{\left \{\emptyset \right \}\right \}\right \} \) into one which does to our case.
1.7 A.7 Hamiltonicity of Squared ClawFree Sets
Nontrivial, clawfree, finite transitive sets have Hamiltonian squares.
For, assuming the opposite, there would exist an inclusionminimal, finite transitive nontrivial clawfree set whose square lacks a Hamiltonian cycle.
Thanks to the finiteness of such an s _{0}, the \({\textsc {Theory}\;}\) pivotsForClawFreeness can be applied to s _{0}. We thereby pick an element x from the frontier of s _{0}, and an element y of x which is pivotal relative to s _{0}. This y will have at most two inneighbors (one of the two being x) in s _{0}. We denote by z an inneighbor of y in s _{0}, such that z differs from x if possible. Observe, among others, that neither one of x,z can belong to the other.
Thus it turns out readily that removal of x,z from s _{0} leads to a set t to which, unless t is ‘trivial’ (i.e. a subset of \(\left \{\emptyset ,\left \{\emptyset \right \}\right \} \)), the inductive hypothesis applies; hence, by that hypothesis, there is a Hamiltonian cycle h _{0} for t.
In order that t be trivial, we should have \(\mathsf{s}_{0} \mbox {\boldmath $\:\subseteq \:$}\left \{\emptyset ,\left \{\emptyset \right \} ,\left \{\left \{\emptyset \right \}\right \} ,\left \{\emptyset ,\left \{\emptyset \right \}\right \}\right \} \); but then, as already shown in the proof of Theorem hamiltonian_{4}, we have the ability, either directly, or by enrichment of a Hamiltonian cycle for \(\left \{\emptyset ,\left \{\emptyset \right \} ,\left \{\left \{\emptyset \right \}\right \}\right \} \), to construct a Hamiltonian cycle for s _{0}: thus, if we suppose \(\mathsf{t} \mbox {\boldmath $\:\subseteq \:$}\left \{\emptyset ,\left \{\emptyset \right \}\right \}\) then we get a contradiction.
It follows from y being a source of \(\mathsf{t} \mbox {\bf $\:$=$\:$}\mbox {\boldmath $\bigcup $}\mathsf{h}_{0} \) that there is an edge \(\left \{\mathsf{y} ,\mathsf{w}\right \} \), with w∈y, in h _{0}, If \(\mathsf{x} \mbox {\bf $\:$=$\:$}\mathsf{z} \), to get a Hamiltonian cycle h _{1} for s _{0} (a fact conflicting with the inductive hypothesis) it will suffice to take \(\mathsf{h}_{1} \mbox {\bf $\:$=$\:$}\mathsf{h}_{0} \mbox {\boldmath $\setminus $}\left \{\left \{\mathsf{y} ,\mathsf{w}\right \}\right \} \mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\left \{\mathsf{x} ,\mathsf{y}\right \} ,\left \{\mathsf{x} ,\mathsf{w}\right \}\right \} \), where \(\left \{\mathsf{x} ,\mathsf{w}\right \} \) is a square edge because w∈y and y∈x both hold. On the other hand, if \(\mathsf{x} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{z} \), clawfreeness implies that either w∈x or w∈z. Assume the former for definiteness, and put \(\mathsf{h}_{2} \mbox {\bf $\:$=$\:$}\mathsf{h}_{0} \mbox {\boldmath $\setminus $}\left \{\left \{\mathsf{y} ,\mathsf{w}\right \}\right \} \mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\left \{\mathsf{y} ,\mathsf{z}\right \} ,\left \{\mathsf{z} ,\mathsf{x}\right \} ,\left \{\mathsf{x} ,\mathsf{w}\right \}\right \} \), where \(\left \{\mathsf{x} ,\mathsf{z}\right \} \) is a square edge and \(\left \{\mathsf{x} ,\mathsf{w}\right \} \) and \(\left \{\mathsf{y} ,\mathsf{z}\right \} \) are genuine edges incident in the sources x,z. We are again facing a contradiction, because h _{2} is a Hamiltonian cycle for s _{0}.
1.8 A.8 Perfect Matchings
Next we introduce the notion of perfect matching. This is a partition consisting of doubletons one of whose elements belongs to the other. Special cases of a perfect matching are: the empty set and, more generally, all subsets of a perfect matching.
By adjoining a pair \(\left \{\mathsf{x} ,\mathsf{y}\right \} \) with y∈x to a perfect matching none of whose blocks has either x or y as an element, we always obtain a perfect matching.
If, in a perfect matching m, we replace one block \(\left \{\mathsf{y} ,\mathsf{w}\right \} \) by pairs \(\left \{\mathsf{y} ,\mathsf{z}\right \} ,\left \{\mathsf{x} ,\mathsf{w}\right \} \), then, under suitable conditions ensuring disjointness between blocks and membership within each block, we get a perfect matching again.
For assuming that m,y _{0},w _{0},x _{0},z _{0} are a counterexample to the claim, we could get a contradiction arguing as follows. Begin by observing that neither y _{0} nor w _{0} can belong to the unionset of the perfect submatching \(\mathsf{m} \mbox {\boldmath $\setminus $}\left \{\left \{\mathsf{y}_{0} ,\mathsf{w}_{0}\right \}\right \} \) of m.
Thus, taking into account that w _{0}∈x _{0} and that \(\mathsf{x}_{0} \notin \mbox {\boldmath $\bigcup $}\mathsf{m} \) which is a superset of \(\mbox {\boldmath $\bigcup $}(\mathsf{m} \mbox {\boldmath $\setminus $}\left \{\left \{\mathsf{y}_{0} ,\mathsf{w}_{0}\right \}\right \})\), we can extend the perfect matching \(\mathsf{m} \mbox {\boldmath $\setminus $}\left \{\left \{\mathsf{y}_{0} ,\mathsf{w}_{0}\right \}\right \} \) with the doubleton \(\left \{\mathsf{x}_{0} ,\mathsf{w}_{0}\right \} \).
Observe next that \(\mathsf{x}_{0} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{y}_{0}\) and \(\mathsf{z}_{0} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{w}_{0}\), because \(\mathsf{x}_{0} \notin \mbox {\boldmath $\bigcup $}\mathsf{m} \) and \(\mathsf{z}_{0} \notin \mbox {\boldmath $\bigcup $}\mathsf{m} \) whereas \(\mathsf{y}_{0}\in \mbox {\boldmath $\bigcup $}\mathsf{m} \) and \(\mathsf{w}_{0}\in \mbox {\boldmath $\bigcup $}\mathsf{m} \). It then follows from \(\mathsf{z}_{0} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{w}_{0}\), thanks to the assumption \(\mathsf{z}_{0} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{x}_{0} \), that z _{0} does not belong to the unionset of the perfect matching \(\mathsf{m} \mbox {\boldmath $\setminus $}\left \{\left \{\mathsf{y}_{0} ,\mathsf{w}_{0}\right \}\right \} \mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\left \{\mathsf{x}_{0} ,\mathsf{w}_{0}\right \}\right \} \).
y _{0} cannot equal w _{0} either, the reason being that the set \(\left \{\mathsf{y}_{0} ,\mathsf{w}_{0}\right \} \) is a block of a perfect matching and hence it cannot be a singleton. If follows, thanks to the assumption y _{0}∈x _{0} (entailing that \(\mathsf{y}_{0} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{x}_{0}\)), that y _{0} does not belong to \(\mbox {\boldmath $\bigcup $}(\mathsf{m} \mbox {\boldmath $\setminus $}\left \{\left \{\mathsf{y}_{0} ,\mathsf{w}_{0}\right \}\right \} \mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\left \{\mathsf{x}_{0} ,\mathsf{w}_{0}\right \}\right \})\) either.
We now know that the perfect matching \(\mathsf{m} \mbox {\boldmath $\setminus $}\left \{\left \{\mathsf{y}_{0} ,\mathsf{w}_{0}\right \}\right \} \mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\left \{\mathsf{x}_{0} ,\mathsf{w}_{0}\right \}\right \} \) can be extended with the doubleton \(\left \{\mathsf{y}_{0} ,\mathsf{z}_{0}\right \} \), which readily leads us to the sought contradiction.
1.9 A.9 Each ClawFree Set Admits a NearPerfect Matching
Every clawfree finite, transitive set admits a perfect matching perhaps omitting one of its elements.
For, supposing the contrary, there would be an inclusionminimal finite set s _{0} which is transitive and clawfree, and such that no perfect matching m partitions the set s _{0} possibly deprived of an element y _{0}.
We observe that such an s _{0} cannot equal ∅ or \(\left \{\emptyset \right \} \), else the null perfect matching would cover it.
Thanks to the finiteness of s _{0}, the \({\textsc {Theory}\;}\) pivotsForClawFreeness can be applied to s _{0}. We thereby pick an element x from the frontier of s _{0} and an element y of x which is pivotal relative to s _{0}. This y will have at most two ∈predecessors (one of the two being x) in s _{0}. We denote by z a predecessor of y in s _{0}, such that z differs from x if possible.
Moreover, we take t′ to be s _{0} deprived of the predecessors of y and, if \(\mathsf{x} \mathbf {\mbox {\bf $\:\not $=$\:$}}\mathsf{z} \), we take \(\mathsf{t} \mbox {\bf $\:$=$\:$}\mathsf {t}' \) else we take \(\mathsf{t} \mbox {\bf $\:$=$\:$}\mathsf {t}' \mbox {\boldmath $\setminus $}\left \{\mathsf{y}\right \} \).
Thus it turns out readily that t is transitive; hence, by the inductive hypothesis, there is a perfect matching m _{0} for t.
The possibility that y does not belong to \(\mbox {\boldmath $\bigcup $}\mathsf{m}_{0} \) is then discarded; in fact, if this were the case, then by adding the pair \(\left \{\mathsf{x} ,\mathsf{y}\right \} \) to m _{0} we would get a perfect matching for s _{0}, while we have assumed that such a matching does not exist. From the fact \(\mathsf{y} \in \mbox {\boldmath $\bigcup $}\mathsf{m}_{0} \) it follows that y belongs to t, hence that \(\mathsf{t} \mbox {\bf $\:$=$\:$}\mathsf {t}' \) and that x,z are distinct.
It also follows that y is the tail of that arc p _{1} of m _{0} to which it belongs. In fact, if y were instead the head of p _{1}, then the tail x _{2} of p _{1}, which must belong to \(\mbox {\boldmath $\bigcup $}\mathsf{m}_{0} \) would belong to \(\mathsf{s}_{0} \mbox {\boldmath $\setminus $}\left \{\mathsf{x} ,\mathsf{z}\right \} \), hence would be inside s _{0} but outside the set of predecessors of y, which is absurd.
Call w the head of the arc issuing from y in m _{0}. Then y,x,z,w form a potential claw; this implies, since s _{0} is clawfree that either w∈x or w∈z.
Obviously, \(\mathsf{w} \in \mbox {\boldmath $\bigcup $}\mathsf{m}_{0} \). Moreover, through elementary reasoning we derive \(\mbox {\boldmath $\bigcup $}\mathsf{m}_{0} \mbox {$\;${\footnotesize $\cup $}$\;$}\left \{\mathsf{z} ,\mathsf{x}\right \} \mbox {\bf $\:$=$\:$}\mathsf{s}_{0} \mbox {\boldmath $\setminus $}\left \{\mathsf{y}_{1}\right \} \), where y _{1} lies outside s _{0} if both x and z has been covered by the matching m _{0}, otherwise y _{1} equals the one of x,z (which might be the same set) left over by m _{0}.
If there is an edge between w and x, then we deviate the perfect matching by replacing \(\left \{\mathsf{y} ,\mathsf{w}\right \} \) by \(\left \{\mathsf{y} ,\mathsf{z}\right \} \) and \(\left \{\mathsf{x} ,\mathsf{w}\right \} \); otherwise we replace \(\left \{\mathsf{y} ,\mathsf{w}\right \} \) by \(\left \{\mathsf{y} ,\mathsf{x}\right \} \) and \(\left \{\mathsf{z} ,\mathsf{w}\right \} \). Plainly we get a perfect matching for s _{0} in either case, which leads us to the desired contradiction.
1.10 A.10 From Membership Digraphs to General Graphs
Let us now place the results presented so far under the more general perspective that motivates this work. We display in this section the interfaces of two Theorys (not developed formally with Ref, as of today), explaining why we can work with membership as a convenient surrogate for the edge relationship of general graphs.
One of these, \({\textsc {Theory}\;}\) finGraphRepr, will implement the proof that any finite graph (v _{0},e _{0}) is ‘isomorphic’, via a suitable orientation of its edges and an injection \(\mathsf {\varrho}_{\varTheta }\) of v _{0} onto a set \(\mathsf {\nu}_{\varTheta }\), to a digraph \((\mathsf {\nu}_{\varTheta },\{(x,y):\:x\in \mathsf {\nu}_{\varTheta },\:y\in x\cap \mathsf {\nu}_{\varTheta }\})\) that enjoys the weak extensionality property: “distinct nonsink vertices have different outneighborhoods”.
Although accessory, the weak extensionality condition is the clue for getting the desired isomorphism; in fact, for any weakly extensional digraph, acyclicity always ensures that a variant of Mostowski’s collapse is welldefined: in order to get it, one starts by assigning a distinct set Mt to each sink t and then proceeds by putting recursively
for all nonsink vertices w; plainly, injectivity of the function u↦Mu can be ensured globally by a suitable choice of the images Mt of the sinks t.
The other Theory, cfGraphRepr, will specialize finGraphRepr to the case of a connected, clawfree (undirected, finite) graph—connectedness and clawfreeness are specified, respectively, by the second and by the third assumption of this Theory. For these graphs, we can insist that the orientation be so imposed as to ensure extensionality in full: “distinct vertices have different outneighborhoods”. Consequently, the following will hold:

there is a unique sink, ∅; moreover,

the set \(\mathsf {\nu}_{\varTheta }\) of vertices underlying the image digraph is transitive. And, trivially,

\(\mathsf {\nu}_{\varTheta }\) is a clawfree set, in an even stronger sense than the definition with which we have been working throughout this proof scenario.
(As regards the third of these points, it should be clear that none of the four nonisomorphic membership renderings of a claw are induced by any quadruple of elements of \(\mathsf {\nu}_{\varTheta }\); our definition forbade only two of them, though!)
Via the \({\textsc {Theory}\;}\) cfGraphRepr, the aboveproved existence results about perfect matchings and Hamiltonian cycles can be transferred from a realm of special membership digraphs to the a priori more general realm of the connected clawfree graphs.
Rights and permissions
Copyright information
© 2013 SpringerVerlag London
About this chapter
Cite this chapter
Omodeo, E.G. (2013). The Ref ProofChecker and Its “Common Shared Scenario”. In: Davis, M., Schonberg, E. (eds) From Linear Operators to Computational Biology. Springer, London. https://doi.org/10.1007/9781447142829_8
Download citation
DOI: https://doi.org/10.1007/9781447142829_8
Publisher Name: Springer, London
Print ISBN: 9781447142812
Online ISBN: 9781447142829
eBook Packages: Computer ScienceComputer Science (R0)