OAI/AlgebraicGeometry/CharacterVarieties/Cutting/StripForest.lean
58 declarations, 0 contain sorry, 0 declared as axioms
Finite trails of secondary corners in a realized band.
This formalizes the band reconstruction for filtered surface local systems in Integral points on character varieties of curves.
- structure
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrailline 18Source documentation
The child-seam graph of a half-band: internal seams have distinct ends and strictly increasing layer. This will be constructed from the literal whole- port gallery below, not requested as a lower-diagram hypothesis.
structure LayeredTrail (N E : Type) where …
- def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.rootline 28 - def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.runline 36 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.root_of_sourceline 46 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.root_of_edgeline 48 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.run_of_sinkline 52 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.run_of_edgeline 54 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.root_externalline 59 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.mem_run_selfline 73 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.root_eq_of_mem_runline 77 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.mem_run_rootline 95Source documentation
Every actual corner node belongs to the run of an exposed end.
lemma mem_run_root (x : N) : x∈T.run (T.root x) := by …
- lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.external_run_coverline 125 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.external_run_uniqueline 128 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.run_levelline 133 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.run_nodupline 151 - def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.reverseline 176Source documentation
Both endpoints of each literal strip run are exposed.
def reverse : LayeredTrail N E where …
Mentions: OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail
- def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.tipline 183 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.tip_externalline 185 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.tip_of_sinkline 186 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.tip_of_edgeline 187 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.tip_mem_runline 189 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.tip_eq_of_mem_runline 205 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.tip_rootline 222 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.root_tipline 223 - def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail.endsEquivline 227Source documentation
The open-end matching is produced, bijective, and retains every corner of every path. There are no concealed circular lower strips.
noncomputable def endsEquiv : {x : N // ¬∃ e,T.target e=x} ≃ {x : N // ¬∃ e,T.source e=x} where … - def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.Kind.SecondaryNodeline 240Source documentation
One oriented SECONDARY corner of an actual allowed vertex. Removing the principal parent corner is essential: this is the graph of the lower strips.
def SecondaryNode (k : Kind) := …
Mentions: OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.Kind
- def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.Kind.inputNodeline 244 - def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.Kind.outputNodeline 249 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.Kind.inputNode_injectiveline 263 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.Kind.outputNode_injectiveline 267 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.Kind.node_not_outputline 274 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.Kind.node_mate_not_inputline 283 - abbrev
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.StripNodeline 308 - abbrev
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.StripEdgeline 309 - def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.stripSourceline 311 - def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.stripTargetline 314 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.stripSource_injectiveline 319 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.stripTarget_injectiveline 329 - def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.stripForestline 342Source documentation
Produced from all and only the actual internally sewn child-port occurrences. In particular no transverse branch is treated as internal.
noncomputable def stripForest : LayeredTrail B.StripNode B.StripEdge where …
Mentions: OAI.IntegralCharacterVarieties.OccurrenceIncidence.LayeredTrail
- def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.stripColorline 349 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.stripColor_edgeline 351 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.stripColor_rootline 358 - theorem
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.strip_runs_coverline 370Source documentation
Every local lower corner is on one and only one actual finite no-repeat strip run, with its original label constant along the entire run.
theorem strip_runs_cover (x : B.StripNode) : ∃ s,(¬∃ e,B.stripTarget e=s) ∧ x∈B.stripForest.run s ∧ (B.stripForest.run s).Nodup ∧ B.stripColor s=B.stripColor x := … - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.Kind.node_at_inputline 380 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.Kind.node_at_outputline 389 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.input_predecessorline 409 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.output_successorline 414 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.root_exposedline 421Source documentation
An incoming strip end is either at the first short end or on an actual transverse port. It cannot terminate invisibly inside a running seam.
lemma root_exposed (x : B.StripNode) (he : ¬∃ e,B.stripTarget e=x) : x.2.val.1≠(B.kind x.1).output ∧ (x.2.val.1≠(B.kind x.1).input ∨ x.1=0) := by … - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.tip_exposedline 436Source documentation
The outgoing end of a strip is similarly at the final short end or on a transverse port, including every split and merge branch.
lemma tip_exposed (x : B.StripNode) (he : ¬∃ e,B.stripSource e=x) : ((B.kind x.1).table.mate x.2.val).1≠(B.kind x.1).input ∧ (((B.kind x.1).table.mate x.2.val).1≠(B.kind x.1).output ∨ x.1=Fin.last B.length) := by … - def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.inputStripline 452 - def
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.outputStripline 454 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.inputStrip_externalline 456 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.outputStrip_externalline 461 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.inputStrip_colorline 466 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.outputStrip_colorline 471 - lemma
OAI.IntegralCharacterVarieties.OccurrenceIncidence.VertexTable.RealizedBand.no_short_to_shortline 481Source documentation
Run colors rather than rank sums rule out a strip joining the two short ends. This is false after forgetting occurrence labels, so proved first on the named band, before attachment to possibly repeated old facets.
lemma no_short_to_short (h : List.Disjoint a b) (c) (d) : B.stripForest.root (B.outputStrip d)≠B.inputStrip c := by … - lemma
OAI.IntegralCharacterVarieties.TwoFlagBand.RankShape.atomic_short_disjointline 493 - lemma
OAI.IntegralCharacterVarieties.TwoFlagBand.RankShape.atomic_no_short_to_shortline 499