Learning.noObs
From the authors
The observation process of an algorithm-environment sequence without observations.
-
ฮฉ : Type u_5
-
โ -
ฮฉ
Unit()Nat : TypeThe natural numbers, starting at zero. This type is special-cased by both the kernel and the compiler, and overridden with an efficient implementation. Both use a fast arbitrary-precision arithmetic library (usually [GMP](https://gmplib.org/)); at runtime, `Nat` values that are sufficiently small are unboxed.
Unit : TypeThe canonical type with one element. This element is written `()`. `Unit` has a number of uses: * It can be used to model control flow that returns from a function call without providing other information. * Monadic actions that return `Unit` have side effects without computing values. * In polymorphic types, it can be used to indicate that no data is to be stored in a particular field.
Unit.unit : UnitThe only element of the unit type. It can be written as an empty tuple: `()`.
Code
def noObs (ฮฉ : Type*) : โ โ ฮฉ โ Unit := fun _ _ โฆ ()
New in v4.34.0-rc2-74-ge05e4f3 (2026-09-10), and its meaning has not changed since.
Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file ยท open it in the Lean web editor.
Dependency graph
Nothing to draw. Its statement rests on no other declaration in this project, and names nothing from a package left unaudited โ so the graph is this declaration alone. That is the answer, not a missing picture.
Audit surface: 0 project declarations, 3 external constants
โ Proved: no sorry anywhere in its closure
This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.