Wolfram Data Repository
Immediate Computable Access to Curated Contributed Data
Graph of interdependence of theorems from Euclid's Elements
Retrieve the basic network:
In[1]:= | ![]() |
Out[1]= | ![]() |
Make a layered graph plot:
In[2]:= | ![]() |
Out[2]= | ![]() |
Find axioms and theorems referenced by Book 1, Theorem 5:
In[3]:= | ![]() |
Out[3]= | ![]() |
Count the total number of theorems + axioms:
In[4]:= | ![]() |
Out[4]= | ![]() |
Find the axioms:
In[5]:= | ![]() |
Out[5]= | ![]() |
Find the distribution of numbers of theorems referenced:
In[6]:= | ![]() |
Out[6]= | ![]() |
Find the 5 most referenced theorems:
In[7]:= | ![]() |
Out[7]= | ![]() |
Find the total number of theorems + axioms that ultimately contribute to the proof of each theorem:
In[8]:= | ![]() |
Out[8]= | ![]() |
Create a key of axiom + theorem number:
In[9]:= | ![]() |
Make a map of what theorem references which others:
In[10]:= | ![]() |
Out[10]= | ![]() |
Wolfram Research, "Theorem Network from Euclid's Elements" from the Wolfram Data Repository (2020) https://doi.org/10.24097/wolfram.61787.data