Proposition 3.33: recognizability closed under iteration
ProvedMSKleene.rec_iterRecognizability closed under iteration (Proposition 3.33).
Assume finite. Let and . If then . (From CVCL20, Prop. 3.25.)
import Definitions.Def_MSKleene_Recognizable import Definitions.Def_MSKleene_Iteration
namespace MSKleene
/-- **Iteration preserves recognizability** (Proposition 3.33; from CVCL20).
With `S` finite: for `z ∈ X_s`, if `L ⊆ T_Σ(X)_s` is `s`-recognizable then so is
its `z`-iteration `L^{⋆z}`. -/
theorem rec_iter {S : Type} [Finite S] (sig : Signature S) (X : SSet S) {s : S}
(z : X s) (L : Set (Term sig X s)) (hL : sRecognizable (freeAlgebra sig X) s L) :
sRecognizable (freeAlgebra sig X) s (iterate z L) := by
sorry
end MSKleeneRead-back
What the Lean code literally says, in plain math · claude-sonnet-5
Read-back of MSKleene.rec_iter
Fix a type of sorts that is assumed to be a finite type, together with an -sorted signature — a family assigning to every finite list of sorts and every sort a type of operation symbols of arity and result sort (this family is not assumed finite) — and an -sorted set of variables , i.e. a family assigning to each sort a type (also not assumed finite). Let be the -sorted set of well-sorted first-order terms: for each , is generated by for and by for and a vector of terms whose sorts match . Let be the algebra over whose carrier at each sort is and whose interpretation of a symbol is the term-forming map .
The theorem takes an implicit sort , an explicit distinguished variable (so is inhabited), and an explicit set of terms of sort . Call a set of elements of -recognizable in an algebra over when there exists an algebra over the same signature such that the dependent sum (the disjoint union of all its carrier sets over all sorts) is a finite type, and there exist a homomorphism — a sort-indexed family of maps satisfying for every symbol — and a subset , such that
The single hypothesis states that is -recognizable in in precisely this sense; if no such exist for , the hypothesis is false and the theorem asserts nothing about that .
Next, let be the power algebra: the algebra over whose carrier at sort is the powerset and whose interpretation of a symbol sends a tuple of argument-sets to . Let be the homomorphism obtained as the evaluation homomorphism induced by the variable assignment that sends the distinguished variable to the set and sends every other variable (every with , and every variable of every sort ) to the singleton . Unfolding term evaluation, for a term of sort the set is computed by structural recursion: ; for any other variable ; and . Equivalently, is the set of all terms obtained from by replacing each occurrence of , independently, by some term of ; in particular if does not occur in then , and if then . For a set of terms of sort define
Define the iteration stages by recursion on :
and set
Thus stage is the singleton ; each next stage keeps everything from the previous stage and adds every term obtained by substituting members of for occurrences of in terms already present; and is the union of all these (nondecreasing) stages over every natural number , including (so always, and ).
Conclusion. Under all of the above, is -recognizable in : there exist an algebra over the signature whose total carrier is a finite type, a homomorphism , and a subset such that
The witnessing algebra is constrained only to be over the same signature and to have finite total carrier; it need not be related to , to , or to the algebra witnessing in any other way.
Confirmed by the mission captain (proposal self-audit).