Locally definable construction sequences
Lax185574.LocalDefinability · concepts/Lax185574/LocalDefinability.lean · lax-185574
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
Let A be a structure and H a partial graph with V(H) ⊆ V(A). Then H is definable in A by formulas of quantifier rank q₀ with parameters from a set S ⊆ V(A) if for every relation R of H of arity k there is a formula φ_R(x₁, …, x_k) of quantifier rank at most q₀ with parameters from S such that, for all v̄ ∈ V(A)^k,
A ⊨ φ_R(v̄) ⟺ v̄ ∈ V(H)^k and H ⊨ R(v̄).
Let G be a graph and r, c, s, q₀ ∈ ℕ. A construction sequence G₁, …, G_λ of G is radius-r definable with c unary predicates, s parameters and quantifier rank q₀ if, for all t ∈ [λ−1] and v ∈ V(G), the induced partial graph G_t[Ball^{G_{t+1}}_r(v)] is definable in some expansion of G by c unary predicates, by formulas of quantifier rank q₀ with parameters from a set of at most s vertices. The expansion and the parameters may depend on t and v.
Concept map
In the paper
- page 16 of this submission's paper
Lean source view on GitHub
| 1 | import Lax185574.ConstructionSequences |
| 2 | import Lax185574.Colorings |
| 3 | import Lax185574.FirstOrderTypes |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Locally definable construction sequences |
| 8 | type: definition |
| 9 | --- |
| 10 | Let A be a structure and H a partial graph with V(H) ⊆ V(A). Then H is |
| 11 | *definable* in A by formulas of quantifier rank q₀ with parameters from |
| 12 | a set S ⊆ V(A) if for every relation R of H of arity k there is a formula |
| 13 | φ_R(x₁, …, x_k) of quantifier rank at most q₀ with parameters from S |
| 14 | such that, for all v̄ ∈ V(A)^k, |
| 15 | |
| 16 | A ⊨ φ_R(v̄) ⟺ v̄ ∈ V(H)^k and H ⊨ R(v̄). |
| 17 | |
| 18 | Let G be a graph and r, c, s, q₀ ∈ ℕ. A construction sequence |
| 19 | G₁, …, G_λ of G is *radius-r definable* with c unary predicates, |
| 20 | s parameters and quantifier rank q₀ if, for all t ∈ [λ−1] and |
| 21 | v ∈ V(G), the induced partial graph G_t[Ball^{G_{t+1}}_r(v)] is |
| 22 | definable in some expansion of G by c unary predicates, by formulas of |
| 23 | quantifier rank q₀ with parameters from a set of at most s vertices. |
| 24 | The expansion and the parameters may depend on t and v. |
| 25 | |
| 26 | # Formalization notes |
| 27 | |
| 28 | The defined partial graph is an induced partial graph H[B]. It is given |
| 29 | by H and the set B, so the definition needs no subtype. Its relations |
| 30 | are those of H restricted to B. The condition "v̄ ∈ V(H[B])^k and |
| 31 | H[B] ⊨ R(v̄)" therefore reads "every entry of v̄ lies in B and H ⊨ R(v̄)". |
| 32 | The relations are the edges, the non-edges and every color class. A |
| 33 | color class that misses B is defined by any false formula, so only |
| 34 | finitely many conditions have content. Parameters are free variables of |
| 35 | the right summand, as in `Lax185574.FirstOrderTypes`. |
| 36 | -/ |
| 37 | |
| 38 | namespace Lax185574.LocalDefinability |
| 39 | |
| 40 | open FirstOrder FirstOrder.Language |
| 41 | open Lax185574.PartialGraphs Lax185574.FirstOrderTypes Lax185574.Colorings |
| 42 | open Lax710763.Transductions |
| 43 | |
| 44 | universe u v z |
| 45 | |
| 46 | variable {V : Type z} |
| 47 | |
| 48 | /-- The induced partial graph `H[B]` is definable in the structure on |
| 49 | `V` by formulas of quantifier rank at most `q₀` with parameters from |
| 50 | `S`. -/ |
| 51 | def DefinableIn {L : Language.{u, v}} [L.Structure V] (q₀ : ℕ) (S : Set V) |
| 52 | (H : PartialGraph V) (B : Set V) : Prop := |
| 53 | ∀ {k : ℕ} (R : PartialGraphs.language.Relations k), |
| 54 | ∃ φ : L.Formula (Fin k ⊕ S), quantifierRank φ ≤ q₀ ∧ |
| 55 | ∀ x : Fin k → V, |
| 56 | φ.Realize (Sum.elim x Subtype.val) ↔ |
| 57 | (∀ i, x i ∈ B) ∧ @Structure.RelMap _ V H.structure k R x |
| 58 | |
| 59 | /-- The sequence `s` is radius-`r` definable in the graph `G` with `c` |
| 60 | unary predicates, `s'` parameters and quantifier rank `q₀`: for every |
| 61 | step `t` and vertex `v`, the induced partial graph |
| 62 | `s[t][Ball^{s[t+1]}_r(v)]` is definable in some expansion of `G` by `c` |
| 63 | unary predicates, by formulas of quantifier rank at most `q₀` with at |
| 64 | most `s'` parameters. -/ |
| 65 | def IsRadiusDefinable (G : SimpleGraph V) (s : List (PartialGraph V)) |
| 66 | (r c s' q₀ : ℕ) : Prop := |
| 67 | ∀ (t : ℕ) (ht : t + 1 < s.length) (v : V), |
| 68 | ∃ (colors : Fin c → Set V) (S : Finset V), S.card ≤ s' ∧ |
| 69 | @DefinableIn V (withColors Language.graph c) (expansion G colors) q₀ S |
| 70 | s[t] (s[t + 1].ball r v) |
| 71 | |
| 72 | end Lax185574.LocalDefinability |
| 73 |
Formalization notes
The defined partial graph is an induced partial graph H[B]. It is given by H and the set B, so the definition needs no subtype. Its relations are those of H restricted to B. The condition "v̄ ∈ V(H[B])^k and H[B] ⊨ R(v̄)" therefore reads "every entry of v̄ lies in B and H ⊨ R(v̄)". The relations are the edges, the non-edges and every color class. A color class that misses B is defined by any false formula, so only finitely many conditions have content. Parameters are free variables of the right summand, as in .
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments