MovingTargetStrategy
An inductive datatype MovingTargetStrategy parameterized by a type V : Type*, with two constructors: stop : MovingTargetStrategy V representing termination; and query : Finset V → MovingTargetStrategy V → MovingTargetStrategy V → MovingTargetStrategy V, which takes a finite subset of vertices Q : Finset V and two continuation strategies for the negative (false) and positive (true) answers.
Statement
inductive MovingTargetStrategy (V : Type*)
- Defined in
- arXiv:2611.01281 Definition 2.1
- Verified
- 04 Nov 2026
- Axioms
- none listed
- Used by 5
- three_by_three_torus_moving_target_accuracy_exactOn the 3-by-3 torus C_3 □ C_3, the minimum achievable moving-target localization accuracy starting from the candidate set of all vertices…
- moving_target_strategy_stop_successfulFor any finite type V with decidable equality and simple graph G on V with decidable adjacency, the immediate stopping strategy…
- moving_target_strategy_successfulGiven a finite type V with decidable equality, a simple graph G on V with decidable adjacency, an accuracy threshold s : ℕ, a strategy…
- moving_target_grid_accuracy_le_minFor all M, N ≥ 1, on the M × N rectangular grid (vertices Fin M × Fin N, adjacent when they differ by one in exactly one coordinate) there…
- three_by_cycle_torus_moving_target_accuracy_le_ceilFor every integer n ≥ 3, there exists an adaptive search strategy for a moving target on the 3-by-n torus C_3 □ C_n achieving accuracy at…
Read back from the Lean
The definition of an inductive type MovingTargetStrategy parameterized by an arbitrary type V : Type*, representing a binary tree of queries. It has two constructors:
1. stop: a leaf node with no arguments, representing termination.
2. query: an internal node that takes a finite subset of V (Finset V) and two continuation strategies of type MovingTargetStrategy V (the two branches following the query).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A finite adaptive search strategy over a vertex type V. -/ inductive MovingTargetStrategy (V : Type*) | stop : MovingTargetStrategy V | query : Finset V → MovingTargetStrategy V → MovingTargetStrategy V → MovingTargetStrategy V