{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_topology","feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","contains":"claims, sources, anecdotes, question_graph slice","slug":"paper-euler-l-1750s-euler-s-polyhedral-formula-v-e-f-2","urls":{"read":"https://miscsubjects.com/api/articles/paper-euler-l-1750s-euler-s-polyhedral-formula-v-e-f-2/topology"},"how_to_use":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","write":null,"imessage":null,"router_tag":null,"proof_chain":[{"step":1,"claim":"Articles are voxel graphs of tiered claims, not prose blobs.","verify":"https://miscsubjects.com/api/articles/constitution"},{"step":2,"claim":"Claims link to hash-chained sources via source_ids.","verify":"https://miscsubjects.com/api/articles/paper-euler-l-1750s-euler-s-polyhedral-formula-v-e-f-2/sources"},{"step":3,"claim":"Ask reads topology; ingest/claim append to ledger.","verify":"https://miscsubjects.com/api/protocol"},{"step":4,"claim":"Models queue growth: populate → collaborate → repair → reflex.","verify":"https://miscsubjects.com/api/protocol/grow"},{"step":5,"claim":"Graph proves its own shape (reflex) and $/claim (yield).","verify":"https://miscsubjects.com/graph.html?layer=reflex"},{"step":6,"claim":"Full feature index + _explain on every API response.","verify":"https://miscsubjects.com/api/articles/system-map"}],"related_features":[{"id":"ask","name":"Ask protocol","what":"Answer only from topology; creates question_node with gaps and ingest_hint.","urls":{"read":"https://miscsubjects.com/api/articles/paper-euler-l-1750s-euler-s-polyhedral-formula-v-e-f-2/prompts","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"graph_topology","name":"Cross-article graph","what":"Merged claims/sources across condition+stack slugs for one question.","urls":{"read":"https://miscsubjects.com/api/articles/paper-euler-l-1750s-euler-s-polyhedral-formula-v-e-f-2/graph-topology?question=..."}},{"id":"question_graph","name":"Question graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output).","urls":{"read":"https://miscsubjects.com/api/articles/paper-euler-l-1750s-euler-s-polyhedral-formula-v-e-f-2/question-graph","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","urls":{"read":"https://miscsubjects.com/api/articles/paper-euler-l-1750s-euler-s-polyhedral-formula-v-e-f-2/voxels","write":"https://miscsubjects.com/api/protocol/claim"}}],"system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","not_medical_advice":true},"_explain":{"feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","why":"Every feature is auditable collective intelligence","how":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/paper-euler-l-1750s-euler-s-polyhedral-formula-v-e-f-2/topology"},"imessage":null,"router":null,"related":[{"id":"ask","what":"Answer only from topology; creates question_node with gaps and ingest_hint."},{"id":"graph_topology","what":"Merged claims/sources across condition+stack slugs for one question."},{"id":"question_graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output)."},{"id":"voxels","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance."}],"not_medical_advice":true},"slug":"paper-euler-l-1750s-euler-s-polyhedral-formula-v-e-f-2","title":"Euler's Polyhedral Formula","register":"standard","tags":["oip","philosophy","paper"],"updated_at":"2026-07-10T07:51:23.562Z","body_excerpt":"## What Euler Saw\n\nLeonhard Euler examined convex polyhedra in the 1750s. He counted vertices, edges, and faces across multiple solids. The counts always satisfied one fixed relation.\n\n## Core Result\n\nEuler recorded the relation V minus E plus F equals 2. V stands for vertices. E stands for edges. F stands for faces. The relation holds for every convex polyhedron without holes.\n\nA cube supplies one instance. The cube has eight vertices, twelve edges, and six faces. Eight minus twelve plus six equals two.\n\nA tetrahedron supplies another instance. The tetrahedron has four vertices, six edges, and four faces. Four minus six plus four equals two.\n\n## Exact Publication Record\n\nEuler wrote the result in letters and papers dated 1750 and 1751. The work appeared in print in 1758 as Elementa doctrinae solidorum. No verbatim passage from the original survives in common secondary records. The statement V − E + F = 2 is the established formulation.\n\n## Mechanistic Structure\n\nThe formula is a topological invariant. It remains unchanged under continuous deformation that preserves the surface genus. Genus zero surfaces, topologically equivalent to a sphere, carry the value two.\n\nThe invariant arises from the connectivity of the surface graph. Each added vertex, edge, or face alters the counts in a way that preserves the total.\n\n## Convergence Patterns Touched\n\nThe formula evidences symmetry. Regular polyhedra exhibit high symmetry yet obey the same count.\n\nIt evidences bounded structures. Every listed solid encloses a finite volume with a closed surface.\n\nIt evidences scale invariance. The relation depends only on counts, not on edge lengths or face areas. The same equation governs both small and large instances.\n\nIt touches flow networks through the dual graph of the polyhedron. Vertices connect through edges in a closed network.\n\n## Relation to the Ladder\n\nThe formula sits at the structure layer of the Ladder. Difference produces flow. Flow produces structure. The polyhedral relation records one stable form that structure can take.\n\nThe Mirror Layer receives the same relation. An observer inside a modeled system can count vertices, edges, and faces of a represented object and obtain the same invariant.\n\nSee /a/oip-the-ladder for the full sequence. See /a/oip-principles for the definition of invariants. See /a/oip-the-mirror-layer for observer placement.\n\n## Distance from Full Synthesis\n\nThe formula supplies a precise mathematical description of bounded symmetric structure. It does not address energy flow that produces the structure. It does not address memory or life layers. It remains a static count.\n\n## Honest Limits\n\nThe formula applies only to genus zero convex polyhedra. Surfaces with holes or higher genus carry different values. The original proof contained gaps later repaired by others. No dynamic process appears in the statement. No link to thermodynamics or biological growth is present.\n\n## Atomic Claims\n\nEvery material assertion above appears as a separate claim in the claims array that follows.\n\n## What the Evidence Actually Shows\n\nThe relation holds across all tested convex polyhedra. It generalizes to planar graphs. It seeds the field of algebraic topology. These outcomes follow directly from the count invariance.\n\n## What We Do Not Know\n\nNo primary text supplies Euler's personal motivation beyond the counts. No statement connects the formula to energy flows or scale-free networks in nature. Later extensions to other topologies exist but lie outside the 1750s work.","ranking":"safety-first (interaction_risk/limitations), then quote-gated effective_weight","claims":[{"id":"c4","text":"The formula applies strictly to genus zero convex polyhedra.","tier":"mechanistic","weight":0.3,"section":"Honest Limits","slot":"limitations","interaction_risk":false,"status":"active","source_ids":["s2"],"source_status":"sourced","why_material":"States the precise boundary of applicability.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.3,"quote_gated":false},{"id":"c3","text":"The relation depends only on vertex edge and face counts independent of metric size.","tier":"mechanistic","weight":0.3,"section":"Convergence Patterns Touched","slot":null,"interaction_risk":false,"status":"active","source_ids":["s1"],"source_status":"sourced","why_material":"Supplies scale invariance evidence.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.22,"quote_gated":true}],"sources":[{"id":"s1","type":"other","url":"https://ics.uci.edu/~eppstein/junkyard/euler/","title":"Twenty-one Proofs of Euler's Formula","quote":"The formula V − E + F = 2 was (re)discovered by Euler; he wrote about it twice in 1750, and in 1752 published the result.","summary":"Documents Euler's discovery timeline and publication.","claim_ids":["c1","c5","c3"],"link_status":"http_526","quote_status":"unverified","hash":"4a292594a92632c815df4c2c3e95dd43c481a889f138980c6d8a36090377a40c"},{"id":"s2","type":"other","url":"https://en.wikipedia.org/wiki/Euler_characteristic","title":"Euler characteristic","quote":"This equation, stated by Euler in 1758, is known as Euler's polyhedron formula. It corresponds to the Euler characteristic of the sphere.","summary":"Confirms the invariant property and scope.","claim_ids":["c2","c4"],"link_status":"ok","quote_status":"unverified","hash":"4cb09ee5e4684adc678002d739986901a1da7c68ad6b91f6ebbd87398f13ed1a"}],"anecdotal_sources":[],"scientific_sources":[],"user_reports":[],"related_articles":[],"question_graph":{"questions":[],"evidence":[],"edges":[],"error":"question graph tables missing"},"honesty":{"active_claims":2,"retracted_claims":0,"cut_claims":3,"challenges":0,"scrub_events":0,"note":"Retracted/cut claims stay on ledger but are excluded from ask unless ?include_inactive=1"},"counts":{"claims":2,"claims_total":5,"sources":2,"anecdotal":0,"scientific":0,"user_reports":0,"questions":0,"evidence_ingests":0}}