The structure OpenImageCondition
drafted
Statement
OpenImageCondition is a structure of type Prop. It has one field.
galoisRepOfPolarizedPairLit : RowT.
The proposition RowT is defined as Row0b fun h rc => IsRecT h rc. This is the statement Row0b with the local condition IsRecT. In words: for each CM field , each prime , each isomorphism and each regular algebraic cuspidal representation of that is part of a polarized pair, there is a continuous semisimple Galois representation with the Hodge-Tate weights and the local-global compatibility of PropsB, for every local map that satisfies IsRecT.
So a term of OpenImageCondition is the same thing as a proof of RowT. The constructor is OpenImageCondition.mk : RowT → OpenImageCondition.
Notes
The name does not match the content. The field states the existence of Galois representations attached to polarized cuspidal representations, not an open image condition.
The file links/literature.yaml lists this structure as a named result, with the papers of Chenevier-Harris, Shin, Caraiani and Barnet-Lamb-Gee-Geraghty-Taylor. On the trunk it is not an assumption: VWin from Row0b builds it as OpenImageCondition.mk h from the row hypothesis , and the Galois row holds proves that hypothesis.
In the branch of the window bound VWin, many theorems take a term O of this structure, for example the CM and abelian variety inputs. No theorem in this branch reads the field galoisRepOfPolarizedPairLit. The row reaches the proof through the separate argument gal : RowT.
Lean
structure UpperTheory.LiteratureTheorems.OpenImageCondition : Prop
The declaration is in Development/AutomorphicArithmetic/AutomorphicVarieties/ModularityArgument/ThresholdArguments/DenseThresholdCases/TemperedProductOfSquareIntegrable.lean, line 207. Its page has the full list of what it uses and what uses it, and a link to the source.
Uses
The proof cites no other step.
The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: UpperTheory.V.Z.Win.RowT.
Used by
- VWin from three inputs
- The CM and abelian variety inputs
- VWin from the rank n inputs
- VWin from Row0b
Status
Drafted. The text follows the Lean code, but no person has checked it against the code with the rules of spec 05.7 yet. If you check it, tell us.
A model wrote the first draft (writer@claude-opus-5-5). A person checks it before its status goes up.
The source of this page. Markdown. Something is wrong? Report it.