# VWin from Row0b

## Statement

Suppose that [the statement Row0b](/step/row0b-def/) holds with the local condition [IsRecT](/step/is-rect-def/). Then [the window bound VWin](/step/vwin-def/) holds.

The Lean hypothesis is `h : Row0b fun h rc => IsRecT h rc`. (Inside the lambda, the name `h` is a different, local variable: the proof that $A$ lies over $w$.)


## Lean

```lean
theorem UpperTheory.One.vwin_of_row (h : UpperTheory.GalStar.Row0b fun h rc => UpperTheory.Zero.LLC.IsRecT h rc) : UpperTheory.Top.VWin
```

The declaration is in `Development/AutomorphicArithmetic/AutomorphicVarieties/ModularityArgument/ThresholdArguments/DenseThresholdCases/VwinOfRow.lean`, line 4. Its [page](/code/decl/?n=UpperTheory.One.vwin_of_row) has the full list of what it uses and what uses it, and a link to the source.

## Proof

The proof applies the theorem `automorphic_window_of_inputs` to three arguments.

1. `OpenImageCondition.mk h`. The structure `OpenImageCondition` has one field, `galoisRepOfPolarizedPairLit`, of type `RowT`. `RowT` is defined as `Row0b fun h rc => IsRecT h rc`, which is the type of `h`. So the proof puts `h` in the structure.
2. `baseChangeN`, a theorem of the code that proves `BaseChangeIsobaricN`. In words, `BaseChangeIsobaricN` says: for each CM field $E$ such that $E/E^+$ is unramified at every finite place, and each $n \ge 1$ and each space $\pi$ of functions on `UA E n` (by its name, the adelic points of a unitary group in $n$ variables) with `IsAutRepU π`, there is a decomposition $n = \sum_i N_i$ and data $V_i$, $\sigma$, $m$, $P$ with `IsBaseChangeN`. By its name, this is an isobaric base change to $\mathrm{GL}_n$. This page does not unfold `IsBaseChangeN`.
3. `h` itself, as the argument `gal : RowT`.

The theorem `automorphic_window_of_inputs` then gives `VWin`. Its proof is the application of `v_window_of_depth_zero_residual_bc_cm` to the same three arguments and to `cm_abelian_inputs_from_literature O`. The [VWin chapter](/proof/vwin/) describes the tree below it.

## Notes

The hypothesis `h` is passed twice: once inside `OpenImageCondition` and once as `gal`. The VWin chapter reports that the field of `OpenImageCondition` is never read in this branch, and that the row reaches the counts only through `gal`. If that is right, the structure `OpenImageCondition` is a wrapper with no effect on the proof.

`baseChangeN` is not a hypothesis of `vwin_of_row`. It is a theorem of the code. So `vwin_of_row` has only one hypothesis, the Galois row.

The user of this step is [EveryCharacter from Row0b](/step/every-character-of-row/). There the hypothesis is the proof from [the Galois row holds](/step/galois-row-holds/).

## Uses

- [The window bound VWin](/step/vwin-def/), the step for `UpperTheory.Top.VWin`.
- [The statement Row0b](/step/row0b-def/), the step for `UpperTheory.GalStar.Row0b`.
- [The local condition IsRecT](/step/is-rect-def/), the step for `UpperTheory.Zero.LLC.IsRecT`.
- [VWin from three inputs](/step/automorphic-window-of-inputs/), the step for `UpperTheory.One.Join.automorphic_window_of_inputs`.
- [Isobaric base change holds](/step/base-change-n/), the step for `UpperTheory.BaseChangeIdentities.baseChangeN`.
- [The structure OpenImageCondition](/step/open-image-condition-def/), the step for `UpperTheory.LiteratureTheorems.OpenImageCondition`.
- The named result Galois representations attached to regular algebraic polarised cuspidal automorphic representations of GL(n) over CM fields, with local-global compatibility, [`UpperTheory.LiteratureTheorems.OpenImageCondition`](/code/decl/?n=UpperTheory.LiteratureTheorems.OpenImageCondition). The page of [named results](/proof/named-results/) gives its citation.

## Used by

- [EveryCharacter from Row0b](/step/every-character-of-row/)

## 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](https://github.com/tamnd/riemann/issues/new?template=error.yml).

A model wrote the first draft (`writer@claude-opus-5-5`). A person checks it before its status goes up.
