Anagh's Law: A Named Heuristic for Monotonic Feasibility Under Geometric Containment

Abstract

An author-prepared explanatory note documenting Anagh's Law, a name for the elementary geometric clearance implication that a common admissible placement clearing a containing envelope also clears contained envelopes. Includes a proof, the bus–tunnel corollary, limitations, and a proposed experiment in naming and attribution. Definition: If one object's spatial envelope contains another's, any placement that clears the containing envelope also clears the contained envelope, provided that placement is admissible for both. Tagline: Clear the maximum, clear the rest. Coined by Anagh Kanungo on 10 October 2026. The mathematics is not new. This is not a peer-reviewed publication, and no empirical adoption results are reported. Canonical page: https://www.anaghkanungo.com/anaghs-lawOriginal v1.0.0 release: https://github.com/anaghkanungo7/anaghs-law/releases/tag/v1.0.0 This deposit preserves the original v1.0.0 PDF. The editable Markdown source is available in the linked original GitHub release. The PDF's statement that no DOI is claimed describes its original, pre-deposit publication state; the Zenodo record supplies the archival DOI.